Directed flood-routing framework for wireless sensor networks
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
MAC-assisted broadcast speedup in ad-hoc wireless networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Modeling and performance analysis of ad hoc broadcasting schemes
Performance Evaluation
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Fast Geometric Routing with Concurrent Face Traversal
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
VBS: maximum lifetime sleep scheduling for wireless sensor networks using virtual backbones
INFOCOM'10 Proceedings of the 29th conference on Information communications
Towards optimal broadcast in wireless networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Concurrent face traversal for efficient geometric routing
Journal of Parallel and Distributed Computing
RNBB: a reliable hybrid broadcasting algorithm for ad-hoc networks
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
| Hi-index | 0.00 |
In ad hoc wireless networks, a successful broadcasting requires that the nodes forwarding the broadcast packet form a connected dominating set to ensure the coverage. An efficient broadcast method should generate a small forward node set without excessive overhead. Neighbor-knowledge-based methods, including neighbor-designating methods and self-pruning methods, are localized algorithms that reduce the number of forward nodes based on affordable local information. A generic broadcast protocol based on a simple self-pruning rule is proposed in this paper. The underlying local information, including the network information collected via exchanging "hello" messages and the broadcast history information carried by incoming broadcast packets, is discussed and formally defined. Most existing self-pruning protocols are shown to be special cases of the self-pruning rule. Simulation results show that more efficient protocols can be derived from the generic protocol, and high delivery ratio can be achieved with near-to-accurate local information.