Dissertation
Dissertation > Industrial Technology > Radio electronics, telecommunications technology > Wireless communications > Mobile Communications

The Research on Coverage Control Algorithm in Wireless Sensor Network

Author SunZeYu
Tutor ZhouYuBin
School Lanzhou University
Course Computational Mathematics
Keywords Wireless Sensor network coverage algorithm coverage area sensor nodes energy of network
CLC TN929.5
Type Master's thesis
Year 2011
Downloads 38
Quotes 0
Download Dissertation

Wireless sensor network (WSN), as a new interdiscipline, is widely applied in engineering fields, like national defense and military, environmental monitoring, medical care, Smart Home, transportation, etc. Targets in coverage area, through fulfilling a certain coverage condition and ensuring the standards of nodes energy and the best coverage are perceived and monitored with the least sensor nodes. It has become one of the challenging core problems in researches on wireless sensor network.As for WSN, lots of redundant nodes are easier to appear in the process of coverage in coverage areas. And for this, much node energy is consumed and coverage area is reduced. Thus it can not ensure the perception and monitoring of target nodes. Based on this, coverage of WSN is studied mainly in the following aspects. Firstly, with the premise of efficient perception energy, covering algorithm is optimized through greedy algorithm and some theories on geometric graphics. The optimal subset is choosed in data collection and data retrieval and scheduling scheme of nodes state is switched dynamically. As a result, network energy can be reduced efficiently and network service quality can be promoted. Secondly, coverage algorithm of target association is suggested according to influence on the whole network and operation cost. This algorithm ensures well-distribution coverage of sensor nodes on target nodes and optimizes network resources through association sensor nodes and target nodes and the dynamic adjustment of working condition of sensor nodes. Thirdly, as for regular coverage area, association model is made through sensor nodes and target nodes when target nodes are arranged in square area with the use of double squares. As for the whole coverage area, expected value of probability is used to work out the number of the least sensor nodes when the coverage conditions are fulfilled. At the same time, connected probability model and inferential process of edge nodes out of the square area are also provided.Based on all the solutions above, feasibility and stability are verified through simulation experiment. Besides, coverage and connectivity with satisfying coverage requirements are realized.

Related Dissertations
More Dissertations