Wireless integrated network sensors
Communications of the ACM
Minimizing communication costs in hierarchically-clustered networks of wireless sensors
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
Minimizing effective energy consumption in multi-cluster sensor networks for source extraction
IEEE Transactions on Wireless Communications
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
On distances in uniformly random networks
IEEE Transactions on Information Theory
Voronoi cells, probabilistic bounds, and hypothesis testing in mixed integer linear models
IEEE Transactions on Information Theory
IEEE Communications Magazine
Node clustering in wireless sensor networks: recent developments and deployment challenges
IEEE Network: The Magazine of Global Internetworking
Distance Distribution in Convex n-Gons: Mathematical Framework and Wireless Networking Applications
Wireless Personal Communications: An International Journal
An efficient compressive data gathering routing scheme for large-scale wireless sensor networks
Computers and Electrical Engineering
| Hi-index | 0.00 |
In this paper, we present an analytical model for determining the optimal number of clusters, with the objective of minimizing the communication costs in a clustered wireless sensor network (WSN). Sensor nodes are located randomly and distributed according to a homogeneous two-dimensional Poisson point process. Overall communication costs in the network are calculated analytically based on a practical energy consumption model at node level. The optimal probability of being a cluster head (CH) for each node is deduced by minimizing a cost function taking into account the energy dissipation of nodes. The scenarios with single-hop and multi-hop clustered networks are investigated. Simulation results show the existence of the optimum number of clusters which improves the energy efficiency of clustering schemes. We also verify by simulations that the analytical optimal probability of being a CH can provide a good approximation of the actual optimum probability, regardless of the different densities of nodes in the network. Copyright © 2010 John Wiley & Sons, Ltd.