Cross-Layer-based Local Repair for Maximizing Goodput and Minimizing Control Messages in Multicasting MANET

The Multicast Ad hoc On-Demand Distance Vector (MAODV) protocol achieves multicast routing in self-organizing wireless mobile on-demand networks, e.g., Mobile Ad-hoc Networks (MANETs). However, unreliable wireless links degrade network reliability and network goodput, and the unreliable link problem becomes worse in multicasting because a multicast tree consists of more number of wireless links. MAODV adopts a broadcast-type local repair, and thus yields a large number of broadcast-type repair messages, increases extensive control overhead, and involves largely power consumption. Thus, a cross-layer unicast-type multihop local repair approach is proposed to recover broken links in multicasting MANETs. Additionally, the cross-layer mechanism provides mobile nodes to send a cross-layer message to the TCP sender to keep current congestion window (cwnd) and slow start threshold (ssthresh) when downstream links are temporarily broken, and then increases network goodput. Finally, the optimal number of neighbor-tiers is analyzed and the optimal substitute node is identified. Numerical results demonstrate that the proposed approach outperforms other approaches in successful repair rate, control message overhead, packet delivery ratio, and network goodput.     

Scalability enhancement of AODV using local link repairing

Dynamic change in the topology of an ad hoc network makes it difficult to design an efficient routing protocol. Scalability of an ad hoc network is also one of the important criteria of research in this field. Most of the research works in ad hoc network focus on routing and medium access protocols and produce simulation results for limited-size networks. Ad hoc on-demand distance vector (AODV) is one of the best reactive routing protocols. In this article, modified routing protocols based on local link repairing of AODV are proposed. Method of finding alternate routes for next-to-next node is proposed in case of link failure. These protocols are beacon-less, means periodic hello message is removed from the basic AODV to improve scalability. Few control packet formats have been changed to accommodate suggested modification. Proposed protocols are simulated to investigate scalability performance and compared with basic AODV protocol. This also proves that local link repairing of proposed protocol improves scalability of the network. From simulation results, it is clear that scalability performance of routing protocol is improved because of link repairing method. We have tested protocols for different terrain area with approximate constant node densities and different traffic load.     

A highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms

Ad-hoc on-demand distance vector routing (AODV) is a well-known routing protocol for mobile ad hoc networks. The original AODV protocol works in a semi-dynamic fashion, by establishing a route on demand and using that route until it breaks. However, to suit the changing network topology of ad hoc networks, more aggressive and adaptable routing strategies are required. A number of researches have proposed improving AODV performance by locally repairing broken links, predicting and replacing potentially vulnerable links, or shortening a link through removing redundant nodes from the transmission path. Although local repair may relieve some problems, it usually results in longer paths and thus a considerable performance drop in heavy traffic conditions. There are also issues regarding packet loss and communication delay due to route rebuilding once the link is broken. Predicting and replacing potentially vulnerable links may require special hardware, additional tables to maintain, or other extra overhead. Finally, path shortening may result in shorter and more efficient routes, but there is no guarantee that the new paths will be robust. This paper proposes integrating preemptive link breaking avoidance and path shortening mechanisms into a modified AODV protocol. However, the difficult issue lies in determining the right timing to initiate the two independent mechanisms so that the two dynamically and complementarily operating mechanisms can work together to improve the routing performance. Through numerical analysis and simulation, we have arranged a simple parameter setting for controlling the activation of each mechanism at the appropriate time. The proposed combination is a highly dynamic ad hoc routing protocol that is capable of adapting itself to the changing network topology and achieving extremely good performance in various routing performance metrics. Extensive simulations show that each of the two schemes alone improves AODV performance. More importantly, the integrated protocol performs even better in terms of data delivery rate, average delay time, and network overhead. To be more specific, in the best cases our protocol can reduce up to 82% in control overhead and 66% in delay time, while achieving 12% more in data delivery rate comparing to AODV.     

基于缓存旁路和本地修复的多跳网络路由重建机制

该文针对多跳网络中现有AODV和AODV-BR按需路由算法的弊端,提出了基于缓存旁路和本地修复的AODV-CL路由重建机制。该机制利用空闲时间监听无线信道中传输的所有数据包和路由控制信令,用于维护有效的邻居节点列表及本地路由缓存,有效降低了周期性HELLO消息带来的信令负担,并增加了可用路由信息。中间节点在发现断链时,尝试采用局部修复,尽量避免由源节点广播RREQ消息发现路由。根据本地路由缓存及邻居节点的路由信息,实现了快速的路由发现及修复,能有效降低路由控制信令开销及丢包率。     

基于局部梯度场的VANET路由研究

车载自组织网络(VANET,Vehicular Ad hoc Network)近几年受到高度关注,同时多跳安全消息路由成为VANET应用的核心问题之一。试图借助梯度场的方法,研究VANET网络安全消息的定向、受限空间及拓扑动态变化条件的传播机制,以达到快速准确地传播安全消息的目的。提出了一种局部梯度场的路由协议(LGFR,Local Gradient Field Routing),并与城市场景下的贪婪边界无状态路由(GPSR,Greedy Perimeter Stateless Routing)和无线自组网按需平面距离矢量路由(AODV,Ad hoc On-DemandDistance Vector Routing)进行了对比。仿真结果表明,LGFR在数据包丢包率、数据包端到端平均时延和全局数据吞吐量方面具有较好的性能。     

