Skip to main content

Performance Comparison of Clustering Schemes in Sensor Networks

  • Chapter
Wireless Sensor Networks and Applications

Part of the book series: Signals and Communication Technology ((SCT))

Recent advances in microelectro-mechanical systems and wireless communications have enabled the development of distributed, wireless networks of small, inexpensive, low power sensors. These sensors, which possess sensing, data processing and short range communication capabilities, can be deployed in diverse environments to collect useful information. Large numbers of such inexpensive sensors form ad hoc wireless networks which can be used in a variety of commercial and military applications.

As sensors become inexpensive and widely available, sensor networks can be deployed in larger scales. One of the issues arising consequently is scalability. A flat structure of a large number of sensors often provides low scalability and makes network-wide coordination difficult. To solve this problem, hierarchical architectures (clusters) have been proposed to solve the scalability problem. Appropriate clustering can reduce the need for global coordination and restrict most of the sensing, data processing and communication activities within clusters, thus can improve resource effciency and prolong network lifetime. Clustering can also provide load balancing if appropriately configured.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. Younis and S. Fahmy,“Distributed clustering for scalable, long-lived sensor networks,” in Mobicom 2003(poster),2003.[Online]. Available: citeseer.ist.psu.edu/641340.html

    Google Scholar 

  2. A. D. Amis, R. Prakash, D. Huynh, and T. Vuong, “Max-min d-cluster formation in wireless ad hoc networks,” in INFOCOM (1), 2000, pp. 32-41. [Online]. Available: citeseer.ist.psu.edu/amis00maxmin.html

    Google Scholar 

  3. A. Karnik and A. Kumar, “Distributed optimal self-organisation in a class of wireless sensor networks,” in INFOCOM 2004, vol. 1, 2004, pp. 536-547. [Online]. Available: citeseer.ist.psu.edu/695226.html

    Article  Google Scholar 

  4. Y. P. Chen, A. L. Liestman, and J. Liu, “Clustering algorithms for ad hoc wireless networks.” [Online]. Available: citeseer.ist.psu.edu/677953.html

    Google Scholar 

  5. C. R. Lin and M. Gerla, “Adaptive clustering for mobile wireless networks,” IEEE Journal of Selected Areas in Communications, vol. 15, no. 7, pp. 1265-1275, 1997. [Online]. Available: citeseer.ist.psu.edu/lin97adaptive.html

    Article  Google Scholar 

  6. K. Kalpakis, K. Dasgupta, and P. Namjoshi, “Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks,” Computer Networks, vol.42, no.6, pp.697-716, August 2003.[Online]. Available: citeseer.ist.psu.edu/kalpakis02efficient.html

    Article  MATH  Google Scholar 

  7. A. Joshi, R. Batta, and R. Nagi, “Ad hoc sensor network topology design for distributed fusion: A mathematical programming approach,” in Proc. of the 7th Int. Conf. on Information Fusion, Stickholm, 2004, pp. 836-841. [Online]. Available: citeseer.ist.psu.edu/696672.html

    Google Scholar 

  8. K. Dasgupta, K. Kalpakis, and P. Namjoshi, “An efficient clustering-based heuristic for data gathering and aggregation in sensor networks,” in IEEE Wireless Comunications and Networking(WCNC), vol. 3, 2003, pp. 1948-1953. [Online]. Available: citeseer.ist.psu.edu/575548.html

    Google Scholar 

  9. O. Younis and S. Fahmy, “Distributed clustering in ad-hoc sensor networks: A hybrid energy-efficient approach,” in INFOCOM 2004, vol. 1, 2004, pp. 629-640. [Online]. Available: citeseer.ist.psu.edu/697086.html

    Article  Google Scholar 

  10. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks,” in Proceedings of the 33rd Annual Hawaii International Conference on System Sciences(HICSS), January 2000, pp. 3005-3014. [Online]. Available: citeseer.ist.psu.edu/rabinerheinzelman00energyefficient.html

    Google Scholar 

  11. A. Siddiqui and R. Prakash, “Modeling, performance measurement, and control of clustering mechanisms for multi-cluster mobile ad hoc networks.” [Online]. Available: citeseer.ist.psu.edu/488604.html

    Google Scholar 

  12. M. Chatterjee, S. Das, and D. Turgut, “Wca: A weighted clustering algorithm for mobile ad hoc networks,” Journal of Cluster Computing(Special Issue on Mobile Ad hoc Networks), vol. 5, pp. 193-204, April 2002. [Online]. Available: citeseer.ist.psu.edu/chatterjee02wca.html

    Article  Google Scholar 

  13. S. Bandyopadhyay and E. Coyle,“An energy efficient hierarchi-cal clustering algorithm for wireless sensor networks,” in INFO-COM 2003, vol.3, 2003, pp.1713-1723.[Online]. Available: cite-seer.ist.psu.edu/bandyopadhyay03energy.html

    Google Scholar 

  14. O. Younis and S. Fahmy,“Heed: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks,” IEEE Transactions on Mobile Computing, vol.3, no.4, pp.366-379,2004.[Online]. Available: citeseer.ist.psu.edu/698974.html

    Article  Google Scholar 

  15. D. Baker and A. Ephremides, “A distributed algorithm for organizing mobile ra-dio telecommunication networks,” in Proceedings of the 2nd International Con-ference on Distributed Computer Systems, 1981, pp. 476-483.

    Google Scholar 

  16. A. K. Parekh, “Selecting routers in ad-hoc networks,” in In Proceedings of the SBT/IEEE International Telecommunications Symposium, 1994.

    Google Scholar 

  17. M. Handy, M. Haase, and D. Timmermann, “Low energy adaptive clustering hierarchy with deterministic cluster-head selection,” in IEEE International Con-ference on Mobile and Wireless Communications Networks, Stockholm, 2002., 2002, pp. 368-372. [Online]. Available: citeseer.ist.psu.edu/handy02low.html

    Google Scholar 

  18. M. X. Cheng, D.-Z. Du, and D. H.-C. Du, “Location management in mobile ad hoc wireless networks using quorums and clusters,” Wireless Communications and Mobile Computing, 2005, to appear.

    Google Scholar 

  19. R. G. Gallager, P. A. Humblet, and P. M. Spira, “A distributed algorithm for minimum-weight spanning trees,” ACM Transactions on Programming Lan-guages and Systems, vol. 5, no. 1, pp. 66-77, 1983.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Ma, Y., Cheng, M. (2008). Performance Comparison of Clustering Schemes in Sensor Networks. In: Li, Y., Thai, M.T., Wu, W. (eds) Wireless Sensor Networks and Applications. Signals and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-49592-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-49592-7_14

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-49591-0

  • Online ISBN: 978-0-387-49592-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics