Skip to main content

Advertisement

Log in

A dynamic-clustering reactive routing algorithm for wireless sensor networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

The clustering is a key routing method for large-scale wireless sensor networks, which effective extends the lifetime and the expansibility of network. In this paper, a node model is defined based on the structure and transmission principle of neuron, and a dynamic-clustering reactive routing algorithm is proposed. Once the event emergences, the cluster head is dynamic selected in the incident region according to the residual energy. The data collected by the cluster head is sent back to the Sink along the network backbone. Two kinds of accumulation ways are designed to increase the efficiency of data collection. Meanwhile through the fluctuation of action-threshold, the cluster head can trace the changing speed of incident; the nodes outside the incident region use this fluctuation to send data periodically. Finally, the simulation results verify that the DCRR algorithm extends the network’s lifetime considerably and adapts to the change of network scale. The analysis shows that DCRR has more prominent advantages under low and middle load.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Akyildiz, F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). Wireless sensor networks: a survey, computer networks. The International Journal of Computer and Telecommunications Networking, 38(4), 393–422.

    Google Scholar 

  2. Zhao, F., & Guibas, L. (2004). Wireless sensor networks: An information processing approach. Morgan Kaufmann Publishers.

  3. Anna Hac, A. Hác (2003). Wireless sensor network designs. John Wiley & Sons Ltd.

  4. Ibriq, J., & Mahgoub, I. (2004). Cluster-Based routing in wireless sensor networks: Issues and challenges. In Proceeding of the 2004 international symposium on performance evaluation of computer telecommunication systems, San Jose (pp. 759–766).

  5. Heinzelman W. R., Chandrakasan, A. P., & Balakrishnan, H. (2000). Energy-efficient communication protocol for wireless micro-sensor networks. In Proceeding of the Hawaii international conference on system sciences, Maui, Hawaii (pp. 3005–3014).

  6. Heinzelman, W. R., Chandrakasan, A. P., & Balakrishnan, H. (2002). An application-specific protocol architecture for wireless microsensor networks. IEEE Trans. on Wireless Communications, 1(4), 660–670.

    Article  Google Scholar 

  7. Lindsey, S., & Raghavendra, C. S. (2002). PEGASIS:Power Efficient Gathering in Sensor Information Systems. In Proceedings of IEEE aerospace conference (vol. 3, pp. 1125–1130).

  8. Manjeshwar, A., & Agrawal, D. P. (2001). TEEN: A protocol for enhanced efficiency in wireless sensor networks. In Proceedings of the 15th international workshop on parallel and distributed computing issues in wireless networks and mobile computing, San Francisco (pp. 2009–2015).

  9. Manjeshwar, A., & Agrawal, D. P. (2002). APTEEN: A hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks. In Proceedings of the 2nd international workshop on parallel and distributed computing issues in wireless networks and mobile computing, Ft. Lauderdale, FL (pp. 195–202).

  10. Younis, O., Fahmy, S. (2004). HEED: A hybrid energy-efficient distributed clustering approach for ad hoc sensor networks. IEEE Transactions on Mobile Computing, 3(4), 660–669.

    Article  Google Scholar 

  11. Ghiasi, S., Srivastava, A., Yang, X., & Sarrafzadeh, Majid (2002). Optimal energy aware clustering in sensor networks. Sensors, 2(7), 258–269.

    Article  Google Scholar 

  12. Jing, Ai., Turgut, D., & Bölöni, L. (2005). A cluster-based energy balancing scheme in heterogeneous wireless sensor networks. Lecture Notes in Computer Science, 3420, 467–474.

    Article  Google Scholar 

  13. Qin, M., & Zimmermann, R. (2005). An energy-efficient voting-based clustering algorithm for sensor networks. In Proceeding of ACIS international workshop self-assembling wireless networks (SAWN) (pp. 444–451).

  14. Fang, Q., Zhao, F., & Guibas, L. (2003). Lightweight Sensing and Communication Protocols for Target Enumeration and Aggregation. In Proceedings of the 4th ACM international symposium on mobile ad hoc networking & computing (MobiHoc) (pp. 165–176).

  15. Chen, W. P., Hou, C. J., & Sha, L. (2004). Dynamic clustering for acoustic target tracking in wireless sensor networks. IEEE Transactions on Mobile Computing, 3(3), 258–271.

    Article  Google Scholar 

  16. Shnayder, V., Hempstead, M., Chen, B., & Welsh, M. (2004). PowerTOSSIM: Efficient power simulation for TinyOS applications. In Proceeding of the second ACM conference on embedded networked sensor systems (SenSys), Baltimore, Maryland, USA, (pp. 188–200).

Download references

Acknowledgments

The authors are grateful to the anonymous referees for their helpful comments. This work was supported in part by National High Technology Research and Development 863 Program of China (02AA784030).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bin Guo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guo, B., Li, Z. A dynamic-clustering reactive routing algorithm for wireless sensor networks. Wireless Netw 15, 423–430 (2009). https://doi.org/10.1007/s11276-007-0061-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-007-0061-6

Keywords

Navigation