EFFICIENT QUEUEING POLICIES FOR MOBILE AD HOC NETWORKS
Avinash Joshi, Samir R. Das · Networks · 2002
We investigate efficient queueing paradigms to be used at the radio interfaces for nodes in a mobile ad hoc network. Such a network employs dynamic routing to ensure communication between remote nodes. Low bandwidth of wireless links makes efficient queueing paradigms critical for the performance of routing protocols. We investigate various packet drop policies and priority scheduling policies targeted to improve aggregate performance measures for best-effort traffic. We evaluate these policies with an on-demand routing protocol, called AODV, and demonstrates that effective queueing paradigms can improve the fraction of packets delivered, and reduce delay and routing load.