Traditional AODV Protocol Research Articles

Inverse Coupled Simulated Annealing for Enhanced OSPF Convergence in IoT Networks

The current Internet of Things (IoT) network structure is evolving from small-scale distributed systems to a large-scale hierarchical collaboration between backbone and access networks. In this context, the dynamic changes in backbone node connections and the surge in service demands, coupled with sluggish fault detection speeds, significantly shorten effective service transmission time. To address this issue, this paper proposes an inverse coupled simulated annealing for enhanced OSPF route convergence in IoT networks (OSPF-ICSA). Initially, the link state is derived from the statistical characteristics of Hello packets, while the aggregated characteristics of the link state are employed to characterize the node state, providing data support for the reverse coupled simulated annealing algorithm. Subsequently, the Hello packet is refined, and a mechanism is designed to synchronize OSPF intervals and transmit node states. This ensures that nodes within the same subnet synchronize their sending intervals and fault detection times while sharing their node states. Finally, building upon this foundation, the reverse coupled simulated annealing algorithm is introduced to jointly optimize the Hello packet sending interval and fault detection time. Compared to the traditional AODV protocol, OSPF-ICSA reduces the average fault detection time by over 37.38%, improves the average fault detection accuracy by more than 3.1%, decreases the average routing overhead by over 20%, and increases the average packet delivery rate by over 5.1%.

Quality communication using varying parameters for wireless mobile ad hoc networks

Wireless Mobile Ad Hoc Networks (MANETs) present topologies where nodes act as both hosts and routes, necessitating efficient routing protocols to handle frequent route updates and transmission congestion. This paper proposes a novel routing algorithm, Fuzzy Controller Ad hoc On-demand Distance Vector (FC-AODV), to address these challenges. The FCAODV algorithm is designed to improve packet delivery ratio, throughput, end-to-end delay, packet loss, remaining energy, and routing overhead compared to the traditional AODV protocol. Through extensive simulations using NS 2, the proposed algorithm demonstrates superior performance across varying network scenarios. Results indicate an average increase of 12.4% in packet delivery ratio, 10.27% in throughput, and a decrease of 5.37% in end-to-end delay compared to AODV. Additionally, FC-AODV reduces packet loss by 5.57%, increases remaining energy by 6.4%, and decreases routing overhead by 6.37%. Future research directions include applying the FC-AODV concept to satellite networks, exploring the integration of shortest path algorithms, and evaluating FC-AODV in real-time network environments.

Fault‐tolerance based on augmenting approach in wireless sensor networks

SummaryA critical node is a sensor whose failure causes loss of connectivity and network fragmentation. In wireless sensor networks, the failure of a critical node, like the failure of all sensor nodes, can be caused by energy depletion or physical failure. To overcome the problem of failure of such nodes, this article proposes a fault‐tolerant strategy that allows a routing protocol to tolerate the failure of a critical node. The proposed strategy is carried out in two phases. In the first phase, a hybrid genetic algorithm with a local search heuristic called genetic algorithm‐critical node problem (GA‐CNP) is used to select the critical nodes and in the second phase, an algorithm called Aug‐CNP is involved to deal with the augmentation problem by deploying additional wireless edges to preserve network connectivity in case of critical node failure. Our proposal has been developed using the OMNET++ simulator, evaluated, and compared to the AODV protocol. The simulation results showed that the GA‐CNP algorithm selects the critical nodes whose failure can degrade the network lifetime with a rate of 40%. Moreover, the Aug‐CNP algorithm applied to the AODV protocol brings improvements in terms of network lifetime which reaches 22% compared to the traditional AODV protocol.

Beacon-Based Hybrid Routing Protocol for Large-Scale Unmanned Vehicle Ad Hoc Network

In this paper, we designed a beacon-based hybrid routing protocol to adapt to the new forms of intelligent warfare, accelerate the application of unmanned vehicles in the military field, and solve the problems such as high maintenance cost, path failure, and repeated routing pathfinding in large-scale unmanned vehicle network communications for new battlefields. This protocol used the periodic broadcast pulses initiated by the beacon nodes to provide synchronization and routing to the network and established a spanning tree through which the nodes communicated with each other. An NS3 platform was used to build a dynamic simulation environment of service data to evaluate the network performance. The results showed that when it was used in a range of 5 ~ 35 communication links, the beacon-based routing protocol’s PDR was approximately 10% higher than that of AODV routing protocol. At 5 ~ 50 communication links, the result was approximately 20% higher than the DSDV routing protocol. The routing load was not related to the number of nodes and communication link data and the protocol had better performance than traditional AODV and DSDV routing protocol, which reduced the cost of the routing protocol and effectively improved the stability and reliability of the network. The protocol we designed is more suitable for the scenarios of large-scale unmanned vehicle network communication in the future AI battlefield.

