The performance of query control schemes for the zone routing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
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
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
ACM Transactions on Computer Systems (TOCS)
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
SIAM Journal on Computing
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the reduction of broadcast redundancy in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
The power of epidemics: robust communication for large-scale distributed systems
ACM SIGCOMM Computer Communication Review
A Performance Comparison of Scatternet Formation Protocols for Networks of Bluetooth Devices
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Expansion properties of (secure) wireless networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Localized techniques for broadcasting in wireless sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Robust network connectivity: when it's the big picture that matters
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
IEEE Transactions on Mobile Computing
Brief announcement: (more) efficient pruning of ad-hoc wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Expansion properties of (secure) wireless networks
ACM Transactions on Algorithms (TALG)
On the connectivity of bluetooth-based ad hoc networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
We propose very simple randomized algorithms to compute sparse overlay networks for geometric random graphs modelling wireless communication networks. The algorithms generate in constant time a sparse overlay network that, with high probability, is connected and spans the whole network. Moreover, by making use of the "power of choice" paradigm, the maximum degree can be made as small as O(log log n), where n is the size of the network. We show the usefulness of this kind of overlays by giving a new protocol for the classical broadcast problem, where a source is to send a message to the whole network. Our experimental evaluation shows that our approach outperforms the well-known gossiping approach in all situations where the cost of a message can be charged to the pair (sender, receiver), i.e. to the edge connecting the two. This includes sensor networks.