Ad Hoc On-demand Distance Vector Research Articles

The Impact of selfishness Attack on Mobile Ad Hoc Network

Mobile Ad-Hoc Network (MANET) is an infrastructure-less network that has the ability to configure itself without any centralized management. The topology of MANET changes dynamically which makes it open for new nodes to join it easily. The openness area of MANET makes it very vulnerable to different types of attacks. One of the most dangerous attacks is selfishness attack. In this type of attack, each node tries to save its resources, behave selfishly or non-cooperatively by not forwarding packets that are generated by other nodes. Routing in MANET is susceptible to selfishness attack and this is a crucial issue which deserves to be studied and solved. Therefore, the main objective of this paper is to study the impact of selfishness attack on two routing protocols namely, Ad hoc On-Demand Distance Vector (AODV) and Destination Sequenced Distance Vector (DSDV), as a try to find the most resistant routing protocol to such attack. The contribution of this paper is a new Selfishness Attack Model (SAM) which applies selfishness attack on the two chosen routing protocols in the NS-2 simulator. According to the conducted simulation results, AODV shows higher performance than DSDV under the effect of selfishness attack.

Performance Improvement in MANET Routing by Paradigm Shifting Through Mobile Agent Approach

A wireless network of self-organizing infrastructure-less mobile devices is known as Mobile Ad-hoc Network (MANET). In such kind of a network, no device is restricted to connect to any other device. This might be the case that each of the devices is performing the job of a router. The major problem that lies in such a network is that there exists no centralized controlling system. The absence of a controlling system and random change in nodes’ position, congestion, delay and lack of sufficient remaining energy results in inconvenient transfer of data which consequently leads to delay, more power consumption, extra overheads, etc. These issues may be resolved by using Quality of Service (QoS) routing protocols. The problem with the usage of routing protocols is that no single protocol is self-sufficient for all the issues and the usage of multiple protocols makes the processing even more complex. This presents a dire need of development of a different approach to address the problem, and mobile agent may be considered as one of the solutions with reduced complexity by taking multiple QoS metrices together. So, in this paper we are trying to improve the QoS of MANET routing with mobile agent technology and also compared it with traditional AODV(Ad-hoc On-demand Distance Vector) routing model and non-mobile agent based SECQDR (Stable Energy efficient QoS based Congestion and Delay aware Routing) routing model. Simulation results are compared with respect to end-to-end delay, energy consumption and routing overheads, etc

Energy Efficiency in Ad-Hoc On Demand Distance Vector and Dynamic Source Routing Protocols Using High Energy First Algorithm for Mobile Ad-Hoc Networks

The main issue that occurs in battery powered applications in Mobile Ad Hoc networks (MANETs) is energy efficiency. Routing protocols are mainly based on energy related parameters which are used to extend the lifetime of networks. In most of the situations Shortest path routing protocols are used in MANETs which do not consider the energy awareness. Hence power failure of the nodes affect the life time of the network. In this paper we focus on Energy efficiency in Ad-hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocol by using High Energy First (HEF) algorithm to overcome the shortcomings that occur in MANETs due to increase in node density. Simulations are performed using NS-2 and we have compared the performance of AODV and DSR using HEF with the performance of existing DSR and AODV to prove the maximization of lifetime of the network. Simulation results show that the proposed protocols with HEF are efficient than the existing protocols.

Comparative Study of Two Reactive Routing Protocols with Realistic Mobility Model

A Mobile Ad-hoc Networks (MANETs) are dynamic wireless networks that can be formed without the need for any existing infrastructure in which each node can act as a host as well as a router. One of the main challenges of MANETs is the design of robust routing protocols that adapt to the frequent and randomly changing network topology. A variety of routing protocols have been proposed and several of them have been extensively simulated or implemented. In this study, we compare and evaluate the performance of two reactive routing protocols namely: The Ad-hoc On-Demand distance Vector (AODV) routing protocol, which is unipath and Ad-hoc On-Demand Multipath Distance Vector (AOMDV) routing protocol. We observed that the results of AODV significantly outperformed that of the AOMDV in most cases contrary to the report that AOMDV outperformed AODV, but concerning in the literature that the selection of the mobility model has a significant impact the performance of the routing protocol.

