The broadcast storm problem in a mobile ad hoc network
From MaRDI portal
Publication:1858025
DOI10.1023/A:1013763825347zbMath1012.68980OpenAlexW2671731656MaRDI QIDQ1858025
Jang-Ping Sheu, Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen
Publication date: 19 February 2003
Published in: Wireless Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013763825347
Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)
Related Items
TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks ⋮ Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks ⋮ A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets ⋮ Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks ⋮ New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs ⋮ Analytical studies of energy-time efficiency of blocking expanding ring search ⋮ PCBA: A priority-based competitive broadcasting algorithm in mobile ad hoc networks. ⋮ BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING ⋮ RNG RELAY SUBSET FLOODING PROTOCOLS IN MOBILE AD-HOC NETWORKS ⋮ On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs ⋮ OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks ⋮ Total energy optimal multicasting in wireless ad hoc networks ⋮ Localized techniques for broadcasting in wireless sensor networks ⋮ An optimal algorithm for the minimum disc cover problem ⋮ Gossiping by energy-constrained mobile agents in tree networks ⋮ AHBP: An efficient broadcast protocol for mobile ad hoc networks ⋮ On the scalability and message count of trickle-based broadcasting schemes ⋮ Lower and upper bounds for minimum energy broadcast and sensing problems in sensor networks†