Proceedings Article10.1109/PDCAT.2005.75
An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks
Yamin Li,Shietung Peng,Wanming Chu +2 more
- 05 Dec 2005
- pp 75-79
5
TL;DR: The proposed algorithm is more efficient than the existing broadcasting algorithms in the literatures, that is, the size of the forwarding nodes found by the algorithm is smaller and the running time is faster than other broadcasting algorithms.
read more
Abstract: In this paper, we propose a distributed broadcasting algorithm for wireless ad hoc networks. In the algorithm, an efficient strategy is used to determine the forward status of a node by just checking whether there exists a ring that contains all its neighbors. The proposed algorithm is more efficient than the existing broadcasting algorithms in the literatures. That is, the size of the forwarding nodes found by our algorithm is smaller and the running time is faster than other broadcasting algorithms. Reducing the number of forwarding nodes will decrease the probability of transmission collision, and hence improve the packet delivery ratio. The algorithm runs in O(d2) time, where d is the maximum node degree. The full coverage is not guaranteed but as shown by the simulation results, the probability of full coverages can be over 99 percent when the network contains 100 or more nodes.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Reliable Transmission Protocol for ZigBee-Based Wireless Patient Monitoring
Shyr-Kuen Chen,Tsair Kao,Chia-Tai Chan,Chih-Ning Huang,Chih-Yen Chiang,Chin-Yu Lai,Tse-Hua Tung,Pi-Chung Wang +7 more
- 01 Jan 2012
TL;DR: A reliable transmission protocol based on anycast routing for wireless patient monitoring, which integrates fall detection, indoor positioning, and ECG monitoring and is fast and reliable and can seamlessly integrate with the next generation technology of wireless wide area network, worldwide interoperability for microwave access.
137
Optimal Broadcast in Ad-hoc and Sensor Networks
A. Samalam,S. Perreau,A. Dadej +2 more
- 01 Dec 2007
TL;DR: This work proposes a new scheme for ad hoc networks based on neighbourhood information and a modified version optimized for sensor networks, and defines an efficiency metric and uses it to compare the different broadcast schemes.
3
GPEB: Power-efficient geographic broadcasting in sensor networks
Shibo Wu,K.S. Candan +1 more
- 28 Oct 2008
TL;DR: Through simulation, it is shown that the GPEB protocol proposed in this paper can save total power consumption up to 23% compared to existing geographic broadcast protocols.
1
Population based broadcast in wireless Ad Hoc and sensor networks
Mehrdad Almasi,Elyas Salimi Shahraki,Mohammad Ali Montazeri +2 more
- 15 May 2012
TL;DR: A new method is presented that like deterministic schemes guaranties 100% coverage and considerably reduce unnecessary message transmissions by detecting dense population areas and compared it with two others deterministic methods.
References
The broadcast storm problem in a mobile ad hoc network
Sze-Yao Ni,Yu-Chee Tseng,Yuh-Shyan Chen,Jang-Ping Sheu +3 more
- 01 Aug 1999
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
The broadcast storm problem in a mobile ad hoc network
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
1.4K
Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks
TL;DR: This paper proposes to significantly reduce or eliminate the communication overhead of a broadcasting task by applying the concept of localized dominating sets, which do not require any communication overhead in addition to maintaining positions of neighboring nodes.
Flooding in wireless ad hoc networks
Hyuk Lim,Chong-kwon Kim +1 more
TL;DR: It is shown that the minimum cost flooding tree problem is similar to MCDS (Minimum Connected Dominating Set) problem and it is proved that the NP-completeness of the minimumCost Flooding tree problem can be proved.
477
On reducing broadcast redundancy in ad hoc wireless networks
TL;DR: This paper analyzes some deficiencies of the dominant pruning algorithm and proposes two better approximation algorithms: total dominant pruned and partial dominant prune, which utilize 2-hop neighborhood information more effectively to reduce redundant transmissions.
Related Papers (5)
François Ingelrest,David Simplot-Ryl,Ivan Stojmenovic +2 more
- 19 Jan 2005
H. Zhang,Zhong-Ping Jiang +1 more
- 06 Jun 2005