An energy-efficient balanced clustering algorithm for wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Lifetime maximisation algorithm in Wireless Sensor Network
International Journal of Ad Hoc and Ubiquitous Computing
Distributed routing schemes with accessibility consideration in multi-hop wireless networks
IEEE Transactions on Wireless Communications
Energy efficient backoff hierarchical clustering algorithms for multi-hop wireless sensor networks
Journal of Computer Science and Technology
Distributed optimal dynamic base station positioning in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-efficient clustering in lossy wireless sensor networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |
In the development of various large-scale sensor systems, a particularly challenging problem is how to dynamically organize the sensors into a wireless communication network and route sensed information from the field sensors to a remote base station. This paper presents a new energy-efficient dynamic clustering technique for large-scale sensor networks. By monitoring the received signal power from its neighboring nodes, each node estimates the number of active nodes in realtime and computes its optimal probability of becoming a cluster head, so that the amount of energy spent in both intra- and inter-cluster communications can be minimized. Based on the clustered architecture, this paper also proposes a simple multihop routing algorithm that is designed to be both energy-efficient and power-aware, so as to prolong the network lifetime. The new clustering and routing algorithms scale well and converge fast for large-scale dynamic sensor networks, as shown by our extensive simulation results.