A new coverage algorithm for directional movement Wireless Sensor Networks

The coverage is a critical issue in WSNs and considered as a measure of the service quality of WSNs. We proposed a coverage optimal algorithm based on Virtual Distance (VD) to enhance the coverage of WSNs after initial random placement. We define the ideal position of node related to its neighbor, and then the distance vector of one node´s real position to ideal position is defined as virtual distance related to the neighbor node. The actual travelled path which is determined by the weighted sum of all virtual distance of sensor. The experimental results show that that VD algorithm enables a remarkably improved coverage of the interested area in various environments.