Research On Coverage Optimization Algorithm And Connectivity Of Wireless Sensor Network

Wireless sensor network is a new research area raised a lot of attention from in home and abroad, its development based on the progress of computing, communication and sensing. Wireless sensor network has great application future, so it gets much focus both from reach and industrial circle and academe.Coverage and connectivity problem constitute fundamental elements in wireless sensor network, and they are also the key points to affect network performance and QoS. The coverage problem in wireless sensor network indicates that every point in the monitored area must be covered by at least one sensing node. Connectivity means that no isolate nodes in the whole network, any two neighbor nodes can communicate with each other. Coverage and connectivity not only influence the property of the wireless sensor network, but also determine other factors such as lifetime, energy consumption etc. So the research on coverage and connectivity boast great significance.In this paper, the classification and research of coverage and connectivity in wireless sensor network are introduced briefly. Then, start with grid network, we proposed a new method of regular hexagonal grid plot for wireless sensor network. By means of theoretical proving and computing, the result shows that this method of grid plot not only demand less sensor nodes, but also have a very outstanding low energy-consuming characteristic.For random distributed network, we divided the monitored area into hexagonal grids with sensing radius. By means of mathematic inference, theoretical analysis and calculation, the relationship between number of nodes and complete coverage were got. Finally, the result shows that nodes must be densely distributed to guarantee complete coverage.