Adaptive Neighbor Detection for Mobile Ad Hoc Networks (original) (raw)

Adaptive Proactive Routing Algorithm for Mobile Ad Hoc Networks

Proactive MANET routing protocols tend to provide smaller route discovery latency than ondemand protocols because they maintain route information to all the nodes in the network at all time. However, the downside for such protocols is the excessive routing control overhead that is generated by disseminating periodic HELLO messages and topology control messages. Due to the resource-constrained nature of wireless networks, the routing overhead increases channel contention, leads to network congestions and lowers significantly network performance. In order to mitigate the side effects of the soft update control overheads, we propose two adaptive proactive routing algorithms, namely DT MIAD and DT ODPU. By tuning the value of refresh intervals dynamically and automatically, refresh updates are triggered based on traffic conditions and node mobility. We have shown through simulations that, the proposed adaptive routing algorithm outperforms traditional proactive routing protocols like OLSR.

Adaptive MANET Routing for Low Overhead

2007

In wireless mission-critical systems, systems may be resource-constrained including limited bandwidth, so minimising protocol overhead, whilst maintaining performance, is important. Proactive MANET routing protocols tend to provide smaller route discovery latency than on-demand protocols because they maintain route information to all the nodes in the network at all time. However, such protocols may impose excessive soft-state routing control overhead which is generated by disseminating periodic update messages. In order to mitigate the side effects of the soft-state control overheads, we propose two adaptive proactive routing algorithms, namely DT MIAD and DT ODPU. By tuning the value of refresh intervals dynamically and automatically, refresh updates are triggered based on traffic conditions and node mobility. We show through simulations that the proposed adaptive routing algorithms can outperform a traditional proactive routing protocol (OLSR).

A New Strategy to Improve Proactive Route Updates in Mobile Ad Hoc Networks

Eurasip Journal on Wireless Communications and Networking, 2005

This paper presents two new route update strategies for performing proactive route discovery in mobile ad hoc networks (MANETs). The first strategy is referred to as minimum displacement update routing (MDUR). In this strategy, the rate at which route updates are sent into the network is controlled by how often a node changes its location by a required distance. The second strategy is called minimum topology change update (MTCU). In this strategy, the route updating rate is proportional to the level of topology change each node experiences. We implemented MDUR and MTCU on top of the fisheye state routing (FSR) protocol and investigated their performance by simulation. The simulations were performed in a number of different scenarios, with varied network mobility, density, traffic, and boundary. Our results indicate that both MDUR and MTCU produce significantly lower levels of control overhead than FSR and achieve higher levels of throughput as the density and the level of traffic in the network are increased.

A Novel Mobility Adaptive Routing Protocol for Manets

2019

Mobile Ad Hoc network (MANET) is a collection of smart mobile nodes, which form a dynamic and autonomous system. Since mobile nodes are free to move, they cause frequent changes in network topology and decrease the overall network performances. Therefore, the task of finding and maintaining a reliable route constitute the main issue in the design of efficient routing protocol for MANET. In this paper, we introduce a novel Mobility Adaptive AODV routing protocol (MA-AODV), which uses the degree of mobility time variation and the local route repair approach to mitigate the influence of high mobility and improve routing performances. We implemented the MA-AODV on network simulator NS2. Then, we evaluated the performance of MA-AODV and AODV based on node mobility variation such as speed and pause time. The comparison of performance metrics, such as Packet delivery Ratio, Throughput, routing overhead and communication delay demonstrates that MA-AODV outperforms AODV in high mobility envi...

Self-adaptive proactive routing scheme for mobile ad-hoc networks

IET Networks, 2015

This study introduces a routing model which has the ability to detect the mobile ad-hoc network (MANET) mobility states and self-adapt routing metrics accordingly. In this model, nodes rely on theirs mobility indicator to detect whether the network is relatively static or mobile and hence switch the routing metric to either expected transmission count (ETX) or mobility factor (MF), respectively. The proposed model takes advantages of both ETX and MF metrics thus enhancing the overall routing performance for MANET in different mobility states. Packet delivery ratio increases 10% in both static and mobile conditions whereas the number of drop packets reduces half compared with the original optimised link state routing protocol.

SDODV: A smart and adaptive on-demand distance vector routing protocol for MANETs

