Advertisement

Wireless Networks

, Volume 15, Issue 2, pp 193–207 | Cite as

An unequal cluster-based routing protocol in wireless sensor networks

  • Guihai Chen
  • Chengfa Li
  • Mao Ye
  • Jie Wu
Article

Abstract

Clustering provides an effective method for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider the hot spot problem in multihop sensor networks. When cluster heads cooperate with each other to forward their data to the base station, the cluster heads closer to the base station are burdened with heavier relay traffic and tend to die much faster, leaving areas of the network uncovered and causing network partitions. To mitigate the hot spot problem, we propose an Unequal Cluster-based Routing (UCR) protocol. It groups the nodes into clusters of unequal sizes. Cluster heads closer to the base station have smaller cluster sizes than those farther from the base station, thus they can preserve some energy for the inter-cluster data forwarding. A greedy geographic and energy-aware routing protocol is designed for the inter-cluster communication, which considers the tradeoff between the energy cost of relay paths and the residual energy of relay nodes. Simulation results show that UCR mitigates the hot spot problem and achieves an obvious improvement on the network lifetime.

Keywords

Wireless sensor networks Unequal clustering Routing Network lifetime Hot spot problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    I.F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, A survey on sensor networks, IEEE Communications Magazine 40 (August 2002) 102–114.Google Scholar
  2. 2.
    A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler and J. Anderson, Wireless sensor networks for habitat monitoring, in: Proceedings of ACM Workshop on Wireless Sensor Networks and Applications (September 2002) pp. 88–97.Google Scholar
  3. 3.
    B. Krishnamachari, D. Estrin and S. Wicker, The impact of data aggregation in wireless sensor networks, in: Proceedings of IEEE International Conference on Distributed Computing Systems Workshops (July 2002) pp. 575–578.Google Scholar
  4. 4.
    W. Heinzelman, A. Chandrakasan and H. Balakrishnan, Energy-efficient communication protocols for wireless microsensor networks, in: Proceedings of the 33rd Hawaiian International Conference on Systems Science (January 2000).Google Scholar
  5. 5.
    V. Mhatre and C. Rosenberg, Design guidelines for wireless sensor networks: communication, clustering and aggregation, Ad Hoc Networks 2(1) (2004) 45–63.CrossRefGoogle Scholar
  6. 6.
    K. Akkaya and M. Younis, A survey on routing protocols for wireless sensor networks, Ad Hoc Networks 3(3) (2005) 325–349.CrossRefGoogle Scholar
  7. 7.
    W. Heinzelman, A. Chandrakasan and H. Balakrishnan, An application-specific protocol architecture for wireless microsensor networks, IEEE Transactions on Wireless Communications 1(4) (2005) 660–670.CrossRefGoogle Scholar
  8. 8.
    W. Choi, P. Shah and S.K. Das, A framework for energy-saving data gathering using two-phase clustering in wireless sensor networks, in: Proceedings of International Conference on Mobile and Ubiquitous Systems (August 2004) pp. 203–212.Google Scholar
  9. 9.
    O. Younis and S. Fahmy, HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks, IEEE Transactions on Mobile Computing 3(4) (2004) 660–669.CrossRefGoogle Scholar
  10. 10.
    M. Qin and R. Zimmermann, An energy-efficient voting based clustering algorithm for sensor networks, in: Proceedings of 1st ACIS Workshop on Self-Assembling Wireless Networks (May 2005).Google Scholar
  11. 11.
    J.S. Liu and C.H. Lin, Energy-efficiency clustering protocol in wireless sensor networks, Ad Hoc Networks 3(3) (2005) 371–388.CrossRefMathSciNetGoogle Scholar
  12. 12.
    M. Ye, C. Li, G. Chen and J. Wu, An energy efficient clustering scheme in wireless sensor networks, Ad Hoc & Sensor Wireless Networks to appear.Google Scholar
  13. 13.
    S. Soro and W. Heinzelman, Prolonging the lifetime of wireless sensor networks via unequal clustering, in: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (April 2005).Google Scholar
  14. 14.
    T. Shu, M. Krunz and S. Vrudhula, Power balanced coverage-time optimization for clustered wireless sensor networks, in: Proceedings of the Sixth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (May 2005).Google Scholar
  15. 15.
    M. Perillo, Z. Cheng and W. Heinzleman, An analysis of strategies for mitigating the sensor network hot spot problem, in: Proceedings of the Second International Conference on Mobile and Ubiquitous Systems (July 2005).Google Scholar
  16. 16.
    S. Olariu and I. Stojmenovic, Design guidelines for maximizing lifetime and avoiding energy holes in sensor networks with uniform distribution and uniform reporting, in: Proceedings of IEEE INFOCOM (April 2006).Google Scholar
  17. 17.
    J. Lian, K. Naik and G. Agnew, Data capacity improvement of wireless sensor networks using non-uniform sensor distribution, International Journal of Distributed Sensor Networks to appear.Google Scholar
  18. 18.
    E.I. Oyman and C. Ersoy, Multiple sink network design problem in large scale wireless sensor networks, in: Proceedings of the International Conference on Communications (June 2004).Google Scholar
  19. 19.
    S.R. Gandham, M. Dawande, R. Prakash and S. Venkatesan, Energy efficient schemes for wireless sensor networks with multiple mobile base stations, in: Proceedings of IEEE IEEE Global Telecommunications Conference (December 2003) pp. 377–381.Google Scholar
  20. 20.
    Z.M. Wang, S. Basagni, E. Melachrinoudis and C. Petrioli, Exploiting sink mobility for maximizing sensor networks lifetime, in: Proceedings of the 38th Hawaii International Conference on System Sciences (January 2005).Google Scholar
  21. 21.
    W. Wang, V. Srinivasan and K.C. Chua, Using mobile relays to prolong the lifetime of wireless sensor networks, in: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking (MobiCom) (August 2005) pp. 270–283.Google Scholar
  22. 22.
    G.G. Finn, Routing and addressing problems in large metropolitan-scale internetworks, Technical Report ISI/RR-87-180 Information Sciences Institute (ISI) (1987).Google Scholar
  23. 23.
    E. Kranakis, H. Singh and J. Urrutia, Compass routing on geometric networks, in: Proceedings of the 11th Canadian Conference on Computational Geometry (August 1999) pp. 51–54.Google Scholar
  24. 24.
    B. Karp and H.T. Kung, GPSR: greedy perimeter stateless routing for wireless networks, in: Proceedings of the 6th ACM/IEEE Annual International Conference on Mobile Computing and Networking (MobiCom) (August 2000) pp. 243–254.Google Scholar
  25. 25.
    H. Frey and I. Stojmenović, Geographic and energy-aware routing in sensor networks, in: Handbook of Sensor Networks: Algorithms and Architectures (Wiley, 2005).Google Scholar
  26. 26.
    O. Younis and S. Fahmy, A scalable framework for distributed time synchronization in multi-hop sensor networks, in: Proceedings of the Second IEEE International Conference on Sensor and Ad Hoc Communications and Networks (September 2005) pp. 13–23.Google Scholar
  27. 27.
    O. Younis and S. Fahmy, An experimental study of routing and data aggregation in sensor networks, in: Proceedings of the International Workshop on Localized Communication and Topology Protocols for Ad hoc Networks (November 2005) pp. 50–57.Google Scholar
  28. 28.
    M. Ye, E. Chan and G. Chen, On mitigating hot spots for clustering mechanisms in wireless sensor networks, in: Proceedings of the Third IEEE International Conference on Mobile Ad-hoc and Sensor Systems (October 2006).Google Scholar
  29. 29.
    V. Kawadia and P.R. Kumar, Power control and clustering in ad hoc networks, in: Proceedings of IEEE INFOCOM (April 2003) pp. 459–469.Google Scholar
  30. 30.
    S. Basagni, Distributed clustering for ad hoc networks, in: Proceedings of the 4th International Symposium on Parallel Architectures, Algorithms, and Networks (June 1999) pp. 310–315.Google Scholar
  31. 31.
    L. Hu, Distributed code assignments for CDMA packet radio networks, IEEE/ACM Transactions on Networking 1(6) (1993) 668–677.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.State Key Laboratory for Novel Software TechnologyNanjing UniversityNanjingP. R. China
  2. 2.Department of Computer Science and EngineeringFlorida Atlantic UniversityBoca RatonUSA

Personalised recommendations