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

A data authentication scheme for UAV ad hoc network communication

Abstract: In this paper, we propose an efficient and energy-saving distributed network architecture based on clustering stratification to solve the information security problem of unmanned aerial vehicle ad hoc network communication. And a double-authentication watermarking strategy is designed. In order to ensure that the data collected by nodes can be sent securely to the cluster head node, we use the self-characteristic of the collected data to generate the authentication watermark and insert it into the collected data at random. The cluster head node first verifies the integrity of collected data and deletes the suspicious data. Then, the authentication information is generated by combining the chaotic mapping method, and the watermark is hidden by changing the parity of the least significant bits of the data. Experimental results show that the proposed security strategy can resist most attacks, such as selective forwarding, data replay and tampering. Meanwhile, it has low energy consumption and low latency.

Wireless sensor network energy model and its use in the optimization of routing protocols

Abstract: 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.

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

Abstract: 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.

Performance Evaluation of Three Mobile Ad-hoc Network Routing Protocols in Different Environments

Abstract: Mobile ad-hoc wireless networks give us the high probability and high properties to create networks, without any central management or infrastructure, independent and temporary network, that is means wide ubiquitous networks. The intermediate nodes should be able to communicate between them to send and receive the data with ability using at any time and anywhere, the mobility of the intermediate node between the source and destination gives us unstable topology maybe the connection between the nodes will be break often. Therefore, the strategies to design any wireless depend on path routing and protocol selection. In this paper we study and evaluate the effect of mobility on the routing protocols DSDV, AODV and DSR in two different scenarios, the density of nodes and different area in NS2.35 simulation by using three performance metrics in the evaluating the routing protocols are Average Throughput, Packet Delivery Ratio and Average End-to-End Delay.

Recent advancements, review analysis, and extensions of the AODV with the illustration of the applied concept

Abstract: Mobile ad hoc networks provide a promising opportunity for the applications requiring instant networking in the resource constraint, multi-hop wireless environment. Routing protocols are the backbone of such networks to enable the routing under dynamic circumstances. Ad hoc on-demand distance vector routing protocol (AODV) is the predominant reactive routing protocol designed for mobile ad hoc networks (MANETs). It provides good performance in terms of hop count, packet delivery ratio, and control overhead in the network. AODV has an extensive research spectrum. Many variants of the protocol have been proposed by the researchers to achieve performance improvements and to address the variety of challenges. As there are hundreds of AODV related extensions, a systematic illustration is worth to present. In this review paper, we elaborate on the core of the protocol and discuss the evolution, its variants, extensions, and the applied concepts for improving the protocol. We have surveyed the broad domain of AODV extensions and have classified them based on the various criteria, e.g., quality, reliability, energy, security, and routing strategies, etc. This paper brings out the concept, design objective, research trends, and the current advancements in the research carried out for AODV improvement. Paper also summarizes various aspects of the research trends and portrays performance metrics, input parameters, applicable domains, and the adopted strategies for improving the protocol.

Performance Analysis of Routing Protocols for UAV Communication Networks

Abstract: 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.

Intelligent Detection of Black Hole Attacks for Secure Communication in Autonomous and Connected Vehicles

Abstract: Detection of Black Hole attacks is one of the most challenging and critical routing security issues in vehicular ad hoc networks (VANETs) and autonomous and connected vehicles (ACVs). Malicious vehicles or nodes may exist in the cyber-physical path on which the data and control packets have to be routed converting a secure and reliable route into a compromised one. However, instead of passing packets to a neighbouring node, malicious nodes bypass them and drop any data packets that could contain emergency alarms. We introduce an intelligent black hole attack detection scheme (IDBA) tailored to ACV. We consider four key parameters in the design of the scheme, namely, Hop Count, Destination Sequence Number, Packet Delivery Ratio (PDR), and End-to-End delay (E2E). We tested the performance of our IDBA against AODV with Black Hole (BAODV), Intrusion Detection System (IdsAODV), and EAODV algorithms. Extensive simulation results show that our IDBA outperforms existing approaches in terms of PDR, E2E, Routing Overhead, Packet Loss Rate, and Throughput.

