节点文献
移动自组网路由协议研究
Mobile Ad Hoc Network Routing Protocols
【作者】 韩露;
【导师】 周曼丽;
【作者基本信息】 华中科技大学 , 通信与信息系统, 2006, 博士
【摘要】 在移动自组网中,每一节点同时充当路由器的角色,负责为其它节点前传数据报文。所有的节点以协作的方式工作,完成指定的任务。这种网络体系代表了网络计算发展的方向,也正广泛地应用在军事、交通、教育等诸多领域。但是,开放的网络体系、共享的无线媒质、受限的资源以及动态的网络拓扑等新特性的引入,使得传统网络的路由协议不再适用于移动自组网路由问题。本文围绕移动自组网路由协议这一中心问题,试图从智能路由、空间信息路由、非合作路由和安全路由等几个角度阐述该问题的解决思路及实现过程,取得了一些有意义的结果。首先,本文介绍了移动自组网路由协议的评价尺度,定义了网络环境参数,对现有的移动自组网路由协议作了分类和总结,并在此基础上详细剖析了三种有代表性的移动自组网路由协议:DSR、Terminode Routing和GPSR,比较了它们的性能指标。其次,结合移动主体技术,本文从规划的角度重新定义了移动自组网路由问题,建立了描述实体的移动主体模型,并在基于群智能的移动自组网路由算法上做了一些具体的尝试,改进了AntNet算法。针对汽车自组网这一应用场景,本文分析了汽车自组网的特点及其对路由协议的影响,引入了空间模型,介绍了空间模型的建立及存储过程,提出了分别针对规避网络中存在的固定的或者暂时的拓扑洞的两种基于空间信息的路由协议。仿真实验结果表明新的路由协议可以有效地改善拓扑洞存在时的路由性能。在考虑节点由于受到能量、带宽等资源的限制从而表现出的“利己性”时,非合作博弈模型被用以描述移动节点的行为。在证明了非合作博弈模型的Nash均衡点与移动自组网有效路由之间的对应关系后,讨论了激励合作的条件,采用了基于有限理性的演化博弈方法求解模型的满意解,实现了非合作路由协议框架。移动自组网的特性决定了它在安全问题上的困境。本文简要介绍了移动自组网面临的安全风险以及现有的安全措施的研究进展,提出并分析了对实体的层化体系的混合保护策略,以及提出了路由层协作安全策略并结合SAR协议实现了安全路由框架。最后,对全文的工作进行了总结,并指出了今后需要进一步研究和探索的问题与方向。
【Abstract】 In a mobile ad hoc networks (MANET), each node also acts as router, forwarding data packets for other nodes. All the nodes run in a cooperative manner in order to complete a specified task. This kind of network architecture represents development course of network computing, thus applying in the comprehensive fields such as military, traffic, education.On the other hand, the unique characteristics of MANET present a new set of nontrivial challenges to network routing design, including open network architecture, shared wireless medium, stringent resource constraints, and highly dynamic network topology. Consequently, the traditional routing protocols do not fit for MANET domain any longer. This dissertation focused on the problems of MANET routing protocols, presented several novel opinions and solutions from the views of intelligent routing, spatially awareness routing, non-cooperative routing and secure routing, and gained creative achievement.Firstly, the thesis introduced the evaluation metrics of MANET routing protocols, defined network evironmental parameters, and presented a though survey on existing MANET routing protocols. Three typical protocols were discussed in detail and compared, which were DSR, Terminode Routing and GPSR.Secondly, Combining with mobile agent technology, the thesis defined MANET routing course in the form of a planning problem. An agent model describing network entities was set up. Swarm intelligence technology was applied to solve MANET routing problem and AntNet alogrithm was improved.Given a scenario of Vehicle Ad hoc Network(VANET), the thesis analyzed the characteristics of VANET and their impacts on routing protocols, introduced spatial model, illustrated how to set up and store the spatial model, and presented two spacially awareness routing protocols to evade permanent or temporary topology holes respectively which frequently occured in the scenario. Simulation results show new routing protocols could achieve better performance in packet delivery ratio.Nodes behave egoistic due to limited resource. Non-cooperative game was used to describe nodes’behavior in the dissertation. After proving corresponding relationship between nash equilibrium points of game and effective MANET routes, conditions of stimulating cooperation were discussed. Evolutionary game based on bounded rationality was used to achieve satisfied solution of the model. A framework of non-cooperative routing was realized.The unique characteristics of MANET destine its difficulty in secure routing. The thesis presented a brief introduction on security risk and research progress, gave and analyzed a layered hybrid security stragety for protecting entities in MANET. A network-layer collabroative security mechanism was also brought forward and realized by combining with SAR alogrithm.At last, we review the entire work and suggest the direction for the furure research in this field.
【Key words】 Mobile ad hoc network; Routing protocol; Intelligent routing; Mobile agent; Spatial model; Non-cooperative game; Evolutionary game; Security strategy;