基于地理位置信息的移動自組織網路由算法研究
發(fā)布時間：2018-11-23 09:49
【摘要】：移動自組織網(Mobile Ad hoc Network,MANET)具有拓撲動態(tài)性、帶寬受限等特點,其中良好的路由協(xié)議是構建移動自組織網的首要問題,也是研究的熱點和難點。由于移動自組織網拓撲結構具有動態(tài)變化的特點,傳統(tǒng)的基于拓撲結構的路由協(xié)議并不能取得理想的路由性能。隨著定位技術的發(fā)展和定位精度的提高,基于地理位置信息的路由協(xié)議逐漸成為了移動自組織網路由協(xié)議的主流研究方向。本文分別從基于拓撲結構和地理位置信息兩方面研究移動自組織網路由協(xié)議,重點對典型的地理位置路由貪婪周邊無狀態(tài)路由(Greedy Perimeter Stateless Routing,GPSR)算法進行深入研究,主要內容包括:(1).針對貪婪轉發(fā)易出現邊界效應和最佳主機問題,在考慮距離因素的基礎上,補充考慮了角度因素和鄰居節(jié)點個數,最后根據各鄰居節(jié)點的判決度量值選取最優(yōu)下一跳節(jié)點。具體來說,在進行路徑選擇時,優(yōu)先選擇偏轉角度較小的節(jié)點,進而減小出現邊界效應的概率;選擇鄰居節(jié)點較多的節(jié)點以盡可能避免路由空洞。當貪婪轉發(fā)失敗轉為周邊轉發(fā)時,針對周邊轉發(fā)的路徑最優(yōu)化問題,本文綜合角度、鄰居節(jié)點個數及剩余能量來計算備選節(jié)點的判決度量值,并根據所得度量值選擇最優(yōu)的下一跳節(jié)點。其中,優(yōu)先選擇能量較高的節(jié)點,可有效避免因節(jié)點能量耗盡導致路由空洞進一步擴大。仿真結果表明,改進的算法在包投遞率、平均端到端時延、控制開銷比方面均有明顯地性能改善。(2).針對GPSR算法采用固定周期信標(Periodic Beaconing,PB)策略易產生通信暫盲現象這一問題,本文引入了一種基于模糊邏輯的動態(tài)信標(Fuzzy Logic based Dynamic Beaconing,FLDB)策略加以改善,該策略以節(jié)點移動速度、鄰居節(jié)點個數和節(jié)點剩余能量作為評價因素,利用模糊邏輯控制機制確定信標周期,從而提高鄰居節(jié)點表構建與維護地實時性與準確性,為數據轉發(fā)提供可靠依據。仿真結果表明,與PB策略相比,FLDB策略有效地減少了通信暫盲現象,引入FLDB策略后GPSR算法在包投遞率、控制開銷比、平均端到端時延性能上均有明顯地改善。
[Abstract]:Mobile ad hoc network (Mobile Ad hoc Network,MANET) has the characteristics of topology dynamics and bandwidth limitation, among which good routing protocol is the most important problem in the construction of mobile ad hoc networks, and it is also a hot and difficult point in the research. Due to the dynamic characteristics of mobile ad hoc network topology, traditional routing protocols based on topology can not achieve ideal routing performance. With the development of location technology and the improvement of location accuracy, the routing protocol based on geographical location information has gradually become the mainstream research direction of mobile ad hoc network routing protocols. In this paper, based on topology and geographic location information, the routing protocols of mobile ad hoc networks are studied, and the typical greedy stateless routing (Greedy Perimeter Stateless Routing,GPSR) algorithm of geographical location routing is studied in detail. The main contents include: (1). Aiming at the problem that greedy forwarding is prone to the boundary effect and the optimal host the angle factor and the number of neighbor nodes are taken into account on the basis of the distance factor. Finally the optimal next hop node is selected according to the judgment measure of each neighbor node. Specifically, in path selection, the node with a smaller deflection angle is preferred to reduce the probability of boundary effect, and nodes with more neighbor nodes are selected to avoid routing holes as much as possible. When greedy forwarding fails to be transferred to peripheral forwarding, the decision metric of alternative nodes is calculated by synthesizing the number of neighbor nodes and residual energy in view of the path optimization problem of peripheral forwarding. The optimal next hop node is selected according to the measured value. Among them, the nodes with higher energy can be selected first, which can effectively avoid the further expansion of the routing holes caused by the node energy depletion. Simulation results show that the performance of the improved algorithm is significantly improved in terms of packet delivery rate, average end-to-end delay and control overhead ratio. (2). In order to solve the problem that fixed period beacon (Periodic Beaconing,PB) strategy in GPSR algorithm is easy to cause transient blind communication, this paper introduces a dynamic beacon (Fuzzy Logic based Dynamic Beaconing,FLDB strategy based on fuzzy logic to improve it. In this strategy, the moving speed of nodes, the number of neighbor nodes and the residual energy of nodes are taken as evaluation factors, and the beacon period is determined by using fuzzy logic control mechanism to improve the real-time and accuracy of neighbor node table construction and maintenance. It provides reliable basis for data forwarding. The simulation results show that compared with the PB strategy, the FLDB strategy can effectively reduce the transient blind phenomenon of communication. The GPSR algorithm with the FLDB strategy has significant improvement in packet delivery rate, control overhead ratio and average end-to-end delay performance.
【學位授予單位】：西安電子科技大學
【學位級別】：碩士
【學位授予年份】：2016
【分類號】：TN929.5
本文編號：2351137
[Abstract]:Mobile ad hoc network (Mobile Ad hoc Network,MANET) has the characteristics of topology dynamics and bandwidth limitation, among which good routing protocol is the most important problem in the construction of mobile ad hoc networks, and it is also a hot and difficult point in the research. Due to the dynamic characteristics of mobile ad hoc network topology, traditional routing protocols based on topology can not achieve ideal routing performance. With the development of location technology and the improvement of location accuracy, the routing protocol based on geographical location information has gradually become the mainstream research direction of mobile ad hoc network routing protocols. In this paper, based on topology and geographic location information, the routing protocols of mobile ad hoc networks are studied, and the typical greedy stateless routing (Greedy Perimeter Stateless Routing,GPSR) algorithm of geographical location routing is studied in detail. The main contents include: (1). Aiming at the problem that greedy forwarding is prone to the boundary effect and the optimal host the angle factor and the number of neighbor nodes are taken into account on the basis of the distance factor. Finally the optimal next hop node is selected according to the judgment measure of each neighbor node. Specifically, in path selection, the node with a smaller deflection angle is preferred to reduce the probability of boundary effect, and nodes with more neighbor nodes are selected to avoid routing holes as much as possible. When greedy forwarding fails to be transferred to peripheral forwarding, the decision metric of alternative nodes is calculated by synthesizing the number of neighbor nodes and residual energy in view of the path optimization problem of peripheral forwarding. The optimal next hop node is selected according to the measured value. Among them, the nodes with higher energy can be selected first, which can effectively avoid the further expansion of the routing holes caused by the node energy depletion. Simulation results show that the performance of the improved algorithm is significantly improved in terms of packet delivery rate, average end-to-end delay and control overhead ratio. (2). In order to solve the problem that fixed period beacon (Periodic Beaconing,PB) strategy in GPSR algorithm is easy to cause transient blind communication, this paper introduces a dynamic beacon (Fuzzy Logic based Dynamic Beaconing,FLDB strategy based on fuzzy logic to improve it. In this strategy, the moving speed of nodes, the number of neighbor nodes and the residual energy of nodes are taken as evaluation factors, and the beacon period is determined by using fuzzy logic control mechanism to improve the real-time and accuracy of neighbor node table construction and maintenance. It provides reliable basis for data forwarding. The simulation results show that compared with the PB strategy, the FLDB strategy can effectively reduce the transient blind phenomenon of communication. The GPSR algorithm with the FLDB strategy has significant improvement in packet delivery rate, control overhead ratio and average end-to-end delay performance.
【學位授予單位】：西安電子科技大學
【學位級別】：碩士
【學位授予年份】：2016
【分類號】：TN929.5
【參考文獻】
相關期刊論文 前5條
1 劉大濵;黎曉波;胡建軍;胡松;;機動突擊中的自組網多路徑路由技術[J];電訊技術;2013年09期
2 楊勇;李季碧;陳紅;任智;;基于位置信息的機會網絡高效路由算法[J];廣東通信技術;2013年03期
3 王勇智;譚用秋;石炎生;丁卓平;;一種基于MANET的多路徑優(yōu)化路由算法[J];電子技術;2012年11期
4 李道全;劉海燕;曹齊光;王懷彩;;基于地理位置的路由算法——GPSR-AD[J];計算機應用;2009年12期
5 張衡陽;李瑩瑩;劉云輝;;移動無線傳感器網絡自適應信標交換算法[J];軟件學報;2008年11期
相關碩士學位論文 前1條
1 趙海燕;Ad Hoc網絡中QoS保障的路由算法研究[D];山東師范大學;2008年
，本文編號：2351137
本文鏈接：http://sikaile.net/kejilunwen/xinxigongchenglunwen/2351137.html