Designing a Energy Efficient Node Disjoint Multipath Routing technique to achieve energy efficiency in Mobile Ad Hoc Networks

Mobile Ad Hoc Networks (MANETs) are wireless networks which comprise of mobile nodes with limited energy resources. Every node cooperates to perform routing and expends energy on a frequent basis. Nodes are mobile thus link breakages are common and new routes need to be established quickly. Traditional routing protocols tend to find shortest routes to destination providing best-effort delivery service. However due to limited energy and bandwidth resources shortest path routes may not suffice and may usually degrade the performance of the network. In this paper an Energy aware Node Disjoint routing technique END-AODV is proposed that is based on the traditional AODV protocol. The technique designed is based on the argument that node disjoint multipath routing can conserve energy more efficiently as compared to link disjoint routing. Link Disjoint routing leads to overuse of a subset of nodes thus decreasing the overall network lifetime. The technique proposed incorporates energy drain rate metric to establish energy aware routes which are node disjoint in nature. Simulation results with ns2.34 simulator show efficiency of the proposed technique in terms of packet delivery ratio, average energy consumption per data bit delivered, network lifetime and average end to end delay.

Simulation of Energy Efficient Clustering Technique in a Gaussian Network

In Wireless sensor network (WSN) the sensor nodes are randomly distributed in the network. As the sensor nodes are adhoc in nature the geographical location must be assessed earlier and for data transmission. Maintenance of the energy level in each sensor node is very challengeable. In this paper a Gaussian network is deployed with four virtual grids and cluster head is obtained using the Gaussian integer. The traditional DSDV protocol is modified and simulated in Network Simulator. The energy efficiency of modified DSDV with regard to increase in number of nodes in compared with traditional AODV protocol and found a better performance of the modified DSDV protocol.

Prediction based opportunistic routing for maritime search and rescue wireless sensor network

In recent years, maritime and air crashes occur frequently. The existing rescue measures rely only on board satellite communications equipment, which makes it difficult to confirm the accurate positioning information and vital signs of drowning people. Recently, wireless sensor networks (WSN) are introduced to Maritime Search and Rescue (MSR). WSNs feature quick expansion, self-organization, and self-adaptation to the marine environment. However, the constant changing nodes location and link reliability in marine search and rescue WSN makes the routing metrics between nodes highly dynamic. Traditional routing protocols such as AODV that establish a fixed single route based on static nodes information will provide poor packet delivery rate and take no consideration of the limited energy on the irreplaceable WSN nodes. We propose to employ opportunistic routing which can make best use of the broadcast property of radio propagation. The forwarding decisions in opportunistic routing are only based on its neighbor’s information. No network-wide flooding is required to establish routes. In order to maintain the latest neighbor information and minimize the energy cost of collecting these information, we propose a light-weight time series based routing metric prediction method to deal with the high communication cost incurred by collecting the latest routing metrics between nodes.Results: Our implementation of opportunistic routing protocol achieved 30% more Packet Delivery Ratio compared to the traditional AODV protocol. Also opportunistic routing protocol with prediction performed slightly better than opportunistic routing protocol without prediction. Our approach generated 90% efficiency where as 60% efficiency was achieved using AODV protocol. In achieving this an additional 3% energy is consumed by the nodes. We feel additional 3% energy consumption to improve delivery greatly by 30% is a good tradeoff.

MODIFIKASI PROTOKOL AODV-BR MENGGUNAKAN LINK EXPIRATION TIME (LET) UNTUK MENINGKATKAN STABILITAS LINK DI LINGKUNGAN MOBILE Ad-Hoc NETWORK (MANET)

AODV protocol is a protocol that is fairly mature in mobile Ad-Hoc network. But the traditional AODV protocol in some ways it seems less satisfying, especially on the stability of data transmission. Development continues, one of which AODV-Backup Routing which became known AODV-BR, were present to address the stability issues of data delivery by providing a backup route, however, AODV-BR still use traditional routing paths that are vulnerable to termination due to the formation of these calculations are based on minimum hop. This study proposes a modified AODV-BR with reliability be the ability to build main route and to choose the route up to the value of the highest stability was then called AODV-Stable bacukp Routing (AODV-SBR). Armed algorithms Link Expiration Time with node movement calculation technique, so the AODV-SBR is able to calculate the value of the minimum and maximum connectivity nodes in a route as the main reference in establishing a delivery route data more stable. The results test of the both protocols in Packet Delivery Ratio (PDR), Throughput, End-to-En Delay and Routing Overhead shows that performance of AODV-SBR better than AODV-BR