A Blackhole Attack Mitigation Algorithm in MANET based on Standard Deviation Outlier Detection

A mobile ad hoc network (MANET) performs a routing and data forwarding obligations in a trustless environment where mobile nodes are not controlled and administered by third parties, it usually suffers from multiple attacks such as the blackhole attacks. This blackhole attacks cause two extreme effects on the network if the malicious nodes are not eliminated. Firstly, it deliberately alters the original data route sequence with an injection of false routing information comprises of the counterfeit destination sequence number and smallest hop count. Secondly, it becomes too greedy to send data to other nodes after receiving from a genuine node. Therefore, this may delay the data transmission process in the act of data dropping. To protect the routing discovery process of an ad hoc on-demand distance vector (AODV) protocol from the blackhole attack, we present a mitigation algorithm based on standard deviation outlier detection to determine a threshold value for validating the route reply (RREP) destination sequence number before route establishment. The simulation shows that the algorithm can detect the malicious nodes and performs better than AODV in a blackhole attack environment.

Preventing Collaborative Black Hole Attack in IoT Construction Using a CBHA–AODV Routing Protocol

Workers or labors who are working in construction sites are prone to severe risks such as death, injuries happened due to accidents, falls and stuck in between objects. Internet of things (IoT) based sensors can be utilized to monitor the behavior of workers when they are in danger zones/areas. To safeguard site workers, supervisors or site managers should monitor and alert them when they are in danger. Data will be routed from site worker to supervisor, during this routing process data is subjected to routing attacks such as black hole attack and so on, due to wireless transmission. This article addresses the problem of black hole attack that happens during the wireless transmission between nodes and the base station (BS) of IoT-based civil construction. The proposed solution Collaborative Black Hole Attack – Ad Hoc On-Demand Distance Vector routing protocol (CBHA-AODV) prevents the collaborative black hole attack by 87.72%.

Comparison of AODV and DSR in MANET’s

MANET acronym for Mobile Ad-hoc Network is a wireless network that is it operates without any physical fixed infrastructure and does not need any centralized access point. Mobile network is wireless in nature that is any node can be part of this network. Different routing protocols exist in a network like reactive, proactive and hybrid. They may be better in one network while nastiest in the other. In this paper we have made an effort for the comparison of the performance of AODV (Ad-hoc On Demand Distance Vector) and DSR (Dynamic source routing) on simulation tool like NS-2 on the basis of various parameters like packet delivery ratio, delay and average throughput.

Efficient and Reliable Communication to Reduce Broadcast Storm in Rural and Urban Scenario using RGHN and UGHN Protocol

In order to reduce overhead and to improve throughput an effective in Rural Group Head Node(RGHN) and Urban Group Head Node (UGHN) protocol can be implemented in the respective rural and urban scenarios. The first section deals with the efficient implementation of RGHN and UGHN protocols in VANET. In the next phase, working of RGHN in rural areas and UGHN protocol in urban areas are described and the performance analyzed. The developed protocol RGHN and UGHN needs comparison with the standard protocols under both the scenarios. The performance of the proposed protocol RGHN in rural scenario is compared with that of Dynamic Source Routing (DSR) and UGHN in urban scenario is compared with Ad-hoc On demand Distance Vector (AODV) shows the proposed technique providing a better result in terms of throughput, packet delivery ratio, delay and packet loss ratio in the network.

Safe Route Discovery for Vehicles using VANET

