本文選題：傳感器網(wǎng)絡(luò) + 負(fù)載平衡�。� 參考：《電子科技大學(xué)》2017年碩士論文

【摘要】：傳感器網(wǎng)絡(luò)多跳中繼通信的工作方式容易導(dǎo)致通信負(fù)荷集中在匯聚節(jié)點附近的傳感器節(jié)點中,導(dǎo)致這些節(jié)點能量消耗更快,形成通信熱點,這個問題稱為通信負(fù)載不平衡問題。窄長鏈狀傳感器網(wǎng)絡(luò)是一種傳感器節(jié)點部署呈窄長鏈狀形式的的傳感器網(wǎng)絡(luò),由于其特殊的結(jié)構(gòu),使其相對于常規(guī)的傳感器網(wǎng)絡(luò)更容易導(dǎo)致數(shù)據(jù)轉(zhuǎn)發(fā)集中在部分節(jié)點造成通信負(fù)載不均衡,也更容易由部分節(jié)點耗盡能量引發(fā)網(wǎng)絡(luò)中斷,使得兼顧能量效率的負(fù)載平衡問題成為困擾窄長鏈狀傳感器網(wǎng)絡(luò)應(yīng)用的核心難題。為了解決上述難題,本文以節(jié)點部署策略和配套路由算法為核心解決這個問題:多個移動匯聚節(jié)點作為網(wǎng)絡(luò)中間層被引入,按照規(guī)劃靜止和行駛。在窄長鏈狀部署的傳感器節(jié)點和移動匯聚節(jié)點的基礎(chǔ)上,動態(tài)分簇路由算法被提出,以實現(xiàn)傳感器節(jié)點之間和移動匯聚節(jié)點之間的通信負(fù)荷平衡,負(fù)載均衡并不以犧牲通信能量效率為代價,通信能量效率依然保持在較高的水平。傳感器網(wǎng)絡(luò)的分簇常常也會帶來客觀的成本,它包括簇首節(jié)點廣播自身位置,簇成員接收信息,判斷歸屬再反饋信息給簇首節(jié)點。在本文提出的方案中,所有傳感器節(jié)點根據(jù)存儲在自身內(nèi)部的算法自動組網(wǎng),無需分簇信息的廣播,僅有極少的時間同步信息即可保證動態(tài)分簇的實現(xiàn)。相對于動態(tài)分簇,時間同步每隔很長一段時間才需要,這大大降低了建簇能量成本,同時還提高了建簇速度。為了驗證該方案的有效性,本文從入侵監(jiān)測的環(huán)形柵欄覆蓋傳感器網(wǎng)絡(luò)、用于管道監(jiān)測的線型鏈狀傳感器網(wǎng)絡(luò)這兩種典型的窄長鏈狀傳感器入手分析方案的效果,網(wǎng)絡(luò)能耗仿真結(jié)果證明,該方案實現(xiàn)了傳感器網(wǎng)絡(luò)的通信能量高效和負(fù)載均衡。除此之外,以確定性部署為基礎(chǔ)實現(xiàn)了低成本高質(zhì)量節(jié)點定位;通過對節(jié)點進(jìn)行參量定義,基站可以從接收信息中判斷參與通信的傳感器節(jié)點及其能耗,使得方案可以進(jìn)一步應(yīng)用于事件驅(qū)動和詢問驅(qū)動的傳感器網(wǎng)絡(luò);網(wǎng)絡(luò)還可以動態(tài)調(diào)整分簇比例等方法,提高自身抗毀性和對環(huán)境的適應(yīng)性。
[Abstract]:The mode of multi-hop relay communication in sensor networks easily leads to the communication load concentrated in the sensor nodes near the convergent nodes, which leads to the faster energy consumption of these nodes and the formation of communication hot spots. This problem is called the problem of communication load imbalance. Narrow long chain sensor network is a kind of sensor network in which sensor nodes are deployed in narrow long chain form. Because of its special structure, Compared with conventional sensor networks, it is easier to cause data forwarding to focus on some nodes and cause communication load imbalance, and it is also easier to cause network disruption by some nodes running out of energy. Therefore, load balancing with energy efficiency is the core problem for narrow long chain sensor networks. In order to solve the above problems, this paper focuses on the node deployment strategy and the matching routing algorithm: multiple mobile convergence nodes are introduced as the intermediate layer of the network, and they are stationary and driving according to the plan. Based on the narrow long chain deployed sensor nodes and mobile convergence nodes, a dynamic clustering routing algorithm is proposed to balance the communication load between sensor nodes and mobile convergence nodes. Load balancing is not at the expense of communication energy efficiency, which remains at a higher level. The clustering of sensor networks often brings the objective cost, which includes broadcasting the location of the cluster head node, receiving the information from the cluster member, judging the home and feedback information to the cluster head node. In the scheme proposed in this paper, all sensor nodes automatically network according to the algorithm stored in their own, without the broadcast of clustering information, only a little time synchronization information can ensure the realization of dynamic clustering. Compared with dynamic clustering, time synchronization is needed every long time, which greatly reduces the energy cost and improves the speed of cluster building. In order to verify the effectiveness of the proposed scheme, this paper analyzes the effects of the two typical narrow and long chain sensor networks, namely, the ring fence covering sensor network for intrusion detection and the linear chain sensor network for pipeline monitoring. The simulation results of network energy consumption show that the proposed scheme achieves communication energy efficiency and load balancing of sensor networks. In addition, on the basis of deterministic deployment, the location of nodes with low cost and high quality is realized. By defining the parameters of nodes, the base station can judge the sensor nodes involved in the communication and their energy consumption from the received information. The scheme can be further applied to event-driven and interrogation-driven sensor networks, and the network can dynamically adjust the clustering ratio to improve its own invulnerability and adaptability to the environment.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 依博亮;;體育場館中的無線地下傳感器網(wǎng)絡(luò)研究[J];現(xiàn)代電子技術(shù);2017年03期

