Title | ||
---|---|---|
Minimizing communication costs in hierarchically-clustered networks of wireless sensors |
Abstract | ||
---|---|---|
A multi-hop network of wireless sensors can be used to gather spatio-temporal samples of a physical phenomenon and transmit these samples to a processing center. This paper addresses the important issue of minimizing the number of transmissions required to gather one sample from each sensor. The technique used to minimize communication costs combines analytical results from stochastic geometry with a distributed, randomized algorithm for generating clusters of sensors. The minimum communication energy achieved by this approach is significantly lower than the energy costs incurred in non-clustered networks and in clustered networks produced by such algorithms as the Max-Min d-cluster algorithm. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1016/S1389-1286(03)00320-7 | WCNC |
Keywords | DocType | Volume |
stochastic geometry,voronoi tessellation,randomized algorithm,sensor network,voronoi tessellations,sensor networks,hierarchical clustering | Journal | 44 |
Issue | ISSN | Citations |
1 | 1389-1286 | 80 |
PageRank | References | Authors |
4.02 | 23 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Seema Bandyopadhyay | 1 | 882 | 52.62 |
E. J. Coyle | 2 | 1321 | 208.71 |