An improvement of AODV protocol for the overhead reduction in scalable dynamic wireless ad hoc networks

Malnar, Marija; Jevtić, Nenad

doi:10.1007/s11276-022-02890-5

Cited by 12 publications

(6 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [7], an optimized protocol called ND-AODV is proposed, which primarily considers utilizing the number of neighbor nodes to determine whether a node exists in a highdensity environment. If it is determined that the node is in a high-density environment, the protocol uses a ratio between a threshold and the number of neighbor nodes to calculate its forwarding probability.…”

Section: Related Workmentioning

confidence: 99%

Routing Selection Algorithm for Mobile Ad Hoc Networks Based on Neighbor Node Density

Li,

Bian,

2024

Sensors

View full text Add to dashboard Cite

In the process of data transmission in mobile ad hoc networks, it is essential to establish optimal routes from source nodes to destination nodes. However, as network density increases, this process is often accompanied by a significant rise in network overhead. To address this issue, the ND-AODV (neighborhood density AODV) protocol has been introduced, which reduces the probability of transmitting control information in high-density node environments to mitigate network overhead. Nevertheless, this may come at the cost of reduced routing accuracy, potentially leading to unnecessary resource wastage in certain scenarios. Furthermore, ND-AODV does not comprehensively consider the location of the receiving nodes, which limits its ability to reduce network overhead effectively. To overcome these limitations, this paper introduces a novel routing approach, known as CND-AODV (common neighborhood density AODV). In comparison to ND-AODV, CND-AODV offers a more comprehensive solution to the challenges posed by high-density network environments. It intelligently processes control information based on the special positioning of the receiving nodes, thereby significantly reducing unnecessary network overhead. Through simulation experiments comparing performance metrics such as throughput, packet delivery rate, and latency, the results clearly indicate that CND-AODV substantially decreases network overhead, enhancing network performance. Compared to ND-AODV, this innovative routing approach exhibits significant advantages. It provides a more efficient and reliable solution for ad hoc networks in high-density environments.

show abstract

Section: Related Workmentioning

confidence: 99%

Routing Selection Algorithm for Mobile Ad Hoc Networks Based on Neighbor Node Density

Li,

Bian,

2024

Sensors

View full text Add to dashboard Cite

show abstract

“…The derivation of optimal density is empirically shown in the literature. The proposed method is compared with AODV and probabilistic AODV on various performance metrics such as overhead, PDR, throughput, jitter, etc ( Malnar & Jevtic, 2022 ).…”

Section: Literature Reviewmentioning

confidence: 99%

Systematic review on modification to the ad-hoc on-demand distance vector routing discovery mechanics

Alameri

Komárková

Al-Hadhrami

et al. 2022

PeerJ Computer Science

View full text Add to dashboard Cite

Mobile ad-hoc networks (MANETs) and wireless mesh networks (WMNs) are used in a variety of research areas, including the military, industry, healthcare, agriculture, the Internet of Things (IoT), transportation, and smart cities. The swift advancement in MANET technology is the driving force behind this rising adoption rate. Routing over MANET is a critical problem due to the dynamic nature of the link qualities, even when nodes are static. A key challenge in MANETs is the need for an efficient routing protocol that establishes a route according to certain performance metrics related to the link quality. The routing protocols utilised by the nodes in WMNs and MANETs are distinct. Nodes in both types of networks exchange data packets through the routing protocols. For this highly mobile network, the ad-hoc On-Demand Distance Vector (AODV) routing protocol has been suggested as a possible solution. Recent years have attracted researchers’ attention to AODV since it is a routing technique for ad-hoc networks that prevents looping. The architecture of this routing protocol considers several factors, including the mobility of nodes, the failure of connection links, and the loss of packets. In this systematic review, one of the key focuses is bringing attention to the classic AODV, which was developed after discussing the recent development of several versions of AODV. The AODV routing protocol performs a path strength check to generate a more reliable and secure route between the source and destination nodes. In AODV, investigations demonstrate advances in both the format protocol approach and the network simulation-2 (NS-2), and these improvements were made in the same scenario used to revitalise AODV. It has been discovered that the AODV is more effective in several aspects, such as throughput, end-to-end delay, packet delivery ratio (PDR), energy consumption, jitter, packet loss ratio, and network overhead. Furthermore, this paper presents this systematic review based on AODV modifications in the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA). It also provides a methodological framework for the papers’ selection.

show abstract

“…However, the probabilities p1 and p2 do not specify the optimal probability value in the reference [23], so the threshold is also difficult to calculate. In order to solve this problem, the reference [24] proposed the ND-AODV protocol.…”

Section: Nd-aodv Protocol Principlementioning

confidence: 99%

“…However k as a constant value, it is necessary to judge its optimal value. In reference [24], k = 11 is optimal. k taking a high value will result in a high routing overhead.…”

Section: Nd-aodv Protocol Principlementioning

confidence: 99%

“…For example, PAODV is mentioned in [23], which improves network performance by reducing routing overhead. Reference [24] proposed ND-AODV based on PAODV, further reducing the routing overhead and improving its performance. Reference [25] proposed three ETX mechanisms to reduce the routing overhead because of the high routing overhead of the ETX metric mechanism.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

UAV Routing Protocol Based on Link Stability and Selectivity of Neighbor Nodes in ETX Metrics

Huang

Zan

Liu

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

With the extensive application of UAVs in various fields, it becomes more important to design a routing protocol that ensures stable transmit between UAV groups. This is because UAV groups are densely packed, move fast, and communication links are fragile. Aiming at the intensive and highly maneuverable UAV group, the AODV-NLS-ETX—a routing protocol based on the link stability of neighbor nodes—is proposed on the basis of the ETX metric based AODV protocol. The protocol is simulated and compared with other protocols. The simulation results show that AODV-NLS-ETX is superior to other protocols in packet delivery rate and throughput under high shift speed, dense nodes, and high routing overhead. It can effectively reduce the high delay brought by the ETX mechanism. The delay is the most stable and is not easy to cause network congestion. It can be better applied to dense and highly mobile unmanned aerial vehicles.

show abstract

An improvement of AODV protocol for the overhead reduction in scalable dynamic wireless ad hoc networks

Cited by 12 publications

References 28 publications

Routing Selection Algorithm for Mobile Ad Hoc Networks Based on Neighbor Node Density

Routing Selection Algorithm for Mobile Ad Hoc Networks Based on Neighbor Node Density

Systematic review on modification to the ad-hoc on-demand distance vector routing discovery mechanics

UAV Routing Protocol Based on Link Stability and Selectivity of Neighbor Nodes in ETX Metrics

Contact Info

Product

Resources

About