2 王立舒;張麗影;張智文;楊鵬;王樹文;;精細(xì)農(nóng)業(yè)無線傳感器網(wǎng)絡(luò)終端節(jié)點定位研究[J];農(nóng)機(jī)化研究;2017年01期

3 陸俊;朱炎平;徐志強(qiáng);肖振鋒;;面向輸電線路監(jiān)測的無線傳感網(wǎng)絡(luò)可靠路由方法研究[J];電網(wǎng)技術(shù);2017年02期

4 譚勵;胡計鵬;楊明華;楊朝玉;;AR可變的有向傳感器網(wǎng)絡(luò)節(jié)點模型的研究[J];計算機(jī)應(yīng)用研究;2017年07期

5 崔小勇;林寧;;基于遺傳模擬退火算法的無線傳感器網(wǎng)路由協(xié)議[J];傳感器與微系統(tǒng);2016年07期

6 張富斌;;油氣長輸管道無線傳感器網(wǎng)絡(luò)監(jiān)測系統(tǒng)研究[J];石化技術(shù);2015年04期

7 杜華程;許同樂;黃湘俊;楊艷輝;;基于CAN總線的智能傳感器節(jié)點設(shè)計與應(yīng)用[J];傳感器與微系統(tǒng);2015年02期

8 匡哲君;師唯佳;胡亮;周航;;基于移動匯聚節(jié)點延遲容忍的節(jié)能策略[J];吉林大學(xué)學(xué)報(工學(xué)版);2015年05期

9 夏輝;;基于傳感器網(wǎng)絡(luò)的油氣管道監(jiān)控系統(tǒng)設(shè)計與實現(xiàn)[J];電子技術(shù)與軟件工程;2014年01期

10 王林;姜杰;;無線傳感器網(wǎng)絡(luò)中間件技術(shù)研究綜述[J];計算機(jī)工程與科學(xué);2014年02期

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

1 匡哲君;無線傳感器網(wǎng)絡(luò)節(jié)能策略的研究[D];吉林大學(xué);2014年

2 吳曉培;傳感器網(wǎng)絡(luò)的部署以及節(jié)能研究[D];電子科技大學(xué);2012年

3 竇金鳳;無線傳感器網(wǎng)絡(luò)生命周期延長算法研究[D];中國海洋大學(xué);2008年

4 張曦煌;無線傳感器網(wǎng)絡(luò)的研究[D];江南大學(xué);2008年

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

1 李濤;邊境防控體系中無線傳感器網(wǎng)絡(luò)系統(tǒng)的設(shè)計與分析[D];云南大學(xué);2015年

2 崔倍磊;智能交通系統(tǒng)中的無線傳感器網(wǎng)絡(luò)和新的傳輸方式[D];北京交通大學(xué);2014年

3 張彩霞;面向輸電線路監(jiān)控的無線傳感器網(wǎng)絡(luò)拓?fù)淇刂蒲芯縖D];華北電力大學(xué);2014年

4 范曉輝;鏈狀線型WSN中基于梯度的分簇成鏈算法研究[D];鄭州大學(xué);2013年

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

6 曲文虎;無線傳感器網(wǎng)絡(luò)中數(shù)據(jù)匯聚節(jié)點移動問題研究[D];中國科學(xué)技術(shù)大學(xué);2010年

7 李雯霏;基于無線傳感網(wǎng)絡(luò)的非法越境監(jiān)測系統(tǒng)中的關(guān)鍵技術(shù)研究[D];昆明理工大學(xué);2008年

，

本文編號：2054231