On the performance of traffic locality oriented route discovery algorithm with chase packets

Al-Rodhaan, M., Mackenzie, L.M. and Ould-Khaoua, M. (2008) On the performance of traffic locality oriented route discovery algorithm with chase packets. Bahria University Journal of Information and Communication Technology, 1(1), pp. 9-16.

Abstract

New traffic locality oriented route discovery algorithm with chase packets, referred to as TLRDA-C, is introduced. It improves route discovery process in on-demand routing protocols for MANETs running applications that exhibit traffic locality. The algorithm defines a neighbourhood region that includes the most likely destinations for each given source node. TLRDA-C broadcasts any route request travelling within their source node’s neighbourhood region according to the routing algorithm used. However, propagation of the route request is deliberately delayed within the beyond-neighbourhood region to provide the associated chase packet with an opportunity to stop the fulfilled route request and minimise network congestion. The algorithm is adaptive and continuously updates the boundary of each source node’s neighbourhood to improve performance. We provide detailed performance evaluation using simulation modelling and compare our algorithm with AODV, Limited Broadcasting, and Blocking-ERS. Our result shows that TLRDA-C improves the performance by minimizing the average end-to-end delay as well as the network overhead and congestion level.

• Item Type: Articles
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Ould-Khaoua, Dr Mohamed and Mackenzie, Dr Lewis
• Authors: Al-Rodhaan, M., Mackenzie, L.M., and Ould-Khaoua, M.
• Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science; Q Science > QA Mathematics
• College/School: College of Science and Engineering > School of Computing Science
• Journal Name: Bahria University Journal of Information and Communication Technology
• ISSN: 1999-4974