Ad hoc On-Demand Distance Vector Routing

About: Ad hoc On-Demand Distance Vector Routing is a research topic. Over the lifetime, 8633 publications have been published within this topic receiving 201509 citations.

Proposal of Routing in Ad-hoc Networks Considering the Communication Status

Abstract: Studies on the wireless mesh network that connects access points (AP) by an ad-hoc network have been drawing much attention. As the routing protocol for the wireless mesh network, ad-hoc routing protocol or its improved version is used. In many of such ad-hoc routing protocols, it depends on the implementation which route to be chosen when there exist a number of shortest routes. In this paper, we propose a routing in ad-hoc network that can make route selection that tales advantage of features of both TCP and UDP, by extending the Optimized Link State Routing(OLSR).

Method for Optimizing Ad-hoc Networks Communication Protocol Parameter Values

Abstract: The article considers the approach to optimize the configuration of routing protocol parameters in ad-hoc networks. The presented method is based on the stochastic optimization algorithm “Fish School Search”, which uses the simulation model based on OMNET ++ and a fitness function based on a multiplicative convolution of individual network performance criteria. During the experimental research, the reactive routing protocol AODV was tuned, the result of which was an improvement in the “Packet Delivery Ratio” criterion to 20%, “Data Transfer Time” criterion to 16% while maintaining the “Service Traffic Share” criterion at an acceptable level.

An Improvement of AODV Algorithm in a Large-Scale Outdoor Area for ZigBee Networks

Abstract: AODV routing algorithm is widely used in a large-scale outdoor area for ZigBee wireless sensors networks. However, a large number of routing requests in AODV algorithm can easily lead to broadcast storms, which consume a lot of bandwidth and node energy, cause a large amount of signal collision and reduce the quality of communication. To solve these problems, this paper proposes self-learning multi-route selection-optimised algorithm (SMSA) based on improvements of ZigBee AODV. By making full use of the learning function of the routing table and taking collision frequency of sending data as a reference index of the cost of the path, this algorithm can reduce effectively the number of forwarding RREQ, inhibit the broadcast storm and reduce the collision of data, thus improving the success rate of data transmission. Meanwhile, it can also reduce the transmission delay and eventually save the overall energy of the network. In the simulation platform of OMNeT++, the algorithm proves to have a good effect on the large scale ZigBee network.

Implementation of Lightweight Stream Cipher in AODV Routing Protocol for MANET

Abstract: The growing use of MANETs and its vulnerability to attacks due to its fundamental characteristics make secure routing one of the most considerable challenges. In this paper, a new security scheme for mobile ad hoc networks (MANETs) is presented. The proposed scheme used Trivium lightweight stream cipher algorithm in combination with HMAC to secure the routing control packets. This paper compares the performance of the AODV after implementing the security scheme in terms of throughput, delay sum (end-to-end), jitter sum (end-to-end) and packet loss ratio. The proposed scheme shows better performance than original AODV under blackhole attack.

EEE-AODV in MANET

Abstract: Mobile Ad hoc network is a collection of mobile nodes. It has the property to change according to changing topology due to the lack of centralized control. The nodes act as a sender and receiver both and communicate with each other through various protocols. We have analyzed the energy factor of existing AODV protocol and have done improvement in it by modifying MAC layer of nodes. We have made the nodes to sleep after the predefined interval which leads to reduction in energy consumption and thus enhances the lifetime of mobile nodes.