基于地理位置信息的移动自组织网路由算法研究
发布时间：2018-11-23 09:49
【摘要】：移动自组织网(Mobile Ad hoc Network,MANET)具有拓扑动态性、带宽受限等特点,其中良好的路由协议是构建移动自组织网的首要问题,也是研究的热点和难点。由于移动自组织网拓扑结构具有动态变化的特点,传统的基于拓扑结构的路由协议并不能取得理想的路由性能。随着定位技术的发展和定位精度的提高,基于地理位置信息的路由协议逐渐成为了移动自组织网路由协议的主流研究方向。本文分别从基于拓扑结构和地理位置信息两方面研究移动自组织网路由协议,重点对典型的地理位置路由贪婪周边无状态路由(Greedy Perimeter Stateless Routing,GPSR)算法进行深入研究,主要内容包括:(1).针对贪婪转发易出现边界效应和最佳主机问题,在考虑距离因素的基础上,补充考虑了角度因素和邻居节点个数,最后根据各邻居节点的判决度量值选取最优下一跳节点。具体来说,在进行路径选择时,优先选择偏转角度较小的节点,进而减小出现边界效应的概率;选择邻居节点较多的节点以尽可能避免路由空洞。当贪婪转发失败转为周边转发时,针对周边转发的路径最优化问题,本文综合角度、邻居节点个数及剩余能量来计算备选节点的判决度量值,并根据所得度量值选择最优的下一跳节点。其中,优先选择能量较高的节点,可有效避免因节点能量耗尽导致路由空洞进一步扩大。仿真结果表明,改进的算法在包投递率、平均端到端时延、控制开销比方面均有明显地性能改善。(2).针对GPSR算法采用固定周期信标(Periodic Beaconing,PB)策略易产生通信暂盲现象这一问题,本文引入了一种基于模糊逻辑的动态信标(Fuzzy Logic based Dynamic Beaconing,FLDB)策略加以改善,该策略以节点移动速度、邻居节点个数和节点剩余能量作为评价因素,利用模糊逻辑控制机制确定信标周期,从而提高邻居节点表构建与维护地实时性与准确性,为数据转发提供可靠依据。仿真结果表明,与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的多路径优化路由算法[J];电子技术;2012年11期
4 李道全;刘海燕;曹齐光;王怀彩;;基于地理位置的路由算法——GPSR-AD[J];计算机应用;2009年12期
5 张衡阳;李莹莹;刘云辉;;移动无线传感器网络自适应信标交换算法[J];软件学报;2008年11期
相关硕士学位论文 前1条
1 赵海燕;Ad Hoc网络中QoS保障的路由算法研究[D];山东师范大学;2008年
，本文编号：2351137
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2351137.html
