Showing papers on "Ad hoc On-Demand Distance Vector Routing published in 2018"

A Blockchain-Based Contractual Routing Protocol for the Internet of Things Using Smart Contracts

Abstract: In this paper, we propose a novel blockchain-based contractual routing (BCR) protocol for a network of untrusted IoT devices. In contrast to conventional secure routing protocols in which a central authority (CA) is required to facilitate the identification and authentication of each device, the BCR protocol operates in a distributed manner with no CA. The BCR protocol utilizes smart contracts to discover a route to a destination or data gateway within heterogeneous IoT networks. Any intermediary device can guarantee a route from a source IoT device to a destination device or gateway. We compare the performance of BCR with that of the Ad-hoc On-Demand Distance Vector (AODV) routing protocol in a network of devices. The results show that the routing overhead of the BCR protocol is times lower compared to AODV at the cost of a slightly lower packet delivery ratio. BCR is fairly resistant to both Blackhole and Greyhole attacks. The results show that the BCR protocol enables distributed routing in heterogeneous IoT networks.

Detecting and Isolating Black-Hole Attacks in MANET Using Timer Based Baited Technique

Abstract: Mobile Ad hoc Network (MANET) is a type of wireless networks that provides numerous applications in different areas Security of MANET had become one of the hottest topics in networks fields MANET is vulnerable to different types of attacks that affect its functionality and connectivity The black-hole attack is considered one of the most widespread active attacks that degrade the performance and reliability of the network as a result of dropping all incoming packets by the malicious node Black-hole node aims to fool every node in the network that wants to communicate with another node by pretending that it always has the best path to the destination node AODV is a reactive routing protocol that has no techniques to detect and neutralize the black-hole node in the network In this research, we enhanced AODV by integrating a new lightweight technique that uses timers and baiting in order to detect and isolate single and cooperative black-hole attacks During the dynamic topology changing the suggested technique enables the MANET nodes to detect and isolate the black-hole nodes in the network The implementation of the proposed technique is performed by using NS-235 simulation tools The results of the suggested technique in terms of Throughput, End-to-End Delay, and Packet Delivery Ratio are very close to the native AODV without black holes

Flying Adhoc Network (FANETs): Simulation Based Performance Comparison of Routing Protocols: AODV, DSDV, DSR, OLSR, AOMDV and HWMP

Abstract: In the last few years, new networking paradigms are evolving from MANETs like VANETs, FANETs, SEANETs etc. Flying Adhoc Networks are attracting interests as UAV vehicles are deployed in tremendous real-time applications. UAVs when connected together work cooperatively and in best coordination forming “Flying Adhoc Networks” (FANETs). FANETs are primarily designed to operate in different missions and rapidly changing environments. Therefore, it is utmost requirement to develop efficient routing protocols considering the nature of applications and services for deploying UAVs. However, lots of routing protocols are proposed till date but every protocol has certain limitations. The aim of this research paper is to analyze various routing protocols like AODV, DSDV, DSR, OLSR, AOMDV, HWMP for evaluating FANETs performance in real-time operations. Simulation based testing is done using NS-2 and it is observed that HWMP and OLSR performs suitably well in dynamic environments of FANETs.

F-Ant: an effective routing protocol for ant colony optimization based on fuzzy logic in vehicular ad hoc networks

Abstract: Vehicular ad hoc networks (VANETs) are a subset of mobile ad hoc networks that provide communication services between nearby vehicles and also between vehicles and roadside infrastructure. These networks improve road safety and accident prevention and provide entertainment for passengers of vehicles. Due to the characteristics of VANET such as self-organization, dynamic nature and fast-moving vehicles, routing in this network is a considerable challenge. Swarm intelligence algorithms (nature-inspired) such as ant colony optimization (ACO) have been proposed for developing routing protocols in VANETs. In this paper, we propose an enhanced framework for ACO protocol based on fuzzy logic for VANETs. To indicate the effectiveness and performance of our proposed protocol, the network simulator NS-2 is used for simulation. The simulation results demonstrate that our proposed protocol achieves high data packet delivery ratio and low end-to-end delay compared to traditional routing algorithms such as ACO and ad hoc on-demand distance vector (AODV).

