Algorithms For Coverage In Wireless Sensor Networks

Recent technological advances in micro-electro-mechanical systems (MEMS) technology, wireless communications, and digital electronics have led to the emergence of large-scale sensor networks. It has been predicted to have a wide range of applications related to national security, military, environment, health care, home and other commercial areas. Many researchers are currently engaged in developing the technologies needed for different layers of the sensor networks protocol.This paper considers the problem of coverage large-scale sensor networks. The coverage problem is centered on a fundamental question: How well do the sensors observe the physical space? The coverage concept is a measure of the quality of service (QoS) of the sensing function and is subject to a wide range of interpretations due to a variety of sensors and applications.This paper considers three different coverage problems: connected coverage, k-coverage and barrier coverage. In order to solve the connected coverage problem, we propose a novel triangle-arranged circle division method to model a sufficient condition for the network to maintain connected coverage. Then the formula for connected coverage is derived using probability method and the possible applications are discussed. Then, a distributed algorithm for k-coverage is proposed and the possible applications of the algorithm are discussed. We study the barrier coverage based on the model of maximal breach path (MBP) and the maximal support path (MSP). And a incremental deployment algorithm is proposed to improve the performance of barrier coverage. Finally, we describe the design and implement of sensor network simulation platform. The simulation platform provides a visual environment for experimentation of algorithms such as location, coverage and deployment.