文档介绍：An Energy Efficient Hierarchical Clustering
Algorithm for Wireless works
Seema Bandyopadhyay and Edward J. Coyle
School of Electrical puter Engineering
Purdue University
West Lafayette, IN, USA
{seema, coyle}***@
Abstract— A work consisting of a large number municate directly only with other sensors that are within a
small sensors with low-power transceivers can be an effective tool small distance. To munication between sensors not
for gathering data in a variety of environments. The data within each other’munication range, the sensors form a
collected by each sensor municated through work to multi-work.
a single processing center that uses all reported data to determine
characteristics of the environment or detect an event. The Sensors in these multi-works detect events and then
communication or message passing process must be designed municate the collected information to a central location
conserve the limited energy resources of the sensors. Clustering where parameters characterizing these events are estimated.
sensors into groups, so that municate information The cost of transmitting a bit is higher than putation [1]
only to clusterheads and then the municate the and hence it may be advantageous anize the sensors into
aggregated information to the processing center, may save clusters. In the clustered environment, the data gathered by the
energy. In this paper, we propose a distributed, randomized sensors municated to the data processing center through
clustering algorithm anize the sensors in a wireless sensor a hierarchy of clusterheads. The processing center determines
network into clusters. We then extend this algorithm to generate the final estimates of the parameters in question using the
a hierarchy of clusterheads and observe that the energy savings municated by the clusterheads. The data
increase with the number of levels in the hierarchy. Results in processing center