MANET Routing Protocols Evaluation: AODV, DSR and DSDV Perspective

Abstract: Mobile Ad Hoc Network (MANET) is a set of mobile nodes that communicate with each other to configure an immediate network without utilizing any of infrastructure, the centralized access point or centralized administration in multiple hop manner. There are a lot of routing protocols have been proposed in MANET which are different from each other in the performance and the mechanism. Therefore, the performance study of those protocols in different scenarios is needed. This paper presents the performance comparison between Dynamic Source Routing (DSR), Ad hoc on demand distance Vector Routing (AODV) as reactive routing protocols and Destination Sequenced Distance Vector (DSDV) as a proactive routing protocol to precisely determine which protocol is more effective. Network Simulator (NS) version 2.35 has used to simulate and evaluate the performance of these protocols in terms of the packet delivery ratio, average throughput, average end-to-end delay, and packet loss ratio with respect to the variable number of nodes.

GreeAODV: An Energy Efficient Routing Protocol for Vehicular Ad Hoc Networks

Abstract: VANETs allow communications among vehicles, and vehicles with the roadside infrastructure, namely Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) respectively, in smart cities. Due to the number of vehicles, the infrastructure elements, the size of scenarios and mobility of nodes, the energy consumed to discover routes between source and destination nodes and to transmit applications packets can be high. In this paper, we propose a GreeDi based reactive routing protocol aimed at selecting the most efficient route in terms of energy consumption between two nodes in VANETs. The route selection is based on the power consumed by the intermediate nodes between the source and destination nodes. The proposed algorithm has been evaluated in city map-based VANET scenarios. The simulation results confirm that the proposed algorithm outperforms the original AODV in terms of power consumption. Furthermore, a computational Intelligence driven approach to address the challenge of energy efficient routing optimisation, is discussed.

Fuzzy Logic Based Reliable and Real-Time Routing Protocol for Mobile Ad hoc Networks

Abstract: MANET (mobile ad-hoc network) includes a set of wireless mobile nodes which communicate with one another without any central controls or infrastructures and they can be quickly implemented in the operational environment. One of the most significant issues in MANETs is concerned with finding a secure, safe and short route so that data can be transmitted through it. Although several routing protocols have been introduced for the network, the majority of them just consider the shortest path with the fewest number of hops. Hop criterion is considered for simple implementation and it is reliable in dynamic environments; however, queuing delay and connection delay in the intermediate nodes are not taken into consideration for selecting route in this criterion. In this paper, a fuzzy logic-based reliable routing protocol (FRRP) is proposed for MANETs which selects stable routes using fuzzy logic. It is able to optimize system efficiency. The score allocated to routes are based on four criteria: accessible bandwidth, the amount of energy of battery, the number of hops and the degree of dynamicity of nodes. The simulation results obtained from OPNET simulator version 10.5 indicate that the proposed protocol, in comparison with ad hoc on-demand distance vector (AODV) and fuzzy-based on-demand routing protocol (FBORP), was able to better improve packet delivery rate, average end-to-end delay and throughput.

Mobility aware and dual phase AODV protocol with adaptive hello messages over vehicular ad hoc networks

Abstract: Establishing stable routes over high mobility networks is a challenging field and consequently brought the attention of a lot of current researchers. In this article, a new reactive routing protocol has been proposed which is considered as a major extension of both Ad-hoc On-demand Distance Vector (AODV) and Mobility and Direction Aware AODV (MDA-AODV) prior routing protocols. It is named as Mobility Aware and Dual Phase Ad-hoc On-demand Distance Vector with Adaptive Hello Messages (MA-DP-AODV-AHM). It primarily concentrates on building routes considering vehicles’ speeds and direction of motion with respect to source vehicles, thereby establishing more stable routes and reducing the route breakages. Not only to this extent, but rather, we proposed an adaptive control packet announcement mechanism, which is directly connected to the periodic hello messages approach, with vehicles’ speeds, yielding a significant reduction in the amount of control overhead and congestion over the network. Moreover, the new protocol is proposed to alternate working among two phases, for the reason of guaranteeing the generation of efficient routes on a timely basis, which include MA-DP-AODV-AHM and AODV protocols. Our protocol has been evaluated in terms of control overhead, end-to-end delay, and energy consumption using QualNet simulator version 7.1 in which enormous simulations have been conducted under the base of vehicle density, packet rate, and constant bit rate connections. Simulation results summarize that MA-DP-AODV-AHM contributes efficiently in mitigating the network instability through generating effective stable routes and reducing link failures. Furthermore, it has proved its superiority over AODV and MDA-AODV.

