一种Ad Hoc网络的多路径路由算法

针对移动Ad Hoc网络,研究了一种多路径的路由算法。该算法是在AODV算法基础上建立起来的,有效地利用了AODV算法中中间节点接收到的重复的RREP建立起多路径的路由,其优点是当一条链路失败时,节点可以从后备链路中选取一条而不会影响到其他的链路通信。并且当路由发生断裂后,该算法可以尽可能地进行本地修复,以保证多路径的数据通信。仿真结果表明建议的路由算法在路由延迟等方面比现有的AODV路由算法有更好的性能。     

一种能量感知的Ad Hoc网络路由协议

Ad Hoc网络中的节点是由电池供电,整个网络是一个能量受限系统,如何节省节点的能量,尽可能延长网络的可操控时间逐渐成为衡量路由协议性能的重要指标.基于移动节点能量的不同级别,采取不同的转发策略,提出了一种基于能量感知的Ad Hoc网络路由协议--EARP.并与AODV协议进行了性能比较,仿真结果显示,EARP具有较低的能耗,较长的网络存活时间.     

An On-Demand Routing Protocol with Backtracking for Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is characterized by multi-hop wireless links and frequent node mobility. Communication between non-neighboring nodes requires a multi-hop routing protocol to establish a route. But, the route often breaks due to mobility. The source must rediscover a new route for delivering the data packets. This wastes the resources that are limited in MANET. In this paper, a new on-demand routing protocol is proposed, named on-demand routing protocol with backtracking (ORB), for multi-hop mobile ad hoc networks. We use the multiple routes and cache data technique to reduce the rediscovery times and overhead. After executing the route discovery phase, we find out a set of nodes, named checkpoint, which has the multiple routes to the destination. When a checkpoint node receives a data packet, it caches this data packet in its buffer within a specific time period. When a node detects a broken route during the data packets delivery or receives an error packet, it will either recover the broken route or reply the error packet to the source. If a node can not forward the data packet to the next node, it replies an error packet to the source. This packet is backtracking to search a checkpoint to redeliver the data packet to the destination along other alternate routes. The main advantage of ORB is to reduce the flooding search times, maybe just delay and cost while a route has broken. The experimental results show that the proposed scheme can increase the performance of delivery but reduce the overhead efficiently comparing with that of AODV based routing protocols. Hua-Wen Tsai received the B.S. degree in Information Management from Chang Jung Christian University, Taiwan, in June 1998 and the M.B.A. degree in Business and Operations Management from Chang Jung Christian University, Taiwan, in June 2001. Since September 2001, he has been working towards the Ph.D. degree and currently is a doctoral candidate in the Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan. His research interests include wireless communication, ad hoc networks, and sensor networks. Tzung-Shi Chen received the B.S. degree in Computer Science and Information Engineering from Tamkang University, Taiwan, in June 1989 and the Ph.D. degree in Computer Science and Information Engineering from National Central University, Taiwan, in June 1994. He joined the faculty of the Department of Information Management, Chung Jung University, Tainan, Taiwan, as an Associate Professor in June 1996. Since November 2002, he has become a Full Professor at the Department of Information Management, Chung Jung University, Tainan, Taiwan. He was a visiting scholar at the Department of Computer Science, University of Illinois at Urbana-Champaign, USA, from June to September 2001. He was the chairman of the Department of Information Management at Chung Jung University from August 2000 to July 2003. Since August 2004, he has become a Full Professor at the Department of Information and Learning Technology, National University of Tainan, Tainan, Taiwan. Currently, he is the chairman of the Department of Information and Learning Technology, National University of Tainan. He co-received the best paper award of 2001 IEEE ICOIN-15. His current research interests include mobile computing and wireless networks, mobile learning, data mining, and pervasive computing. Dr. Chen is a member of the IEEE Computer Society. Chih-Ping Chu received the B.S. degree in agricultural chemistry from National Chung Hsing University, Taiwan, the M.S. degree in computer science from the University of California, Riverside, and the Ph.D. degree in computer science from Louisiana State University. He is currently a Professor in the Department of Computer Science and Information Engineering of National Cheng Kung University, Taiwan. His current research interests include parallel computing, parallel processing, component-based software development, and internet computing.     

