Ad Hoc On-demand Distance Vector Research Articles

Enhancement of QOS for Multi-user Environment in Cognitive Radio Network

CRT(Cognitive radio technology) enhances the utilization of available better spectrum in the channel. So to provide better Quality of Service for the user in this paper the Localizability aided localization(LAL) and Water filling Methodologies are proposed. This paper analyzes the routing protocols like AOMDV(Ad-hoc On-demand Multi-path Distance Vector routing), DSR (Dynamic Source Routing) and AODV (Ad-hoc On-Demand Distance Vector). Considering the AODV as the existing routing protocol, this paper proposed with AOMDV and DSR routing algorithms for Localizability aided localization(LAL) and Water filling methodologies respectively. Current work on improving Quality of Service, the different routing protocols are proposed in this paper. The main factors analyzing in this paper are throughput, PDR( packet delivery ratio) and Delay. The simulation results will confirm the accuracy of the proposed techniques.

Security Improved Chicken Swarm Optimization Based A* Routing Algorithm on MANETs

The mobile devices usage has been widespread, which directly impacts the increase of mobile communication, the increased usage of Mobile Ad-hoc networks(MANETs) has brought a rapid growth in the technology development. MANETs can be deployed in any environment conveniently as it comes under the category of ad-hoc networks which is infrastructureless. Due to flexibility of deployment features, it is compatible with other networks like PAN, LAN, etc.,. MANET is applicable in many applications like rescue of emergency disasters, military operations and other special environments where wired system may not support and of urgency. Since, MANETs are having the property of infrastructureless, nature of topology of network being dynamic, and lack of authority certification leads to certain problems with regard to security from attackers. In MANETs high attention should also be given to security parameter along with other parameters for efficient routing. With the aim of facing the possibility of malicious node attacks, the proposed paper presents the technique of detecting the malicious nodes attacks caused form two major attacks like blackhole and wormhole attacks are detected and prevented by Cooperative Bait Detection Scheme (CBDS). Once those attacks are prevented, the routing efficiency in MANETs for Chicken Swam Optimization based A* algorithm is improved, which is a computer algorithm that is broadly deployed in path finding and graph traversal. The comparative examination of Optimized A*, Ad-hoc On-Demand Distance Vector (AODV) with the proposed model against attacks, enhances the performance.

Ad Hoc On-demand Distance Vector Inherent Techniques Comparison for Detecting and Eliminating the Black Hole Attack Nodes in Mobile Ad Hoc Network

It is important to connect wirelessly a group of moving mobile nodes together in a static or dynamic form, to transfer digital data between them, this form known as a mobile ad hoc network. This private network can be used in different essential situations where it depends on each connected mobile node to deliver and pass the data between them, without any fixed access point or router. Unfortunately, there are different types of attacks that can affect these nodes, and steal or corrupt the data inside, one of these attacks called the black hole attack. In this paper, a compared study will be done between two major innovative techniques derived from the ad hoc on-demand distance vector routing protocol to avoid the black hole attack; the paper will compare the two techniques in delay, throughput and packet dropping efficacy.

Efficient dynamic-power AODV routing protocol based on node density

Mobile Ad Hoc Networks (MANET) allows versatile communication between host devices moving around in a state of flux. These networks have no fixed infrastructure thus making the routing of packets a continuous challenge to be optimally delivered under varying criteria such as when the number of nodes within an area increases the scope for interference between nodes which also increases significantly. Additionally, MANETs have low stability in areas with fast moving nodes which leads to their reduced longevity. This paper proposes a method by adapting the standard Ad hoc On-Demand Distance Vector (AODV) protocol to dynamically adjust transmission power usage, which is titled Dynamic Power-Ad hoc On-Demand Distance Vector (DP-AODV). This method uses the dependence of a transmission range on density to achieve this improvement. The results demonstrate that as density increases, DP-AODV shows decrease in delay than AODV and offering better performance for highly populated networks exceeding 200 nodes. The simulation results show that DP-AODV increase network throughput whilst reducing the node interference in a dense region, as well as it enhances the overall network performance with respect to the increased packet delivery fraction, reducing the control overheads and jitter, enhancing overall throughput, reducing interferences and finally, shortening end-to-end delay in medium to high density conditions.

Routing Using Genetic Algorithm in a Wireless Sensor Network

