Sensor network deployment based on coverage addition factor

In order to improve coverage of randomly deployed wireless sensor networks, a distributed deployment algorithm based on coverage addition factor (CAF) is proposed. In this algorithm, each node acquires the distribution of overlapped coverage arcs on the sensing circle based on its neighbors¿ positions and moves in the direction the coverage addition factor is the greatest. With the algorithm iterated, the coverage of every node and the total coverage of network are both increased obviously. As enhancements, a movement-adjustment scheme and three oscillation-control schemes are designed to avoid movement oscillation and reduce the deploying time. Simulation results show that CAF has advantages over other distributed algorithms such as VOR and VEC in terms of coverage, moving efficiency, moving distance and deploying time.