Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
Introduction to algorithms
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
An optimal topology-transparent scheduling method in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
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
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
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
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Minimizing broadcast latency and redundancy in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
A power management protocol for multi-hop ad hoc networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
IEEE Transactions on Wireless Communications
Framework for optimizing the capacity of wireless mesh networks
Computer Communications
Low-Latency broadcast scheduling in ad hoc networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Hi-index | 0.00 |
Broadcast is an important operation in wireless networks. However, broadcasting by naïve flooding causes severe contention, collision, and congestion, which is called the broadcast storm problem. Many protocols have been proposed to solve this problem, with some investigations focusing on collision avoidance yet neglecting the reduction of redundant rebroadcasts and broadcasting latency; while other studies have focused on reducing redundant rebroadcasts yet have paid little attention to collision avoidance. Two one-to-all broadcast protocols based on two schemes are proposed herein. The set-covering scheme reduces redundant rebroadcasts, and the independent-transmission-set scheme avoids collisions and reduces latency. Furthermore, an all-to-all broadcast protocol is presented based on the one-to-all protocol. Simulation results show that the novel broadcast protocols are efficient and can achieve high reachability.