In this paper we probe the routing algorithm that maximizes the quality of the network. In this regard, we present various scenarios for comparisons among different routing algorithms in a wireless sensor network. Using simulations conducted in NS-2, we compare the performance of genetic algorithm (GA) to the Dijkstra algorithm, Ad hoc On-Demand Distance Vector (AODV), GA-based AODV Routing (GA-AODV), grade diffusion (GD) algorithm, directed diffusion algorithm and GA combined with the GD algorithm. We assume the presence of faulty nodes and work on finding out the performance that enhances the lifespan of the sensor network. In this regard, we have simulated routing algorithms while considering faulty nodes up to 50% of the functioning nodes. Nodes are considered to be dynamic and we assumed different mobility speeds of the nodes. Our results demonstrate that GA can be used in different network configurations as it shows a better performance in the wireless sensor network.

Trust framework for attack resilience in MANET using AODV

Mobile Ad-hoc network (MANET) is a collection of arbitrary moving autonomous nodes having routing capabilities. Theoretically, nodes are expected to cooperate with each other to facilitate communication with not directly connected nodes but in real scenario some of the nodes may be malicious. These compromised /malicious nodes may be part of the network or any other node trying to intrude in the network. A trust based framework is proposed in this paper to make the network resilient to malicious nodes. Trust is calculated using route request and route reply counter to make it simple and scalable. Ad Hoc On- Demand Distance Vector (AODV) routing protocol is used as the basic protocol. Performance analysis is done by varying malicious node density and calculating packet loss & average packet delay. It shows that the proposed framework along with trust calculating mechanism is giving better results as compared to basic routing protocol AODV in the presence of malicious nodes.

Extended Multipath Routing in Zigbee which Improves Performance Parameters

As we know Wireless Sensor Network is the perfect solution for quick capturing, processing, and transmission of critical data. Sensor nodes are often deployed in a generous environment but nodes suffer from low battery power. So, energy efficiency and network life are the main concerns in WSN. ZigBee has low cost, low power consumption, and is beneficial in wireless sensor networks by selecting adequate communication protocol. Routing protocols like AODV (Ad- hoc on-demand distance vector routing), ZTR (ZigBee tree routing), and STR (Shortcut tree routing) and ESTR (Extended Shortcut tree routing) are compared on the idea of various performance metrics like the end to finish delay, routing overload, throughput, packet delivery ratio (PDR). The mathematical analysis and performance evaluation shows that ESTR achieves better performance as compared to other routing protocols. The overall evaluation shows that ESTR achieves better performance as compared to other routing protocols. But there are some limitations to the ESTR method. The performance of the packet delivery ratio of STR is less as compared to AODV. The performance of end to finish delay of STR is poor as compared to AODV. Extended STR is proposed to represent the new ZigBee network routing protocol with the improved performance of the Packet Delivery ratio (PDR) and delay against STR and AODV. We are introducing here Efficient Extended Shortcut Tree Routing method (ESTR) for further improvement of delays of the ESTR method.

Assessing node mobility impact on routing performances in MANETs

Mobile ad hoc network (MANET) plays a major role in enabling data communication in infrastructures-less areas. Network performance relies on the capacity of mobile nodes to process data packet and deliver it to the right destination at lower cost. Since nodes are free to move toward random destination, data delivery from a source to a destination might be disturbed due to frequent topology changes. Hence, mobility in mobile ad hoc network represents the main issue that should be addressed carefully while designing routing protocols. The purpose of this paper is to study the impact of node mobility on the performance of well-known routing protocols such as destination-sequenced distance vector (DSDV), dynamic source routing (DSR) and ad-hoc on demand distance vector (AODV). We assessed the efficiency of each protocol under high mobility environment using various values of speed and pause. Performance assessment is based on the conventional metrics such as latency, throughput, packet delivery ratio (PDR) and routing overhead. Moreover, we introduced two new metrics called path change factor (PCF) and route repair influence (RRI) for accuracy purpose. The study demonstrates that AODV has better performances in high mobility environment.

Assessing node mobility impact on routing performances in MANETs

Mobile ad hoc network (MANET) plays a major role in enabling data communication in infrastructures-less areas. Network performance relies on the capacity of mobile nodes to process data packet and deliver it to the right destination at lower cost. Since nodes are free to move toward random destination, data delivery from a source to a destination might be disturbed due to frequent topology changes. Hence, mobility in mobile ad hoc network represents the main issue that should be addressed carefully while designing routing protocols. The purpose of this paper is to study the impact of node mobility on the performance of well-known routing protocols such as destination-sequenced distance vector (DSDV), dynamic source routing (DSR) and ad-hoc on demand distance vector (AODV). We assessed the efficiency of each protocol under high mobility environment using various values of speed and pause. Performance assessment is based on the conventional metrics such as latency, throughput, packet delivery ratio (PDR) and routing overhead. Moreover, we introduced two new metrics called path change factor (PCF) and route repair influence (RRI) for accuracy purpose. The study demonstrates that AODV has better performances in high mobility environment.

