Enhanced AODV routing protocol for Bluetooth scatternet

Bluetooth is one of the most widespread technologies for personal area networks that allow portable devices to form multi-hop Bluetooth ad hoc networks, so called scatternets. Routing is one of the challenges in scatternets because of its impact on the performance of the network. It should focus on reducing the power consumption in the network because most of the nodes are battery-operated portable devices. In this paper, we propose a routing protocol for Bluetooth scatternets that customizes the Ad hoc On-Demand Distance Vector (AODV) routing protocol by making it power-aware and suitable for scatternets. It enhances the AODV flooding mechanism by excluding all non-bridge slaves from taking apart in the AODV route discovery process. In addition, it improves the AODV route discovery phase by considering the hop count, the predicated node’s power, and the average traffic intensity for each node as metrics for best route selection. By removing HELLO packets, our protocol reduces the control packets overhead and the power consumption in network devices. Simulation results show that the proposed protocol achieved considerable improvements over other enhanced AODV protocols by increasing the data delivery ratio by 10.78%, reducing the average end-to-end delay by 8.11%, and reducing the average energy consumption by 7.92%.     

Optimized Tuning of LOADng Routing Protocol Parameters for IoT

Interconnected devices and intelligent applications have slashed human intervention in the Internet of Things (IoT), making it possible to accomplish tasks with less human interaction. However, it faces many problems, including lower capacity links, energy utilization, enhancement of resources and limited resources due to its openness, heterogeneity, limited resources and extensiveness. It is challenging to route packets in such a constrained environment. In an IoT network constrained by limited resources, minimal routing control overhead is required without packet loss. Such constrained environments can be improved through the optimal routing protocol. It is challenging to route packets in such a constrained environment. Thus, this work is motivated to present an efficient routing protocol for enhancing the lifetime of the IoT network. Lightweight On-demand Ad hoc Distance-vector Routing Protocol—Next Generation (LOADng) protocol is an extended version of the Ad Hoc On-Demand Distance Vector (AODV) protocol. Unlike AODV, LOADng is a lighter version that forbids the intermediate nodes on the route to send a route reply (RREP) for the route request (RREQ), which originated from the source. A resource-constrained IoT network demands minimal routing control overhead and faster packet delivery. So, in this paper, the parameters of the LOADng routing protocol are optimized using the black widow optimization (BWO) algorithm to reduce the control overhead and delay. Furthermore, the performance of the proposed model is analyzed with the default LOADng in terms of delay, delivery ratio and overhead. Obtained results show that the LOADng-BWO protocol outperforms the conventional LOADng protocol.     

Adjusted probabilistic route discovery in mobile ad hoc networks

Conventional on-demand route discovery methods in mobile ad hoc networks (MANET) employ simple flooding method, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. This paper proposed two new probabilistic methods that can significantly reduce the number of RREQ packets transmitted during route discovery operation. Our simulation analysis reveals that equipping AODV with an appropriate probabilistic route discovery method can result in significant performance improvements in terms of routing overhead, MAC collisions and end-to-end delay while still achieving a good throughput when compared with the traditional AODV.     

基于移动状态的车载自组织网络路由算法

传统的AODV协议应用于车载自组织网络,尽管分组投递率比较高,但在数据分组需要发送时才建立路由,网络延迟较大。而DSDV中通过周期性的路由更新机制,网络延迟小,但需维护大量不必要的路由,并且拓扑结构变化使许多路由无效,导致分组投递率非常低。为了综合满足VANET分组投递率和网络延迟的要求,将AODV和DSDV两种路由建立机制相互融合,形成混合式路由协议。首先,根据车辆节点的位置、速度和方向等移动状态周期性地选择稳定且距离适中的链路,形成网络主干并更新路由;其次,当数据分组目的节点路由不存在时,发起路由发现过程建立路由,在路由请求报文前进和路由应答报文回溯过程中求出路由过期时间。仿真实验表明,尽管路由开销有所增大,分组投递率略低于AODV,但是网络延迟显著降低。     

双向路径重选的自组网负载均衡路由协议

