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 Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Flooding in wireless ad hoc networks
Computer Communications
Multimedia Correlation Analysis in Unstructured Peer-to-Peer Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Similarity-based clustering strategy for mobile ad hoc multimedia databases
Mobile Information Systems
Semantic-Aware and QoS-Aware Image Caching in Ad Hoc Networks
IEEE Transactions on Knowledge and Data Engineering
DSI: A model for distributed multimedia semantic indexing and content integration
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Hierarchical semantic-based index for ad hoc image retrieval
Journal of Mobile Multimedia
Hi-index | 0.00 |
Flooding is a simple routing technique that can be used to transmit data from one node to every other node in a network. The focus of this paper is to investigate improvements to flooding techniques used in ad hoc wireless networks. Recent work has focused on using topological information to reduce the number of broadcasts. The number of broadcasts necessary to flood the network was the major performance metric used to compare previous neighborhood-based flooding algorithms. We build upon this foundation by first presenting a Parameterized Neighborhood-Based Flooding (PNBF) algorithm, which provides a single platform for the performance comparison of various multi-hop neighborhood-based flooding algorithms. We also introduce and motivate the use of additional performance metrics, including total number of collisions and percentage of nodes that receive the message, for comparing flooding algorithms. An analysis is given of how different network properties, such as average node degree, communication patterns, affect the performance of the different neighborhood-based flooding algorithms. Our simulation results demonstrate that our algorithm is capable of handling a wide variety of situations where properties of ad hoc networks along with the relative importance of the performance criteria are taken into consideration.