TY - GEN
T1 - A probabilistic flooding algorithm using weighting factor
AU - Jie, Yang
AU - Liu, Yan Tao
AU - Heng, Liu
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
KW - Ad hoc
KW - Probabilistic flooding
KW - Weighting factor
UR - http://www.scopus.com/inward/record.url?scp=58049099074&partnerID=8YFLogxK
U2 - 10.1109/WiCom.2008.616
DO - 10.1109/WiCom.2008.616
M3 - Conference contribution
AN - SCOPUS:58049099074
SN - 9781424421084
T3 - 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008
BT - 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008
T2 - 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008
Y2 - 12 October 2008 through 14 October 2008
ER -