基于跨层负载感知和双向路径重选的自纽网负载均衡路由协议（CLBLR）在路由发现阶段和路由维护阶段，将整个路径中各节点MAC层的总平均估计时延和路径总业务流负载结合起来，共同作为路由选择和路由调整的重要依据，通过双向路径重选方法实现最优路径选择和网络业务流的均衡分布和均衡传输．协议通过禁止中间节点对路由请求进行应答和阻止不必要的路由请求分组，经由重负载中间节点转发，以保证路由发现时能够利用最新负载信息，并避免了节点在重负载情况下成为新建路由的中间节点，使协议具有一定的拥塞控制功能，以间接的方式实现了请求接纳控制．上述措施使分组传输路由很好地避免了拥塞节点，减少了网络瓶颈对网络性能的影响．仿真表明，CLBLR在分组丢失率、平均端到端时延和路由附加开销等方面具有良好性能，其优良的分布式控制特征能适应自组网的动态环境．     

基于ZigBee网状网络的分簇路由协议

ZigBee是一种短距离、低速率无线网络通信技术,ZigBee网状网的路由是建立在AODV协议基础上的。采取一种有效的路由协议并能减少路由的负载对于整个网络的负荷的减小非常关键。在ZigBee网状网的基础上,对AODV路由协议进行改进,提出一种新型的分簇路由协议AODV_Cluster,把整个ZigBee网络分成多个簇,一个簇的标签是根据簇首的短地址来实现的,而且同一个簇内的路由信息共享。仿真结果表明,协议既保持了AODV的优点,又提高了网络的可扩展性能,特别是在网络的节点数较多时,性能明显优于AODV。     

AODV路由协议的改进

在新建路由时,AODV选择具有最短跳数的路由,未考虑节点的负载,所选的路径可能造成网络拥塞,且在节点移动较快时,性能下降非常厉害。针对这种情况,对其路由发现和维护阶段进行改进,在路由发现时根据节点负载选择节点并且在拓扑改变时动态对路由进行优化,减少网络拓扑变化对路由的影响。仿真结果证明,改进后的协议在减少网络拥塞、降低丢包率等方面较AODV协议均有了改进。     

自组网中一种基于跨层负载感知的按需负载均衡路由

本文提出了一种新的基于跨层负载感知的自组网负载均衡路由协议（CLLOR）。CLLOR在路由发现阶段和路由维护阶段将整个路径中各节点MAC层的总平均估计时延和路径总业务流负载结合起来共同作为路由选择和路由调整的重要依据,以实现网络业务流的均衡分布和均衡传输。协议通过禁止中间节点对路由请求进行应答和阻止不必要的路由请求分组经由重负载的中间节点转发,以保证路由发现时能够利用最新的负载信息,并避免了节点在重负载情况下成为新建路由的中间节点,使得协议具有一定的拥塞控制功能,以间接的方式实现了请求接纳控制。通过上述措施,可以很好地避免网络中出现拥塞节点,减少了网络瓶颈对网络性能的影响。仿真表明,CLLOR在分组丢失率、平均端到端时延和路由附加开销等方面具有良好的性能,其优良的分布式控制特征能适应自组网的动态环境。     

一种改进的基于能量效率的AODV路由协议

传统的按需距离矢量路由协议（AODV）使用基本的路由发现算法建立从源节点到目的节点的路由,不考虑节点当前的剩余能量大小,整个网络的生存期受到影响。提出了一种改进的按需距离矢量路由协议（EM-AODV）。它在建立路由的过程中使用了一种考虑节点剩余能量的算法,来确定路由请求报文的转发时延,选取剩余能量较多的节点建立路由。仿真结果表明：EM-AODV较AODV提高了能量使用效率,延长了网络生存期。     

节点度估计和静态博弈转发策略的Ad Hoc网络路由协议

