Performance Analysis of AODV Routing for Wireless Sensor Network in FPGA Hardware

Multi-Party Computation (MPC) is a technique enabling data from several sources to be used in a secure computation revealing only the result while protecting the original data, facilitating shared utilization of data sets gathered by different entities. The presence of Field Programmable Gate Array (FPGA) hardware in datacenters can provide accelerated computing as well as low latency, high bandwidth communication that bolsters the performance of MPC and lowers the barrier to using MPC for many applications. In this work, we propose a Secret Sharing FPGA design based on the protocol described by Araki et al. We compare our hardware design to the original authors' software implementations of Secret Sharing and to work accelerating MPC protocols based on Garbled Circuits with FPGAs. Our conclusion is that Secret Sharing in the datacenter is competitive and when implemented on FPGA hardware was able to use at least 10× fewer computer resources than the original work using CPUs.

Wireless sensor network (WSN) with several sensors is used to group measurements of certain physical quantities or environmental conditions, including sound, temperature, pressure, vibration, motion, or pollution, at various locations and ranges. In WSNs, several protocols address the issue of routing. Sensor nodes in WSN usually have limited energy resources and storage capacities. Therefore, the issue of energy usage in sensors and protocols is very important. This paper analyzes and compares the quality of service (QoS) performances of three important routing protocols of the mobile ad-hoc network (MANET) including Ad-hoc on-demand distance vector (AODV), dynamic source routing (DSR), and destination sequenced distance vector (DSDV), in a smart building case study. The QoS evaluation metrics include residual energy of nodes, instant throughput (IT), average throughput (AT), packet delivery ratio (PDR), packet loss ratio (PLR), and route discovery latency (RDL) based on IEEE 802.15.4 MAC protocol standard. The simulation is carried out using NS2, and the WSN has 16 fixed and 4 mobility nodes with different speeds and paths. The simulation results illustrate that average throughput in AODV is 1.985118 (kbps), however, the figures for DSR and DSDV are 1.977780 and 1.720700 (kbps), respectively. PDR, also, in DSR stands at 1.0, but the figures for AODV and DSDV are lower with the range of 0.999572 and 0.997930, respectively. Overall, The DSR protocol provides a better performance compared to AODV and DSDV routing protocols in terms of PLR and PDR. Also, AODV has better efficiency in RDL and AT compared to other assumed protocols.

This paper presents a resilient routing algorithm that is more suitable for a Mobile Ad Hoc Network (MANET) with node quick moving or node sparse, than traditional routing algorithms such as Ad-hoc On-demand Distance Vector (AODV) routing. Since AODV routing in MANETs is known for its advantageous properties, the proposed routing algorithm is based on the AODV, and called RAODV (Resilient AODV). In the route discovery phase, it differs from AODV, which only establishes one routing path from a source node to the destination node, whereas RAODV establishes as many routes as possible. Thus, when the primary route breaks, the node can immediately adopt an alternative route without further route research effort. If no possible alternative route exists, the node will transmit the route break information backward to instruct the previous node on the reverse route to select an alternative one, and so on. The proposed RAODV can reduce the number of route rediscovery procedures, and thus improve the packet loss rate and transmission delay, especially in sparse MANETs. Simulator ns2 was used to evaluate the performance of RAODV. In some cases, the proposed RAODV was able to reduce the packet loss rate by 72.61% compared to traditional AODV.

