本文選題：ZigBee網(wǎng)絡(luò) + Cluster-Tree��； 參考：《西華大學(xué)》2017年碩士論文

【摘要】：近年來,物聯(lián)網(wǎng)技術(shù)得到了飛速發(fā)展,與此相關(guān)的一些技術(shù)如RFID、無線傳感器網(wǎng)絡(luò)和嵌入式技術(shù)相應(yīng)地也得到了快速的發(fā)展。與此同時,各種短距離無線傳感器網(wǎng)絡(luò)協(xié)議標(biāo)準(zhǔn)也百家爭鳴,大放其彩。其中ZigBee技術(shù)因其具有低成本、低功耗、低復(fù)雜度、高可靠性等特點目前被廣泛應(yīng)用在無線傳感器網(wǎng)絡(luò)中。目前隨著ZigBee技術(shù)應(yīng)用范圍越來越廣,對ZigBee技術(shù)的研究也在不斷的推進(jìn)。其中ZigBee網(wǎng)絡(luò)路由協(xié)議對整個ZigBee網(wǎng)絡(luò)的性能有著重大意義,如何設(shè)計出一個能量高效、低傳輸時延算法成為了ZigBee網(wǎng)絡(luò)路由算法研究熱點。針對Cluster-Tree路由算法和現(xiàn)有的基于鄰居表的樹路由算法存在著跳數(shù)過大、節(jié)點流量負(fù)載不均衡和節(jié)點能量不均衡等問題,對原有的Cluster-Tree路由算法進(jìn)行改進(jìn)。通過設(shè)計節(jié)點之間維護(hù)鄰居表的字段,比較無線傳輸范圍內(nèi)的鄰居節(jié)點作為下一跳節(jié)點;其次通過引入能量分級機制,在節(jié)點使用鄰居表進(jìn)行跳數(shù)選擇時對能量不達(dá)標(biāo)的節(jié)點進(jìn)行保護(hù);理論分析表明,優(yōu)化后的算法在保護(hù)能量較低節(jié)點的前提下能找到一條跳數(shù)更優(yōu)的路徑進(jìn)行傳輸,對網(wǎng)絡(luò)節(jié)點能量有一定自適應(yīng)。仿真數(shù)據(jù)表明,改進(jìn)的算法在平均時延、節(jié)點能耗均衡和降低丟包率上有所提升。針對AODVjr路由算法在進(jìn)行路由發(fā)現(xiàn)和路由維護(hù)過程中,帶來大量無效的路由控制開銷,不僅會造成網(wǎng)絡(luò)堵塞,還會增加整個網(wǎng)絡(luò)能耗和傳輸時延等問題,對原有AODVjr路由算法從路由發(fā)現(xiàn)和路由修復(fù)兩個階段進(jìn)行改進(jìn)。首先根據(jù)節(jié)點加入網(wǎng)絡(luò)時建立的父子關(guān)系自適應(yīng)地設(shè)置RREQ請求幀的廣播范圍和方向,其次針對本地路由修復(fù)過程中會廣播大量路由控制分組,改進(jìn)路由表字段進(jìn)行最小范圍的本地路由維護(hù)。理論分析表明,改進(jìn)后的算法有效限制了路由控制分組在網(wǎng)絡(luò)中的數(shù)量。仿真數(shù)據(jù)表明,改進(jìn)的算法能夠減少路由控制分組在網(wǎng)絡(luò)中的數(shù)量、降低了節(jié)點端到端的平均時延和降低了節(jié)點的能量消耗。
[Abstract]:In recent years, the Internet of things technology has been rapid development, and some related technologies such as RFID, wireless sensor networks and embedded technology have been developed rapidly.At the same time, all kinds of short-range wireless sensor network protocol standards are also controversial.ZigBee technology is widely used in wireless sensor networks because of its low cost, low power consumption, low complexity and high reliability.At present, with the application of ZigBee technology more and more widely, the research of ZigBee technology is also advancing.The routing protocol of ZigBee network is of great significance to the performance of the whole ZigBee network. How to design an energy-efficient and low-transmission delay algorithm has become a hotspot in the research of ZigBee network routing algorithm.In view of the problems of Cluster-Tree routing algorithm and existing tree routing algorithm based on neighbor table, such as too large hops, unbalanced node traffic load and unbalanced node energy, the original Cluster-Tree routing algorithm is improved.By designing the fields of maintaining neighbor table between nodes, the neighbor nodes in wireless transmission range are compared as the next hop nodes. Secondly, the energy classification mechanism is introduced.When nodes use neighbor table to select hops, the energy substandard nodes are protected. Theoretical analysis shows that the optimized algorithm can find a path with better hops for transmission under the premise of protecting the nodes with lower energy.It is adaptive to network node energy.The simulation results show that the improved algorithm improves the average delay, energy consumption equalization and packet loss rate.In the process of route discovery and route maintenance, AODVjr routing algorithm brings a lot of invalid routing control overhead, which will not only cause network congestion, but also increase energy consumption and transmission delay of the whole network.The original AODVjr routing algorithm is improved from two stages: route discovery and route repair.Firstly, the broadcast range and direction of RREQ request frames are set adaptively according to the parent-child relationship established when the nodes join the network. Secondly, a large number of routing control packets are broadcast during the local routing repair process.Improved routing table fields for minimal range local routing maintenance.Theoretical analysis shows that the improved algorithm effectively limits the number of routing control packets in the network.Simulation data show that the improved algorithm can reduce the number of routing control packets in the network, reduce the average end-to-end delay of nodes and reduce the energy consumption of nodes.
【學(xué)位授予單位】：西華大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TN92