针对Ad Hoc网络路由发现过程中广播路由请求分组导致的广播风暴问题，提出了一种基于节点度估计和静态博弈转发策略的Ad Hoc网络路由协议NGRP.NGRP考虑边界影响，采用分段函数的思想将网络场景分为中心、边和角区域，分别估算网络中节点在不同区域的节点度，避免了周期性广播Hello消息获取节点度导致的开销；NGRP路由请求分组的转发采用静态博弈转发策略，利用节点度估算参与转发路由请求分组的节点数量，将转发和不转发作为策略集合，设计效益函数，通过纳什均衡获得节点转发路由请求分组的转发概率，从而减少了路由请求分组广播过程中产生的大量的冗余、竞争和冲突，提高了路由发现过程中路由请求分组的广播效率.运用NS-2对协议的性能进行大量的仿真，结果表明：NGRP的分组投递率、路由开销、MAC层路由开销和吞吐率这4项指标明显优于AODV+FDG，AODV with Hello和AODV without Hello协议.     

Ad Hoc网络中按需路由协议的仿真与性能分析

对Ad Hoc网络中两种典型的按需路由协议AODV和DSR协议进行了介绍,对两种协议的路由发现和路由维护过程进行了分析与比较。对两种路由协议在不同的运动场景中进行了比较系统的仿真研究。仿真中选取了数据包的传输率、端到端的平均时延、路由开销这三个指标对AODV和DSR路由协议进行了性能评估,并通过改变节点的个数、分组速率和节点暂停时间来分析比较这些参数的改变对这两个协议性能的影响。     

Congestion Adaptive Routing in Mobile Ad Hoc Networks

Mobility, channel error, and congestion are the main causes for packet loss in mobile ad hoc networks. Reducing packet loss typically involves congestion control operating on top of a mobility and failure adaptive routing protocol at the network layer. In the current designs, routing is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and unnecessary packet loss and requires significant overhead if a new route is needed. This problem becomes more visible especially in large-scale transmission of heavy traffic such as multimedia data, where congestion is more probable and the negative impact of packet loss on the service quality is of more significance. We argue that routing should not only be aware of, but also be adaptive to, network congestion. Hence, we propose a routing protocol (CRP) with such properties. Our ns-2 simulation results confirm that CRP improves the packet loss rate and end-to-end delay while enjoying significantly smaller protocol overhead and higher energy efficiency as compared to AODV and DSR     

基于稳定性的AODV路由协议研究与仿真

分析了按需路由协议AODV的基本原理,针对AODV仅维护单一路由及不考虑节点能耗的不足,提出了一种基于稳定性的AODV优化思想。通过NS2仿真实验表明,优化后的AODV路由协议在分组投递率、端到端平均时延及网络生存时间等方面的性能优于原协议,更适用于网络拓扑结构快速变化的场合。     

动态源路由协议(DSR)在Linux下的实现

动态源路由协议(DynamicSourceRoutingProtocol,DSR)是由移动节点组成的多跳无线AdHoc网络犤3,4犦中一种简单和行之有效的路由协议犤1犦。协议允许任一结点动态发现到达AdHoc网络中其它任意节点的路由,所有的路由信息由DSR自动地进行维护。每个DSR头部都携带了到达目的节点的完整的路由跃点列表(hoplist),中间节点只需简单地对分组进行转发即可。同时DSR协议完全按需(on-demand)的特性可以显著减少路由协议的开销,节省了电池能量,减少了分组冲突的概率并减少了潜在的大规模的路径更新信息的传播。使用DSR协议可以实现AdHoc网络的完全的自组织和自配置而无需任何已经存在的网络基础设施。论文详细论述了DSR路由协议在Linux操作系统下借助Netfilter的实现。     

基于萤火虫群优化的Ad Hoc网络路由协议

针对Ad Hoc网络拓扑结构多变、网络生存时间受限及数据包分组传输效率低下等问题,本文借鉴萤火虫群优化算法的思想,提出了一种基于萤火虫群优化的Ad Hoc网络路由协议。路由协议用萤火虫优化算法的荧光素强度的更新规则与无线自组网络中的节点移动速度、拥塞程度、节点剩余能量及节点间的距离等因素相互映射,改进萤火虫群优化算法中的搜索萤火虫、驻留萤火虫及回溯萤火虫用于完成Ad Hoc网络中路由协议的路由发现、路由选择及路由维护等过程,整个协议无须传送大量的控制分组,即可实现Ad Hoc网络的稳定。仿真实验结果表明,与AODV及基于蚁群优化的路由算法AntRouting协议相比,本文所提出的路由协议在端到端延时、分组数据传输率及网络生存时间上均有良好的性能。     

