A Location-Independent Node Scheduling for Heterogeneous Wireless Sensor Networks

In this paper, we address the problem of maximizing sensor networks lifetime as well as maintain sufficient sensing coverage. The problem of computing redundant sensing areas among neighboring heterogeneous sensors is analyzed. We present a mathematical model to compute the redundancy degree of each sensor without the knowledge of location information for heterogeneous wireless sensor networks. Based on the model, we propose a location-independent node scheduling for heterogeneous wireless sensor networks (LINSH), which can implement node self-scheduling automatically. Simulations results show that LINSH can guarantee the desired coverage QoS requirement accurately as well as minimize the number of active nodes and prolong the networks useful lifetime significantly. In addition, LINSH can also balance the energy consumption with low control overhead.