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
Flooding for reliable multicast in multi-hop ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
Effects of wireless physical layer modeling in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd 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
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Internal Nodes based Broadcasting in Wireless Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Energy-efficient collision-free medium access control for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Simultaneous adaptive localization of a wireless sensor network
ACM SIGMOBILE Mobile Computing and Communications Review
Energy Minimization for Broadcasting Message in Wireless Sensor Networks
NSWCTC '09 Proceedings of the 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 01
Reliable and Energy-Efficient Routing for Static Wireless Ad Hoc Networks with Unreliable Links
IEEE Transactions on Parallel and Distributed Systems
Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
EDFS a novel flooding protocol for multi-hop wireless networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Fault-tolerant relay node placement in wireless sensor networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Robust Optimization Models for Energy-Limited Wireless Sensor Networks under Distance Uncertainty
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications - Part 2
IEEE Communications Magazine
Efficient Broadcasting Using Network Coding and Directional Antennas in MANETs
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
Almost all existing broadcasting algorithms assume an ideal physical layer, in which a successful transmission is guaranteed if the distance between communicating nodes is less than a certain threshold, e.g., a transmission range. However, wireless communication links normally suffer from the characteristics of realistic physical layer, which significantly reduce the reliability of broadcasting among the nodes. This work addresses the minimal broadcasting problem in multi-hop wireless networks with a realistic physical layer. Given a probability p^*, the problem is to design a distributed broadcasting algorithm such that each node in the network receives the broadcasting packet with probability no less than p^* and the number of retransmissions is minimized. We show that this problem is NP-hard and propose a distributed greedy algorithm which maximizes the gain cost ratio at each node. We prove that the proposed algorithm guarantees that each node receives the broadcasting packet with probability no less than p^*, and analyze upper bound on the number of total retransmissions in the network. Simulation results show that our algorithm can provide near 100% coverage to the wireless network with a realistic physical layer, and reduce the number of retransmissions compared with modified traditional flooding schemes k-Flooding (pure flooding with multiple times) and ACK-Flooding (pure flooding with acknowledgement). We believe our algorithmic solution is efficient and practical for general existing multi-hop wireless networks.