本文選題：低功耗有損網(wǎng)絡(luò)　切入點(diǎn)：RPL　出處：《浙江理工大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：針對低功耗有損網(wǎng)絡(luò)的特殊路由需求及四個(gè)主要方向的應(yīng)用場景,互聯(lián)網(wǎng)工程任務(wù)組下的ROLL組擬定了RPL路由協(xié)議,RPL協(xié)議適用于其中的工業(yè)自動化應(yīng)用場景。目前WSN適用于工業(yè)自動化方向,市場占有率最高的為ISA100.11a,其采用6Lo WPAN連通網(wǎng)絡(luò),6LoWPAN采用RPL作為路由協(xié)議。RPL協(xié)議是基于IPV6架構(gòu),通過構(gòu)建DODAG形成網(wǎng)絡(luò)拓?fù)?DODAG的構(gòu)建依賴目標(biāo)函數(shù)OF所采用的路由度量和路由約束。OF0和MRHOF是RPL中兩類主要的目標(biāo)函數(shù),其中OF0采用距離根節(jié)點(diǎn)相對位置最近的點(diǎn)作為選擇最優(yōu)父節(jié)點(diǎn)的標(biāo)準(zhǔn),路由度量單一,這加劇了各節(jié)點(diǎn)的負(fù)載及能耗不均衡,導(dǎo)致部分節(jié)點(diǎn)丟包或能量提前耗盡。在LLN環(huán)境中,節(jié)點(diǎn)不均勻的能耗將會顯著減少網(wǎng)絡(luò)的覆蓋和壽命。路由回路也是RPL協(xié)議亟待解決的問題。路由回路會影響網(wǎng)絡(luò)收斂,導(dǎo)致數(shù)據(jù)包投遞率下降,并大量占用鏈路帶寬。RPL協(xié)議中,當(dāng)鏈路質(zhì)量等級LQL發(fā)生變化或網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)改變時(shí),極易發(fā)生路由回路。RPL中典型的回路有DODAG回路和DAO回路。RPL采用的回路避免規(guī)則為:max_depth規(guī)則和拒絕貪婪規(guī)則,但仍無法避免路由回路的產(chǎn)生。本文從RPL的工業(yè)應(yīng)用場景需求出發(fā),以能耗和可靠性為研究重點(diǎn),相應(yīng)的針對RPL協(xié)議的目標(biāo)函數(shù)OF0和回路避免兩方面進(jìn)行優(yōu)化,主要做了以下工作:(1)為解決目標(biāo)函數(shù)OF0路由度量單一導(dǎo)致的節(jié)點(diǎn)負(fù)載及能耗不均衡的問題,本文提出采用綜合的路由度量Metric(R,E),即從MC度量容器內(nèi)選取能量度量,通過設(shè)置節(jié)點(diǎn)能量格式與計(jì)算節(jié)點(diǎn)能耗引入能量,研究將能量度量和OF0原本的路由度量相融合。使OF0中的節(jié)點(diǎn)在選取父節(jié)點(diǎn)時(shí),不再是單一的對比Rank值,而是綜合考慮節(jié)點(diǎn)Rank與剩余能量。(2)為提升優(yōu)化性能,本文提出兩種使用Metric(R,E)優(yōu)化OF0的方案:方案一在原始協(xié)議基礎(chǔ)上對比節(jié)點(diǎn)剩余能量;方案二則在Rank1"gRank2時(shí)對比剩余能量,剩余能量相等及Rank1Rank2時(shí),由Rank值對比決定最優(yōu)父節(jié)點(diǎn)。在Contiki系統(tǒng)中,修改RPL協(xié)議中OF0相關(guān)代碼。通過COOJA仿真,對比優(yōu)化前后能耗和相應(yīng)節(jié)點(diǎn)數(shù)據(jù)包轉(zhuǎn)發(fā)量,驗(yàn)證了優(yōu)化方案初步解決了網(wǎng)絡(luò)中節(jié)點(diǎn)能耗差異較大的問題,且方案二優(yōu)化性能最佳。在優(yōu)化前論證了SINK節(jié)點(diǎn)置于圓心位置時(shí),能耗最低,在此基礎(chǔ)上優(yōu)化,更加保證節(jié)點(diǎn)低能耗。在采用方案二時(shí),對比了單SINK節(jié)點(diǎn)、雙SINK節(jié)點(diǎn)與是否采用優(yōu)化OFO方案的網(wǎng)絡(luò)整體能耗差異,證明在單SINK節(jié)點(diǎn)下OF0優(yōu)化方案,優(yōu)化前后網(wǎng)絡(luò)總能耗差別最為顯著。(3)為解決路由回路問題,做到深度回路避免,在RPL拒絕貪婪及max_depth規(guī)則的基礎(chǔ)上,本文提出采用基于Rank門限的候選父節(jié)點(diǎn)篩選機(jī)制。在DODAG中,Rank相等的點(diǎn)可能引起路由回路;在鏈路變化時(shí),DIO消息及節(jié)點(diǎn)信息更新滯后,導(dǎo)致節(jié)點(diǎn)和子節(jié)點(diǎn)之間互相選取作為父節(jié)點(diǎn),從而出現(xiàn)回路。將這兩類容易導(dǎo)致回路的節(jié)點(diǎn)從候選父節(jié)點(diǎn)集合中篩除。依此修改協(xié)議代碼后,通過對比100節(jié)點(diǎn)和160節(jié)點(diǎn)環(huán)境下的數(shù)據(jù)包投遞成功率和平均端到端時(shí)延,驗(yàn)證了優(yōu)化方案部分解決了路由回路問題。
[Abstract]:Application scenarios for low power loss with special routing requirements of network and the four main directions, the Internet Engineering Task Force under the ROLL group to the RPL routing protocol, RPL protocol applies to the scene of industrial automation applications. Currently WSN is suitable for the direction of industrial automation, the highest market share for ISA100.11a, which uses 6Lo WPAN 6LoWPAN connected network, using RPL as the routing protocol.RPL is based on IPV6 architecture, the network topology is formed by constructing DODAG, DODAG is built upon objective function used by OF routing metrics and routing constraints.OF0 and MRHOF are the two main types of objective function RPL, which OF0 uses the relative position of distance from the root node as the nearest point selection the optimal parent node routing metric standard, single, which exacerbated the load and energy consumption of each node is not balanced, resulting in part of packet loss or energy depletion in the LLN environment. In energy consumption will significantly reduce the non-uniform node coverage and network lifetime. RPL protocol is a routing loop problem to be solved. The routing loop will affect the network convergence, resulting in packet delivery rate, and take up a lot of bandwidth in the.RPL protocol, when the change of network topology or link quality grade LQL, very easy loop typical routing loop in.RPL DODAG and DAO.RPL using the loop loop loop: max_depth rules and rules to avoid rejection greedy rules, but still can not avoid the routing loop. This paper from the industry application requirement of RPL based on energy consumption and reliability as the research focus, the corresponding RPL protocol the objective function of OF0 and circuit to avoid the two aspects of optimization, mainly do the following work: (1) to solve the objective function OF0 node routing metric caused by a single load and energy consumption is not balanced The problem is proposed in this paper, using an integrated routing metric Metric (R, E), from the MC metric energy container selection metric, by setting the node energy format and calculation of node energy consumption into energy, study the energy metric and the original OF0 routing metric integration. The OF0 in the selected node in the parent node. Comparison of Rank is no longer single value, but considering the node residual energy and Rank. (2) to improve the optimization performance, this paper puts forward two kinds of Metric (R, E) OF0 optimization solutions, a comparison in the original agreement based on the residual energy of nodes; scheme two in Rank1 gRank2 compared the residual energy the residual energy, equal and Rank1Rank2, by the comparison of Rank value determines the optimal parent node. In the Contiki system, modify the RPL protocol in OF0 code. Through COOJA simulation, compared before and after optimization of energy consumption and the corresponding node packet forwarding, verified optimization The case initially solved the problem of the energy consumption of network node difference scheme, and the best performance. Two optimization demonstrates the optimization SINK node at the center position, the lowest energy consumption, the optimization on the basis of this, to ensure low energy consumption. In the scheme of node two, compared to the single SINK node, SINK node with double the overall energy consumption of the network optimization scheme of OFO difference that OF0 optimization scheme in single SINK node, before and after optimization of the total energy consumption of the network. The most significant difference (3) in order to solve the routing loop problem, do the depth of circuit based on RPL to avoid greed and max_depth rules, this paper adopts the candidate parent node selection mechanism Rank based on the threshold. In DODAG, Rank equal point may cause a routing loop; in the link changes, DIO messages and node information update lag, resulting in between nodes and sub nodes each other is selected as the parent node, Thus the circuit. The two kinds of easily lead to circuit nodes from the set of candidate parent node deletion. According to the protocol code after the delivery success rate and average end-to-end delay compared with 100 nodes and 160 nodes under the data packet, to verify the optimization scheme to solve the routing loop problem. Part

【學(xué)位授予單位】：浙江理工大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TN915.04

【參考文獻(xiàn)】

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

1 李田;史浩山;楊俊剛;;無線傳感器網(wǎng)絡(luò)LEACH協(xié)議成簇算法研究[J];傳感技術(shù)學(xué)報(bào);2010年08期

2 周曉芳;屈玉貴;;一種基于多優(yōu)化函數(shù)的跨層定向擴(kuò)散路由協(xié)議[J];中國科學(xué)技術(shù)大學(xué)學(xué)報(bào);2009年08期

3 侯睿,孫軍強(qiáng),丁攀峰;MPLS中一種環(huán)路檢測方法的研究[J];光通信研究;2005年03期

，

本文編號：1634223