【參考文獻(xiàn)】

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

1 白樂強;王玉濤;;基于非均勻分簇機制的ZigBee混合路由算法[J];計算機應(yīng)用;2016年01期

2 曾光輝;張海;;基于能量均衡的ZigBee網(wǎng)絡(luò)路由優(yōu)化[J];內(nèi)蒙古師范大學(xué)學(xué)報(自然科學(xué)漢文版);2015年02期

3 孫慶中;余強;宋偉;;基于博弈論能耗均衡的WSN非均勻分簇路由協(xié)議[J];計算機應(yīng)用;2014年11期

4 劉兆孟;吳錫生;;能量高效的ZigBee路由算法[J];計算機仿真;2013年09期

5 蔡迎玲;楊春勇;谷tQ;胡雯萱;石珊;;基于簇樹AODVjr的混合動態(tài)成簇路由算法[J];光通信研究;2013年03期

6 錢志鴻;王義君;;物聯(lián)網(wǎng)技術(shù)與應(yīng)用研究[J];電子學(xué)報;2012年05期

7 李予東;黃宏光;向西西;;基于能量均衡的ZigBee路由算法優(yōu)化[J];計算機工程與設(shè)計;2011年02期

8 彭友;楊恢先;滿莎;;蟻群優(yōu)化和能量管理的ZigBee網(wǎng)絡(luò)路由[J];計算機應(yīng)用;2011年02期

9 劉丹;錢志鴻;劉影;;ZigBee網(wǎng)絡(luò)樹路由改進(jìn)算法[J];吉林大學(xué)學(xué)報(工學(xué)版);2010年05期

10 陳煒于;孫未未;;自組織網(wǎng)絡(luò)基于鄰居信息廣播算法綜述[J];計算機工程與科學(xué);2010年02期

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

1 呂濤;無線傳感器網(wǎng)絡(luò)分簇路由協(xié)議及其應(yīng)用研究[D];電子科技大學(xué);2013年

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

1 王松;基于蟻群優(yōu)化多路徑路由算法的研究與設(shè)計[D];山東大學(xué);2016年

2 周策;一種基于AOMDV的ZigBee多徑路由網(wǎng)絡(luò)均衡算法研究[D];吉林大學(xué);2015年

3 范珊珊;基于能量均衡的ZigBee網(wǎng)絡(luò)路由模糊控制研究[D];西北師范大學(xué);2014年

4 朱爽;基于ZigBee網(wǎng)絡(luò)的混合路由能量優(yōu)化算法研究[D];吉林大學(xué);2013年

5 易子軍;基于能量均衡的ZigBee網(wǎng)絡(luò)改進(jìn)路由算法研究[D];華南理工大學(xué);2013年

6 韓大衛(wèi);ZigBee網(wǎng)絡(luò)層AODVjr路由算法的節(jié)能研究[D];杭州電子科技大學(xué);2011年

，

本文編號：1737643