Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Research challenges in wireless networks of biomedical sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Energy Efficient Multi-Hop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Crash faults identification in wireless sensor networks
Computer Communications
Mobile data collector strategy for delay-sensitive applications over wireless sensor networks
Computer Communications
Adaptive intra cluster routing for wireless sensor networks
Proceedings of the 2009 International Conference on Hybrid Information Technology
| Hi-index | 0.00 |
In this paper, we consider the problem of positioning mobile cluster heads and balancing traffic load in a hybrid sensor network, which consists of two types of nodes: basic static sensor nodes and mobile cluster heads. In such a network, sensor nodes are organized into clusters and form the lower layer of the network. At the higher layer, cluster heads collect sensing data from sensors and forward data to outside observers. Such two-layer hybrid networks are more scalable and energy-efficient than homogeneous sensor networks. We show that the locations of cluster head-s can affect network lifetime significantly. The problem of maximizing network lifetime through dynamically positioning cluster heads in the network (referred to as the CHL problem in this paper) turns out to be NP-hard. We present a heuristic algorithm for positioning cluster heads and balancing traffic load in the network. We show that by moving the cluster head to a better location, the traffic load can be balanced and network lifetime can be prolonged. We conducted simulations on the NS-2 simulator, and the result-s show that our clustering algorithm can increase network lifetime by up to 35% after only three rounds of adjustments, compared to the optimal lifetime of the initial network layout.