SECURED AODV TO PROTECT WSN AGAINST MALICIOUS INTRUSION

One of the security issues in Wireless Sensor Networks (WSN) is intrusion detection. In this paper, we propose a new defense mechanism based on the Ad hoc On-Demand Vector (AODV) routing protocol. AODV is a reactive protocol designed for ad hoc networks and has excellent flexibility to be adapted to a new secure version. The main objective of the proposed secured AODV routing protocol is to protect WSN against malicious intrusion and defend against adversary attacks. This secured AODV protocol works well with the WSN dynamics and topology changes due to limited available resources. It establishes secure multi-hop routing between sensor nodes with high confidence, integrity, and availability. The secured AODV utilizes an existing intrusion dataset that facilitates new collection from all the exchanged packets in the network. The protocol monitors end to end delay and avoid any additional overhead over message transfer between sensor nodes. The experimental results showed that this secured AODV could be used to fight against malicious attacks such as black hole attacks and avoid caused large transmission delays.

Adaptation of Smart Antenna with AODV Routing Protocol for Ad Hoc Wireless Networks

In the recent years, Mobile Ad-Hoc Wireless Networks (MANET) have played a key role in communication system. It is a self-configured and infrastructure-less network. It is used in different application areas like disaster recovery operations, hospitals and agricultural sectors. However, there are a lot of problems that limit the performances of this network for significantly achieving its roles in different areas. To overcome these problems, this paper enhances the performances of MANET in wireless communication system by adapting smart antenna in Ad-hoc On-Demand Distance Vector (AODV) routing protocol combining with multiple network interfaces. The improved new version AODV utilizing directional antenna and multiple network interface compared with Omni-directional antenna is evaluated based on simulations, which was done with the Network Simulator version two (NS2). Through this study, we found out that directional antennas integrating with multiple network interface throughput and end to end delays always outperform Omni-directional antennas in both random and grid scenarios for AODV routing protocol. In high communication paths and long communication distances also directional antennas have significant improvements in contrast to traditional Omni-directional antennas. Finally, we recommend that for increasing throughput and decreasing end to end delay utilizing directional antennas and multiple network interfaces in MANET technology improve the performances of the wireless communication system.

Optimal Routing for Beamforming-Constrained Swarm UAS Networking

With the evolution of 5G cellular communication, beamforming is mature for the implementation on a large scale. The development of cellular networking provides a great opportunity for swarm UAS. Concurrently, the advantages of swarm UAS can provide immense improvement to the advance of industrial and residential implementations. However, the nature of the antenna array constrains beamforming in a limited space which is rarely mentioned in networking routing researches. In this paper, regarding the constrained steering space, we proposed a novel algorithm, Optimized Ad-hoc On-demand Distance Vector (OAODV), which aims to improve the capacity of beamforming on swarm UAS networking. With the adjustable searching space, OAODV can achieve better latency, overhead, and link generation than the conventional algorithms of Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State Routing (OLSR). Compared with AODV and OLSR, OAODV can reduce 35.07% and 68.93% of average overhead, and decrease 47.73% and 11.55% of average latency respectively. Further, we leverage Ant Colony Optimization (ACO) to enhance OAODV, and the ACO enabled OAODV can achieve better throughput and fewer hops with reduction of overhead. The proposed algorithms show the promising capacity to improve swarm UAS networking. The OAODV is more suitable for the 5G cellular networking based swarm UAS networking. The decentralized advantages can improve the deployment of swarm UAS networking on a large scale with more efficiency, flexibility and elasticity.

On Modeling Optimizations and Enhancing Routing Protocols for Wireless Multihop Networks

