基于能量均衡的WSN地理位置路由協(xié)議研究
本文選題:無(wú)線傳感器網(wǎng)絡(luò) + 地理位置路由; 參考:《長(zhǎng)春理工大學(xué)》2017年碩士論文
【摘要】:無(wú)線傳感器網(wǎng)絡(luò)由傳感器節(jié)點(diǎn)組成,節(jié)點(diǎn)之間通過(guò)路由進(jìn)行數(shù)據(jù)的傳輸。然而,傳感器節(jié)點(diǎn)微小,易受資源約束,因此建立能量高效的路由協(xié)議顯得十分必要。地理位置路由協(xié)議利用位置信息來(lái)避免數(shù)據(jù)的洪泛傳播,從而減少了路由開(kāi)銷。本文從能量均衡的角度出發(fā),提出基于雙閾值和夾角的改進(jìn)GPSR算法(IGPSR)和基于貪婪轉(zhuǎn)發(fā)和能量梯度的改進(jìn)GAF算法(IGAF)。從平面路由的角度,IGPSR算法利用雙閾值對(duì)節(jié)點(diǎn)的能量等級(jí)進(jìn)行劃分,讓處于低能量的節(jié)點(diǎn)只負(fù)責(zé)數(shù)據(jù)的收集。在路由建立的過(guò)程中,選擇能量較高且偏移角較小的節(jié)點(diǎn)作為下一跳;在數(shù)據(jù)傳輸?shù)倪^(guò)程中,啟動(dòng)能量保護(hù)策略,對(duì)路由上能量較低的節(jié)點(diǎn)進(jìn)行替換,從而保護(hù)低能量節(jié)點(diǎn)。仿真結(jié)果表明,與GPSR相比,IGPSR降低了網(wǎng)絡(luò)能耗,提高了網(wǎng)絡(luò)的生存周期。從層次路由的角度,IGAF算法采用優(yōu)化分簇和簇頭選舉的方法,降低網(wǎng)絡(luò)的能量損失。通過(guò)優(yōu)化分簇,簇頭之間可以采用貪婪轉(zhuǎn)發(fā)的方式進(jìn)行無(wú)線通信,減少簇頭與目的節(jié)點(diǎn)的傳輸距離;簇頭選舉時(shí),考慮節(jié)點(diǎn)的能量信息,提高高能量的節(jié)點(diǎn)選為簇頭的概率,減少低能量節(jié)點(diǎn)的能量消耗;并且當(dāng)簇頭的能量小于能量閾值時(shí),重新選舉簇頭。仿真結(jié)果表明,與GAF相比,IGAF均衡了網(wǎng)絡(luò)能耗,使網(wǎng)絡(luò)的生存周期得到了提高。
[Abstract]:Wireless sensor networks are composed of sensor nodes, which transmit data by routing between nodes. However, sensor nodes are small and vulnerable to resource constraints, so it is necessary to establish energy-efficient routing protocols. Geographical location routing protocol uses location information to avoid data flooding and thus reduces routing overhead. This paper presents an improved GPSR algorithm based on double thresholds and angles and an improved GAF algorithm based on greedy forwarding and energy gradient from the point of view of energy balance. From the point of view of planar routing, IGPSR classifies the energy level of nodes by using double thresholds, so that the nodes in low energy are only responsible for data collection. In the process of route establishment, the node with high energy and small offset angle is chosen as the next hop; in the process of data transmission, the energy protection strategy is initiated to replace the node with lower energy on the route, so as to protect the low energy node. The simulation results show that compared with GPSR, the network energy consumption is reduced and the lifetime of the network is improved. From the point of view of hierarchical routing, the IGAF algorithm adopts the method of optimizing clustering and cluster head election to reduce the energy loss of the network. By optimizing clustering, the wireless communication between cluster heads can be carried out by greedy forwarding, and the transmission distance between cluster heads and destination nodes can be reduced. When cluster heads are elected, the energy information of nodes is considered to improve the probability of high energy nodes being selected as cluster heads. The energy consumption of the low energy node is reduced, and when the energy of the cluster head is less than the energy threshold, the cluster head is re-elected. The simulation results show that compared with GAF, the network energy consumption is balanced and the lifetime of the network is improved.
【學(xué)位授予單位】:長(zhǎng)春理工大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2017
【分類號(hào)】:TP212.9;TN929.5
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 梁青;李卓冉;曹曉民;熊偉;;無(wú)線傳感器網(wǎng)絡(luò)基于相交圓結(jié)構(gòu)的改進(jìn)GAF算法[J];計(jì)算機(jī)工程與設(shè)計(jì);2014年12期
2 安子強(qiáng);;模糊強(qiáng)化學(xué)習(xí)的改進(jìn)GEAR傳感網(wǎng)絡(luò)均衡算法[J];計(jì)算機(jī)仿真;2013年06期
3 錢志鴻;王義君;;面向物聯(lián)網(wǎng)的無(wú)線傳感器網(wǎng)絡(luò)綜述[J];電子與信息學(xué)報(bào);2013年01期
4 唐冰清;張玲華;;GEAR協(xié)議中貪婪算法及查詢消息傳播優(yōu)化方法[J];計(jì)算機(jī)技術(shù)與發(fā)展;2013年01期
5 陳祖爵;歐陽(yáng)燁龍;;一種層次蜂窩結(jié)構(gòu)的負(fù)載均衡GAF算法[J];計(jì)算機(jī)工程;2012年03期
6 何艷麗;;無(wú)線傳感器網(wǎng)絡(luò)質(zhì)心定位算法研究[J];計(jì)算機(jī)仿真;2011年05期
7 陳正宇;楊庚;陳蕾;許建;;無(wú)線傳感器網(wǎng)絡(luò)數(shù)據(jù)融合研究綜述[J];計(jì)算機(jī)應(yīng)用研究;2011年05期
8 蔣陽(yáng);孫柳林;袁敏;陳碧云;;一種解決GEAR路由空洞問(wèn)題的新方案[J];傳感器與微系統(tǒng);2011年04期
9 鄭晨;王玫;;一種基于RSSI的幾何位置定位新算法[J];電子器件;2010年03期
10 趙強(qiáng)利;蔣艷凰;徐明;;無(wú)線傳感器網(wǎng)絡(luò)路由協(xié)議的分析與比較[J];計(jì)算機(jī)科學(xué);2009年02期
相關(guān)博士學(xué)位論文 前1條
1 王麗娟;基于地理位置的貪婪周邊無(wú)狀態(tài)路由算法理論及應(yīng)用研究[D];太原理工大學(xué);2013年
,本文編號(hào):1883127
本文鏈接:http://sikaile.net/kejilunwen/zidonghuakongzhilunwen/1883127.html