一种面向移动Ad Hoc网络DSR协议的改进泛洪算法

在移动自组织网络中,基于移动节点地理位置辅助信息,提出了一种新的泛洪算法——位置辅助泛洪改进算法（ILFA）,ILFA通过节点位置信息重传广播分组并有效控制网络流量。此外,将ILFA应用于经典MANET源路由（dynamic source routing,DSR）协议中,通过限定请求区域和期望区域等限制路由发现的有效范围,进而通过设置提名广播重传邻居列表限定路由请求分组重传范围,有效减小DSR路由寻路分组的传播次数。仿真结果证明,和传统泛洪方案相比,ILFA能够有效减小DSR路由协议的路由开销并提升MANET吞吐量。     

一种改进的基于能量优化的AODV路由协议

针对节点能量有限、消耗过快易导致网络分隔的问题,提出一种改进的基于能量优化的AODV路由协议(IEO-AODV)。以AODV路由协议为基础,通过综合考虑节点剩余能量和路由跳数进行路径选择,在路由过程中,中间节点在转发路由请求时进行一个与自身剩余能量有关延迟,在目的节点进行一个延迟记录,最后根据评估函数选取最优路由。仿真结果表明,与经典AODV相比,所改进的方案能均衡网络的能量消耗,在分组投递率、延长网络的生存时间等方面有较大的优势。     

自组网路由协议的仿真与性能研究

在Ad Hoc网络中,如何针对实际的应用选择一个最佳的路由协议是一个难点问题.分析DSDV,OLSR,DSR,TORA和AODV五种常用的Ad HOC路由协议,基于网络节点暂停时间及最大移动速度变化两种情况,设计了针对平均端到端时延、数据包分组传送率、路由开销和平均跳数四个指标的仿真实验.仿真结果表明:在相同的网络环境下,与其他四种协议相比,OLSR协议的平均时延、路由开销和平均跳数都较小,分组传送率也较高,性能最好.通过对五种协议性能指标的综合比较,提出了一个通用的路由选择方案.     

复杂网络环境下的DSR路由协议性能仿真

DSR是用于多跳无线Ad hoc网络的一个简单高效的路由协议,DSR协议由路由发现和路由维持两部分组成,允许节点在Ad hoc网络中发现、维持到任意节点的源路由.文章详细介绍了DSR协议的特点并利用Opnet Modeler 10.5构建了小规模(50节点)和大规模(100节点)复杂的(所有节点同时移动、所有节点既是源节点又是目的节点)移动自组网模型,通过改变节点移动速度及发送分组大小,对DSR路由算法的平均路由发现时间、平均路由长度、吞吐量、数据分组平均端到端的时延、及分组交付率在两种场景下进行了仿真分析和性能比较.     

AODV路由协议性能的改进研究

路由问题一直是移动Ad Hoc网络（MANET）研究中的难点和重要问题。按需路由协议是当前移动Ad Hoc网络的主流路由协议。丈中通过对AODV和DSR两种典型的按需路由协议的分析与比较，提出了一种利用DSR的路径收集机制来改进和提高AODV路由协议性能的方法。通过NS2仿真实验表明，该方法能有效减少路由请求的数量，从而降低路由的开销，提高分组发送的成功率，减少端对端的延时。     

基于拥塞程度和能量状态的DSR路由协议的改进

无线Ad Hoc网络是由一些无线主机所组成的具有多跳、临时性等特征的网络,这些无线主机还带有无线收发装置;每个无线终端具有路由器和主机两种功能.网络中所有的节点地位平等.无线Ad Hoc网络组网的无基础设施性和自组织性,使它在特定的救灾抢险、军事指挥作战、野外科学考察等特殊场合下得到了广泛的应用.DSR路由协议具有使用源路由机制和路由缓存技术,并且支持中间节点路由回复应答,减少了路由开销等优点.文中主要解决了DSR路由协议节点拥塞、负载不均以及在选择路径时没有考虑节点的能量等问题,经仿真分析比原DSR路由协议在节点的拥塞状态和能量状态方面得到较大的改善.     

基于节点特性的LR-WPAN网络能量优化路由算法

针对ZigBee网络混合路由算法的不足,考虑低速无线个域网(LR-WPAN)网络的能耗问题,提出了一种基于ZBR路由协议的改进算法(F-ZBR).本算法通过定义最小路由能量值和控制路由请求分组(RREQ)的传输方向、跳数以及在RREQ分组中加入能量标志位等措施,降低网络的整体能耗.仿真结果表明,F-ZBR算法的分组投递率、网络可用节点比率和网络剩余能量都较ZBR有明显提高,从而可以延缓ZigBee网络中大量数据传输造成的RN+节点能量过度损耗而导致的网络瘫痪等问题的发生,延长网络生命周期.     

