Abstract
In this paper, we firstly study the connectivity of ad hoc networks and establish the correlations of connectivity with average node degree. Then, based on the simulation result of connectivity, we present a probabilistic flooding algorithm that can tradeoff the efficiency and reliability by using weighting factor. Thus, we treat the well-known contradictions in our new algorithm. Our simulation results show that, with the choice of an optimal flooding probability by using weighting factor, we can get a great deal of overhead gain with a little loss of packet delivery ratio.
Original language | English |
---|---|
Title of host publication | 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008 |
DOIs | |
Publication status | Published - 2008 |
Event | 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008 - Dalian, China Duration: 12 Oct 2008 → 14 Oct 2008 |
Publication series
Name | 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008 |
---|
Conference
Conference | 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008 |
---|---|
Country/Territory | China |
City | Dalian |
Period | 12/10/08 → 14/10/08 |
Keywords
- Ad hoc
- Probabilistic flooding
- Weighting factor
Fingerprint
Dive into the research topics of 'A probabilistic flooding algorithm using weighting factor'. Together they form a unique fingerprint.Cite this
Jie, Y., Liu, Y. T., & Heng, L. (2008). A probabilistic flooding algorithm using weighting factor. In 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008 Article 4678524 (2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008). https://doi.org/10.1109/WiCom.2008.616