AMRoute: Ad Hoc Multicast Routing Protocol

The Ad hoc Multicast Routing protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad hoc networks by exploiting user-multicast trees and dynamic logical cores. It creates a bidirectional, shared tree for data distribution using only group senders and receivers as tree nodes. Unicast tunnels are used as tree links to connect neighbors on the user-multicast tree. Thus, AMRoute does not need to be supported by network nodes that are not interested/capable of multicast, and group state cost is incurred only by group senders and receivers. Also, the use of tunnels as tree links implies that tree structure does not need to change even in case of a dynamic network topology, which reduces the signaling traffic and packet loss. Thus AMRoute does not need to track network dynamics; the underlying unicast protocol is solely responsible for this function. AMRoute does not require a specific unicast routing protocol; therefore, it can operate seamlessly over separate domains with different unicast protocols. Certain tree nodes are designated by AMRoute as logical cores, and are responsible for initiating and managing the signaling component of AMRoute, such as detection of group members and tree setup. Logical cores differ significantly from those in CBT and PIM-SM, since they are not a central point for data distribution and can migrate dynamically among member nodes. Simulation results (using ns-2) demonstrate that AMRoute signaling traffic remains at relatively low level for typical group sizes. The results also indicate that group members receive a high proportion of data multicast by senders, even in the case of a highly dynamic network.     

一种节省能量的移动Ad Hoc网络组播选路协议

鉴于现有基于网孔的移动Ad Hoc网络组播选路协议都滑考虑如何有效使用电池能量的问题，本文提出了一种节省能量组播选路协议（E^2MRP),E^2MRP协议的两个主要特征是：（1）在创建和维护中继组（RG）的过程中交替采用分组平均能量消耗最少和最大节点花费最小两种标准，（2）采用基于图的组播结构，本文通过仿真分析大大降低了节点的能量消耗，特别是在节移动性较低，组播成员较少时更是如此。     

Ad hoc网络中的路由技术

Ad hoc网络是一些移动节点组成一个多跳的临时性无线自治系统，这种新型的通信网络具有动态变化的拓扑结构和分布控制的网络机制。文中针对Ad hoc网络作了简单的介绍并重点介绍了针对Ad hoc网络特性而提出的路由协议。     

Scalable Routing Protocol for Ad Hoc Networks

In this paper we present a scalable routing protocol for ad hoc networks. The protocol is based on a geographic location management strategy that keeps the overhead of routing packets relatively small. Nodes are assigned home regions and all nodes within a home region know the approximate location of the registered nodes. As nodes travel, they send location update messages to their home regions and this information is used to route data packets. In this paper, we derive theoretical performance results for the protocol and prove that the control packet overhead scales linearly with node speed and as N ^3/2 with increasing number of nodes. These results indicate that our protocol is well suited to relatively large ad hoc networks where nodes travel at high speed. Finally, we use simulations to validate our analytical model.     

无线Ad Hoc网络支持QoS的路由协议研究

当前,Ad Hoc网络传输多媒体业务需求提出了服务质量（QoS）的要求。由于Ad Hoc网络本身具有分布式控制、无线信道容量受限以及节点、链路和网络拓扑状态不断变化等特点,使其相对于固定无线网络及有线网络提供有保证且稳定的QoS要困难得多。文章总结了当前DSR协议的QoS研究进展,对不同的改进方案加以分类比较,指出了存在的问题：并针对hdHoc网络中基于资源预留的QoS算法所带来的复杂度问题,提出了适合该网络的测量可用带宽算法,构造了一种支持实时业务的Ad Hoc网络QoS服务机制。     

一种能量有效的多径Ad Hoc网路由算法

