A Novel Broadcasting Algorithm for Wireless Sensor Networks

  • Yong Tang
  • Mingtian Zhou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4330)


Broadcasting is one of the typical operations in wireless sensor networks where the nodes are energy constrained. Considering the characteristics that nodes are almost static and position aware in wireless sensor networks, we propose a novel broadcasting algorithm (NBA) for utilizing energy efficiently. The energy status of nodes is regarded as an important factor, as well as the local network topology, in clustering and deciding retransmission nodes. We prove the accurateness of NBA. Simulations show that NBA reduces the number of redundant retransmissions and balances traffic efficiently, so energy is conserved and energy dissipation is distributed evenly throughout the network. Thereby the lifetime of WSN is prolonged greatly.


Wireless Sensor Network Cluster Head Network Lifetime Message Complexity Optimize Link State Route 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A Survey on Sensor Networks. IEEE Communications Magazine 40(8), 102–114 (2002)CrossRefGoogle Scholar
  2. 2.
    Niculescu, D., Americ, N.: Communication Paradigms for Sensor Networks. IEEE Communications Magazine 43(3), 116–122 (2005)CrossRefGoogle Scholar
  3. 3.
    Du, K., Wu, J., Zhou, D.: Chain-Based Protocols for Data Broadcasting and Gathering in the Sensor Networks. In: Proceedings of the International Parallel and Distributed Processing Symposium, pp. 1–8 (2003)Google Scholar
  4. 4.
    Ni, S.Y., Tseng, Y.C., Chen, Y., Sheu, J.: The Broadcast Storm Problem in a Mobile Ad Hoc Network. In: Proceedings of the Fifth Asmual ACM/ IEEE International Conference on Mobile Computing and Network, pp. 151–162 (1999)Google Scholar
  5. 5.
    Tang, Y., Zhou, M., Zhang, X.: Overview of Routing Protocols in Wireless Sensor Networks. Journal of Software 17(3), 410–421 (2006)MATHCrossRefGoogle Scholar
  6. 6.
    Lim, H., Kim, C.: Flooding in Wireless Ad Hoc Networks. Computer Communications 24(34), 353–363 (2001)CrossRefGoogle Scholar
  7. 7.
    Williams, B., Camp, T.: Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks. In: Proceedings of the Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 194–205 (2002)Google Scholar
  8. 8.
    Tian, D., Georganas, N.: A Coverage-preserving Node Scheduling Scheme for Large Wireless Sensor Networks. In: Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications, pp. 32–41 (2002)Google Scholar
  9. 9.
    Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: An Application-specific Protocol Architecture for Wireless Microsensor Networks. IEEE Transaction on Wireless Communications 1(4), 660–670 (2002)CrossRefGoogle Scholar
  10. 10.
    Clausen, T., Jacquet, P.: Optimized Link State Routing Protocol (OLSR). RFC 3626 (2003) Google Scholar
  11. 11.
    Wu, J.: An Enhanced Approach to Determine a Small Forward Node Set Based on Multipoint relay. In: Proceedings of IEEE Vehicular Technology Conference, pp. 2774–2777 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yong Tang
    • 1
  • Mingtian Zhou
    • 1
  1. 1.College of Computing Science and EngineeringUniversity of Electronic Science and Technology of ChinaSichuanChina

Personalised recommendations