A lightweight scheme for node scheduling in wireless sensor networks

Abstract

The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of the WSN by turning off redundant nodes. In this paper, we propose a mathematical method for calculating the coverage fraction in WSNs. According to the method, each active node can evaluate its sensing area whether covered by its active neighbors. We assume that the network is sufficiently dense and the deployed nodes can cover the whole monitored area. In this scenario, if a node's sensing area is covered by its active neighbor nodes, it can be treated as a redundant node. Based on this idea, we propose a lightweight node scheduling (LNS) algorithm that prolongs the network lifetime of the sensor network by turning off redundant nodes without using location information. Simulation study shows that LNS scheme can save considerable energy for data gathering while meeting the desired coverage fraction imposed by application. © Springer-Verlag Berlin Heidelberg 2007.