Research On Grid-based WSN Deployment For K-coverage And Multi Connectivity

Wireless Sensor Network (WSN) is a mass high-density network system which iscomposed of a dense of wireless sensor nodes deployed in the monitoring area usingself-organization, consisting of multiple hops communication mode. It is suitable forlarge-scale deployment and widely used in military, environmental monitoring, health careand forecasting system, etc. The effective deployment of wireless sensor nodes is theprecondition of networks’ efficiency and stable working. Considering wireless sensornodes’ characteristics of vulnerability and low energy storage, we should make suremonitoring area is covered with sensor nodes in k coverage and multiply connected to forma high stability and high fault-tolerance network.The main work of this paper:(1) This paper analyzes the existing wireless sensor node deployment algorithmDESK. The algorithm converts regional k-cover to nodes’ perimeters k-cover. And judgenode perimeter k coverage through the communication between the neighbor nodes. Thispaper uses the concession mechanism to improve the DESK algorithm by controlling thenumber of the competition nodes to participate in the DESK. This improvement saves thenodes’energy, so it can prolong the life of the network.(2) In view of the existing node deployment algorithms, the distributed nodedeployment algorithm that considered both the coverage and connectivity usually based onpremise of node communication radius is greater than or equal to2times of the senseradius. In this paper, we propose a distributed node deployment algorithm that is based onpremise of the communication radius is less than2times the radius of perception. In thisalgorithm, we divide monitor area into grids and use the rounds work mechanism,according to the energy of nodes and its coverage contribution for the grid to choice somenodes into active state. And make the monitoring area achieve k-cover and multiply connected.