Performance Evaluation of Data Dissemination Protocols for Connected Autonomous Vehicles

Abstract: An overwhelmed number of vehicles has wrecked the current system of transportation due to rapid growth in population. Smart cities are the novel innovation that is inevitable to curb the problems of traffic jams, unorganized traffic, environmental pollution, and slow response rate to emergency situations. The intelligent transportation system (ITS) is an integral part of smart cities allowing communications and interaction among vehicles. An autonomous vehicle is the key element of ITS and the mass implementation of this emerging technology is the solution to traffic problems linked to the current transportation system. Autonomous vehicles lead to the need for efficient and reliable external vehicular communications particularly through vehicular ad hoc networks (VANET). However, utilizing a suitable routing protocol to provide stable routing and efficient performance for vehicular communications in autonomous vehicles is a key factor. Routing protocols are particularly important for establishing vehicular to vehicular and vehicular to infrastructure (V2X) communication, which is incredibly challenging due to the movement of nodes. The quality of inter-vehicular communications is widely affected by numerous factors such as routing protocols, traffic environment, and traffic density. This article presents a detailed evaluation of three commonly used protocols, i.e., Ad-hoc On-demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR), and Destination-Sequenced Distance-Vector Routing (DSDV) under three different traffic environments. To investigate the performance of these routing protocols under diverse environments, simulations are extended further by using the varying density of vehicles. This study aims at finding the best routing protocol for efficient and reliable packet dissemination among vehicles under different scenarios.

A traffic-aware Q-network enhanced routing protocol based on GPSR for unmanned aerial vehicle ad-hoc networks

Abstract: In dense traffic unmanned aerial vehicle (UAV) ad-hoc networks, traffic congestion can cause increased delay and packet loss, which limit the performance of the networks; therefore, a traffic balancing strategy is required to control the traffic. In this study, we propose TQNGPSR, a traffic-aware Q-network enhanced geographic routing protocol based on greedy perimeter stateless routing (GPSR), for UAV ad-hoc networks. The protocol enforces a traffic balancing strategy using the congestion information of neighbors, and evaluates the quality of a wireless link by the Q-network algorithm, which is a reinforcement learning algorithm. Based on the evaluation of each wireless link, the protocol makes routing decisions in multiple available choices to reduce delay and decrease packet loss. We simulate the performance of TQNGPSR and compare it with AODV, OLSR, GPSR, and QNGPSR. Simulation results show that TQNGPSR obtains higher packet delivery ratios and lower end-to-end delays than GPSR and QNGPSR. In high node density scenarios, it also outperforms AODV and OLSR in terms of the packet delivery ratio, end-to-end delay, and throughput.

TAD-HOC Routing Protocol for Efficient VANET and Infrastructure-Oriented Communication Network

Abstract: Intelligent Transportation System (ITS) is a critical factor for Vehicular Ad hoc Networks (VANET). Even though VANET belongs to the class of Mobile Ad hoc Network (MANET), none of the MANET routing protocol applies to VANET. VANET network is dynamic, due to increased vehicle speed and mobility. Vehicle mobility of VANET affects conventional routing algorithm performance, which deals with the dynamicity of the network node. The evaluation of the existing research stated that Ad hoc On-Demand Distance Vector (AODV) is an effective MANET protocol to adopt network changes for significant resource utilization and also provides effective adaptation in the network change. Due to the effective performance of the AODV protocol, it is considered as an effective routing protocol for VANET. This paper proposed an ad hoc TROPHY (TAD-HOC) routing protocol for the VANET network for increasing efficiency and effective resource utilization of the network. To improve the overall performance, ad hoc network is combined with Trustworthy VANET ROuting with grouP autHentication keYs (TROPHY) protocol. The proposed TAD-HOC protocol transmits data based on time demand in the VANET network with the desired authentication. Results of the proposed approach show the increased performance of the VANET network with packet delay, transmission range, and end-to-end delay. The comparative analysis of the proposed approach with I-AODV, AODV-R, and AODV-L shows that the proposed TAD-HOC exhibited effective performance.