这里研究了一种能满足服务质量(QoS,Quality of Service)需求的能量有效的多路径多速率路由算法EAMM,该算法能结合节点地理位置、延迟时间、丢包率和剩余能量信息,选择符合要求的若干条路径,满足数据传输的可靠性和实时性要求,为不同应用的数据提供不同等级的可靠性和实时性传输质量。仿真结果显示,该算法不仅能保证各等级可靠性和实时性的数据传输,还能均衡网络的能量消耗,延长了网络的生存时间。     

高效率的小规模Ad Hoc组播路由协议

Ad Hoc网络中,组播路由协议具有广泛的应用前景。但由于网络拓扑的变化和节点能量的限制,设计具有高效传输能力的组播路由协议比较困难。通过综合比较表驱动路由协议与按需路由协议的优缺点,并且考虑Ad Hoc网络中节点的移动性以及路由发现与路由维护的方法对传输效率的影响,在无状态组播路由的基础上,使用表驱动与按需路由驱动相结合的路由方法,提出一种新的组播路由协议,使传输效率有较高的提升。     

高动态Ad Hoc路由协议性能分析

Ad Hoc网络是一种没有固定设施的无线移动自组织网络,动态变化的拓扑结构对路由协议的性能有着重要影响。研究了动态源路由(DSR)协议、Ad Hoc按需距离矢量(AODV)路由协议和最优链路状态路由(OLSR)协议3种传统路由协议,利用OPNET软件作为仿真工具,设计了2种不同网络规模条件下空中飞行平台网络拓扑结构背景的高动态仿真方案,通过比较网络时延、归一化网络吞吐量、路由负载和数据传送成功率,分析了它们的性能。仿真结果表明,OLSR协议的综合性能优于其它协议,更适合于节点高速移动且网络拓扑结构频繁变化的Ad hoc网络,并为下一步研究打下基础。     

移动自组网的CARPs协议分析

移动自组网备受关注的同时也暴露了其在某些方面的局限性,尤其是能量、带宽问题,因此有必要设计最佳路由协议来减少能量消耗、缩短路由、限制泛播,介绍了2种自适应的、无链接的路由协议及其子系统。当采用定向天线时,该协议能减少在分组传送过程中涉及的节点数量,因此减少了能量消耗,充分利用带宽。     

Dynamic Relationship-Zone Routing Protocol for Ad Hoc Networks

A new dynamic relationship-zone routing protocol (DRZRP) for ad hoc networks is proposed. In this protocol, each node in the network establishes a neighboring-zone with a radius of ρ hops, and activates a relationship-zone according to the service request frequency and service hotspot condition. DRZRP establishes proactive routing for neighboring-zone and relationship-zone of the node, and the relationship-zone of the node can be dynamically maintained, including: initialization, relationship-zone activation, and relationship-zone inactivation. The simulation results are compared with LSR, ZRP and ZHLS protocols, and DRZRP greatly reduces the communication overhead of routing control messages and significantly improves the average delay of routing requests. The new protocol matches the service relationship among nodes in the network, and has comprehensive performance advantage in communication overhead and routing request delay, which improves the quality of network service.

     

一种适用于战术条件下的自组织网路由协议

应用于战术条件下的自组织网络,其拓扑具有长期稳定而短期突变的特性;其流量具有不均衡性,中心节点的流量比重较大.针对战术无线网络的这种特性设计了一种混合式路由协议(HRP),协议为近端节点采用先应式协议维护路由而为远端节点采用反应式协议维护路由,对远端节点的路由请求采用OLSR协议的MPR思想,限制反应式协议的路由开销.并且,在近端拓扑变化频度超过门限值后,发起针对繁忙节点的路由发现请求,保持到繁忙节点的路由常新,从而提高了路由命中率.仿真结果表明,应用HRP协议后,无论其选路质量还是应用层业务的时延和吞吐量指标都优于DSR和ZRP协议.     

一种新型的Ad hoc QoS多播路由协议

