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.     

Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks

Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Such floods take up a substantial portion of network bandwidth. We focus on a particular on-demand protocol, called Dynamic Source Routing, and show how intelligent use of multipath techniques can reduce the frequency of query floods. We develop an analytic modeling framework to determine the relative frequency of query floods for various techniques. Our modeling effort shows that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths. It also shows that providing all intermediate nodes in the primary (shortest) route with alternative paths has a significantly better performance than providing only the source with alternate paths. We perform some simulation experiments which validate these findings.     

Ad hoc网络中的路由技术

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

Ad Hoc网络路由技术

无线自组织网络(Adhoc)是一个复杂的系统,其中路由协议是该领域中的研究热点。通过采用合理的路由技术,可使无线自组网具有更为灵活的组网方式,从而达到提升网络性能、减少网络开销等目的。通过与认知无线电(CR)技术、协同通信(CC)技术以及多输入多输出(MIMO)天线技术等物理层新技术的有效结合,可以大大改善Adhoc路由协议的性能。     

ABRP: Anchor-based Routing Protocol for Mobile Ad Hoc Networks

Ad hoc networks, which do not rely on any infrastructure such as access points or base stations, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. Ad hoc networks are attractive in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. As more and more wireless devices connect to the network, it is important to design a scalable routing protocol for ad hoc networks. In this paper, we present Anchor-based Routing Protocol (ABRP), a scalable routing protocol for ad hoc networks. It is a hybrid routing protocol, which combines the table-based routing strategy with the geographic routing strategy. However, GPS (Global Positioning System) (Kaplan, Understanding GPS principles and Applications, Boston: Artech House publishers, 1996) support is not needed. ABRP consists of a location-based clustering protocol, an intra-cell routing protocol and an inter-cell routing protocol. The location-based clustering protocol divides the network region into different cells. The intra-cell routing protocol routes packets within one cell. The inter-cell routing protocol is used to route packets between nodes in different cells. The combination of intra-cell and inter-cell routing protocol makes ABRP highly scalable, since each node needs to only maintain routes within a cell. The inter-cell routing protocol establishes multiple routes between different cells, which makes ABRP reliable and efficient. We evaluate the performance of ABRP using ns2 simulator. We simulated different size of networks from 200 nodes to 1600 nodes. Simulation results show that ABRP is efficient and scales well to large networks. ABRP combines the advantages of multi-path routing strategy and geographic routing strategy—efficiency and scalability, and avoids the burden—GPS support.     

基于QoS的Ad Hoc路由协议综述

Ad Hoc网络是由一组带有无线收发装置的移动终端组成的一个多跳的临时性自治系统。随着人们对通信业务要求的不断提高，对带宽、时延、误码率等性能参数提出了不同程度的保障要求，因此要求Ad Hoc网络能够为某些业务提供服务质量（QoS）保障。但由于Ad Hoc网络无线链路的时变特性、网络拓扑结构的动态变化、移动终端设备电池容量受限等特点，使其相对于固定无线网络及有线网络提供有保证且稳定的QoS保障要困难得多，非常具有挑战性。本文对目前几种基于带宽和时延约束的QoS路由协议进行了介绍。     

Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks

Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. We propose a technique that can reduce the routing overhead even further. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Our technique utilizes prior routing histories to localize the query flood to a limited region of the network. Simulation results demonstrate excellent reduction of routing overheads with this mechanism. This also contributes to a reduced level of network congestion and better end-to-end delay performance of data packets.     

无线自组网技术应用

针对Ad Hoc网络良好的灵活性和健壮性在介绍其基本结构和特点的基础上,说明了Ad Hoc网络的技术难点、解决方法并展望了发展前景。     

Ad Hoc网络中QoS技术研究

服务质量保障是Ad Hoc网络环境中的一个复杂的急需解决的问题。首先论述了Ad Hoc网络的网络协议模型、QoS服务模型、QoS路由以及QoS保障策略等方面的问题,然后对其进行了综合分析,在此基础上,给出了Ad Hoc网络中不同层次的QoS路由方案以及其未来的研究方向。     

基于定向天线的移动自组网路由协议研究

同等功耗下,定向天线能够产生更高的增益,提供更大的传输范围,提高网络的空间复用度和吞吐量,天线选择的方向性又降低了邻近结点之间的相互干扰,采用定向天线能够给移动自组网带来潜在性能的提高。对基于定向天线的移动自组网路由协议进行研究,简单介绍了定向天线,总结了引入定向天线产生的路由问题,对现有的一些典型定向路由协议进行了分类、介绍和比较,最后对引入定向天线带来的好处进行了分析。     

移动Ad Hoc网络的安全路由协议研究

ad hoc网络是一种新型的无线移动网络,因其独特的组网特性,使得安全问题成为其发展的最大束缚。路由协议的安全是自组网安全的一个重要部分。本文首先论述移动AdHoc网络中的安全问题,介绍了多种安全路由的协议和方案,并对其中的三种按需安全路由协议进行了比较,最后提出进一步研究AdHoc网络路由安全应注意的问题。     

Ad Hoc 网络中的路由技术

