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
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Flooding for reliable multicast in multi-hop ad hoc networks
Wireless Networks
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
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
On Minimum-Energy Broadcasting in All-Wireless Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
| Hi-index | 0.00 |
Scalability and power-efficiency are two of the most important design challenges in wireless ad hoc networks. In this paper, we present a scalable, power-efficient broadcast algorithm for wireless ad hoc networks. We first investigate the trade-off between (i) reaching more nodes in a single hop using higher transmission power and (ii) reaching fewer nodes using lower transmission power and relaying messages through multiple hops. Our analysis indicates that multi-hop broadcast is more power-efficient if α ≥ 2.2, where α is the path loss exponent in the power consumption model P(r, α) = c0 ċ rα + c1. Based on the analysis, we then propose Broadcast over Local Spanning Subgraph (BLSS). In BLSS, an underlying topology is first constructed by a localized topology control algorithm, Fault-Tolerant Local Spanning Subgraph (FLSS). FLSS can preserve k- connectivity of the network, where the value of k determines the degree of fault tolerance. Broadcast messages are then simply relayed through the derived topology in a constrained flooding fashion. BLSS is fully localized, scalable, power-efficient, and fault-tolerant. Simulation results show that the performance of BLSS is comparable to that of centralized algorithms.