A Comprehensive Review and Performance Evaluation of Recent Trends for Data Aggregation and Routing Techniques in IoT Networks

Abstract: Internet of things (IoT) is a ubiquitous network which supports and offers a system that observes and manages the physical world through the aggregation, filtering, and investigation of generated data using IoT devices. Aggregation of data and routing of nodes in IoT devices are always challenging tasks. A well-organized data aggregation and routing of nodes is necessary factor for successful placement and use of IoT devices. IoT devices usually share large amount of data that can be converted into information. The information is aggregated to enhance the overall efficiency of the IoT network. Data aggregation is the process in which information is collected and expressed for the purpose of statistical analysis. Routing in the IoT network plays a vital role. IoT devices act as routers for sending information to the gateways. The routing of data affects the power consumption of progressing IoT devices. For these reasons, aggregation of data and routing of nodes are important for IoT devices. This paper conveys and evaluates comparison on current data aggregation and routing techniques of IoT devices. Ad hoc On-demand Distance Vector (AODV) routing protocol is simulated for ten different mobility conditions, and its performance is observed in respect of throughput, delay, and packet delivery ratio.

Beamforming-Constrained Swarm UAS Networking Routing

Abstract: 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 beam-forming 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.

Performance Evaluation of Ad-Hoc Routing Protocols in (FANETs)

Abstract: The utilization of Unmanned Aerial Vehicles (UAVs) as aerial relays for the Internet of Drones (IoD) network has several advantages such as civilian and military applications A Flying Ad-Hoc Network (FANETs) is a group of Unmanned Aerial Vehicles (UAVs) which can complete their function without human intervention FANET is considered as a subset of MANET, however, due to high mobility and rapid topology changes in FANET applying routing protocols in FANET is a big challenge In this paper, we have extensively evaluated existing Ad-Hoc routing protocols such as OLSR, AODV, DSR, TORA & GRP for FANET environment The performance of those protocols was evaluated using an OPNET 175 network simulator We have compared the protocols using packet dropped ratio, end to end delay, number of hops and throughput in different moving speeds and mobility models such as Random Waypoint Mobility (RWPM), Manhattan Grid Mobility Model (MGM), Semi-Random Circular Movement (SCRM) and Pursue Mobility Model (PRS) For all evaluation scenarios, the results indicate that OLSR and GRP perform better than AODV, DSR, and TORA on average This paper shows that the variation of the network topology caused by the relative speed of nodes is the main reason for the fluctuation of network performance Also, we found that the (MGM) greatly affects the packet dropped ratio for all protocols As we increase mobility speed, we found that End-to-End delay decreases in MGM, PRS, and RWPM, while it is high in SCRM

Analysis and comparison of ant colony optimization algorithm with DSDV, AODV, and AOMDV based on shortest path in MANET

Abstract: Due to the dynamic nature of Mobile Ad hoc NETwork (MANET) the designing and development of protocols is very challenging. MANET has a limited number of resources i.e., power, infrastructure, etc. ...

Performance Analyzing the Effect of Network Size on Routing Protocols in MANETs