Improved AODV Routing Protocol Based on Restricted Broadcasting by Communication Zones in Large-Scale VANET

The performance of traditional AODV protocol will be sharply decreased in the scenario of large-scale VANET, which covers a wide range geographic space and contains a huge number of vehicles. This paper proposes an improved AODV routing protocol based on restricted broadcasting by communication zones for data transmitting in large-scale VANET. The whole network is divided into several communication zones according to the spatial distribution characteristic of inter-vehicle communication connectivity probabilities of road sections. The connectivity performance of the communication zone is evaluated using the grey correlation analysis method, in which both the historical and forecasting connectivity probabilities of road sections are considered. Following the maximum grey correlation degree principle, a series of key communication zones is selected to construct a restricted broadcasting area for route discovery in AODV. In the paper, the simulation scheme for the proposed AODV protocol in large-scale VANET scenario is also presented. Simulation results show that, compared with traditional AODV, the proposed improved protocol has advantages in packet delivery fraction, overhead and route setup time.

A new network coding mechanism balancing coding opportunities, energy and QoS in WSNs

A new Network Coding mechanism in WSNs (Wireless Sensor Networks), which is named COEQ and aims at balancing coding opportunities, energy and QoS, is proposed and analyzed. Implemented on the basis of traditional AODV protocol, COEQ evaluates several metrics of paths comprehensively with TOPSIS method including minimum remaining energy, coding opportunities, QoS and so on, so as to select the optimal transmitting route. Experiments on NS[2] show that COEQ can improve throughput and save energy when the transmitting rate is low.

TAB-PRRA: Improved Link Repair Decision Mechanism for Ondemand Routing in MANET

The traditional AODV protocol uses a fixed hop count based threshold as a basis for deciding when to invoke Local Repair or Source Repair in case of a link break. The problem arises with this type of repairing mechanism is that the network is not clear that at which time what algorithms needs to be applied. So some condition has to be identified on the basis of which the decision can be taken. Also the decision must be pre- emptive so that the loss of data can be avoided before occurrence. In this paper, a Threshold Alarm Based Pre- emptive Route Repair Algorithm (TAB-PRRA) for Multi-Hop Local repair in ADOV is presented and simulated. It focuses on measuring those parameters which provides an prior information of link failure before its occurrence and also if the link break occurs that the network must know the time to start the route discovery. The approach offers efficient utilization of network resources such as energy and bandwidth. Index Terms: MANET, AODV, TAB (Threshold Alarm Based), PRRA (Pre-emptive Route Repair Algorithm), RREQ, RREP, Local Repair;

A Survey on QoS based routing protocols for MANET

mobile ad hoc networks (MANETs), the provision of quality of service (QoS) guarantees is much more challenging mainly due to node mobility and resource constraints. Therefore it is important that routing protocols incorporate QoS metrics in route finding and maintenance to support end-to-end QoS. The traditional AODV protocol seems less satisfactory in terms of routing data to end systems. Many revisions are done to the traditional AODV protocol to meet QoS challenges focused on bandwidth, end to end delay, Packet delivery ratio, energy and mechanism overheads. Hence , it becomes very necessary for MANETS to have an efficient routing and QoS mechanism to support various application. This article extensively and exclusively studies the issues involved with QoS routing and presents an overview and comparison of existing QoS based revisions done on AODV protocol, thus providing the reader with insight into their differences and allows to highlight trends in protocol design and identify areas for future research. Keywordsof Service, QoS metrics, MANET, AODV, Routing.

Energy Efficient AODV Routing in CDMA Ad Hoc Networks Using Beamforming

We propose an energy aware on-demand routing protocol for CDMA mobile ad hoc networks, for which improvements in the energy consumption are realized by both introducing an energy-based routing measure and by enhancing the physical layer performance using beamforming. Exploiting the cross-layer interactions between the network and the physical layer leads to a significant improvement in the energy efficiency compared with the traditional AODV protocol, and provides an alternative solution of link breakage detection in traditional AODV protocol. Several performance measures are considered for evaluating the network performance, such as data energy consumption, latency, and overhead energy consumption. An optimum SIR threshold range is determined experimentally for various implementation scenarios.