基于NS2的Ad Hoc网络AODV协议研究与改进

无线自组网是由一组无线移动主机组成的无基础设施的临时网络,在与其相关的网络协议的研究中常涉及到修改及扩展问题。文章分析了经典按需路由协议AODV的路由发现和建立过程,通过NS2仿真软件的内核扩展及重编译,在控制台输出相关的扩展内容,包括RREQ和RREP包的传送、正反向路由表的建立和节点路由表的更新等信息。结果表明,在NS2仿真软件下对无线自组网路由协议的研究和调试分析是一种科学有效的方法。最后对AODV协议本身提出了几种改进的思路和方法。     

On improving the efficiency of truthful routing in MANETs with selfish nodes

In Mobile Ad Hoc Networks (MANETs), nodes depend upon each other for routing and forwarding packets. However, nodes belonging to independent authorities in MANETs may behave selfishly and may not forward packets to save battery and other resources. To stimulate cooperation, nodes are rewarded for their forwarding service. Since nodes spend different cost to forward packets, it is desirable to reimburse nodes according to their cost so that nodes get incentive while the least total payment is charged to the sender. However, to maximize their utility, nodes may tell lie about their cost. This poses the requirement of truthful protocols, which maximizes the utility of nodes only when they declare their true cost. Anderegg and Eidenbenz recently proposed a truthful routing protocol, named ad hoc-VCG. This protocol incurs the route discovery overhead of O(n³), where n is the number of nodes in the network. This routing overhead is likely to become prohibitively large as the network size grows. Moreover, it leads to low network performance due to congestion and interference. We present a low-overhead truthful routing protocol for route discovery in MANETs with selfish nodes by applying mechanism design. The protocol, named LOTTO (Low Overhead Truthful rouTing prOtocol), finds a least cost path for data forwarding with a lower routing overhead of O(n²). We conduct an extensive simulation study to evaluate the performance of our protocol and compare it with ad hoc-VCG. Simulation results show that our protocol provides a much higher packet delivery ratio, generates much lower overhead and has much lower end-to-end delay.     

A new wireless ad hoc multicast routing protocol

An ad hoc network is a multi-hop wireless network of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and mobility require that ad hoc routing protocols be robust, simple, and energy conserving. This paper proposes a new ad hoc multicast routing protocol called neighbor-supporting multicast protocol (NSMP). NSMP adopts a mesh structure to enhance resilience against mobility. And NSMP utilizes node locality to reduce the overhead of route maintenance. NSMP also attempts to improve route efficiency and reduce data transmissions. Our simulation results show that NSMP delivers packets efficiently while substantially reducing control overhead in various environments.     

基于模糊逻辑改进的MANET路由协议设计与仿真

现有的移动自组网(MANET)状态感知路由协议中,由于在路由过程中负载和能量两个状态会动态变化,所以很难用具体数值完整描述,从而造成路由选择质量的下降。为此引入模糊逻辑系统,提出了一种新的基于模糊逻辑改进的状态感知路由协议(FLISAR),通过解模糊给出结合负载和能量的综合路由指标,使整个网络中负载和能量能更均匀地分布。利用NS2软件对协议进行仿真,分析结果表明,本协议能较好地提高分组投递率和延长网络生存时间。     

LA_AODV路由协议的仿真与性能分析

AODV协议以源到目的的最短路径或最短跳数作为路由度量参数。LA_AODV协议综合考虑无线移动自组织网络的路由层和物理层,提出了一种新的路由度量参数。首先介绍了LA_AODV协议,然后讲述在NS2中实现LA_AODV的方法,并详细分析仿真中的关键问题。仿真结果表明LA_AODV协议在保持AODV协议特点的基础上,具有吞吐量高、路由开销低、延时小的特点。