6LoWPAN has become a new technology to provide the Internet connectivity to the traditional wireless sensor network (WSN). In order to route the delivered packet from originator to destination nodes, the simplified Ad-hoc On- Demand Distance Vector (AODV) routing protocol for 6LoWPAN with 6LoWPAN Ad-Hoc On-Demand Distance Vector Routing (LOAD) has been introduced. However, the conceptual LOAD routing protocol has yet proposed any path recovery mechanism in 6LoWPAN. In this paper, an originator recognition (OR) path recovery mechanism is proposed for the 6LoWPAN LOAD-based routing protocol. In this proposed mechanism, the participated nodes will memorize the originator address attached within data packet during the data transmission. When a link break happens on destination path, the LOAD protocol message will be amended by inserting an identity key, which is a memorial of originator address, in the generated route error (RERR) message before transmitted towards the originator for the failure notification. This identity key is then used by the originator to initialize path recovery in order to retransmit the failed data packet to the unreachable destination node. Instead of using MAC address in the LOAD routing protocol, IP address is used in the proposed Originator Recognition (OR) path recovery mechanism (OR-LOAD) routing protocol which is designed for the global routing. The proposed OR-LOAD routing protocol has been examined under noisy 6LoWPAN environment in Qualnet simulator. Its performance is then evaluated and compared to AODV routing protocol in terms of packet delivery ratio and average energy consumption. The simulation results show that the proposed OR-LOAD outperforms AODV with packet delivery ratio of 19.4%, and with comparable average energy consumption in both routing protocols.

Energy efficiency is one of the major concerns in wireless sensor networks since it impacts the network lifetime. The trade-off between sensed information and the amount of energy expended in communication are considered in developing protocols as sensor networks are resource constrained. In this paper, the ad hoc on-demand distance vector (AODV) protocol and threshold-sensitive energy efficient sensor network (TEEN) protocol are integrated to form a hybrid AODV routing protocol. The hybrid protocol is based on the characteristics of both protocols. The primary design objective of this research is to determine the active nodes and enhance the energy efficiency. Extensive simulation results show that the proposed protocol is efficient in transmission of packets, reduction in latency, energy consumption and throughput.

Wireless Sensor Networks (WSNs) are fundamental to security and surveillance applications such as military defense, disaster management, and intrusion monitoring. The performance of these networks depends largely on the efficiency of routing protocols. This paper examines the Ad hoc On-Demand Distance Vector (AODV) routing protocol in multi-hop WSN environments for target tracking, evaluating critical metrics including Packet Delivery Ratio (PDR), End-to-End Delay, Energy Consumption, and Network Lifetime. Simulation results illustrate the impact of node depletion due to transmission loss, affecting network stability and robustness in target detection. In-network detection in WSNs presents trade-offs between real-time data transmission, energy efficiency, and trajectory lifespan. Inefficient routing optimization may result in increased latency, packet loss, and premature node failure, ultimately reducing localization accuracy. While AODV’s reactive path-based approach offers manageable overhead, its performance degrades under increased energy consumption and route rediscovery delays. This study systematically evaluates AODV’s strengths and limitations in time-sensitive detection scenarios. Findings indicate that AODV ensures reliable data transmission in early network stages but suffers significant performance deterioration as node energy declines, impacting coverage and responsiveness. To enhance AODV’s target tracking capabilities, this paper proposes adaptive energy-saving techniques and hybrid routing schemes. These strategies contribute to ongoing research aimed at optimizing routing protocols to balance accuracy and node longevity for real-time WSN applications.

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.

Vehicular Ad-hoc NETworks (VANETs) is a specific type of MANETs class as it deals with the safety of the vehicular nodes moving on the roads. As the VANETs field has a high movement rate, choosing the best routing protocol in this domain is a difficult task. Therefore, this paper reveals that the AODV (Ad-hoc On-Demand Distance Vector) routing protocol is regarded as one of the most suitable protocols for the VANETs field. During the route generation process, AODV transmits RREQ (Route-Request message) and generates several additional routes among an origin and a target node. This paper focuses on enhancing and improving the AODV performance by applying the novel clustering approach to generate constant clusters. In this paper, initially, the VANETs network's deployment for the route discovery and later generation of the appropriate route using the AODV routing protocol with a clustering approach is mentioned. Finally, four parameters are calculated for each route. The performance of three chosen protocols and the proposed algorithm is analyzed based on the defined parameters such as Throughput, Packet Delivery Ratio (PDR), End-to-End Delay, Packet Loss Ratio (PLR). The outcomes revealed that our proposed algorithm performs better than the other algorithms. The proposed algorithm gives the highest value for the throughput and PDR and the minimum value for the delay and PLR.