A Flocking-Based on Demand Routing Protocol for Unmanned Aerial Vehicles

Abstract: The interest shown by some community of researchers to autonomous drones or UAVs (unmanned aerial vehicles) has increased with the advent of wireless communication networks. These networks allow UAVs to cooperate more efficiently in an ad hoc manner in order to achieve specific tasks in specific environments. To do so, each drone navigates autonomously while staying connected with other nodes in its group via radio links. This connectivity can deliberately be maintained for a while constraining the mobility of the drones. This will be suitable for the drones involved in a given path of a given transmission between a source and a destination. This constraint could be removed at the end of the transmission process and the mobility of each concerned drone becomes again independent from the others. In this work, we proposed a flocking-based routing protocol for UAVs called BR-AODV. The protocol takes advantage of a well known ad hoc routing protocol for on-demand route computation, and the Boids of Reynolds mechanism for connectivity and route maintaining while data is being transmitted. Moreover, an automatic ground base stations discovery mechanism has been introduced for a proactive drones and ground networks association needed for the context of real-time applications. The performance of BR-AODV was evaluated and compared with that of classical AODV routing protocol and the results show that BR-AODV outperforms AODV in terms of delay, throughput and packet loss.

An Adaptive Emergency Broadcast Strategy for Vehicular Ad Hoc Networks

Abstract: In recent years, since the adoption of the IEEE 802.11p and IEEE 1609 standards, Vehicular Ad hoc Networks (VANETs) have received a significant amount of attention in Ad hoc Network studies. Vehicular safety applications have thus played an important role in VANETs, and many emergency broadcast systems have been proposed. However, some of these broadcast mechanisms might result in the broadcast storm problem. The emergency broadcast strategy proposed in this paper is that when a car accident occurs, the vehicle’s sensors detect impacts and immediately send emergency messages to inform other vehicles nearby. In addition, we propose a way to eliminate redundant broadcasts and to ensure that emergency messages can be transmitted properly. We propose a stability function to estimate the reliability of the transponder. The backoff procedure of this proposed method assigns appropriate waiting times to different forwarders. The proposed scheme is implemented with NS2 simulator based on WAVE/DSRC standards. Simulation results show that the proposed protocol exhibits outstanding performance in terms of forwarding counts, packet loss rate, and delay time in different environments. In addition, our protocol maintains stability in different vehicle density scenarios so that each vehicle receives emergency messages and holds a low latency to ensure that the driver has adequate safety response time to enhance traffic safety.

Security Enhancement in MANETs Using Fuzzy-Based Trust Computation Against Black Hole Attacks

Abstract: Mobile ad hoc networks (MANETs) are much more susceptible to routing attacks as compared to wired networks and infrastructure-based wireless networks. MANETs lack infrastructure and trusted centralized authority, thereby vulnerable to black hole attacks. This paper presents novel approach based on weighted binary relational fuzzy trust model to mitigate black hole attacks in ad hoc on demand distance vector (AODV) protocol. It uses trust computing approach, which is by default a fuzzy approach. Direct trust computation method is applied to determine malicious nodes and thereby safe route in MANETs. The results show performance improvement of proposed protocol over AODV protocol.

Performance analysis and comparison of the DSDV, AODV and OLSR routing protocols under VANETs

Abstract: Vehicle-to-Vehicle (V2V), Vehicle-to-Road Infrastructure (V2R) and Vehicle-to-Pedestrian (V2P) communications are paramount for paving the way for smarter, cleaner and safer cities and roads. We investigate on how three state-of-the-art Mobile Ad-Hoc Network (MANET) routing protocols behave over the IEEE 802.11p/WAVE stack, which has been recently been specified for Vehicular Ad-hoc Networks (VANETs): Ad-hoc On-Demand Distance Vector (AODV), Optimized Link State Routing (OLSR) and Destination-Sequenced Distance-Vector (DSDV). Based on ns-3 and BonnMotion simulations, we evaluate Packet Delivery Rate, Goodput, Routing Overhead and End-to-End Delay for different trajectories, average speeds, and network densities. Our results show that the DSDV and OLSR protocols have a better performance than AODV, for low-density and low-speed scenarios. Additionally, we have observed that when the number of Nodes (network density) or Nodes’ velocity increases, the OLSR protocol performs better than the other two.

