Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2010.17C.6.499

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

Jeong, Hyo-Cheol (부산대학교 공과대학 컴퓨터공학과)
Yoo, Young-Hwan (부산대학교 정보컴퓨터공학부)
Publication Information
The KIPS Transactions:PartC / v.17C, no.6, 2010 , pp. 499-504 More about this Journal
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.
Keywords
Broadcast Storm; Dynamic Flooding Algorithm; Flooding; Neighbor Information; Wireless Sensor Network(WSN);
Citations & Related Records
연도 인용수 순위
  • Reference
1 I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirici, “Wireless sensor networks: A survey,” Computer Networks, Vol.38, 2002, pp.393-422.   DOI   ScienceOn
2 A.S. Tanenbaum, Computer Networks, Prentice Hall, Englewood Cliffs, NJ, 1996.
3 A. Qayyum, L. Viennot, A. Laouiti, “Multipoint Relaying for Flooding Broadcast Messages in MobileWireless Networks,” in Proc. Of the 35th Annual Hawaii International Conference on System Sciences-Volume 9, Jan., 2002.
4 S.-Y. Ni, Y.-C. Tseng, Yuh-Shyan Chen, and Jang-Ping Shen, “Broadcast Storm Problem in a Mobile Ad hoc Network,” Wireless Networks, Vol.8, pp.153-167, May, 2002.   DOI   ScienceOn
5 B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” in Proc. of the 3rd ACM international symposium on Mobile ad hoc networking & computing, pp.194-205, Jun., 2002.
6 Y. Tseng, S. Ni, and E. Shih, “Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multi-hop Mobile Ad Hoc Network,” in Proc. of ICDCS 2001, pp.481-488, Apr., 2001.   DOI
7 Q. Zhang and D. P. Agrawal, “Dynamic Probabilistic Broadcasting in Mobile Ad Hoc Networks,” Journal of Parallel and Distributed Computing Vol.65, Issue 2, Feb., 2005, pp.220-233.   DOI   ScienceOn
8 H. Lim, C. Kim, Multicast tree construction and flooding in wireless ad hoc networks, in: Proceedings of the ACM International Workshop on Modeling, Analysis and Simulation of Wireless and MobileSystems (MSWIM 2000), Boston, MA, 2000, pp.61-68.
9 Scalable Networks Inc. [Online]. Available: http://www.scalable-networks.com/