Abstract: The Mobile Ad-hoc network (MANET) means an independently operating self-configured wireless network without existing infrastructure and centralized control. MANET may be found in wireless systems in different fields of daily uses, for example of automotive, military, and other specific field networks. Many networks need a fixed or wired data transmission and computer connectivity system relative to MANET. WiFi, satellite networking and the smartphone network are examples of fixed infrastructure wireless technology. This paper analyzes the effect of MANET on network size routing protocols. Ad hoc on-demand remote vector routing (AODV) and Greedy Stateless routing perimeter (GPSR) was measured on a efficiency basis in terms of network capacity. The result is a gradual decrease in GPSR output from 17.68 kbps to 12.61 kbps, with an average of 43.96 kbps. The packet transmission fraction for AODV and GPSR protocols is being developed for increasing network capacity. GPSR averages E2E delay less than AODV because the GPSR moves each node closer to the destination with a packet of local knowledge. As a matter of fact, the superiority of the GPSR protocol in all document tested on a network scale in simulation.

Comparative Analysis to the Performance of Three Mobile Ad-Hoc Network Routing Protocols in Time-Critical Events of Search and Rescue Missions.

Abstract: Gradually, Mobile Ad-hoc Networks (MANETs) play an important role in the construction of smart organization, resident, campus, search/rescue region and battlefield. MANETs are suitable for providing communication support where no fixed infrastructure exists due to conventional networks neither feasible nor economically profitable. These networks are essentially important in the case of a disaster or natural calamities situations for establishing urgent communication among rescue members. The MANET relies on routing protocols to adapt to the dynamic changes in its topology and maintain the supply of routing information to the nodes. This paper provides a comparative analysis to the most popular routing protocols in MANET environments namely, Destination-Sequenced Distance-Vector (DSDV), Ad-hoc On-demand Distance Vector (AODV) and Ad-hoc On-demand Multipath Distance Vector (AOMDV). The compression covers the single-path and multi-path mechanisms, and reactive and proactive behaviors of the protocols in time-critical events of search and rescue missions. The NS2 simulator is used to test and evaluate the performance of these protocols based on throughput (TP), packet delivery ratio (PDR) and packet loss ratios (PLR), and end-to-end delay (E2E delay). The results show that the most suitable MANET routing protocol for time-critical events of search and rescue missions is the AOMDV.

Performance Optimization of MANET Networks through Routing Protocol Analysis

Abstract: A Mobile Ad Hoc Network (MANET) protocol requires proper settings to perform data transmission optimally. To overcome this problem, it is necessary to select the correct routing protocol and use the routing protocol’s default parameter values. This study examined the effect of route request parameters, such as RREQ_RETRIES and MAX_RREQ_TIMOUT, on the Ad Hoc On-demand Distance Vector (AODV) protocol, which was then compared with the default AODV performance Optimized Link State Routing (OLSR) protocols. The performance metrics used for measuring performance were Packet Delivery Ratio (PDR), throughput, delay, packet loss, energy consumption, and routing overhead. The results show that the OLSR protocol has a smaller delay than the AODV protocol, while in other measurements, the AODV protocol is better than OLSR. By reducing the combination value of RREQ_RETRIES, MAX_RREQ_TIMEOUT in AODV routing to (2, 10 s) and (3, 5 s), the protocol’s performance can be improved. The two combinations result in an average increase in throughput performance of 3.09%, a decrease in delay of 17.7%, a decrease in packet loss of 27.15%, and an increase in PDR of 4.8%. For variations in the speed of movement of nodes, 20 m/s has the best performance, while 5 m/s has the worst performance.

Performance Analysis of Routing Protocols AODV, OLSR and DSDV on MANET using NS3

Abstract: Wireless Sensor Networks (WSN) have been widely used to process the monitoring of earth physical phenomena remotely. The result of data sensing in a certain area is transmitting to the server by routing these data via the adjacent nodes between sensor nodes and the server. The changing of physical phenomena will be monitored periodically in a server based on the receiving data from sensor nodes. Mobile Ad Hoc Network (MANET) is a flexible network topology that could be installed in disaster areas with a lack of infrastructure. This topology strongly supports the WSN system in sensor data transmitting. In this paper, we analyze the performance of 3 common MANET routing protocols, i.e. Ad Hoc On-demand Distance Vector (AODV), Dynamic Source Distance Vector (DSDV), and Optimized Link State Routing (OLSR). The three protocols have been examined by simulation using Network Simulator 3 (NS3) with 4 examination parameters, namely Packet Delivery Ratio (PDR), received data throughput, the percentage of packet loss, and transmitting delay. The result of the simulation shows that OLSR has better performance in the aforementioned parameter with the values 97,198%, 19,6399 Kbps, 2,802%, and 0,842 msec respectively based on the number of nodes provides.