The contribution of this paper is two fold. It first analyses the flooding strategies for the Wireless Multihop Networks (WMNs) then it enhances the reactive and proactive routing protocols. For analysis purpose, we select four widely used flooding techniques for routing: i. traditional flooding, ii. Time-To-Live based Expanding Ring Search (TTL-based ERS) flooding scheme, iii. TTL-based Scope Routing (SR) flooding and iv. Multi-Point Relays (MPR) flooding. These techniques play a vital role and act as a backbone for routing protocols. Therefore, we compare efficiency of these techniques for six widely used routing protocols: Ad-hoc On-demand Distance Vector (AODV), Destination Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), DYnamic MANET On-demand (DYMO), Fish-eye Scope Routing (FSR) and Optimized Link State Routing (OLSR). DSDV uses traditional flooding, AODV, DSR and DYMO use TTL-based ERS flooding, FSR uses TTL-based SR flooding and OLSR uses MPR flooding. This paper also presents mathematical models for flooding techniques and studies the affects of these techniques on their respective protocols in terms of energy and time consumption. This is done to measure the cost incurred by the routing protocols in the form of routing overhead and latencies. A novel contribution of this work is the enhancement in search set values and intervals of routing algorithms to improve the efficiency of selected existing protocols. A detailed comparison analysis of selected protocols with their default and enhanced routing algorithms in NS-2 is also a part of this work.

A new way of achieving multi-path routing in wireless networks

In the 21st century, the wireless technology is still developing rapidly and trying to be 'Faster, Higher, and Stronger': faster data rate, higher bandwidth and stronger connectivity. Wireless Mesh Networks (WMN) have been envisioned as an important solution to the next generation wireless networking which can be used in wireless community networks, wireless enterprise networks, transportation systems, home networking and last-mile wireless internet access. They also provide a cheap, quick and effective way for building wireless data networks. Considering the nature of these networks, routing is a key process for operating the WMN. This paper proposes a new way of creating multi-path routing protocols based on a fusion between multicast and unicast routing protocols to get different routes (node-disjoint or link-disjoint) from the source to its destination. The simulation results using Network Simulator 2 (NS-2) show that our new Multi-path Routing Protocol (Fusion) outperforms Ad hoc On-Demand Distance Vector (AODV) and Ad hoc On-demand Multi-path Distance Vector (AOMDV) routing protocols in terms of average network throughput, end-to-end delay, and number of flows.

An Energy Proficient Load Balancing Routing Scheme for Wireless Sensor Networks to Maximize Their Lifespan in an Operational Environment

Owing to the limited resources of sensor nodes, we propose an efficient hybrid routing scheme using a dynamic cluster-based static routing protocol (DCBSRP), leveraging the ad hoc on-demand distance vector (AODV) routing protocol and low-energy adaptive clustering hierarchy (LEACH) protocol. In the proposed scheme, the cluster head (CH) nodes are formed dynamically for a fixed interval, whereas static routing is applied in the designated clusters by utilizing the AODV routing protocol. The static routing condition of the proposed scheme limits all connected nodes of the cluster for a defined interval of time (T) to share their collected information through a specific CH node. Once the time (T) interval is completed, all ordinary nodes connected with the specific CH are released and they are free to advertise their CH candidateship within the network. Likewise, the node receiving the maximum number of route replies (RREPs) is selected as the next CH node in the vicinity of deployed sensor nodes. However, with the DCBSRP protocol, the recently selected CH node does not advertise its candidateship for five consecutive cycles and acts as an ordinary node. The simulation result shows significant improvement in the lifetime and participation of ordinary nodes in the network until the end-stage of the network. In the proposed scheme, the participation of ordinary nodes in the network is 95.9 %, which not only balances load between participating nodes but also improves the network lifetime in the presence of field-proven schemes. Moreover, the simulation results show an out-performance of rival schemes in terms of communication cost, end to end delay, throughput, packet lost ratio, and energy consumption.

Ecological environment fuzzy networking system protection based on optical fiber intelligent network

The optical fiber network has the characteristics of providing users with wider bandwidth and supporting the changing needs of more users. At the same time, the optical fiber network can also reduce the network infrastructure investment. The traditional Ad Hoc On-demand Distance Vector (AODV) algorithm does not consider the impact of node movement on the network, and the link disconnection frequently occurs during the routing process. The ant colony algorithm based on swarm intelligence only considers the unique factor of pheromone concentration to find the optimal path through multiple iterations, which will increase the complexity of the algorithm and affect the route establishment delay. In response to the above problems, this paper proposes a routing algorithm based on fuzzy logic. The algorithm can comprehensively consider the three factors of node location, mobility and signal strength, and greatly reduces the complexity of the algorithm. This paper gives a detailed definition of profust reliability of the Ethernet Passive Optical Network (EPON) system for distribution network communication and obtains the profust reliability parameters based on Monte Carlo simulation. After that, the reliability of profust under different networking modes was simulated, and the influence of network scale, component failure rate, component repair time and other parameters on the reliability of EPON networking profust was analyzed. The fuzzy probist reliability analysis method uses analytical methods, which are commonly used to deal with end-to-end reliability analysis problems and has certain limitations. Profust reliability analysis treats the system as a whole, which is more suitable for the reliability of complex end-to-multi-end systems.

