No abstract

AODV is a mature and widely accepted routing protocol for Mobile Ad hoc Networks (MANET), it has low processing and memory overhead and low network utilization, and works well even in high mobility situation. We modified AODV to use these dominating sets, resulting in the AODV-DS protocol. Our contribution in addressing the fragility of a minimum connected dominating set in the presence of mobility and cross-traffic. We develop three heuristics to fortify the dominating set process against loss by re-introducing some redundancy using a least-first set cover rather than a greedy set cover. AODV-DS exhibits about a 70% savings in RREQ traffic while maintaining the same or better latency and delivery ratio for 30 source nodes in a graph of 50 nodes. It was also about as fair as conventional AODV in distributing the RREQ burden among all nodes, except in cases of low-mobility and few source nodes. For low-mobility networks, it was not as fair to forwarding nodes as AODV, but better than AODV with Dominant Pruning (DP)