發(fā)布時(shí)間：2018-06-15 11:18

  本文選題：無(wú)線傳感網(wǎng) + 能量空洞　； 參考：《南京郵電大學(xué)》2017年碩士論文

【摘要】：在無(wú)線傳感網(wǎng)中,對(duì)于如何有效利用節(jié)點(diǎn)的有限能量來(lái)最大限度的發(fā)揮網(wǎng)絡(luò)整體功效并延長(zhǎng)網(wǎng)絡(luò)生命周期,始終是其關(guān)鍵問(wèn)題之一。由于部分節(jié)點(diǎn)自身儲(chǔ)備的能量過(guò)早消耗殆盡,從而導(dǎo)致網(wǎng)絡(luò)原有覆蓋區(qū)域的缺失或者節(jié)點(diǎn)采集的數(shù)據(jù)信息無(wú)法送達(dá)到Sink的“能量空洞”現(xiàn)象。對(duì)于“能量空洞”現(xiàn)象的研究已經(jīng)成為了無(wú)線傳感網(wǎng)的研究熱點(diǎn)。本文分別針對(duì)圓形和矩形網(wǎng)絡(luò),設(shè)計(jì)并實(shí)現(xiàn)了兩類(lèi)能量空洞緩解方法。具體包括——(1)基于虛擬環(huán)的圓形傳感網(wǎng)能量空洞緩解方法利用環(huán)間節(jié)點(diǎn)非均勻分布部署,結(jié)合最優(yōu)父節(jié)點(diǎn)選擇算法,提出了一種基于相鄰環(huán)間節(jié)點(diǎn)同步工作的能量空洞緩解方法(SNAA)。為降低網(wǎng)絡(luò)中心附近節(jié)點(diǎn)的負(fù)載,首先將圓形網(wǎng)絡(luò)劃分為若干等寬的虛擬環(huán),節(jié)點(diǎn)在各環(huán)內(nèi)隨機(jī)部署且各環(huán)中的節(jié)點(diǎn)數(shù)量按照一定比例由外環(huán)向內(nèi)環(huán)遞增。隨后,各節(jié)點(diǎn)通過(guò)考慮其候選父節(jié)點(diǎn)的剩余能量及節(jié)點(diǎn)間距來(lái)選擇最優(yōu)父節(jié)點(diǎn),并在環(huán)間數(shù)據(jù)收發(fā)過(guò)程中,進(jìn)一步實(shí)現(xiàn)了節(jié)點(diǎn)的休眠調(diào)度,降低了處于空閑監(jiān)聽(tīng)狀態(tài)的節(jié)點(diǎn)的能耗。仿真結(jié)果表明,SNAA方法與吳小兵、劉安豐等人提出的方法相比,在能耗均衡方面的性能較優(yōu)。(2)基于移動(dòng)Sink的矩形傳感網(wǎng)能量空洞緩解方法首先,將矩形網(wǎng)絡(luò)劃分為虛擬柵格以使得節(jié)點(diǎn)在各柵格中形成簇狀結(jié)構(gòu)。隨后,以移動(dòng)Sink為根節(jié)點(diǎn),以各柵格內(nèi)的簇頭為中間節(jié)點(diǎn)或葉節(jié)點(diǎn),建立一棵數(shù)據(jù)收集樹(shù)。為降低節(jié)點(diǎn)的數(shù)據(jù)傳輸能耗,該Sink將分別計(jì)算其當(dāng)前所建立的數(shù)據(jù)收集樹(shù)和其可能移動(dòng)到鄰居?xùn)鸥窈笏⒌臄?shù)據(jù)收集樹(shù)的通信代價(jià),從中選擇代價(jià)最小的樹(shù),并移動(dòng)至該樹(shù)根所在的柵格,直到其不再移動(dòng)為止。仿真結(jié)果表明,該方法所建立的數(shù)據(jù)收集樹(shù),在多跳傳感網(wǎng)絡(luò)的節(jié)能方面表現(xiàn)較為良好,有效緩解了矩形網(wǎng)絡(luò)中的能量空洞現(xiàn)象。
[Abstract]:In wireless sensor networks, how to use the limited energy of nodes to maximize the effectiveness of the network and extend the network life cycle is always one of the key issues. Due to the premature depletion of the energy stored by some nodes, the lack of the original coverage area of the network or the inability of the data collected by the nodes to reach the "energy hole" phenomenon of the Sink. The study of "energy hole" has become a hotspot in wireless sensor networks. In this paper, two kinds of energy cavity mitigation methods are designed and implemented for circular and rectangular networks. It includes: (1) the energy cavity mitigation method of circular sensor network based on virtual loop is based on the non-uniform distribution of nodes between rings, combined with the optimal parent node selection algorithm. A new energy void mitigation method based on the synchronization of adjacent nodes between rings is presented in this paper. In order to reduce the load of nodes near the center of the network, the circular network is first divided into a number of virtual rings of equal width. The nodes are randomly deployed in each ring and the number of nodes in each ring increases by a certain proportion from the outer loop to the inner ring. Then, each node selects the optimal parent node by considering the residual energy of its candidate parent node and the distance between nodes, and further realizes the sleep scheduling of the nodes in the process of receiving and sending data between rings. The energy consumption of nodes in idle listening state is reduced. The simulation results show that compared with the methods proposed by Wu Xiaobing and Liu Anfeng, the performance of the SNAA method in energy balance is better than that proposed by Wu Xiaobing and Liu Anfeng. The rectangular network is divided into virtual grids so that nodes form cluster structures in each grid. Then, a data collection tree is established with mobile sink as root node and cluster head in each grid as intermediate node or leaf node. In order to reduce the data transmission energy consumption of the node, the sink will calculate the communication cost of the data collection tree currently established by the node and the data collection tree that may be moved to the neighbor grid to select the tree with the least cost. And move to the grid where the root of the tree is located until it no longer moves. The simulation results show that the data collection tree established by this method performs well in energy saving of multi-hop sensor networks and effectively alleviates the phenomenon of energy holes in rectangular networks.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 王建玲;王亞慧;田樂(lè);;基于無(wú)線傳感器網(wǎng)絡(luò)的Socket通信研究[J];傳感器與微系統(tǒng);2014年02期

2 屈峰;楊華;王立軍;謝愛(ài)榮;;無(wú)線傳感器網(wǎng)絡(luò)及其應(yīng)用[J];四川兵工學(xué)報(bào);2013年02期

3 錢(qián)志鴻;王義君;;面向物聯(lián)網(wǎng)的無(wú)線傳感器網(wǎng)絡(luò)綜述[J];電子與信息學(xué)報(bào);2013年01期

4 朱紅松;孫利民;;無(wú)線傳感器網(wǎng)絡(luò)技術(shù)發(fā)展現(xiàn)狀[J];中興通訊技術(shù);2009年05期

5 李建中;高宏;;無(wú)線傳感器網(wǎng)絡(luò)的研究進(jìn)展[J];計(jì)算機(jī)研究與發(fā)展;2008年01期

6 吳光斌,梁長(zhǎng)垠;無(wú)線傳感器網(wǎng)絡(luò)能量有效性的研究[J];傳感器技術(shù);2004年07期

，

本文編號(hào)：2021831