Impact of wormhole attack on AODV routing protocol in vehicular ad-hoc network over real map with detection and prevention approach

Vehicular Ad-hoc Network (VANET) is a subclass of Mobile Ad-hoc Network (MANET) which provides the safety measure and other different applications to the drivers of the vehicles. The goal of VANET is to fulfil the requirements of users on roadside area, which improves the safe and comfortable journey. Secure routing is the main issue in VANET. Dynamic topology and wireless networking makes the VANET vulnerable to numerous sorts of attacks. Wormhole is one of the extreme assaults in VANET. This type of attack disturbs the working of routing protocol such as Ad hoc On demand Distance Vector (AODV) routing protocol. The motivation of this research work is that by using proposed detection and prevention approach the VANET can be made more secure. The results show how the performance of AODV routing protocol is affected by wormhole. In this research paper the impact of wormhole attack is analysed in terms of throughput, packer delivery ratio, and end-to-end delay. An approach is also proposed to detect and prevent wormhole attack in VANET over a real map on different vehicle densities based on multipath concept.

Impact of wormhole attack on AODV routing protocol in vehicular ad-hoc network over real map with detection and prevention approach

Vehicular Ad-hoc Network (VANET) is a subclass of Mobile Ad-hoc Network (MANET) which provides the safety measure and other different applications to the drivers of the vehicles. The goal of VANET is to fulfil the requirements of users on roadside area, which improves the safe and comfortable journey. Secure routing is the main issue in VANET. Dynamic topology and wireless networking makes the VANET vulnerable to numerous sorts of attacks. Wormhole is one of the extreme assaults in VANET. This type of attack disturbs the working of routing protocol such as Ad hoc On demand Distance Vector (AODV) routing protocol. The motivation of this research work is that by using proposed detection and prevention approach the VANET can be made more secure. The results show how the performance of AODV routing protocol is affected by wormhole. In this research paper the impact of wormhole attack is analysed in terms of throughput, packer delivery ratio, and end-to-end delay. An approach is also proposed to detect and prevent wormhole attack in VANET over a real map on different vehicle densities based on multipath concept.

Performance Analysis of Routing Protocols for UAV Communication Networks

The design of routing protocol is an important and key problem in unmanned aerial vehicle (UAV) communication networks. In low altitude environment, UAV information transmission is a complex task. It is an important scientific challenge to design a routing protocol that can provide efficient and reliable node to node packet transmission. This paper develops a more realistic simulation environment based on OPNET 14.5, and performs performance tests and comparisons on four classic routing protocols: Ad Hoc on demand distance vector (AODV), dynamic source routing (DSR), optimized link state routing (OLSR), and geographic routing protocol (GRP). The performance parameters such as network delay, traffic received, data dropped and throughput are compared and analyzed. The experimental results indicate that different routing protocols can be adapted to different UAV communication network scenarios. Therefore, the quantitative results can provide pertinent reference for choosing the best routing protocol in different scenarios.

Anomaly-based Detection of Blackhole Attacks in WSN and MANET Utilizing Quantum-metaheuristic algorithms

Wireless sensor network (WSN) comprises various distributed nodes that are physically separated. Nodes are constantly applying for sensing their environment. If the information sensitivity coefficient is very high, data should be conveyed continually and also with confidentially. WSNs have many vulnerability features because of data transferring on the open air, self-organization without reformed structure, bounded range of sources and memory, and limited computing capabilities. Therefore, the implementation of security protocols in WSN is inescapable. According to the resemblance between WSN and biotic reaction to the real menace in nature, bio-inspired approaches have variant rules in computer network investigations. In this paper, we exploited an ant colony optimization (ACO) algorithm based on Ad-hoc On-Demand Distance Vector (AODV) protocol for detection of black hole attacks. Finally, the Grover quantum metaheuristic algorithm is applied to optimize attack paths detection. The results gained from extensive simulations in WSN proved that the proposed approach is capable of improving some fundamental network parameters such as throughput, end-to-end delay, and packet delivery ratio in comparison with other approaches.