Using Process Algebra to Design Better Protocols

The objective of this study is to enhance the Ad hoc On-demand Distance Vector (AODV) routing protocol, a representative mobile ad hoc network environment routing protocol. In the existing AODV protocol, dynamic topology changes due to node mobility cause frequent route failures and network instability. We herein propose a local repair scheme to re-establish routes when links are broken and a dual-path routing scheme to improve network stability by employing alternate routes. After comparing the total data processing volumes, average packet end-to-end delays, numbers of connection pairs, energy consumptions, and numbers of generated packets of the enhanced AODV protocols, we discuss the optimal operating conditions for each scheme. We also investigated the performance variations resulting from changing the number of nodes and node mobility, using an NS-2 simulator. The results revealed that the dual-path protocol generally performs the best and improves the packet end-to-end delay by up to 45 %.

An innovative method is proposed to analyze the nodes and its packets, in order to identify the malicious nodes which are created by the single or black hole attacks in the mobile ad hoc networks, by timeout period analysis. Timeout period acts as an imperative function to avoid the false alarms and predicts the misbehaving nodes accurately. The proposed method is dependent on the ad hoc on-demand distance vector (AODV) routing protocol and IEEE 802.11 MAC protocol. This paper proposed modified AODV with timeout period analysis for each transmitted packets from the nodes with queuing analysis for computing the average, minimum and maximum delay of packet transmission. The existing AODV protocol was modified to adopt the timeout period analysis, detect the malicious nodes which are to be changed as single or cooperative black hole nodes and remove the nodes from the network. The network simulator is used to simulate the modified AODV protocol to analyze the performance of the obtained results and correlate the results.

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.

Ad Hoc Routing with Distributed Ordered Sequences

A mobile ad hoc network is a collection of wireless nodes without any existing network infrastructure or centralized administration. It applies some special routing protocols, e.g. Ad hoc On-demand Distance Vector (AODV) routing protocol, having the ability to forward the packets in dynamic network topology. The existing routing protocols can be divided into unsecure and secure protocols. They could not address all possible attacks aiming the disruption of the protocol itself.

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.

Several research effort in recent years has shown its significant interest in the development of security measure in the routing of Mobile Ad-hoc Network (MANET). Ad-hoc On-demand Distance Vector (AODV) routing protocol has been one of the basic protocol that is modified to cope with security demands. This paper present an analytical model to evaluate the performance of AODV variant that is developed to be secure with malicious node detection and trust mechanism. Since the performance of MANET is tightly depends on the underlying topology of the nodes, route establishment may fail due to node's movement or malicious activity. The analytical model aims to provide the basic performance insight in the form of the route establishment probability of the MANET with and without malicious nodes. The model is important for MANET designer to optimize the connectivity for all nodes.

Recently, the study of multicast routing attracts more attentions in MANET. Multicast Ad Hoc On-Demand Distance Vector (MAODV) protocol, which is multicast operation of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, enables dynamic, self-starting, multihop routing between participating mobile nodes wishing to join or participate in a multicast group within an Ad Hoc network. Through analyzing its operation mechanism, we present a probability based multicast routing protocol with energy constrained (PBMR),in which a hybrid probability forwarding strategy is adopted. When a node wants to join a multicast tree, it floods a RREQ-Join message to its neighbors, when the neighbors receive this message, the neighbor with much energy left has a high probability to forward the message, and so on. By making correctness proof and complexity analysis of PBMR, this paper evaluates MAODV and PBMR with extensive simulations, the results show that PBMR has a better jitter than MAODV and a more balance in energy consumption. On the one hand, it saves the energy of the network system; on the other hand, it has a longer network lifetime and a more stable routing than MAODV and successfully solves the inconsistent problem of energy and scalability.

Recently mobile ad-hoc networks (MANET) have found widespread applications. In this infrastructure-less networks the routes have to be refreshed often due to mobility of nodes which also acting as routers. Many ad-hoc routing protocols have been proposed, of which on-demand routing protocols are very popular. To meet the scarce of network resources, the need of the time is to develop a protocol which makes efficient use of resources. In this paper we propose a mobility adaptive cross layer design to enhance the performance of ad-hoc on-demand distance vector (AODV) routing protocol by establishing stable routes. The adaptive decision making according to the speed of mobile nodes on route request (RREQ) packet forwarding results in stable routes. Comparing with the basic AODV protocol, the new cross layer algorithm has better performance as shown with the simulation results obtained using the network simulator, GloMoSim.