People travelling by vehicles to reach their desired destination find difficult to choose the safe route. A road may be damaged due to natural calamities and not be safe for vehicles. Those who are travelling long distances will not have enough knowledge regarding the safety of the road. An IoT device monitors road conditions and generate an alert message. The message is generated when water level reaches threshold level. Data analysis algorithm is employed to detect the safe route using previous conditions. The message is transmitted to a Road Side Unit (RSU) which then broadcasts it to a vehicle. The vehicle then sends the message to next nearest vehicle. This broadcasting happens until all vehicles within a range receives the message. Other Road Side Units helps in improving the signal strength of the message. RSU’s can also send message to vehicle if there is failure in Vehicle-Vehicle Communication. Protocol used for message broadcasting is Adhoc On-Demand Distance Vector Routing (AODV). It is slightly modified to improve efficiency and accuracy. Based on the alert message received vehicular nodes can take different path that is safe to reach the destination.

Evaluating TCP performance of routing protocols for traffic exchange in street-parked vehicles based fog computing infrastructure

As most vehicles remain parked 95% of its time, this suggests that leveraging the use of On-board Units (OBUs) in parked vehicles would provide communication and computation services to other mobile and fixed nodes for delivery of services such as multimedia streaming, data storage and data processing. The nearby vehicles can form an infrastructure using IEEE 802.11p communication interface, facilitating communication, computation and storage services to the end users. We refer to this as a Vehicular Fog Computing (VFC) infrastructure. In this study, using NS-2 simulator, we investigate how six routing protocols consisting of two proactive routing protocols, Destination Sequence Destination Vector (DSDV) and Fisheye State Routing (FSR); two reactive routing protocols, Ad Hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR); and two geographic routing protocols, Distance Routing Effect Algorithm for Mobility (DREAM) and Location Aided Routing (LAR) perform when forwarding TCP traffic among the parked vehicles that form a VFC infrastructure in an urban street parking scenario. In order to reflect an urban street parking scenario, we consider a traffic mobility traces that are generated using SUMO in our simulation. To the best of our knowledge, this work is the first effort to understand how vehicle density, vehicle speed and parking duration can influence TCP in an urban street parking scenario when packet forwarding decision is made using proactive, reactive and geographic routing protocols. In our performance evaluation, positive results are observed on the influence of parking duration in parked vehicles as TCP performance in all routing protocols increases with longer parking duration. However, variable speed in parked vehicles and moving vehicles in an urban street parking scenario may not have significant influence on TCP performance, especially in case of reactive and proactive routing protocols. Further, our findings reveal that vehicle density in a VFC infrastructure can noticeably influence TCP performance. Towards the end of the paper, we delineate some important future research issues in order to improve routing performance in a street-parked vehicle based VFC infrastructure.

Performance analysis of static wireless body area network for different routing protocols

Wireless body area network (WBAN) is a special type of wireless sensor network. It consists of sensors mounted on a human body to measure important body parameters. WBAN network uses different technologies such as IEEE 802.11, IEEE 802.15.4 and IEEE 802.15.6. In this paper, research outcomes focused on WBAN architecture design and performance analysis in a simulation environment for different routing protocols are done for IEEE 802.15.6. A comparative report is prepared for WBAN technology. Routing protocols are compared with each other based on energy consumption, throughput, and delay. For simulation purposes, a sensor network is designed by placing three sensors in a single hop star topology with a single central hub. The test run was successfully carried out to check the network configuration. A performance of three routing protocols for WBAN wireless technologies is investigated. These three routing protocols include AODV (Ad hoc On-Demand Distance Vector routing), DSDV (Destination Sequenced –Distance Vector routing) and DSR (Dynamic Source Routing). In three sets of simulation, the effect of various routing protocols on throughput, delay, and the energy consumption is calculated by increasing packet rate up to 2000 Kbps with an increment of 250 Kbps. Simulation results have shown that WBAN with AODV routing protocol is the most suitable to reduce power consumption and delay, and to increase throughput. Detailed analysis is discussed in the paper. Â

