[图书][B] Wireless sensor and actuator networks: algorithms and protocols for scalable coordination and data communication
A Nayak, I Stojmenovic - 2010 - books.google.com
This timely book offers a mixture of theory, experiments, and simulations that provides
qualitative and quantitative insights in the field of sensor and actuator networking. The …
qualitative and quantitative insights in the field of sensor and actuator networking. The …
Distributed compressed sensing for static and time-varying networks
We consider the problem of in-network compressed sensing from distributed measurements.
Every agent has a set of measurements of a signal x, and the objective is for the agents to …
Every agent has a set of measurements of a signal x, and the objective is for the agents to …
Handling of resource allocation in flying ad hoc network through dynamic graph modeling
AS Parihar, SK Chakraborty - Multimedia Tools and Applications, 2022 - Springer
Now a days, Flying ad hoc network (FANET) as a trending wireless classification has a
vibrant area of research. FANET architecture can also be viewed as a special form of a …
vibrant area of research. FANET architecture can also be viewed as a special form of a …
A simple R-UAV permission-based distributed mutual exclusion in FANET
AS Parihar, SK Chakraborty - Wireless Networks, 2022 - Springer
Mutual exclusion problem in the distributed system is a very basic and highly researched
area in this domain. Various distributed mutual exclusion (DME) protocols exist till date to …
area in this domain. Various distributed mutual exclusion (DME) protocols exist till date to …
Distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications
in many areas of computer science, including distributed computing. In this article, we focus …
in many areas of computer science, including distributed computing. In this article, we focus …
A cross-sectional study on distributed mutual exclusion algorithms for ad hoc networks
AS Parihar, SK Chakraborty - Pattern Recognition and Data Analysis with …, 2022 - Springer
The mutual exclusion problem has been substantially studied in the distributed systems.
Various solutions have been proposed to achieve distributed mutual exclusion till date …
Various solutions have been proposed to achieve distributed mutual exclusion till date …
A comparative study and proposal of a novel distributed mutual exclusion in UAV assisted flying ad hoc network using density-based clustering scheme
One of the fundamental problems in the study of distributed systems is mutual exclusion. In
the past, several solutions to this fundamental issue have been put up in the literature …
the past, several solutions to this fundamental issue have been put up in the literature …
A tight unconditional lower bound on distributed randomwalk computation
D Nanongkai, A Das Sarma… - Proceedings of the 30th …, 2011 - dl.acm.org
We consider the problem of performing a random walk in a distributed network. Given
bandwidth constraints, the goal of the problem is to minimize the number of rounds required …
bandwidth constraints, the goal of the problem is to minimize the number of rounds required …
Fast distributed random walks
A Das Sarma, D Nanongkai… - Proceedings of the 28th …, 2009 - dl.acm.org
Performing random walks in networks is a fundamental primitive that has found applications
in many areas of computer science, including distributed computing. In this paper, we focus …
in many areas of computer science, including distributed computing. In this paper, we focus …
Distributed maintenance of anytime available spanning trees in dynamic networks
A Casteigts, S Chaumette, F Guinand… - Ad-hoc, Mobile, and …, 2013 - Springer
We address the problem of building and maintaining a forest of spanning trees in highly
dynamic networks, in which topological events can occur at any time and any rate, and no …
dynamic networks, in which topological events can occur at any time and any rate, and no …