A Hybrid Algorithm for Improving the Quality of Service in MANET

Abstract: A mobile ad-hoc network (MANET) exhibits a dynamic topology with flexible infrastructure. The MANET nodes may serve as both host and router functionalities. The routing feature of the MANET is a stand-alone multi-hop mobile network that can be utilized in many real-time applications. Therefore, identifying paths that ensure high Quality of Service (QoS), such as their topology and applications is a vital issue in MANET. A QoS-aware protocol in MANETs aims to find more efficient paths between the source and destination nodes of the network and, hence, the requirements of the QoS. This paper proposes a different hybrid algorithm that combines Cellular Automata (CA) with the African Buffalo Optimization (ABO), CAABO, to improve the QoS of MANETs. The CAABO optimizes the path selection in the ad-hoc on-demand distance vector (AODV) routing protocol. The test results show that with the aid of the CAABO, the AODV manifests energy and delay-aware routing protocol.

Evaluation of AODV and DSDV routing protocols for a FANET: Further results towards robotic vehicle networks

Abstract: Flying Ad-Hoc Network (FANET) is basically a special form of Mobile Ad-Hoc Network (MANET) which is formed by a group of wireless nodes, which can dynamically form a network to exchange information without the necessity of using a fixed network infrastructure. Its good performance and its low cost, make it suitable for use in several applications such as environment sensors, vehicular communications, disaster rescue operations, air/land/navy defense and so on. In the present work the performance evaluation of Ad hoc on Demand Distance Vector (AODV) and Destination-Sequenced Distance-Vector (DSDV) routing protocols for a FANET using the software package NS2. The metrics of delivery rate, end-to-end delay and throughput are calculated for both protocols in order to evaluate its performance in the network. Besides, an energy analysis is shown for each protocol since energy is a key technical challenge for embedded and mobile applications. These results represent the base for future development of collaborative control protocols for robotic vehicle networks.

A Review on VANET Routing Protocols and Wireless Standards

Abstract: The vehicular ad hoc network (VANET) is an ad hoc network system based on the concept of mobile ad hoc network (MANET) in which nodes (vehicle) that are being connected with each other by wireless technologies. But due to the non deterministic mobility behavior and high velocity of automobiles, the topology is unpredictable. Such types of system can work independently and can also be interconnected through internet with in its infrastructure. The system characteristics such as multi-hop paths, node mobility, huge network, device heterogeneity, congestion and bandwidth are the constraints in designing the routing protocols for VANET. The present routing protocols that have been deployed for MANET are used to test the VANET accuracy and performance. Present research efforts are strongly emphasized on designing a novel routing algorithm and its implementations. Recent VANET research are majorly focused on predefined areas such as broadcasting and routing, security, quality of service (QoS) and infotainment with information dissemination during emergencies. In this paper authors present a detailed review of wireless standards used in VANET with a number of trials in VANET and its deployment in many of the developed countries. As a conclusion we conceptualized some of the issues and research challenges in VANET that had not yet addressed so that industry can opt for widespread adoption of scalable, reliable, secure and robust VANET protocols, architectures services and technologies and enable the ubiquitous deployment of it.

Mobile Matrix: Routing under mobility in IoT, IoMT, and Social IoT