Problem statement: This study propose an improvement of Ad Hoc on Demand Distance Vector (AODV) Routing protocol in order to include some of the aspects of ad hoc networks such as load balancing, congestion avoidance and avoidance of link breakage. Approach: The most important problem nowadays is link breakage which mainly occurs due to excessive load and congestion in the network. Each node contains a buffer in order to detect the congestion in the network. Thus it selects a route from source to destination to avoid congestion and balance the load. The threshold value is initially set to a pre-determined value. Once the buffer crosses the threshold value, then packet forwarding is carried out via alternate path. Results: As a result, the proposed protocol Secure Enhanced Authenticated Routing Protocol (SEARP) avoids congestion and balances the load to avoid link failure. Conclusion: By detailed simulation studies, we show that even in high mobility scenario, SEARP achieves better packet delivery ratio with reduced delay and overhead compared to AODV protocol.

Mobile Ad-Hoc NETworks (MANET) designed specifically for WMNs. MANET plays an important role to find single the best path to a destination from various paths available using Ad-Hoc On Demand Distance Vector (AODV) routing protocol. However, when multiple nodes choose the same path, it will cause the path to be overload and deteriorating the overall performance of the network. Multipath Parallel Routing Protocol (MPRP) comes out to overcome this problem. The scope of this project is to study and discuss how MPRP and Coordinated Distributed Scheme (CDS) enhance the performance of WMNs. MPRP and CDS is combined to allow the selection of shortest path. The algorithm named Shortest Path Multipath Parallel Routing Protocol (S-MPRP). S-MPRP enhanced the performance of MPRP by allowing the selecting second best path when the best path is congested. Due to cost limitation, the simulation carried out using Network Simulation 2 (NS2) to compare the performance of WMNs between S-MPRP and AODV. Simple configurations have been done to configure the S-MPRP on the nodes. The simulation results shows S-MPRP helps WMNs produce a better result in terms of throughput, delay and normalized control overhead.

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.

Advances in electronic systems, wireless communication protocols, and intelligent devices allowed the development of networks of mobile devices such as cars, drones, and robots. The field of mobile ad hoc networks (MANETs) comprises networks where the mobility of the devices is one of the fundamental elements that characterise these networks. However, the node’s mobility leads to constant changes in the network’s topology, representing a challenge to routing protocols designed for MANETs. Although there is effort from researchers to tackle the intricacies of routing protocols in MANETs, there is still room for improvement as new applications with challenging specifications continue to arise. This research enriches the existing theoretical perspective by presenting an innovative method for optimising the routing performance of the ad hoc on-demand distance vector (AODV) protocol. Grounded on multi-objective metaheuristics, we aim to improve AODV’s routing recovery performance concerning routing delay, energy consumption, packet loss ratio, and route load metrics. To gauge the quality of our contribution, we compare its performance to the standard AODV, a mono-objective optimised AODV, and four other well-known routing protocols with different routing approaches. The results indicate that the proposed solution was superior to the original AODV with average improvements of 56.0%, 59.3%, 48.1% and 0.7% on route load, routing delay, packet loss ratio and energy consumption, respectively. It also presented competitive results compared to other routing protocols.

<p>In the scenario of node failure in mobile multi-agent, Ad hoc On-demand Distance Vector (AODV) rout-ing protocol fails in network information transmission due to the damage of communication link. In addi-tion, the existing AODV multipath routing protocol node load balancing mechanism is imperfect. In order to solve the low network survivability caused by the above problems, an improved responsive multipath routing protocol MD_AODV (Multipath Destroy-resistance AODV) is proposed. The protocol is opti-mized in three aspects: multi-channel concurrency mechanism, node load balancing mechanism and shortest path maintenance mechanism. The simulation analysis of the modified AODV multipath routing protocol is realized on OPNENT simulation platform. The simulation results show that compared with AODV protocol, the improved multipath routing protocol can enhance the utilization of network re-sources and has better link redundancy. Moreover, the modified routing protocol not only enhances the reliability and fault tolerance of the path, but also increases the network aggregation bandwidth. </p> <p> </p>

This paper conduct a comprehensive simulation study on the behavior of TCP-friendly Rate Control (TFRC) protocol over Ad-Hoc On Demand Vector (AODV) routing protocol and Dynamic Source Routing (DSR) protocol. The aim are first, to measure the performance of TFRC in terms of throughput, delay and jitter. The second objective is to identify which Mobile Ad-Hoc Network (MANET) routing protocols work well with TFRC. We conduct the experiment by sending multimedia streaming traffic carried by TFRC over AODV and DSR respectively. Random-Waypoint mobility model is used for both experiments. Results obtained shows that in average TFRC over AODV has more throughput and less delay as compared with TFRC over DSR. However, in terms of jitter, TFRC over DSR gives better result.