Energy Optimized Routing Protocol Based on Binary Particle Swarm Optimization Successive Interference Cancellation for WSN

A large variety of Wireless Sensor Network (WSN) applications encourage researchers to develop and improve protocols and algorithms for rising challenges. During data transmission, energy consumption is main issue because sensor nodes have limited energy capacity. In fact, WSN needs load balancing algorithms that keep use of the limited energy source to route the collected data to the receiving node. While considering adhoc network in sensitive areas, one amongst the necessary aspects to consider is energy as a result of while sending information all communicating nodes exhausts its battery life. For mobile nodes in adhoc situation one and only one source of energy is battery. As compared to single path multipath routing helps to find best path that needs less energy and enhances the network life. In this paper an energy efficient routing protocol is proposed. In routing algorithm, route that have shortest path among multipaths chosen by particle swarm optimization algorithm. Among these shortest paths, that path is chosen that need minimum route selection parameter. The proposed algorithm is based on selection of energy efficient paths from multiple shortest SIC path from source to destination. For selection Binary Particle Swarm Optimization (BPSO) algorithm is applied. The Binary Particle Swarm Optimization (BPSO) algorithm selects energy efficient route among different shortest paths. The k-shortest route is selected on the basis of bandwidth and minimum SIC. The performance of the proposed algorithm is compared with multipath Ad hoc On-Demand Distance Vector (AODV) routing protocol and concluded that BPSO optimized energy efficient path is more efficient with respect to remaining energy of the network. The result is analyzed with variable number of packets send.

Fuzzy based Combined Trust Scheme for Secure Routing in MANET (FCTRS)

Mobile Ad Hoc network (MANET) is a self-configuring network consisting of mobile nodes without any fixed infrastructure. However due to the nodes has not any fixed infrastructure in MANET, it is susceptible to various security attacks like data modification, information sniff, due to low energy, computing ability and bandwidth. In MANET Black hole is also an attack and it is difficult to detect and prevent. The lack of quality in security aspects of ad-hoc routing protocols won’t provide reliability in the data packets movement between source and destination nodes. Implementing the routing decision with trust is an important one in the MANNET security. Hence, this research work propose an enhanced Fuzzy based combined trust scheme (FCTRS) based on public trust and Quality of Service (QoS) trust to detect black hole attack. It provides secure routing based on certificate authority (CA) to improve the performance of Ad-hoc On-demand Distance Vector (AODV). The results will show the performance improvement of proposed protocol over Enhanced Trusted Routing Scheme with Pattern Discovery (ETRS-PD) and the protocol AODV. The metrics in the performance of network examined with different conditions of mobility and the presence of black hole node positions.

Failure history-based routing protocol for mobile ad hoc networks

Mobile Ad-hoc NETworks (MANETs) are defined as a collection of mobile nodes that cooperate in order to operate. Nodes in MANETs should build and maintain routes in order to communicate. A routing algorithm is used to manage these routes. MANETs have dynamic topology because of node mobility. The probability of route failure increases when intermediate nodes have higher mobility. This study will propose a routing protocol that depends on the failure history of the nodes from which the route will constructed. The proposed protocol will be implemented over the existing Ad hoc On-Demand Distance Vector (AODV) routing protocol. It is expected that the proposed protocol will improve the packet delivery ratio in the network.Â

Performance Evaluation of Cognitive Internet on Things Under Routing Attacks

Background & Objective:: In past few years, Cognitive Radio (CR) paradigm has emerged as a promising and revolutionary solution to avoid problems of spectrum paucity and inefficiency in spectrum usage. Efficiently utilization of the spectrum offers high network performance. CRs are proficient to identify and adopt the unused spectrum in order to allow secondary users to occupy it without interfering the primary user’s activity. Cognitive Internet on Things (CIoT) is an integration of several technologies and communication solutions which can be effectively realized as Cognitive Radio Adhoc Networks (CRAHN). In CRANH, on-demand routing protocols are the best suitable protocols due to their dynamic feature of available un-utilized channel/spectrum selection. Methods: Here, firstly, Ad-Hoc On-Demand Distance Vector (AODV) routing protocol has been modified and further evaluated to address route selection challenges in CIoT framework. Secondly, the effects on network performance under network layer routing attacks (i.e. blackhole attack, byzantine attack and flooding attacks) are evaluated. Conclusion: The simulations results demonstrate network performance increase with more channels and degrade differently under attacks.