Abstract: The explosive growth of “things” connected to the Internet (Internet of Things, IoT) raises the question of whether existing ready-to-go networking protocols are enough to cover social and mobile IoT’s demands. IoT aims to interconnect static devices attached to some physical infrastructure. However, mobility is a major factor present in everyday life, and naturally the “things” can move around (Internet of Mobile Things, IoMT) and create social ties (Social IoT, SIoT) in the cyber-physical space. In that context, we present Mobile Matrix (μMatrix), a routing protocol that uses hierarchical IPv6 address allocation to perform any-to-any routing and mobility management without changing a node’s address. In this way, device mobility is transparent to the application level favoring IoMT and SIoT implementation and broader adoption. The protocol has low memory footprint, adjustable control message overhead, and it achieves optimal routing path distortion. Moreover, it does not rely on any particular hardware for mobility detection (a key open issue), such as an accelerometer. Instead, it uses a passive mechanism to detect that a device has moved. We present analytic proofs for the computational complexity and efficiency of μMatrix, as well as an evaluation of the protocol through simulations. We evaluate the protocol performance under human and non-human mobility models. For human mobility, we generated mobility traces using Group Regularity Mobility (GRM) Model, setting its parameters based on real human mobility traces. For the non-human mobility, we propose a new mobility model, to which we refer as Cyclical Random Waypoint (CRWP), where nodes move using a simple Random Waypoint and, eventually, return to their initial position. We compared μMatrix with three baseline protocols: Routing Protocol for low-power and lossy networks (RPL), Mobility Management RPL (MMRPL), and Ad hoc On-Demand Distance Vector (AODV). The results show that μMatrix and RPL offer ≈ 99.9% of bottom-up delivery rate, but only μMatrix offer ≥ 95% of top-down traffic in highly dynamic and mobile scenarios, while other protocols ≤ 75%. Moreover, μMatrix uses up to 65% of the routing table while RPL and AODV fulfill theirs in all scenarios, which leads to poor top-down and any-to-any reliability.

VANET Routing Protocols: Review, Implementation and Analysis

Abstract: Wireless technology is developing very fast. Most of the researchers are working in the field of wireless communication. VANET is an evolving technology in the field of wireless communication and with the advancement it will contribute more to the smart transportation system in days to come. VANET gives a communication framework that has enhanced the traffic service and helped in reducing the road accidents. Data sharing in this system is time sensitive and require quick and vigorous network connection forming. VANET is serving the said purposes but there are some issues and challenges like efficient handling of fast handovers for video streaming applications. Therefore, in this paper we have reviewed and discussed several studies related to the routing protocols to judge which one is the best for video applications in VANET. Moreover, after studying different systems made by the researchers, we have critically analyzed them and found advantages and disadvantages for the future works. Also, simulation is performed to check the delays and throughput comparisons between the routing protocols. Furthermore, with the experiments we have proven that the AODV performance is better than the other ad-hoc protocols in VANET environment.

Energy efficient teaching-learning-based optimization for the discrete routing problem in wireless sensor networks

Abstract: Wireless sensor networks (WSNs) are composed of sensor nodes, having limited energy resources and low processing capability. Accordingly, major challenges are involved in WSNs Routing. Thus, in many use cases, routing is considered as an NP-hard optimization problem. Many routing protocols are based on metaheuristics, such as Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO). Despite the fact that metaheuristics have provided elegant solutions, they still suffer from complexity concerns and difficulty of parameter tuning. In this paper, we propose a new routing approach based on Teaching Learning Based Optimization (TLBO) which is a recent and robust method, consisting on two essential phases: Teacher and Learner. As TLBO was proposed for continuous optimization problems, this work presents the first use of TLBO for the discrete problem of WSN routing. The approach is well founded theoretically as well as detailed algorithmically. Experimental results show that our approach allows obtaining lower energy consumption which leads to a better WSN lifetime. Our method is also compared to some typical routing methods; PSO approach, advanced ACO approach, Improved Harmony based approach (IHSBEER) and Ad-hoc On-demand Distance Vector (AODV) routing protocol, to illustrate TLBO's routing efficiency.

A novel approach for mitigating route request flooding attack in MANET

Abstract: Mobile ad-hoc network (MANET) is a temporary network in which the main requirement for establishing the communication path among nodes is that the nodes should be cooperative. However, in the presence of malicious node, the MANET's routing protocol such as AODV is vulnerable to different types of flooding attacks. The flooding attack can be continuous or selective. In the available literature, although many researchers have analyzed the network under continuous flooding attack but they have not focussed on selective flooding attack in which an attacker can sometimes behave as a normal and sometimes behave as a malicious. Most of the existing schemes use constant threshold value which lead to a false positive problem in the network. In order to address this issue, a new mechanism called as Mitigating Flooding Attack Mechanism is proposed which is based on a dynamic threshold value and consists of three phases. It makes use of several special nodes called as Flooding-Intrusion Detection System (F-IDS) that are deployed in MANETs in order to detect and prevent flooding attack. The F-IDS nodes are set in promiscuous in order to monitor the behaviour of the node. The simulation results show that the proposed mechanism improves network performance metrics in terms of PDR, throughput and reduces the routing overhead as well as normalized routing load.

