Traffic Locality Oriented Route Discovery Algorithm with Chase Packets for Mobile Ad Hoc Networks

摘要

A new traffic locality oriented route discovery algorithm with chase packets, referred to as TLRDA-C that improves route discovery process in on-demand routing protocols, is introduced. The algorithm defines a local neighbourhood that includes the most likely destinations for each given source node. The algorithm is adaptive and continuously updates the boundary of each source node's neighbourhood to improve performance. TLRDA-C broadcasts any route request travelling within their source node's neighbourhood according to the on-demand routing algorithm used. To minimise network congestion and provide the associated chase packet with an opportunity to stop the fulfilled route request, propagation of the route request is deliberately delayed outside such neighbourhood. We provide detailed performance evaluation using mathematical modelling and compare our algorithm with Limited Broadcasting and Blocking-ERS. Our result shows that TLRDA-C improves the performance by minimizing the average route request lifetime as well as the route discovery time.