.png){kind=icon}
返回
Routing Selection Algorithm for Mobile Ad Hoc Networks Based on Neighbor Node Density
.png){kind=icon}
OA
AI
DOI：10.3390/s24020325.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
AODV
ND-AODV
CND-AODV
ad hoc
neighbor nodes
route discovery
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment.png)
SENSORSOAAI
SENSORSIF3.5
OAAI分享收藏Computing the Kolmogorov-Smirnov Distribution When the Underlying CDF is Purely Discrete, Mixed, or Continuous当基础CDF是纯离散的、混合的或连续的时，计算kolmogorov-smirnov分布
OAAI
OAAI分享收藏A Reliable Low-Latency Multipath Routing Algorithm for Urban Rail Transit Ad Hoc NetworksSENSORSOAAI
SENSORSIF3.5
OAAI分享收藏分享收藏
查看更多内容