Font Size: a A A

Wireless Sensor Network Coverage Optimization Methods Research

Posted on:2010-10-14Degree:MasterType:Thesis
Country:ChinaCandidate:Y Y ZhuFull Text:PDF
GTID:2208360275998374Subject:Control theory and control engineering
Abstract/Summary:PDF Full Text Request
Recent advancement in wireless communications and electronics has enabled the development and application of low-cost, energy efficient and multi-function wireless sensor network (WSN). Coverage optimization is a fundamental issue for the operation and management of Wireless Sensor Network, which is aimed to obtain long system lifetime, as well as maintain sufficient surveillance to targets.Scheduling the redundant nodes to sleep alternately can prolong the network lifetime efficiently. In this paper, the node scheduling scheme of a kind of random sensor networks is studied. Based on a large number of literatures on the sleep algorithm of wireless sensor network, kinds of the current sleep algorithm based on redundant node determine are analyzed and acquired. However, the following problems exist in these kinds of redundant node determine algorithms. Firstly, the complexity is too high.Secondly, too many work nodes are picked. Besides, the boundary nodes are not able to sleep. To solve these problems, based on the Tian D arithmetic on the sector coverage, this paper designed an improving wireless sensor network sleep mechanism with the reference of circle coverage thought of Huang arithmetic. This method firstly uses the density control to sleep part of the nodes in the region of over high redundancy ratio in order to make the active nodes distribute more equally. Then, the circle coverage redundancy determine is used on the other nodes. Different circle coverage redundancy determine methods are used on the network boundary nodes and non-boundary nodes respectively to ensure the boundary nodes get good sleep resulting in the decline of the network boundary redundancy ratio. The simulated result demonstrate that the improving sleep mechanism result in less number and more equal distribution of the network active nodes, which extend the network lifetime with the network coverage ratio retained.Based on the above process, discussing the node invalidation problem in the wireless sensor network reconfiguration, the concept and key question of restructure are expatiated. Based on this, an auto-fit sensor network restructure scheme is proposed. When the density of network redundant node is large, the sleep node awakening mechanism is adopted. When the density of network redundant node is small, the node moving mechanism based on Dijkstra arithmetic is adopted. The simulated result demonstrates that the reconfiguration scheme can repair the node invalidation network efficiently.
Keywords/Search Tags:Wireless Sensor Network, sleep algorithm, reconfiguration, awakening, node moving
PDF Full Text Request
Related items