Dynamic Probabilistic Flooding Algorithm based-on the Number of Child and Sibling Nodes in Wireless Sensor Networks


The KIPS Transactions:PartC, Vol. 17, No. 6, pp. 499-504, Dec. 2010
10.3745/KIPSTC.2010.17.6.499,   PDF Download:

Abstract

The flooding is the simplest and effective way to disseminate a packet to all nodes in a wireless sensor network (WSN). However, basic flooding makes all nodes transmit the packet at least once, resulting in the broadcast storm problem in a serious case, in turn network resources become severely wasted. Particularly, power is one of the most valuable resources of WSNs as nodes are powered by battery, then the waste of energy by the basic flooding lessens the lifetime of WSNs. In order to solve the broadcast storm problem, this paper proposes a dynamic probabilistic flooding that utilizes the neighbor information like the number of child and sibling nodes. Simulation results show that the proposed method achieves a higher packet delivery ratio with the similar number of duplicate packets as compared to existing schemes.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. C. Jeong and Y. H. Yoo, "Dynamic Probabilistic Flooding Algorithm based-on the Number of Child and Sibling Nodes in Wireless Sensor Networks," The KIPS Transactions:PartC, vol. 17, no. 6, pp. 499-504, 2010. DOI: 10.3745/KIPSTC.2010.17.6.499.

[ACM Style]
Hyo Cheol Jeong and Youn Hwan Yoo. 2010. Dynamic Probabilistic Flooding Algorithm based-on the Number of Child and Sibling Nodes in Wireless Sensor Networks. The KIPS Transactions:PartC, 17, 6, (2010), 499-504. DOI: 10.3745/KIPSTC.2010.17.6.499.