Coverage in wireless sensor networks

Wireless Sensor Networks are developing as a key sensing technology, with various military and civilian applications. In these networks, a large number of sensors are distributed to sensing a target field. The sensors coverage mean that every point in the target field is sensing by at least one sensor. Each sensor is a limited battery-operated device that can sense events in its sensing range and can communicate with neighboring sensors. Since the life time of the sensor is dependent on its battery, where this battery is impossible to replace or recharge it in rough places, it is necessary to find an efficient energy way for it. Consumption of these limit energy batteries can result in the end of network life itself. Therefore, extending the lifetime of wireless sensor networks is important. Designing a schedule for sensors is an important goal in sensor networks to maximize the lifetime of the network. In this thesis presents a different way of scheduling to increase the lifetime of wireless sensor network. At all times, half of the full coverage is provided. Each sensor in our algorithm only needs to know the distances between its neighbor nodes and its sensing areas.Simulations show that new proposed algorithm noticeably improves several existing lifetime maximization algorithms. Also it improves the runtime.