Reducing Latency and Overhead of Route Repair with Controlled Flooding

Ad hoc routing protocols that use broadcast for route discovery may be inefficient if the path between any source–destination pair is frequently broken. We propose and evaluate a simple mechanism that allows fast route repair in on demand ad hoc routing protocols. We apply our proposal to the Ad hoc On-demand Distance Vector (AODV) routing protocol. The proposed system is based on the Controlled Flooding (CF) framework, where alternative routes are established around the main original path between source–destination pairs. With alternative routing, data packets are forwarded through a secondary path without requiring the source to re-flood the whole network, as may be the case in AODV. We are interested in one-level alternative routing. We show that our proposal reduces the connection disruption probability as well as the frequency of broadcasts.     

基于改进蚁群算法的Ad hoc路由协议的研究

现有Ad hoc网络路由协议技术研究中,路由稳定性和可靠性问题尚未得到很好解决,不能很好地适应Adhoc网络.针对已有Ad hoc路由技术中存在的开销大以及网络稳定性较低的问题,该文引入蚁群算法,并对其进行改进.研究基于改进蚂蚁算法的Ad hoc路由协议,并与比较成熟的AODV(Ad hoc On-Demand Distance Vector)进行对比.仿真实验结果表明,通过发挥网络中结点群体功能,新协议减小了端对端传输延时,改善了数据包传输成功率与协议开销,有效地提高了网络的稳定性和通信效率.     

后备路径在自组网AODV协议中的应用

研究了后备路由策略在自组网AODV协议中的应用。通过仿真实验证明在不增加控制信息个数的条件下,后备路由策略能有效提高AODV协议的数据平均递交率。     

基于能量和负载均衡的AODV路由协议改进

在Ad Hoc网络中AODV路由协议是一个比较成熟且广泛接收的路由协议,具有较低的内存和处理开销,实现简单,但是AODV协议在能量和负载方面却存在着很大问题;针对这个问题提出无线Ad Hoc网络中基于AODV路由协议的能量和负载均衡的B-AODV协议。B-AODV协议考虑了节点的剩余能量和节点的已使用缓冲区大小两个度量,使之支持能量均衡和负载均衡,仿真结果表明B-AODV协议有效地均衡了AODV路由协议的能量消耗和节点的负载,延长了网络的生存时间,提高了包的传输率,充分利用了网络资源。     

基于路由表条目删除机制的分类简化AODV

针对按需距离矢量路由协议AODV(Ad Hoc On-demand Distance Vector)在网络拓扑变化迅速性能快速下降的弊端,提出了一种路由改进方案。在节点稳定性比较低时,直接删除该节点的所有路由表条目,从而减少路由维护的代价,并对链路进行分类与细化处理,简约路由协议。     

基于移动性的AODV路由协议改进

介绍了Ad Hoc网络路由协议（Ad Hoc On-Demand Distance Vector Routing,AODV）的路由机制和特点,提出了一种基于AODV的改进协议V-AODV。V-AODV改进了AODV的路由测度,用量化的节点移动性代替跳数作为路由代价的度量,在动态网络中能够选取到更加稳定的路由。仿真表明,V-AODV比AODV在时延和重传次数等性能上都有一定程度的提升。     

基于IEEE802.11 DCF的链路预先修复AODV路由协议

基于无线自组织网络中普遍使用的底层通信协议IEEE802.11 DCF,针对广泛应用于无线自组织网络中的路由协议(AODV),提出了一种链路预先修复算法。该算法首先推算了DCF协议中的不稳定传输范围,然后通过MAC层与路由层的跨层协作,在下一跳节点移动在不稳定传输范围时就事先采取相应的路由修复措施。相对于AODV中采用节点周期性地发送HELLO消息来监测邻居节点变化的方法,该算法更为高效及时。仿真结果表明,该算法能够有效的减小端到端时延,保障了投递率。     

基于邻节点表辅助的路由协议

提出了一种基于AODV的路由协议UH-AODV,该协议利用了无线信道的广播特性和MANET网络中存在的冗余路径,可对破损路由进行快速修复。     

Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing

A mobile ad hoc network is an autonomous system of infrastructure-less, multihop, wireless mobile nodes. Reactive routing protocols perform well in this environment due to their ability to cope quickly against topological changes. This paper proposes a new routing protocol named CHAMP (caching and multiple path) routing protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route failures. We show through extensive simulation results that these two techniques yield significant improvement in terms of packet delivery, end-to-end delay and routing overhead. We also show that existing protocol optimizations employed to reduce packet loss due to frequent route failures, namely local repair in AODV and packet salvaging in DSR, are not effective at high mobility rates and high network traffic.     

基于AODV协议的航空自组网仿真与分析

