Energy-efficient clustering algorithm in wireless sensor networks

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Wireless sensor networks is a key technology for new ways of interaction between computers and the physical environment. However, the energy constrained and limited computing resources of the sensor nodes present major challenges in gathering data. Since sensor nodes are densely deployed, redundant data may occur. While cluster-based data gathering is efficient at energy and bandwidth, it's difficult to cluster network efficiently. In this work, a new distributed clustering algorithm for ubiquitous sensor network is presented. Clustering is based on the distance between nodes and the number in a cluster for wireless sensor networks. Simulation results show that the proposed algorithm balances the energy dissipation over the whole network thus increase the amount of data delivery to the sink. © IFIP International Federation for Information Processing 2006.

Cite

CITATION STYLE

APA

Kim, D., Lee, S., & Cho, W. D. (2006). Energy-efficient clustering algorithm in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4096 LNCS, pp. 1078–1088). Springer Verlag. https://doi.org/10.1007/11802167_108

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free