Mathematical Model Of Coverage Problem In Wireless Sensor Network

With the rapid development of wireless communication and sensors, a wireless sensor network (WSN) has attracted wide attention, the coverage of the network has also become one of the hot research problems in wireless sensor networks, and wireless sensor networks also have a wide applications in agriculture, medical aid, transportation and others fields. In this thesis, in order to discuss the completely covered problem under sensing topology, we use regular hexagon grid divides area and sensor nodes are arranged in the grid. This thesis gives the definition of high degree point of grid and discuss sensing holes problem when high degree point of grid deletion, and concluded:(1)The node determines disposed at the center of the grid. If network only missing a high degree point, the network does not exist sensing holes, whenR=(3)3/3Rs(2) Nodes are randomly placed on the grid. If network has one or two Chord when high degree point missing, the network must exist sensing holes.Finally, given the algorithm to identify redundant nodes in conditions to keep the area fully covered, and proved the feasibility of the algorithm through simulation.