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

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.