As more and more real Wireless Sensor Network's (WSN) applications have been tested and deployed over the last decade, the research community of WSN realizes that several issues need to be revisited from practical angles, such as reliability and availability. Furthermore, fault-tolerance is one of the main issues in WSNs since it becomes critical in real deployed environments where network stability and reduced inaccessibility times are important. Basically, wireless sensor networks suffer from resource limitations, high failure rates and faults caused by the defective nature of wireless communication and the wireless sensor itself. This can lead to situations, where nodes are often interrupted during data transmission and blind spots occur in the network by isolating some of the devices. In this paper, we address the reliability issue by designing an enhanced fault-tolerant mechanism for Ad hoc On-Demand Distance Vector (AODV) routing protocol applied in WSN called the ENhanced FAult-Tolerant AODV (ENFAT-AODV) routing protocol. We apply a backup route technique by creating a backup path for every node on a main path of data transmission. When a node gets failure to deliver a data packet through the main path, it immediately utilizes its backup route to become a new main path for the next coming data packet delivery to reduce a number of data packets dropped and to maintain the continuity of data packet transmission in presence of some faults (node or link failures). Furthermore, with increased failure rate, this proposed routing protocol improves the throughput, reduces the average jitter, provides low control overhead and decreases the number of data packets dropped in the network. As a result, the reliability, availability and maintainability of the network are achieved. The simulation results show that our proposed routing protocol is better than the original AODV routing.

Wireless sensor networks (WSNs) normally consist of large number of sensing nodes that organize themselves into multi-hop wireless networks. It is desirable for communication protocols to minimize the communication overhead and hence the energy consumption while keeping the data delivery relatively reliable. In this paper, we present a new routing protocol, called cross-layer AODV (CAODV), based on a cross-layer design and Ad hoc on-demand distance vector (AODV) routing protocol. The proposed protocol adopts two mechanisms, called delaying transmission (DT) and efficient broadcasting (EB), to address the broadcast storm problems in WSNs such as high probability of collisions and redundancy of broadcasting. Simulation results show that CAODV can improve the performance of the routing protocol in WSNs by reducing the routing overhead and the latency of route discovery without degrading the packet delivery ratio.

Introduction: The future of healthcare systems relies on faster communication between sensors and smart devices, which can assist in taking decisions for betterment of patients. The responsiveness of wireless health care system in case of medical urgencies is crucial factor for survival of patient’s life. The routing protocol of infrastructure less based are playing key role in sending the information in such medical related emergencies. Therefore, it is important to study and identify the best routing protocol in wireless healthcare based system using Mobile Ad-hoc networks (MANETS). Methods: MANET routing protocols such as Ad-hoc On Demand Vector (AODV), Secure AODV (SAODV) and Hybrid Wireless Mesh Protocol (HWMP) through their routing environment are simulated through this research study. It is essential to highlight the effect of various attacks affecting the routing methodology of these protocols. Since Distributed Denial of Service (DDoS) attack is popularly talked about and is most vulnerable attack present in MANET environment, so this research study analyses AODV, SAODV and HWMP under DDoS attacks through various simulation parameters. Results: In this research study, most suitable routing protocols to handle DDoS attacks are simulated and estimated in terms of delay and packet delivery ratio in the scenario of changing nodes. This aids in providing implications to enhance existing protocols and alleviate the consequences of DDoS investigation by such attacks. Discussion: For ensuring the optimized routing, privacy and security of patient’s data during transmission in healthcare sector, MANET could be used as one of the important technology combined with IoT. For dealing with end to end data transmission of patient's sensitive data, MANET protocol plays a vital role in sending the information securely. Conclusion: The performance of AODV, SAODV and HWMP (Hybrid Wireless Mesh Protocol) are compared and tabularized which are the most popularly utilized protocols in healthcare environment. The simulation results shows that the HWMP out performed than AODV and SAODV routing protocol, in terms of evaluation metrics namely end-to-end delay and Packet Delivery Ratio (PDR) and could be considered as much less vulnerable against DDoS attacks prevailing in wireless healthcare sector using MANET.

