On the Performance of Traffic Locality Oriented Route Discovery Algorithm with Delay
- 1 Sponsored by King Saud University, Riyadh, Saudi Arabia
- 2 Department of Computing Science, University of Glasgow, Glasgow, UK
- 3 Department of Electrical & Computer Engineering, Sultan Qaboos University, Muscat, Oman
Abstract
In MANETs, traffic may follow certain pattern that is not necessarily spatial or temporal but rather to follow special needs as a part of group for collaboration purposes. The source node tends to communicate with a certain set of nodes more than others regardless of their location exhibiting traffic locality where this set changes over time. We introduce a traffic locality oriented route discovery algorithm with delay, TLRDA-D. It utilises traffic locality by establishing a neighbourhood that includes the most likely destinations for a particular source node. The source node broadcasts the route request according to the original routing used. However, each intermediate node broadcasts the route request with a delay beyond this boundary to give priority for route requests that are travelling within their own source node’s neighbourhood region. This ap-proach improves the end-to-end delay and packet loss, as it generates less contention throughout the network. TLRDA-D is analysed using simulation to study the effect of adding a delay to route request propagation and to decide on the amount of the added delay.
- S. Murthy and B. Manoj, “Ad hoc wireless networks: Architectures and protocols,” Prentice Hall, 2004.
- A. Tanenbaum, “Computer networks,” Pearson Education, 2003.
- M. Abolhasan, T. Wysocki, and E. Dutkiewicz, “A review of routing protocols for mobile ad hoc networks,” Ad Hoc Networks, Vol. 2, No. 1, pp. 1-22, 2004.
- C. Adjih, T. Clausen, P. Jacquet, et al., “Optimized link state routing protocol,” The Internet Engineering Task Force, IETF, RFC 3626, 2003.
- S. R. Das, R. Castaneda, Y. Jiangtao, et al., “Comparative performance evaluation of routing protocols for mobile ad hoc networks,” pp. 153-161, 1998.
- D. Johnson, D. Maltz, and Y. -C. Hu, “The dynamic source routing protocol for mobile ad hoc networks (DSR),” The Internet Engineering Task Force, IETF, draft-ietf-manet-dsr-09.txt, April 2003.
- C. Perkins, E. Belding-Royer, and S. Das, “AODV ad hoc on-demand distance vector routing,” The Internet Engi-neering Task Force, IETF, RFC 3561, July 2003.
- Z. J. Haas, M. R. Pearlman, and P. Samar, “The Zone Routing Protocol (ZRP) for ad hoc networks,” IETF MANET Working Group, INTERNET-DRAFT, July, 2002.
- P. Denning, “The working set model for program behavior,” Communications of the ACM, Vol. 11, No. 5, pp. 323-333, 1968.
- M. Shikharesh and B. B. Richard, “Measurement and analysis of locality phases in file referencing behaviour,” Proceedings of the ACM SIGMETRICS Joint Interna-tional Conference on Computer Performance Modelling, Measurement and Evaluation, Raleigh, North Carolina, United States, 1986.
- P. Denning, “The locality principle,” Communications of the ACM, Vol. 48, No. 7, pp. 19-24, 2005.
- C. Kozierok, “The TCP/IP guide,” 1st Edition, No Starch Publishing, 2005.
- A. Silberschatz, P. Galvin, and G. Gagne, “Operating systems concepts,” 7th Edition, John Wiley & Sons, 2005.
- F. Borgonovo, “ExpressMAN: Exploiting traffic locality in expressnet,” IEEE Journal on Selected Areas in Com-munications, Vol. 5, No. 9, pp. 1436-1443, 1987.
- M. Prasant and K. Srikanth, “Ad hoc networks: Tech-nologies and protocols,” Springer-Verlag New York, Inc., 2004.
- J. Y. Li, C. Blake, D. S. J. De Couto, H. I. Lee, and R. Morris, “Capacity of ad hoc wireless networks,” Pro-ceedings of the 7th Annual International Conference on Mobile Computing and Networking, Rome, Italy, 2001.