作为下一代网络的重要组成部分,Ad Hoc网是目前的一个重要研究热点。根据Ad Hoc网络的特点,总结了Ad Hoc网中的路由技术。从路由查找和维护的角度分析和归纳了网络中关于单播路由、组播路由和QoS路由等的技术特点,指出了不同协议及算法的设计思路和解决策略,为寻求和设计更为高效的适合自组网特点的新型路由技术奠定基础。     

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

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

能量感知和链路稳定度的多径MANET路由

在移动自组织网络中,相对于单路径路由算法而言,多路径路由算法可以均衡网络负载、提高路由的可靠性。通过对AOMDV路由协议进行改进,提出了基于能量感知和链路稳定度的多径MANET路由协议ELMRP。ELMRP协议综合考虑了节点的剩余能量和链路稳定度,根据路径的剩余能量和稳定度计算代价值,按照代价值在多条节点不相交路径上分配数据流量。仿真结果表明,和AOMDV路由协议相比,ELMRP协议延长了网络的生存时间,提高了数据分组递送率,降低了路由发现频度。     

Ad Hoc网络组播路由ODMRP协议的改进

ODMRP组播协议非常适合于带宽限制大、移动性强和节点能量受限的Ad hoc网络.为了进一步提高该协议的性能,文中提出一种新的技术来增强其功效.增强ODMRP的主要目标有:(1)改进节点移动模式的适应性;(2)消除路由获得时延.最后仿真结果显示该改进协议比原协议在数据分发率和网络有效性等性能方面有很大改善.     

Replication of Routing Tables for Mobility Management in Ad Hoc Networks

Ad Hoc networking is a rather old technology that is gaining new momentum in the research community. It is still an area under development and there are several proposals for the technology regarding routing protocols, addressing, interoperability, etc. Because of the extreme conditions where Ad Hoc networks should operate, it is envisioned that in medium to large scale networks, a hybrid proactive and reactive routing mechanism should be used. Therefore, considering the proactive routing protocols as the most suitable protocol for certain topologies in Ad Hoc networks, this paper proposes a specific layered structure to enable both technologies in a seamless manner. This approach supports both reactive (e.g., AODV, DSR) and proactive link state (e.g., OLSP) protocols. The proposed layered structure divides the routing problem into different parts, where one module performs the routing algorithm, another module takes care of replicating and synchronizing the routing tables, and a third one evaluates the routing information for triggering hand-over signals to the upper layers. The overall responsibility for selecting the appropriate routing schema and for initiating the roaming process resides on a proposed Context Sensitive Roaming Layer. This paper describes the interface and the functions implemented by the Roaming Layer. The paper also analyses replication using the Server Cache Synchronization Protocol (SCSP). Finally, the last part of the paper describes the demand for Ad Hoc networks, which is driven by applications supported with an appropriate billing or bonus mechanism.     

移动自组网模糊逻辑QoS动态源路由算法

该文提出了一种新的移动Ad hoc网络QoS路由算法：模糊逻辑QoS动态源路由算法。算法从模糊理论的思想出发,将业务的多个QoS参数进行综合评判产生一类以语言变量描述的请求,在修改动态源路由协议为多径路由算法的基础之上,对比各条路径综合模糊路由状态,选择出最适合业务请求的路径。仿真显示算法在支持QoS的同时对移动Ad hoc网络因拓扑动态变化而引起的信息不精确性有很好的适应度。     

移动Ad Hoc网络的一种跨层功率控制路由协议

移动ad hoe网络中通信终端能量有限,但在许多应用场景,尤其是战场环境下,节点能量消耗较大,因此采用有效的功率控制策略非常重要.利用信道增益的对称性,在AODV协议的基础上提出了一种不依赖于地理位置信息的跨层功率控制路由协议PBAODV,仿真表明该协议在不影响其他网络性能指标的前提下,有效的降低了系统整体功耗.     

Ad hoc技术

Ad　hoc技术是从无线移动Ad　hoc网络(WMANET)抽象出来的一个一般性概念，该项技术所标称的是自组识、多跳的一个临时分布式系统，是一种网络构架技术。它要面临多项难题。本文就是从OSI模型的角度把Ad　hoc技术分层介绍，最后给出了一种WMANET应用方案。     

Multi-Level Hierarchies for Scalable Ad hoc Routing

Ad hoc networks have the notable capability of enabling spontaneous networks. These networks are self-initializing, self-configuring, and self-maintaining, even though the underlying topology is often continually changing. Because research has only begun to scratch the surface of the potential applications of this technology, it is important to prepare for the widespread use of these networks. In anticipation of their ubiquity, the protocols designed for these networks must be scalable. This includes scaling to both networks with many nodes, and networks with rapidly changing topologies. This paper presents two hierarchical clustering protocols that improve the scalability of ad hoc routing protocols. The Adaptive Routing using Clusters (ARC) protocol creates a one-level clustered hierarchy across an ad hoc network, while the Adaptive Routing using Clustered Hierarchies (ARCH) protocol creates a multi-level hierarchy which is able to dynamically adjust the depth of the hierarchy in response to the changing network topology. It is experimentally shown that these protocols, when coupled with an ad hoc routing protocol, produce throughput improvements of up to 80% over the ad hoc routing protocol alone.