Journal of Computer and System Sciences
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
GPS-free Positioning in Mobile Ad Hoc Networks
Cluster Computing
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Position-based ad hoc routes in ad hoc networks
The handbook of ad hoc wireless networks
A Partial-Range-Aware Localization Algorithm for Ad-hoc Wireless Sensor Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Radio communication in random graphs
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Average-Time complexity of gossiping in radio networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
The capacity of wireless networks
IEEE Transactions on Information Theory
Communication problems in random line-of-sight ad-hoc radio networks
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
On Radio Broadcasting in Random Geometric Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Efficient broadcast on random geometric graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Comparison of efficient random walk strategies for wireless multi-hop networks
Computer Communications
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Gossiping in one-dimensional synchronous ad hoc wireless radio networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
| Hi-index | 0.00 |
We study the complexity of distributed protocols for the classical information dissemination problem of distributed gossiping. We consider the model of random geometric networks, one of the main models used to study properties of sensor and ad-hoc networks, where n points are randomly placed in a unit square and two points are connected by an edge/link if they are at at most a certain fixed distance r from each other. To study communication in the network, we consider the ad-hoc radio networks model of communication. We examine various scenarios depending on the local knowledge of each node in the networks, and show that in many settings distributed gossiping in asymptotically optimal time O(D) is possible, where D is the diameter of the network and thus a trivial lower bound for any communication.