Mobile Ad-hoc Networks (MANETs) features such as open medium, dynamic topology, lack of centralised management and lack of infrastructure expose them to a number of security attacks. Black hole attack is one type of attack that is more common in MANET reactive routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). Black hole attack takes advantage of route discovery process in reactive routing protocols. In this type of attack, a malicious node misleads other nodes in the network by pretending to have the shortest and updated route to a target node whose packets it wants to interrupt. It then redirects all packets destined to a target node to itself and discards them instead of forwarding. This paper analyses the performance of AODV and DSR when attacked by black hole, by varying the mobility of the nodes in the network. The analysis is carried out by simulating scenarios of AODV based MANET and DSR based MANET using Network Simulator 2 (NS-2) and introducing the black hole attack in each of the scenarios. The different scenarios are generated by changing the mobility of the nodes. The performance metrics that are used to do the analysis are throughput, packet delivery ratio and end-to-end delay. The simulation results show that the performance of both AODV and DSR degrades in the presence of black hole attack. Throughput and packet delivery ratio decrease when the network is attacked by black hole because the malicious node absorbs or discards some of the packets. End-to-end delay is also reduced in the presence of a black hole attack because a malicious node pretends to have a valid route to destination without checking the routing table, and therefore shortens the route discovery process. The results also show that throughput decreases slightly when mobility of the nodes is increased in the network. The increase in the speed of the nodes decreases both end-to-end delay and packet delivery ratio.

The objective of the research work is to examine energy-efficient routing in wireless sensor networks for moving nodes by contrasting new evolutionary algorithms with the Particle Swarm Optimization (PSO) Algorithm. Comparative analysis of energy efficient routing is performed by a novel genetic algorithm where there are several samples (N = 10) and a PSO algorithm where there are several samples (N = 10) techniques with pre-test power of 80% using NS2. When routing wireless sensor networks with moving nodes, Various metrics, including delay, energy use, and packet delivery ratio, are used to compare PSO and genetic algorithms. The evolutionary algorithm outperforms the PSO algorithm in these ways in terms of packet delivery ratio, energy usage, and delay. (p < 0.05) indicates a statistically significant difference. The research's findings comprised the three metrics of delay, energy consumption and packet delivery ratio. The method shows that the novel Genetic algorithm outperforms the PSO algorithm for wireless sensor network energy-efficient routing for moving nodes by identifying a set of routes that can satisfy the delay restrictions.KeywordsNovel genetic algorithmParticle Swarm Optimization (PSO)Wireless sensor networkDelayEnergy consumptionPacket delivery ratio

Ad Hoc Routing with Distributed Ordered Sequences

In intelligent transportation systems, the collaboration between vehicles and the road side units is essential to bring these systems to realization. The emerging Vehicular Ad Hoc Network (VANET) is becoming more and more important as it provides intelligent transportation application, comfort, safety, entertainment for people in vehicles. In order to provide stable routes and to get good performance in VANET, there is a need of proper routing protocols must be designed. In this paper, we are working with the very well-known ad-hoc on-demand distance vector (AODV) routing protocol. The existing Routing protocol AODV-L which is based on the Link expiration time is extended to propose a more reliable AODV-AD which is based on multichannel MAC protocol. For the performance evaluation of routing protocols, a simulation tool ‘NS2’ has been used. Simulation results show that the proposed AODV-AD protocol can achieves better performances in forms of high Route stability, Packet Delivery ratio and packet loss rate than traditional AODV-L and traditional AODV.