介绍NS2仿真软件,分析了按需距离矢量（AODV）路由协议的特点和基本构成,建立了航空自组网络模型。基于AODV路由协议,通过对数据报文投递率、端到端平均延时、路由负载3个网络连通性能参数的定量分析研究,得到了仿真结果并进行性能分析。结果表明：只有建立合适的航空自组网络模型,选定与之匹配的路由协议,设定合理的网络连通性能参数,才能使航空自组网络发挥出最佳性能效果。     

一种蜂窝辅助的AODV路由协议

首先提出了一种新的融合AdHoe和蜂窝网络体系结构。接着在这种融合网络结构下,对传统AODV路由协议进行了改进,设计了一种蜂窝辅助的AODV路由协议（CA-AODV）。CA-AODV路由协议利用蜂窝系统中代理节点所保存的移动adhoe节点位置信息,来维护、更新节点中的路由,这种主动维护路由信息的方法从而可以提高传统AODV协议的性能。最后文中通过NS-2仿真表明：在数据发送率较高的情况下,CA-AODV路由协议能显著提高传统AODV协议的系统参数性能。     

Improving Bandwidth Utilization of Intermittent Links in Highly Dynamic Ad Hoc Networks

Non-uniform node densities occur and intermittent links exist in highly dynamic ad hoc networks. To fit these networks, researchers usually combine delay tolerant network (DTN) routing protocols and mobile ad hoc network (MANET) routing protocols. The DTN protocol separates end-to-end links into multiple DTN links, which consist of multi-hop MANET links. Determining how to arrange DTN links and MANET links from source to end and dealing with intermittent links are performance issues, because node density ranges from sparse to dense and MANET protocols are much lighter than DTN protocols. This paper presents HMDTN, an application-network cross-layer framework, to solve the previously mentioned issues. The application layer in HMDTN supports disrupt tolerance with a large data buffer while adjusting the routing table on the basis of the connection state of links (link is disrupted or recovered), which are collected by the network layer. As a result, HMDTN increases the bandwidth utilization of intermittent links without compromising the efficiency of the MANET protocol in a reliable network. The HMDTN prototype was implemented based on Bytewalla (a Java version of DTN2) and Netfilter-based AODV. Experiments on Android devices show that unlike AODV and Epidemic, HMDTN increases the bandwidth utilization of intermittent links with a negligible increase of network overhead. In particular, HMDTN maintains the network throughput as high as regular network conditions even if the network undergoes relatively long-term (dozens of seconds or few minutes) data link disruptions.

     

Gossip-based ad hoc routing

Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations of flooding, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, the gossip dies out quickly and hardly any node gets the message; in the remaining executions, a substantial fraction of the nodes gets the message. The fraction of executions in which most nodes get the message depends on the gossiping probability and the topology of the network. In the networks we have considered, using gossiping probability between 0.6 and 0.8 suffices to ensure that almost every node gets the message in almost every execution. For large networks, this simple gossiping protocol uses up to 35% fewer messages than flooding, with improved performance. Gossiping can also be combined with various optimizations of flooding to yield further benefits. Simulations show that adding gossiping to AODV results in significant performance improvement, even in networks as small as 150 nodes. Our results suggest that the improvement should be even more significant in larger networks.     

MANET网络中改进本地修复机制的AODV路由协议

针对移动AdHoc网络中,AODV路由协议在本地修复过程中存在路由发现币口路由维护的巨大开销。提出了一种改进本地修复机制的AODV路由协议。通过OPNET分别对普通AODV协议和提出的改进本地修复机制的AODV路由协议进行仿真。仿真结果表明,该机制有效地减少了路由开销和端到端的数据传输延时,提高了协议效率和整个网络的性能。     

Security upgrade against RREQ flooding attack by using balance index on vehicular ad hoc network

VANET is an ad hoc network that formed between vehicles. Security in VANET plays vital role. AODV routing protocol is a reactive or on-demand routing protocol which means if there is data to be send then the path will create. AODV is the most commonly used topology based routing protocol for VANET. Using of broadcast packets in the AODV route discovery phase caused it is extremely vulnerable against DOS and DDOS flooding attacks. Flooding attack is type of a denial of service attack that causes loss of network bandwidth and imposes high overhead to the network. The method proposed in this paper called Balanced AODV (B-AODV) because it expects all network node behave normally. If network nodes are out of the normal behavior (too much route request) then they identified as malicious node. B-AODV is designed with following feature: (1) The use of adaptive threshold according to network conditions and nodes behavior (balance index) (2) Not using additional routing packets to detect malicious nodes (3) Perform detection and prevention operations independently on each node (4) Perform detection and prevention operations in real time (5) No need for promiscuous mode. This method for detection and prevention flooding attack uses average and standard deviation. In this method each node is employing balance index for acceptation or rejection RREQ packets. The results of the simulation in NS2 indicates B-AODV is resilience against flooding attack and prevent loss of network bandwidth. Comparing between AODV with B-AODV in normal state (non-attacker) shows B-AODV is exactly match with AODV in network performance, this means that the B-AODV algorithm does not impose any overhead and false positive to AODV.