Estimation of Broadcast Probability in Wireless Adhoc Networks
Most routing protocols (DSR, AODV etc.) that have
been designed for wireless adhoc networks incorporate the broadcasting
operation in their route discovery scheme. Probabilistic broadcasting
techniques have been developed to optimize the broadcast operation
which is otherwise very expensive in terms of the redundancy
and the traffic it generates. In this paper we have explored percolation
theory to gain a different perspective on probabilistic broadcasting
schemes which have been actively researched in the recent years.
This theory has helped us estimate the value of broadcast probability
in a wireless adhoc network as a function of the size of the network.
We also show that, operating at those optimal values of broadcast
probability there is at least 25-30% reduction in packet regeneration
during successful broadcasting.
[1] S. yao Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, "The broadcast
storm problem in a mobile ad hoc network," in Proceedings of the 5th
annual ACM/IEEE international conference on Mobile computing and
networking. Seattle, Washington, United States: ACM, 1999, pp. 151-
162.
[2] B. Williams and T. Camp, "Comparison of broadcasting techniques for
mobile ad hoc networks," in Proceedings of the 3rd ACM international
symposium on Mobile ad hoc networking computing. ACM, June 2002,
pp. 194 - 205.
[3] I. Stojmenovic and J. Wu, Mobile Adhoc Networking. IEEE, 2004, ch. 7.
[4] Y. Sasson, D. Cavin, and A. Schiper, "Probabilistic broadcast for flooding
in wireless mobile," Swiss Federal Institute of Technology (EPFL), 1015
Lausanne, Switzerland, Tech. Rep., 2002.
[5] D. Stauffer and A. Aharony, Introduction to Percolation Theory, 2nd, Ed.
Taylor Francis, 2003.
[6] K. B., Wicker, and S. Bejar, "Phase transition phenomena in wireless ad
hoc networks," in Global Telecommunications Conference GLOBECOM,
November 2001, pp. 2921-2925.
[7] F. Babalievski, "Cluster counting: The hoshen-kopelman algorithm vs.
spanning tree approaches," Intern. J. of Modern Physics, vol. 9, 1998.
[8] Q. Zhang and D. P. Agrawal, "Dynamic probabilistic broadcasting in
manets," Journal of Parallel and Distributed Computing, vol. 65, pp.
220-233, November 2004.
[9] J. Gomez and A. T. Campbell, "A case for variable range transmission
power control in wireless ad hoc networks," in Twenty-third
AnnualJoint Conference of the IEEE Computer and Communications
Societies,INFOCOM. IEEE, March 2004, pp. 1425- 1436.
[1] S. yao Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, "The broadcast
storm problem in a mobile ad hoc network," in Proceedings of the 5th
annual ACM/IEEE international conference on Mobile computing and
networking. Seattle, Washington, United States: ACM, 1999, pp. 151-
162.
[2] B. Williams and T. Camp, "Comparison of broadcasting techniques for
mobile ad hoc networks," in Proceedings of the 3rd ACM international
symposium on Mobile ad hoc networking computing. ACM, June 2002,
pp. 194 - 205.
[3] I. Stojmenovic and J. Wu, Mobile Adhoc Networking. IEEE, 2004, ch. 7.
[4] Y. Sasson, D. Cavin, and A. Schiper, "Probabilistic broadcast for flooding
in wireless mobile," Swiss Federal Institute of Technology (EPFL), 1015
Lausanne, Switzerland, Tech. Rep., 2002.
[5] D. Stauffer and A. Aharony, Introduction to Percolation Theory, 2nd, Ed.
Taylor Francis, 2003.
[6] K. B., Wicker, and S. Bejar, "Phase transition phenomena in wireless ad
hoc networks," in Global Telecommunications Conference GLOBECOM,
November 2001, pp. 2921-2925.
[7] F. Babalievski, "Cluster counting: The hoshen-kopelman algorithm vs.
spanning tree approaches," Intern. J. of Modern Physics, vol. 9, 1998.
[8] Q. Zhang and D. P. Agrawal, "Dynamic probabilistic broadcasting in
manets," Journal of Parallel and Distributed Computing, vol. 65, pp.
220-233, November 2004.
[9] J. Gomez and A. T. Campbell, "A case for variable range transmission
power control in wireless ad hoc networks," in Twenty-third
AnnualJoint Conference of the IEEE Computer and Communications
Societies,INFOCOM. IEEE, March 2004, pp. 1425- 1436.
@article{"International Journal of Electrical, Electronic and Communication Sciences:52685", author = "Bharadwaj Kadiyala and Sunitha V", title = "Estimation of Broadcast Probability in Wireless Adhoc Networks", abstract = "Most routing protocols (DSR, AODV etc.) that have
been designed for wireless adhoc networks incorporate the broadcasting
operation in their route discovery scheme. Probabilistic broadcasting
techniques have been developed to optimize the broadcast operation
which is otherwise very expensive in terms of the redundancy
and the traffic it generates. In this paper we have explored percolation
theory to gain a different perspective on probabilistic broadcasting
schemes which have been actively researched in the recent years.
This theory has helped us estimate the value of broadcast probability
in a wireless adhoc network as a function of the size of the network.
We also show that, operating at those optimal values of broadcast
probability there is at least 25-30% reduction in packet regeneration
during successful broadcasting.", keywords = "Crossover length, Percolation, Probabilistic
broadcast, Wireless adhoc networks", volume = "2", number = "7", pages = "1364-6", }