Algorithms for finding best locations of cluster heads for minimizing energy consumption in wireless sensor networks
Authors:
- 22 March 2013
- journal article
- research article
- Published by Springer Nature in Wireless Networks
- Vol. 19 (7) , 1755-1768
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- k-means Requires Exponentially Many Iterations Even in the PlaneDiscrete & Computational Geometry, 2011
- Efficient Load-Balanced Clustering Algorithms for wireless sensor networksComputer Communications, 2008
- Adaptive clustering in wireless sensor networks by mining sensor energy dataComputer Communications, 2007
- A survey on clustering algorithms for wireless sensor networksComputer Communications, 2007
- A distributed clustering method for energy-efficient data gathering in sensor networksInternational Journal of Wireless and Mobile Computing, 2006
- HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networksIEEE Transactions on Mobile Computing, 2004
- An application-specific protocol architecture for wireless microsensor networksIEEE Transactions on Wireless Communications, 2002
- Data gathering algorithms in sensor networks using energy metricsIEEE Transactions on Parallel and Distributed Systems, 2002
- A access-based clustering protocol for multihop wireless ad hoc networksIEEE Journal on Selected Areas in Communications, 2001
- The Architectural Organization of a Mobile Radio Network via a Distributed AlgorithmIEEE Transactions on Communications, 1981