An Investigational Analysis of DSDV, AODV and DSR Routing Protocols in Mobile Ad Hoc Networks

Abstract: A Mobile ad hoc network is a gathering of various data transmission node. The nodes in the MANET are movable. Due to this quality of Mobile ad hoc network, the topology is highly dynamic. There is no fixed infrastructure in this type of network. Any node that wants to transmit the data from origin node to sink node in the network, the data has to promote from one node to another node to reach the destination node. In this paper we have done a comparative investigation of three routing protocols in MANET by varying the pause time. The simulations have been made by considering the three parameters throughput, packet delivery ratio and end to end delay. The simulator used for making the comparative analysis NS-2.33. The results show that the DSR protocol outperforms the other two protocols AODV and DSDV in Throughput and packet delivery ratio and DSDV outperform the AODV and DSR in end to end delay.

A Multi-Agent Ad Hoc On-Demand Distance Vector for Improving the Quality of Service in MANETs

Abstract: The field of mobile communication has experienced great changes and growth since the advancement of computing devices and wireless technology. The need for mobile networks with minimal infrastructure that can be easily used, has been aroused by the mobility advancement of people around the world. Such kind of networks is known as Mobile Ad-hoc Networks (MANETs). The Ad Hoc On-Demand Distance Vector (AODV) is a popular routing protocol in the MANETs. Nevertheless, one issue of the AODV is the selection of routes based on minimum delay alone. Even though the delay is a significant parameter that has a direct effect on the performance of the network, other parameters such as energy consumption are necessary to establish efficiency routes. Therefore, this paper proposes employing a Multi-Agent System (MAS) for the establishment of efficient routes from the source to destination nodes in AODV, namely MAAODV protocol. The agents utilize the parameters of energy consumption, number of hops and delay to optimize the selection of the routes. The paper presents a simulation scenario to show the applicability of the proposed MAAODV routing protocol.

An Artificial Immune System based Method for Defense against Wormhole Attack in Mobile Adhoc Networks

Abstract: Mobile ad hoc networks (MANETs) are structure-less networks in which the mobile nodes are communicate wirelessly with each other’s. This wireless channel makes the MANETs vulnerable against different types of attacks. Wormhole is one of these attacks, according to which, two active attackers create a virtual private communication tunnel; reduce message normal stream and pretend two non-neighbored nodes as neighbors. In this way, the path between these two nodes is pretended as the shortest possible route between the source and the destination. Thus, all data packets passing through this route can be eliminated by these attacker nodes. This paper inspires from human immune system to design a defense mechanism against wormhole attack, called WAAIS (Wormhole Attack Artificial Immune System). In this proposed mapping, all unsecure routes, are considered as antigen. These unsecure routes are recognized by some rules, which are considered as antibody. The simulation results show that WAAIS outperforms WormPlanar and AODV in terms of packet delivery rate, average end-to-end delay and drop packets rate.

AODV–Based Routing for Payment Channel Networks

Abstract: Payment Channel Networks such as the Lightning Network (LN), Raiden or COMIT were created to tackle the scalability problems of their underlying blockchains, by moving from expensive and slow on-chain transactions to inexpensive and fast off-chain ones. However, those networks are unregulated and decentralised, comprise point-to-point channels that may be opened or closed without coordination or warning, and fees may change at any time – making routing over these networks a hard problem. In addition, by connecting different blockchains using such off-chain networks, an immense network of channels will evolve which is under continues change. Routing needs to take into account the current network status, availability and distributions of channels’ funding, fees for each node, and exchange rates between different currencies. In this work, we identify requirements for such a routing protocol and adapt the Ad-hoc On-Demand Distance Vector Routing (AODV) protocol to this end by enhancing the messages with information on fees and exchanges rates. This approach allows finding suitable routes through the network, while intermediate nodes can maintain their economic incentives. We simulate different network topologies and evaluate the adapted AODV protocol on 3 different networks of 500, 1,000 and 5,000 nodes.

