Algorithms For Coverage Control In Wireless Sensor Networks

A lot of sensors, which can sense the environment, process data, store data and carry on wireless communication, collaborate and form a wireless sensor network. As the power of the sensors is limited and can’t be recovered, how to prolong the lifetime by conserving the limited power is a key issue in wireless sensor network. Coverage control is a basic problem in wireless sensor network. An energy-efficient coverage control scheme can minimize the energy consumption and meanwhile meet the coverage requirement.This paper considers two different coverage problems:how to deploy sensor to fully cover the field of interest (FOI) in plane with fewest mobile sensors, and how to select fewest sensors from randomly deployed sensors to fully k-cover FOI on complex surface.For the first coverage problem, the minimum number of sensors needed to fully cover the FOI and the target locations where to place sensors are computed according to the cellular grid. The sensor nodes randomly placed in the target area need to move to the target locations. In order to reduce the total energy consumed by node mobility, and to make the energy consumed by node mobility as even as possible, this paper presents a new integer programming model, and the genetic algorithm gives the approximate optimal deployment plan. The simulation is conducted to verify the proposed algorithm.In the second coverage problem, it is assumed that there is a set of randomly deployed sensors in FOI on the complex surface. A necessary and sufficient condition for the FOI to be fully k-covered by the set of deployed sensors is proposed. For the problem how to select fewest sensors from the deployed sensors, a integer programming model is presented. A centralized algorithm is present to solve the integer programming problem. A distributed scheduling algorithm is proposed, and as many as sensors can turn into the state of sleep according to the distributed scheduling algorithm.