Font Size: a A A

Wireless Sensor Network Connectivity And Coverage Control Algorithm

Posted on:2012-08-03Degree:MasterType:Thesis
Country:ChinaCandidate:G Q ChangFull Text:PDF
GTID:2208330335489637Subject:Control Science and Engineering
Abstract/Summary:PDF Full Text Request
Two of the most fundamental problems in Wireless Sensor Network (WSN) are connectivity and coverage. Connectivity indicates that every node can communicate with any other nodes in WSN, which is the precondition to create a self-organization network. Coverage means that overall area should be sensed by all nodes so that the observer can obtain the whole information.In the thesis, the basic principle and the research status worldwide of wireless sensor network are introduced briefly. Since there are many redundant nodes in WSN, and the sensor node energy is limited, in order to reduce the energy consumption of the entire network, this thesis proposes a minimum connected cover set algorithm, which reduces the coverage redundancy, reduce network energy consumption in the testing process. When the communication radius is less than the two times of the perception radius, it further proposes two algorithms to solve the minimum connected set, i.e., the connected algorithm to adjust the virtual radius and the connected algorithm based on minimum spanning tree. So the communication radius and perception radius of coverage in any proportion connectedness of the set can be ensured. Simulation results show that this algorithm needs a small number of nodes to the connected cover set, and ensures the work of the node network connectivity.Currently, most algorithms are dependent on node location information to determine redundant nodes, ignoring the positioning of the nodes need to waste a lot of energy problems. To this end, we propose a non-position independent coverage control algorithm, and analyze and discuss the affection of the node clock asynchronous on the strength of network coverage. By the broadcasting algorithm in the spanning tree, the time synchronization of working node network can be ensured, and the affection of the time asynchronization on network coverage intensity be reduced. Simulation results show that the algorithm is independent of node location information and can reduce the work of the network nodes and maintain the network connectivity.
Keywords/Search Tags:Wireless Sensor Networks, Coverage control, Connectivity, Spanning tree, Location unaware
PDF Full Text Request
Related items