无线自组织（Ad hoc）网络的应用环境要求其必须提供一定的服务质量（QoS）保证，然而，无线信道固有的特点及节点移动造成网络拓扑的频繁变化，使得在无线Ad hoc网络中支持QoS较困难。可以采用Ad hoc QoS多播（AQM）协议通过事先预约邻居节点以跟踪资源的有效性等措施来解决这一问题。通过考虑传输时延、丢失率、带宽要求、时延抖动、吞吐量等QoS指标，寻找满足特定QoS要求的路由，AQM协议可以明显地改善多播通信的性能。网络仿真结果表明AQM协议基本适合Adhoc网络。     

移动Ad Hoc网络安全按需路由协议

Ad Hoc网络的安全性问题越来越引起人们的关注,如何确保Ad Hoc网络路由协议的安全成为Ad Hoc研究的一项关键技术。提出一种适用于移动Ad Hoc网络的安全按需源路由协议,利用移动节点之间的会话密钥和基于散列函数的消息鉴别码HMAC一起来验证路由发现和路由应答的有效性。提出的邻居节点维护机制通过把MAC地址和每个节点的ID绑定来防御各种复杂的攻击如虫洞攻击。NS-2仿真表明该协议能有效地探测和阻止针对Ad Hoc网络的大部分攻击。     

An Adaptive Secure and Efficient Routing Protocol for Mobile Ad Hoc Networks

The rapidly emerging wireless service requirements and deployment demands over last few decades necessitates the application of Mobile Ad hoc Networks in many areas. These application areas vary from social networks to safety-critical domains such as environmental monitoring, disaster rescue operations, military communications, etc. The potency of the ad hoc network deployment in a specific context is significantly affected by the underlying routing protocol. Hence, developing an efficient and secure routing protocol for MANETs is an important task in order to achieve the service level requirements and to satisfy the deployment demands effectively. However, development of such routing protocol is a challenging problem due to the inherent characteristics of ad hoc networks: frequent topology changes, open wireless medium, and limited resource constraints, etc. In addition, the stringent requirements: mobility, performance, security, trust and timing constraints, etc. add complexity to this problem. In this paper, we present an adaptive routing protocol for MANETs, which dynamically configures the routing function with respect to the metrics: (1) the varying requirement parameters and (2) the contextual features as per the desired application context. The requirement models include various performance, security, and functional parameters. On the other hand, the contextual features include mobility of nodes/groups of nodes, nodes’ trust values, resource constraints of nodes, geographical context, roles of individual nodes etc. Our routing protocol is evaluated with extensive simulation test cases and the efficacy of the protocol is reported.

     

一种快速收敛的基于距离矢量的自组织网路由协议

本文提出了一种新的快速收敛的基于距离矢量(DV)的路由协议.该协议是在MIL-STD-188-220C路由协议的基础上,结合DSDV的优点,并提出了局部拓扑变化感知、全局拓扑变化感知等思想,加快了拓扑变化的收敛过程,提高了应用层分组传榆率.通过仿真分析对比表明,改进后的整体性能优于DSDV,使之更适合应用于快速移动的无线自组织网络中.     

链路稳定的AdHoc网络组播路由协议

Ad Hoc网络中,组播路由协议具有广泛的应用前景.但由于网络拓扑的变化,设计具有可靠数据传输能力的组播路由协议比较困难.综合考虑Ad Hoc网络中节点的移动性和节点能量对路由稳定性的影响,选取具有较高性能的链路,使得路由具有较好的稳定性.仿真结果证明,与MAODV协议相比,设计的路由协议明显提高了数据投递率,并大大降低了丢包数.     

Ad Hoc网络中一种动态负载感知路由协议

介绍了基于负载均衡的动态负载感知路由协议(DLLMR)的工作过程,DLLMR协议对DSR协议进行了3个方面的改进:①避免了负载较重的路径上继续增加业务量;②均匀地分配网络中的业务流;③减小了由于重新发起路由发现过程带来的开销和时延。最后介绍了以负载、时延为尺度的路径优劣判定准则。