Wireless Sensor Network Energy Model and Its Use in the Optimization of Routing Protocols

In this study, a Wireless Sensor Network (WSN) energy model is proposed by defining the energy consumption at each node. Such a model calculates the energy at each node by estimating the energy of the main functions developed at sensing and transmitting data when running the routing protocol. These functions are related to wireless communications and measured and compared to the most relevant impact on an energy standpoint and performance metrics. The energy model is validated using a Texas Instruments CC2530 system-on-chip (SoC), as a proof-of-concept. The proposed energy model is then used to calculate the energy consumption of a Multi-Parent Hierarchical (MPH) routing protocol and five widely known network sensors routing protocols: Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), ZigBee Tree Routing (ZTR), Low Energy Adaptive Clustering Hierarchy (LEACH), and Power Efficient Gathering in Sensor Information Systems (PEGASIS). Experimental test-bed simulations were performed on a random layout topology with two collector nodes. Each node was running under different wireless technologies: Zigbee, Bluetooth Low Energy, and LoRa by WiFi. The objective of this work is to analyze the performance of the proposed energy model in routing protocols of diverse nature: reactive, proactive, hybrid and energy-aware. Experimental results show that the MPH routing protocol consumes 16%, 13%, and 5% less energy when compared to AODV, DSR, and ZTR, respectively; and it presents only 2% and 3% of greater energy consumption with respect to the energy-aware PEGASIS and LEACH protocols, respectively. The proposed model achieves a 97% accuracy compared to the actual performance of a network. Tests are performed to analyze the consumption of the main tasks of a node in a network.

ANALYSIS OF BLACK HOLE ATTACK DURING ROUTE DISCOVERY PHASE OF AODV IN MANET

MANET (Mobile ad hoc networks) is a collection of wireless mobile nodes dynamically forming an infrastructure less network. Several routing protocols are designed for routing of packets in MANET. One of them is AODV (Ad hoc on demand Distance Vector) protocol whose performance is better for higher mobile nodes. It is more vulnerable to black hole attack by the malicious node. Black hole attack is a network layer attack in MANET that tries to hamper the routing process. During route discovery phase it sends false reply to the nodes and dropped data packets. In this paper, first we have implemented black hole attack in AODV and then analyzed the impact of black hole attack under deferent metrics like throughput, packet delivery ratio and packet loss. Simulator NS-2.35 is used for implementation and result analysis.

EPLAODV: Energy Priority and Link Aware Ad-hoc On-demand Distance Vector Routing Protocol for Post-disaster Communication Networks

EPLAODV: Energy Priority and Link Aware Ad-hoc On-demand Distance Vector Routing Protocol for Post-disaster Communication Networks

EPLAODV: Energy Priority and Link Aware Ad-hoc On-demand Distance Vector Routing Protocol for Post-disaster Communication Networks

In Mobile Ad-hoc Networks (MANETs) the major issue between nodes for data transfer is link quality. The majority of the MANET routing protocols try to maintain the link quality between nodes but still need improvement. This paper focuses on link quality between nodes in an ad hoc network in emergency scenarios through the design of the Energy Priority and Link Aware Ad-hoc On Demand Distance Vector (EPLAODV) routing protocol. EPLAODV improves the link quality between nodes through SNR. For performance analysis, the NS2.35 network simulator was used. Simulation time and traffic load were the major simulation parameters. From the simulation results, it is observed that EPLAODV performs better than AODV.

AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN'S

In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.