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
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
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
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
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
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Deterministic Broadcasting Time in Radio Networks of Unknown Topology
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & 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
A Generic Broadcast Protocol in Ad Hoc Networks Based on Self-Pruning
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Distributed localization in wireless sensor networks: a quantitative comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Efficient location-aided flooding scheme initiated by receiver for MANETs
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
The Quest for Mobility Models to Analyse Security in Mobile Ad Hoc Networks
WWIC 2009 Proceedings of the 7th International Conference on Wired/Wireless Internet Communications
Efficient flooding scheme based on regular polygonal tiling in wireless ad hoc networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Mobility and cooperation to thwart node capture attacks in MANETs
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network security
A location aided flooding protocol for wireless ad hoc networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Triangular tiling-based efficient flooding scheme in wireless ad hoc networks
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Efficient mobile networking for tactical radios
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Ripple flooding in wireless sensor networks
Proceedings of the 8th ACM Symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Tree-based double-covered broadcast for wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Future Generation Computer Systems
ICCSA'13 Proceedings of the 13th international conference on Computational Science and Its Applications - Volume 1
| Hi-index | 0.00 |
Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of messages, resource contention, and signal collision. This causes high protocol overhead and interference with the existing traffic in the networks. Some efficient flooding algorithms were proposed to avoid these problems. However, these algorithms either perform poorly in reducing redundant transmissions or require each node to maintain 2-hop (or more) neighbors information. In the paper, we study the sufficient and necessary condition of 100 percent deliverability for flooding schemes that are based on only 1-hop neighbors information. We further propose an efficient flooding algorithm that achieves the local optimality in two senses: 1) The number of forwarding nodes in each step is minimal and 2) the time complexity for computing forwarding nodes is the lowest, which is O(nlogn), where n is the number of neighbors of a node. Extensive simulations have been conducted and simulation results have shown the excellent performance of our algorithm.