Mobile ad hoc networks (MANETS) are nodes connected in a peer-to-peer fashion. Because MANETs have challenging characteristics such as mobility and limited energy, traditional existing routing protocols are not very efficient-they suffer several limitations in terms of network stability and lifetime, especially in the emerging era of IoT, crowd-sensing, and smart cities. In this work, we present SDODV, a new smart and dynamic on-demand distance vector routing protocol for mobile ad hoc networks that addresses the shortcomings of existing routing protocols. Our proposed adaptive algorithm effectively increases the built network's lifetime by considering the network topology when establishing a route. It monitors the traffic load, nodes mobility, neighborhood density, and battery power to adjust packets accordingly. This protocol is based on the distributed reinforcement learning approach and on the traditional AODV. SDODV improves the quality of service because it chooses the shortest and most stable path while considering mobility, bandwidth, and power. Experimental results prove that SDODV outperforms the shortest path method and reduces energy consumption.

Adaptive routing for mobile ad hoc networks

2012

Developing efficient routing protocols for mobile ad hoc networks remains a challenging task. It is well known that every protocol is capable of outperforming the others depending on the network context under which it is evaluated, since protocols only perform optimally under specific network contains due to their inability to adapt their behavior to the network context, which both varies in time and place. This article builds upon this observation to motivate and propose an adaptive multi-mode routing framework that has multiple compatible modes of operation. Based on this framework, an adaptive protocol has been implemented with the novel feature that individual nodes can adapt their mode of operation at any moment, while an overall consistent state of the routing tables is maintained. Through simulation, the correct behavior of the protocol during mode switches is demonstrated and it is shown that the protocol is capable of minimally offering the performance of either proactive or reactive routing, Its capabilities to dynamically switch, when intelligently applied, allow outperforming these protocols. This is illustrated for one specific application scenario where network conditions are dynamically monitored. Further, the article discusses some challenges encountered during the design and, since no monitoring solution has been developed, identifies existing solutions for monitoring and dissemination of network context are identified, offering directions for further research.

A new approach for integrating proactive and reactive routing in MANETs

2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008

In this article, we propose a new approach to integrate proactive and reactive routing in mobile ad hoc networks. Our work deploys a lightweight proactive algorithm that runs in the background offering a basic routing service, and a reactive algorithm that can be called on demand offering a connection-oriented routing service. The reactive algorithm relies for its working as much as possible on the routing information provided by the proactive algorithm, creating a synergy between the two parts of our system. The most interesting property of our system is that it allows the choice between proactive and reactive routing to be made for each session individually, by their source nodes. This allows to shift the load of data that is being routed proactively and reactively while the network is being deployed. Also, it gives network nodes a very fine-grained level of control over the routing process, and allows them to maximally exploit the complementary properties of proactive and reactive routing, for example by matching the choice of the routing approach to the needs of individual sessions. In a range of tests, we show the validity of our approach.

A New Approach for Integrating Proactive and Reactive Routing in MANETs Frederick Ducatelle

We propose a new approach to integrate proactive and reactive routing in mobile ad hoc networks. Our work deploys a lightweight proactive algorithm that runs in the background offering a basic routing service, and a reactive algorithm that can be called on demand offering a connection-oriented service. The reactive algorithm uses the routing information from the proactive algorithm in its working, so that there is a synergy between the two parts of the system. An important property of our system is that it allows the choice between proactive and reactive routing to be made for each session individually, by their source nodes. This gives network nodes a very fine-grained level of control over the routing process, and allows them to exploit the complementary properties of proactive and reactive routing, e.g. by matching the choice of the routing approach to the needs of individual sessions. In a range of simulation tests, we evaluate the validity of our approach.

Randomized dynamic route maintenance for adaptive routing in multihop mobile ad hoc networks

Journal of Parallel and Distributed Computing, 2005

Several approaches have been proposed for designing multihop routing protocols in mobile ad hoc networks (MANET). Many of them adopt a method, called flooding, to discover a routing path. Due to the time-varying nature of the route in MANET, the discovered route needs to be dynamically maintained for optimality in terms of traffic load, hop-distance, and resource usage. It is easy to see that flooding incurs significant overhead and hence is inappropriate for the dynamic route maintenance. In this paper we propose a randomized, dynamic route maintenance scheme for adaptive routing in MANET. The scheme makes use of a nomadic control packet (NCP) which travels through the network based on a random walk, and collects its stopovers as a traversal record. The NCP uses the traversal record to probabilistically provide the nodes with clue for routing path updates. From the clue, the nodes can find the routing path update information that is up-to-date and optimal (less-loaded and shorter), thereby adapting to the dynamic network topology and traffic load conditions. We present an analytical model for measuring the effectiveness of NCP in terms of its frequency of visits and probability of finding the clue from the NCP traversal record. The proposed randomized scheme serves as a routing protocol supporting layer and can be easily applied with minimum modifications to the existing on-demand routing protocols such as AODV and DSR. In our experimental study, we modified the AODV protocol to maintain routing paths using NCPs' traversal record. Simulation results show that NCPs help the routing protocol to notably reduce average end-to-end packet delay with increased route optimality and better control on traffic congestion.