A COverage INcreasing Algorithm in Mixed Sensor Networks

Wireless ad hoc sensor networks have recently emerged as a premier research topic. They have great long term economic potential, ability to transform our lives and pose many new system-building challenges. Here, we address one of the fundamental problems, namely coverage.Sensor coverage, in general, answers the questions about the quality of service (surveillance) that can be provided by a particular sensor network. Most existing researches on sensor networks consider networks where all sensors are static nodes. We propose to improve sensor network performance by deploying a small number of mobile sensors in addition to a large number of static sensors. In this paper, we present a distributed solution that utilizes a small number of mobile sensors to improve coverage performance in sensor networks. The distributedsolution includes distributed schemes for: 1) determining the exact size of a coverage hole; 2) determining the number and locations of mobile sensors for covering a hole; 3) calling mobile sensors. In this paper we propose a protocol, called Coin, where multi-step deployment process in a mixed sensor network is used. Coin is an extension of CovEN algorithm, from [3]. Our simulation experiments show that our algorithm achieves the best results of coverage percentage

کلیدواژه ها:

Coverage ، hole size ، sensor network