基于DSR的改进型综合源路由协议

在无线Mesh网络中,动态源路由(Dynamic Source Routing,DSR)协议是一种广泛应用的协议,其路由的建立与维护都从源节点发起。然而,由于DSR协议在路由发现与建立的过程中存在局限性,因此仍需要进一步研究。基于DSR协议通过引入一种综合了路径负载率、时延和跳数的负载均衡机制,并加入能量状态监控和多径路由,提出了一种改进型综合源路由协议(Improved Comprehensive Multi-path Source Routing,ICMSR),能够更好地实现网络负载均衡,节约网络能源,提升网络性能。最后,使用Opnet仿真验证了算法的有效性。仿真结果表明,改进协议在网络生存时间、分组投递率、端到端时延和网络吞吐量等性能指标上,相较于现有DSR协议都有较大的提升。     

用于Ad Hoc网络的多径混合路由

移动Ad hoc网络是由一组移动节点组成的临时网络,它不需要事先建立的网络基础设施的支持。路由协议对网络性能起着决定性的作用。文中提出了一种基于多路径的Ad hoc网络混合路由策略（MPHR）。在MPHR中,边权值表示节点之间的链路可靠性。与传统的单路径路由策略不同,在一对源节点和目的节点间,使用多条路径来发送分组。仿真结果表明,MPHR的分组投递率远高于DSR路由协议,但路由开销略大于DSR。     

一种改进的无线自组网DSR路由协议

DSR路由协议中很多相邻节点的"路由应答"无法到达源节点,因此向这些节点广播"路由请求"产生了不必要的耗费.如果选择相对于源节点移动性较弱的相邻节点进行"路由请求",则可比较稳定地获得"路由应答".仿真结果显示,改进后的DSR(M-DSR)路由协议在路由发现时间、路由长度、路由错误、传播路由请求、路由应答等方面的性能较DSR路由协议有明显的改进.     

Integrating service discovery with routing and session management for ad-hoc networks

In this paper, we propose GSR: a new routing and session management protocol for ad-hoc networks as an integral part of a service discovery infrastructure. Traditional approaches place routing at a layer below service discovery. While this distinction is appropriate for wired networked services, we argue that in ad-hoc networks this layering is not as meaningful and show that integrating routing with discovery infrastructure increases system efficiency. Central to our protocol is the idea of reusing the path created by the combination of a service discovery request and a service advertisement for data transmission. This precludes the need to use separate routing and discovery protocols. GSR also combines transport layer features and provides end-to-end session management that detects disconnections, link and node failures and enables service-centric session redirection to handle failures. This enables GSR to accommodate service-centric routing apart from the traditional node-centric routing. We compare GSR with AODV in terms of packet delivery ratio, response time and average number of hops traveled by service requests as well as data. GSR achieves better packet delivery ratio with a minor increase of the average packet delivery delay.     

A self-healing On-demand Geographic Path Routing Protocol for mobile ad-hoc networks

We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherits the best of the three well-known techniques for routing in ad-hoc networks, viz., greedy forwarding, reactive route discovery, and source routing. In OGPR protocol, source nodes utilize the geographic-topology information obtained during the location request phase to establish geographic paths to their respective destinations. Geographic paths decouple node ID’s from the paths and are immune to changes in the network topology. Further, they help nodes avoid dead-ends due to greedy forwarding. To utilize geographic paths even in sparser networks, OGPR uses a path-healing mechanism that helps geographic paths adapt according to the network topology. We present extensions to OGPR protocol to cope with networks containing unidirectional links. Further, we present results from an extensive simulation study using GloMoSim. Simulation results show that OGPR achieves higher percentage packet delivery and lower control overhead, compared to a combination of GPSR+GLS protocols, AODV, and DSR under a wide range of network scenarios.     

Novel multi-path routing scheme for UWB Ad hoc network

1 Introduction Ad hoc networks and ultra-wideband communications technology are a key factor in the evolution of wireless communications. In ad hoc networks, wireless hosts can communications with each other in the absence of a fixed infrastructure. These networks typically consist of equal nodes that communication over wireless links without central control .The followings can be used to describe the ad hoc network[1]: ? Dynamic network topology ? Limited resource ? Multi-hop communication …     

A strategy to reduce the control packet load of MANETs with bidirectional links using DSR