Analysis of Energy Consumption in Dynamic Mobile Ad Hoc Networks

Abstract: Energy is a very crucial parameter in Mobile Ad Hoc Networks since mobile nodes are operated with this scarce resource. If nodes battery is drained, then ongoing transmission in the network is disrupted and discontinued. Mobile nodes can communicate with each other directly or multi-hop fashion. A mobile node uses battery power while working in various modes, i.e., transmitting, receiving, idle, and sleep. Routing protocols, MAC layer, and other network layers exchanges various control packets for executing their task. Overall, performance of the network indirectly depends on the battery power. So, wisely utilizing battery of individual nodes may significantly increase the network performance and lifetime. We have studied the energy utilization of individual node in the network. We have used AODV routing protocol for the analysis of individual node energy utilization in different mode of their operation. Finally, we observed that in receiving mode nodes average energy consumption is higher as compared to transmit mode operation.

Research of Security Routing Protocol for UAV Communication Network Based on AODV

Abstract: With the rapid development of information technology and the increasing application of UAV in various fields, the security problems of unmanned aerial vehicle (UAV) communication network have become increasingly prominent. It has become an important scientific challenge to design a routing protocol that can provide efficient and reliable node to node packet transmission. In this paper, an efficient Digital Signature algorithm based on the elliptic curve cryptosystem is applied to routing protocol, and an improved security method suitable for on-demand routing protocol is proposed. The UAV communication network was simulated through the NS2 simulation platform, and the execution efficiency and safety of the improved routing protocol were analyzed. In the simulation experiment, the routing protocols of ad-hoc on demand distance vector (AODV), security ad-hoc on demand distance vector (SAODV), and improved security ad-hoc on demand distance vector (ISAODV) are compared in terms of the performance indicators of packet delivery rate, throughput, and end-to-end delay under normal conditions and when attacked by malicious nodes. The simulation results show that the improved routing protocol can effectively improve the security of the UAV communication network.

Unmanned Aerial Vehicles Routing Formation Using Fisheye State Routing for Flying Ad-hoc Networks

Abstract: Flying Ad-hoc Networks creates rapid topology changes that causes routing problems between Unmanned Aerial Vehicle and ground base station. Mobile Ad-hoc networks and Vehicular Ad-hoc network protocols are conventionally adopted to overcome routing issues. But Still, they do not fully address the routing problem in Flying Ad-hoc Networks. In this paper, Fisheye state routing protocol is implemented and evaluated to fully overcome routing issues in a Flying Ad-hoc Network and fully utilize the limited resource of Unmanned Aerial Vehicles. Performance evaluation is measured in terms of throughput, average end-to-end delay, packet drop analysis as congestion measure with Ad-Hoc On-Demand Distance Vector (AODV), Distance Sequence Distance Vector (DSDV), Optimized Link State Routing (OLSR), Temporary Ordered Routing Protocol (TORA) and Dynamic Source Routing (DSR). Fisheye state routing protocol showed promising results regarding throughput, packet drop rate, and average end-to-end delay compared with traditional protocols. Moreover, with the suggested improvement of the parameters, network lifetime is increased, and resources harvesting becomes under control.

Bio-inspired routing algorithm for MANETs based on fungi networks

