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
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd 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
Reactive routing overhead in networks with unreliable nodes
Proceedings of the 9th annual international conference on Mobile computing and networking
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Predictive Models to Rebroadcast in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Theoretical Computer Science
IEEE/ACM Transactions on Networking (TON)
Localization and routing in sensor networks by local angle information
ACM Transactions on Sensor Networks (TOSN)
Modeling the performance of flooding in wireless multi-hop Ad hoc networks
Computer Communications
Probabilistic flooding for efficient information dissemination in random graph topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Controlling route discovery for efficient routing in resource-constrained sensor networks
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Understanding stateful vs stateless communication strategies for ad hoc networks
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We study the performance of network-wide broadcasting as a function of the information implicitly available at nodes from neighbourhood transmissions. We term this set of instantaneous information as network information. Our discussion is focused on stateless broadcasting algorithms in which nodes decide on their forwarding behaviour based on the available network information. While stateless broadcasting schemes in the existing literature use various design guidelines that take advantage of specific aspects of the information, we develop a unified analytical model by characterizing the information available during different stages of broadcasting. Thus, our results are applicable to all stateless algorithms. We analyze broadcasting performance in terms of the transmission probability and redundancy of transmissions. Subsequently, we use our results to obtain insights on the feasibility conditions governing algorithm design depending on the network density and costs. While the first part of the work considers ideal channel conditions modeled as a unit disk graph (UDG), we subsequently enhance the model using a quasi-unit disk graph model (QUDG) to understand the effect of dynamic channel conditions.