An energy efficient hierarchical clustering algorithm for wireless sensor networks Export

@inproceedings{bandyopadhyay:clustering, abstract = {A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. The communication or message passing process must be designed to conserve the limited energy resources of the sensors. Clustering sensors into groups, so that sensors communicate information only to clusterheads and then the clusterheads communicate the aggregated information to the processing center, may save energy. In this paper, we propose a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters. We then extend this algorithm to generate a hierarchy of clusterheads and observe that the energy savings increase with the number of levels in the hierarchy. Results in stochastic geometry are used to derive solutions for the values of parameters of our algorithm that minimize the total energy spent in the network when all sensors report data through the clusterheads to the processing center.}, author = {Bandyopadhyay, Seema and Coyle, E. J.}, booktitle = {Proceedings of IEEE INFOCOM 2003}, citeulike-article-id = {895112}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1209194}, citeulike-linkout-1 = {http://www.comsoc.org/confs/ieee-infocom/2003/papers/42_02.PDF}, keywords = {clustering, energy, routing, sensor-networks}, location = {San Francisco, CA, USA}, month = {April}, pages = {1713--1723}, posted-at = {2009-11-10 14:54:27}, priority = {2}, title = {An energy efficient hierarchical clustering algorithm for wireless sensor networks}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1209194}, year = {2003} }

TY - CONF ID - bandyopadhyay:clustering L3 - citeulike-article-id:895112 N2 - A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. The communication or message passing process must be designed to conserve the limited energy resources of the sensors. Clustering sensors into groups, so that sensors communicate information only to clusterheads and then the clusterheads communicate the aggregated information to the processing center, may save energy. In this paper, we propose a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters. We then extend this algorithm to generate a hierarchy of clusterheads and observe that the energy savings increase with the number of levels in the hierarchy. Results in stochastic geometry are used to derive solutions for the values of parameters of our algorithm that minimize the total energy spent in the network when all sensors report data through the clusterheads to the processing center. CY - San Francisco, CA, USA EP - 1723 TI - An energy efficient hierarchical clustering algorithm for wireless sensor networks T2 - Proceedings of IEEE INFOCOM 2003 SP - 1713 KW - clustering KW - energy KW - routing KW - sensor-networks AU - Bandyopadhyay, Seema AU - Coyle, EJ PY - 2003/04// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1209194 ER -