RARZ: Ring-Zone Based Routing Protocol for Wireless Sensor Networks

Abstract: Sensor networks are handicapped by limited resources in the form of energy, processing, and memory. This paper proposes a new multi-hop energy efficient protocol, namely a routing algorithm using the ring-zone (RARZ) model. The protocol is lightweight, takes routing decisions based on the remaining energy of nodes, and performs location-based routing without the need for the nodes to know their respective positions. The protocol partitions the network into concentric rings around the base station. Each node assigns itself to a particular ring, known by a ringID. Multi-hop routing is performed and nodes within inner rings carry data for the outer rings towards the base station. Simulation results show that RARZ outperforms the address-light integrated MAC routing protocol (AIMRP), ad hoc on-demand distance vector (AODV) and Flooding in terms of end-to-end delay, average hop count, and energy consumption.

Performance Evaluation of Ad-Hoc On-Demand Distance Vector and Optimized Link State Routing Protocols in Mobile Ad-Hoc Networks

Abstract: Mobile Ad-hoc Networks (MANETs) are self-sufficient networks that can work without the need for centralized controls, pre-configuration to the routes or advance infrastructures. The nodes of a MANET are autonomously controlled, which allow them to act freely in a random manner within the MANET. The nodes can leave their MANET and join other MANETs at any time. These characteristics, however, might negatively affect the performance of the routing protocols and the overall topology of the networks. Subsequently, MANETs comprise specially designed routing protocols that reactively and/or proactively perform the routing. This paper evaluates and compares the performance of two routing protocols which are Ad-Hoc On-Demand Distance Vector (AODV) and Optimized Link State Routing (OLSR) in MANET environment. The study includes implementing a simulation to examine the performance of the routing protocols based on the variables of the nodes’ number and network size. The evaluation results show that the AODV outperforms the OLSR in most of the simulated cases. The results further show that the number of nodes and network size have a great impact on the Throughput (TH), Packet Delivery Ratio (PDR), and End-to-End delay (E2E) of the network.

On Greedy Routing in Dynamic UAV Networks

Abstract: Unmanned aerial vehicles (UAVs), commonly known as drones, are becoming increasingly popular for various applications. Freely flying drones create highly dynamic environments, where conventional routing algorithms which rely on stationary network contact graphs fail to perform efficiently. Also, link establishment through exploring optimal paths using hello messages (as is used in AODV algorithm) deems extremely inefficient and costly for rapidly changing network topologies. In this paper, we present a distance-based greedy routing algorithm for UAV networks solely based on UAVs' local observations of their surrounding subnetwork. Thereby, neither a central decision maker nor a time consuming route setup and maintenance mechanism is required. To evaluate the proposed method, we derive an analytical bound for the expected number of hops that a packet traverses. Also, we find the expected end-to-end distance traveled by each packet as well as the probability of successful delivery. The simulation results verify the accuracy of the developed analytical expressions and show considerable improvement compared to centralized shortest path routing algorithms.

DEBH: detecting and eliminating black holes in mobile ad hoc network

Abstract: Security in mobile ad hoc network (MANET) is one of the key challenges due to its special features e.g. hop-by-hop communications, dynamic topology, and open network boundary that received tremendous attention by scholars. Traditional security methods are not applicable in MANET due to its special properties. In this paper, a novel approach called detecting and eliminating black holes (DEBH) is proposed that uses a data control packet and an additional black hole check table for detecting and eliminating malicious nodes. Benefiting from trustable nodes, the processing overhead of the security method decreases by passing time. Ad hoc on-demand distance vector (AODV) routing protocol is used as the routing protocol in our design. After finding the freshest path using AODV, our design checks the safety of selected path. In case of detecting any malicious node, it is isolated from the entire network by broadcasting a packet that contains the ID of malicious nodes. Simulation results show that DEBH increases network throughput and decreases packet overhead and delay in comparison with other studied approaches. Moreover, DEBH is able to detect all active malicious nodes which generates fault routing information.