ND-AOMDV: SELEKSI PENERUSAN RREQ BERBASIS KEPADATAN NODE TETANGGA PADA PROTOKOL ROUTING AOMDV DI JARINGAN MANET BERKEPADATAN TINGGI

ND-AOMDV: Neighbor Density-Based RREQ Forwarding Selection in the AOMDV Routing Protocol for High-Density in MANETs

Abstract

Abstract

Route discovery in the Ad hoc On-demand Multipath Distance Vector (AOMDV) protocol relies on flooding Route Request (RREQ) packets, a mechanism that becomes increasingly wasteful as more nodes share the same radio neighborhood. In dense Mobile Ad Hoc Networks (MANETs), most rebroadcasts carry redundant information and only add channel contention, collisions, and control traffic. This paper presents Node Density-AOMDV (ND-AOMDV), in which every intermediate node regulates its own participation in route discovery using only its number of active neighbors. Nodes with at most k=11 neighbors always rebroadcast, whereas nodes in crowded neighborhoods rebroadcast with a probability inversely proportional to their neighbor count. The scheme was implemented in NS-2.35 and compared with standard AOMDV in a 1000 × 1000 m² area with 25 to 275 nodes. Standard AOMDV remains superior up to 175 nodes, but from 200 nodes onward ND-AOMDV delivers higher throughput and packet delivery ratio (PDR) with lower end-to-end delay and routing overhead. With 275 nodes, ND-AOMDV sustains a PDR of 92.37% versus 82.9% and lowers delay and routing overhead by 13.2% and 13.0%, respectively. Neighbor density is therefore a lightweight and effective criterion for controlling RREQ flooding in dense MANETs.