Dynamic source routing (DSR) is a robust protocol commonly applied to multi‐hop wireless mobile ad hoc networks (MANETs). In this paper, an algorithm is proposed for modifying the basic DSR protocol to enhance its performance by reducing the number of redundant route reply packets (RREPs). In the modified DSR (MDSR), for a source destination pair, the destination responds to the first received route request packet (RREQ) with an RREP, and the subsequently received RREQs, bearing the same request ID, are responded to only if the hop count is less than that of all the previously received RREQs. The performance of MDSR has been compared with that of the basic DSR for different network densities and for different mobility of nodes. Simulation results show that MDSR gives fewer control packets, less latency and a higher packet delivery ratio than DSR. Copyright © 2007 John Wiley & Sons, Ltd.     

A gradient‐based multiple‐path routing protocol for low duty‐cycled wireless sensor networks

Routing in a low duty‐cycled wireless sensor network (WSN) has attracted much attention recently because of the challenge that low duty‐cycled sleep scheduling brings to the design of efficient distributed routing protocols for such networks. In a low duty‐cycled WSN, a big problem is how to design an efficient distributed routing protocol, which uses only local network state information while achieving low end‐to‐end (E2E) packet delivery delay and also high packet delivery efficiency. In this paper, we study low duty‐cycled WSNs wherein sensor nodes adopt pseudorandom sleep scheduling for energy saving. The objective of this paper is to design an efficient distributed routing protocol with low overhead. For this purpose, we design a simple but efficient hop‐by‐hop routing protocol, which integrates the ideas of multipath routing and gradient‐based routing for improved routing performance. We conduct extensive simulations, and the results demonstrate the high performance of the proposed protocol in terms of E2E packet delivery latency and packet delivery efficiency as compared with existing protocols. Copyright © 2014 John Wiley & Sons, Ltd.     

Trading latency for energy in densely deployed wireless ad hoc networks using message ferrying

Wireless mobile ad hoc networks (MANETs) have the potential for use in important application environments, such as remote environmental monitoring, where energy resources are limited. Efficient power management is necessary to allow these networks to operate over a long period of time. One of the key factors affecting the design of power management mechanisms is the routing protocol in use within the network. In this paper, we investigate the Message ferrying (MF) routing paradigm as a means to save energy while trading off data delivery delay. In MF, special nodes called ferries move around the deployment area to deliver messages for nodes. While this routing paradigm has been developed mainly to deliver messages in partitioned networks, here we explore its use in a connected MANET. The reliance on the movement of ferries to deliver messages increases the delivery delay if a network is not partitioned. However, delegating message delivery to ferries provides the opportunity for nodes to save energy by aggressively disabling their radios when ferries are far away. To exploit this feature, we present a power management framework, in which nodes switch their power management modes based on knowledge of ferry location. We evaluate the performance of our scheme using ns-2 simulations and compare it with a multihop routing protocol, dynamic source routing (DSR). Our simulation results show that MF achieves energy savings as high as 95% compared to DSR without power management and still delivers more than 98% of messages. In contrast, a power-managed DSR delivers many fewer messages than MF to achieve similar energy savings. In the scenario of heavy traffic load, the power-managed DSR delivers less than 20% of messages. MF also shows robust performance for highly mobile nodes, while the performance of DSR suffers significantly. Thus, delay tolerant applications can use MF rather than a multihop routing protocol to save energy efficiently when both routing approaches are available.     

Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking

As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper, we give an overview of the Safari architecture for highly scalable ad hoc network routing, and we present the design and evaluation of a specific realization of the Safari architecture, which we call Masai. We focus in this work on the scalability of learning and maintaining the routing state necessary for a large ad hoc network. The Safari architecture provides scalable ad hoc network routing, the seamless integration of infrastructure networks when and where they are available, and the support of self-organizing, decentralized network applications. Safari’s architecture is based on (1) a self-organizing network hierarchy that recursively groups participating nodes into an adaptive, locality-based hierarchy of cells; (2) a routing protocol that uses a hybrid of proactive and reactive routing information in the cells and scales to much larger numbers of nodes than previous ad hoc network routing protocols; and (3) a distributed hash table grounded in the network hierarchy, which supports decentralized network services on top of Safari. We evaluate the Masai realization of the Safari architecture through analysis and simulations, under varying network sizes, fraction of mobile nodes, and offered traffic loads. Compared to both the DSR and the L+ routing protocols, our results show that the Masai realization of the Safari architecture is significantly more scalable, with much higher packet delivery ratio and lower overhead.     

无线自组织网络中一种拥塞意识的多径路由算法

提出了无线自组织网络中一种拥塞意识的多径路由算法。该算法在路由发现过程中,综合节点的队列长度和路径跳数来动态确定路由请求消息的转发概率,可以在保证路由请求消息有一定送达率的条件下,降低路由开销;在路径选择和流量分配过程中,综合考虑节点的队列长度和路径质量作为路由度量,发现流量高吞吐量低拥塞路径,并基于该度量值进行流量分配。仿真结果显示,所提出的多径路由算法能有效提高网络性能。