On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks
Mobile Networks and Applications
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Proceedings of the 7th annual international conference on Mobile computing and networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
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
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network
IEEE Transactions on Computers
Efficient Broadcasting with Guaranteed Coverage in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Optimized Broadcast Protocol for Sensor Networks
IEEE Transactions on Computers
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Journal of Parallel and Distributed Computing
A survey of message diffusion protocols in mobile ad hoc networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
A Distributed Intelligent Broadcasting Protocol for Mobile Ad Hoc Networks
Mobile Networks and Applications
Context-aware broadcasting approaches in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-pruning broadcasting for mobile ad hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Tree-based double-covered broadcast for wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Reliable gossip-based broadcast protocol in mobile ad hoc networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
On the behavior of broadcasting protocols for MANETs under omission faults scenarios
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
| Hi-index | 0.00 |
Self-pruning is an effective scheme for efficient broadcasting in ad hoc wireless networks. In a self-pruning broadcast protocol, a node may not forward a broadcast packet if a certain self-pruning condition is satisfied based on the neighborhood information. In a static network with an ideal MAC layer, only a subset of nodes forward the broadcast packet and still guarantee the complete network delivery. Various protocols have been proposed with different self-pruning conditions. Recently, a generic self-pruning protocol was proposed by Wu and Dai [21], which combines the strength of previous conditions and is more effective. In this paper, we first propose an enhanced version of the generic protocol, which is more elegant in interpreting existing protocols and has a simpler correctness proof. Then, we evaluate the performance of the family of self-pruning protocols under various network situations with ns2. The objective is to observe the efficiency and reliability of these protocols as a function of network density, congestion, and mobility, and provide a guideline of implementation in the "real world.驴 Our performance analysis reveals that the protocol reliability is barely affected by packet collision. However, most self-pruning protocols suffer from low delivery ratio in highly mobile networks. We further explore various techniques that improve the delivery ratio and show that both high efficiency and reliability can be achieved in highly mobile networks.