本文選題：無線傳感器網(wǎng)絡(luò) + 休眠機(jī)制��； 參考：《南京理工大學(xué)》2009年碩士論文

【摘要】： 隨著無線通信技術(shù)和電子器件技術(shù)的快速發(fā)展,低成本、低功耗、多功能的無線傳感器的開發(fā)和廣泛應(yīng)用成為可能。如何實(shí)現(xiàn)最優(yōu)覆蓋,使網(wǎng)絡(luò)在保證可靠監(jiān)測(cè)性能的同時(shí)延長(zhǎng)網(wǎng)絡(luò)生存時(shí)間是無線傳感器網(wǎng)絡(luò)的一個(gè)基本問題。 調(diào)度冗余節(jié)點(diǎn)輪流休眠能有效延長(zhǎng)網(wǎng)絡(luò)壽命。本文針對(duì)節(jié)點(diǎn)高密度隨機(jī)均勻布撒的網(wǎng)絡(luò),在綜合了大量有關(guān)無線傳感器網(wǎng)絡(luò)休眠算法文獻(xiàn)的基礎(chǔ)上,分析了幾種常用的基于冗余節(jié)點(diǎn)判定的休眠機(jī)制,得到了值得借鑒的思想。針對(duì)這幾種冗余節(jié)點(diǎn)判定算法復(fù)雜度過高、選出的工作節(jié)點(diǎn)過多以及無法使邊界節(jié)點(diǎn)休眠等問題,本文以基于扇區(qū)覆蓋的Tian D算法為基礎(chǔ),結(jié)合Huang算法的圓周覆蓋思想,提出了一種改進(jìn)的無線傳感器網(wǎng)絡(luò)休眠機(jī)制。首先通過密度控制使冗余度過高的區(qū)域中部分節(jié)點(diǎn)先休眠,使活躍節(jié)點(diǎn)分布更均勻;然后對(duì)活躍節(jié)點(diǎn)進(jìn)行圓周覆蓋冗余判定,對(duì)網(wǎng)絡(luò)邊界節(jié)點(diǎn)和非邊界節(jié)點(diǎn)使用不同的圓周覆蓋判定方法,從而使邊界節(jié)點(diǎn)和非邊界節(jié)點(diǎn)均得到很好的休眠,降低了網(wǎng)絡(luò)冗余度。仿真結(jié)果表明,在保持網(wǎng)絡(luò)原有的覆蓋率的基礎(chǔ)上,改進(jìn)休眠機(jī)制使得網(wǎng)絡(luò)活躍節(jié)點(diǎn)數(shù)目更少、分布更均勻,網(wǎng)絡(luò)生存時(shí)間得到延長(zhǎng)。 在此基礎(chǔ)上,本論文針對(duì)節(jié)點(diǎn)失效的無線傳感器網(wǎng)絡(luò)的修復(fù)覆蓋問題進(jìn)行了討論,闡述了重構(gòu)的概念及其關(guān)鍵問題。提出了一種自適應(yīng)的傳感器網(wǎng)絡(luò)重構(gòu)方案:當(dāng)網(wǎng)絡(luò)冗余節(jié)點(diǎn)密度較大時(shí)使用休眠節(jié)點(diǎn)喚醒機(jī)制,當(dāng)冗余節(jié)點(diǎn)密度較小時(shí)使用基于Dijkstra算法的節(jié)點(diǎn)移動(dòng)機(jī)制。仿真結(jié)果表明,該重構(gòu)方案能較好的修復(fù)節(jié)點(diǎn)失效的網(wǎng)絡(luò)。
[Abstract]:With the rapid development of wireless communication technology and electronic device technology, the development and wide application of low-cost, low-power, multi-function wireless sensors are possible. How to achieve optimal coverage and ensure reliable monitoring performance while prolonging network lifetime is a basic problem in wireless sensor networks (WSN). Scheduling redundant nodes can effectively prolong network life by taking turns dormancy. In this paper, based on a large number of literatures on sleep algorithms of wireless sensor networks, several commonly used sleep mechanisms based on redundant node decision are analyzed for nodes with high density and random and uniform distribution. Got the thought which is worth drawing lessons from. In view of the high complexity of these redundant node decision algorithms, the number of selected working nodes and the inability to make the boundary nodes dormant, this paper bases on the Tian D algorithm based on sector coverage and combines the circular coverage idea of the Huang algorithm. An improved sleep mechanism for wireless sensor networks is proposed. First, some nodes in the region with high redundancy are dormant by density control to make the active nodes distribute more evenly, and then the active nodes are judged by circumferential coverage redundancy. Different circumferential coverage decision methods are used for the network boundary nodes and the non-boundary nodes so that both the boundary nodes and the non-boundary nodes are dormant very well and the redundancy of the network is reduced. The simulation results show that on the basis of maintaining the original coverage of the network, the improved dormancy mechanism makes the number of active nodes in the network less, the distribution more uniform, and the network lifetime extended. On this basis, the repair coverage of wireless sensor networks with node failure is discussed in this paper, and the concept of reconstruction and its key problems are discussed. In this paper, an adaptive sensor network reconstruction scheme is proposed. When the redundant node density is high, the dormant node wake-up mechanism is used, and the node movement mechanism based on Dijkstra algorithm is used when the redundant node density is small. The simulation results show that the proposed reconstruction scheme can effectively repair the network with node failure.
【學(xué)位授予單位】：南京理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2009
【分類號(hào)】：TP212.9;TN929.5

【引證文獻(xiàn)】

相關(guān)期刊論文 前2條

1 薛志斌;曾建潮;胡豁生;薛頌東;;移動(dòng)傳感器網(wǎng)絡(luò)編隊(duì)覆蓋搜索控制算法[J];復(fù)雜系統(tǒng)與復(fù)雜性科學(xué);2013年03期

2 傅質(zhì)馨;朱寅寅;吳曉蓓;;能量有效的無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)調(diào)度算法[J];信息與控制;2010年06期

相關(guān)博士學(xué)位論文 前1條

1 張可;無線移動(dòng)自組織及傳感器網(wǎng)絡(luò)中若干問題的研究[D];電子科技大學(xué);2010年

相關(guān)碩士學(xué)位論文 前6條

1 劉姣姣;無線傳感器網(wǎng)絡(luò)中基于Voronoi圖的網(wǎng)絡(luò)覆蓋技術(shù)研究[D];武漢理工大學(xué);2011年

2 黃帥;低冗余率的中高速傳感器網(wǎng)絡(luò)覆蓋算法研究[D];廣東工業(yè)大學(xué);2011年

3 史明岳;能量有效的無線傳感器網(wǎng)絡(luò)覆蓋優(yōu)化研究[D];江蘇科技大學(xué);2012年

4 趙貞貞;三峽庫(kù)區(qū)水環(huán)境監(jiān)測(cè)網(wǎng)絡(luò)的覆蓋優(yōu)化算法[D];重慶大學(xué);2012年

5 洪利平;面向地磁信號(hào)檢測(cè)與傳輸?shù)臒o線傳感器網(wǎng)絡(luò)研究[D];華中科技大學(xué);2012年

6 秦澤峰;面向安全監(jiān)測(cè)的無線傳感器網(wǎng)絡(luò)Voronoi覆蓋算法研究[D];太原科技大學(xué);2013年

，

本文編號(hào)：1979138