The traditional AODV routing protocol uses broadcast method to forward RREQ(route re-quest group)in route discovery phase,which easily leads to broadcast storms to degrade the network performance.To address this problem,the study proposes an AODV routing protocol based on im-proved K-means,which uses inter-node distance,transmission error count and route congestion as routing metrics,improves the selection of initial clustering centers using the denseness parameter,and designs the AODV-K routing protocol to select the best forwarding node to reduce unnecessary route request packet forwarding,which improves the efficiency of route request packet forwarding and reduc-es.This improves the efficiency of routing request packet forwarding and reduces routing congestion.Simulation results using NS-3 show that the proposed improved routing protocol reduces the average end-to-end delay by 26.1%and 25.6%,respectively,compared to the original AODV routing protocol at high network load and network density.The average improvement in packet delivery rate is 13.7%when the number of nodes is 30,40,and 50,and 11.3%when the number of packet packets sent per second is greater than 30.
Ad Hoc networkAODV routing protocolrouting metricsK-means clusteringmessage for-warding mechanism
NETL
NSTL
万方数据