Abstract: The major trends today show that mobile ad hoc networks (MANETs) are increasingly taking up space in the domestic and corporate market with the growth of numbers of users and new applications. Just as various systems were inspired by the behavior of social insects (ants, bees, among others), fungal colonies also demonstrate potential for bio-inspiration of new protocols for MANETs because they exhibit behavior and capacity for self-organization of adaptive, resilient and efficient natural networks in transporting nutrients. In this work, HyphaNet proposes a new bio-inspired approach in the fungi dynamics to develop an algorithm for the creation, optimization and selection of routes for MANETs. In HyphaNet, the routes are built similarly to the fungal mycelium, in which several parallel paths are initially established, but over time, only the hyphae of the best routes receive biomass for reinforcement and thickening of their walls, thus remaining and presenting greater flow attractiveness. Otherwise, less interesting routes remain rare or disappear completely. In this new algorithm, the routing process follows the idea of attractiveness, in which the data flow tends to travel through regions (nodes and links) with a higher concentration of immobile biomass, which indicates lower cost and greater availability of resources. In this model, the routes are reinforced with each data package delivered successfully and the distribution of immobile biomass is a function of the quality of the path between source and destination. The most attractive paths are more likely to be chosen by the route selection heuristic. HyphaNet is reactive, multipath, and the results of the simulations on the NS-2 show good performance compared to the classic AODV and SARA based on ant colony.

Swarm-Intelligence-Centric Routing Algorithm for Wireless Sensor Networks.

Abstract: The swarm intelligence (SI)-based bio-inspired algorithm demonstrates features of heterogeneous individual agents, such as stability, scalability, and adaptability, in distributed and autonomous environments. The said algorithm will be applied to the communication network environment to overcome the limitations of wireless sensor networks (WSNs). Herein, the swarm-intelligence-centric routing algorithm (SICROA) is presented for use in WSNs that aim to leverage the advantages of the ant colony optimization (ACO) algorithm. The proposed routing protocol addresses the problems of the ad hoc on-demand distance vector (AODV) and improves routing performance via collision avoidance, link-quality prediction, and maintenance methods. The proposed method was found to improve network performance by replacing the periodic “Hello” message with an interrupt that facilitates the prediction and detection of link disconnections. Consequently, the overall network performance can be further improved by prescribing appropriate procedures for processing each control message. Therefore, it is inferred that the proposed SI-based approach provides an optimal solution to problems encountered in a complex environment, while operating in a distributed manner and adhering to simple rules of behavior.

UAV-Assisted Hybrid Scheme for Urban Road Safety Based on VANETs

Abstract: Traffic congestion control is becoming a popular field of research due to the rapid development of the automotive market. Vehicular ad hoc networks (VANETs) have become the core research technology for numerous application possibilities related to road safety. Road congestions have been a serious issue of all time since the nodes have high mobility and transmission range is limited, resulting in an interruption of communication. One of the significant technical challenges faced in implementing VANET is the design of the routing protocol, providing adequate information and a reliable source for the destination. We proposed a novel mechanism unmanned aerial vehicle (UAV)-assisted ad hoc on-demand distance vector (AODV) routing protocol (UAVa) for current-time traffic information accumulation and sharing to the entire traffic network and to control congestions before it happens. The UAV-assisted (UAVa) protocol is dedicated to urban environments, and its primary goal is to enhance the performance of routing protocols based on intersections. We compared the overall performance of existing routing protocols, namely ad hoc on-demand distance vector. The simulations were done by using OpenStreetMap (OSM), Network Simulator (NS-2.35), Simulation of Urban Mobility (SUMO), and VanetMobiSim. Furthermore, we compared the simulation results with AODV, and it shows that UAV-assisted (UAVa) AODV has significantly enhanced the packet delivery ratio, reduced the end-to-end delay, improved the average and instant throughput, and saved more energy. The results show that the UAVa is more robust and effective and we can conclude that UAVa is more suitable for VANETs.

Routing Using Genetic Algorithm in a Wireless Sensor Network

Abstract: 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.

On Modeling Optimizations and Enhancing Routing Protocols for Wireless Multihop Networks

Abstract: 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.