The connectivity richness in mobile ad hoc networks, there are paths between a source and a destination. There are many applications those require uninterrupted connections between the nodes while transferring the packets, the long-living paths can be very useful to provide Quality of Service. In this paper, we propose path-selection algorithms and evaluate their performance in a mobile ad hoc network based on two criteria: 1) the selected path is the most likely to meet a target energy consumptions, and 2) the selected path has the longest residual path lifetime among all the available paths. We also develop performance metrics (PMs) to compare the proposed algorithms among themselves and with a baseline random-selection algorithm. It is found that path selection algorithms demonstrate comparable performance than existing algorithm. As the number of node increases, the proposed algorithms yield even greater performance gain over the baseline algorithm.

1. T. Camp, J. Boleng, and V. Davies, A Survey of Mobility Models for Ad Hoc Network Research, WCMC: Special issue on Mobile Ad HocNetworking: Research, Trends and Applications, 2002, Vol. 2, No. 5, pp. 483-502
2. S. K. Das, A. Mukherjee, S. Bandyopadhyay, K. Paul, and D. Saha, Improving Quality–of–Service in Ad-Hoc Wireless Networks with Adaptive Multi–path Routing, IEEE Global Telecommunications Conference, Vol. 1, 2000. pp 261–265
3. M. Gerharz, C. deWaal, M. Frank, and P. Martini, Link Stability in Mobile Wireless Ad Hoc Networks, 27th IEEE Conference on Local Computer Networks, Nov. 6-8, 2002. pp 30–39
4. M. Gerharz, C. de Waal, P. Martini, and P. James, Strategies for Finding Stable Paths in MobileWireless Ad Hoc Networks, 28th IEEE Conference on Local Computer Networks, Oct. 20-24, 20023. pp 130–139
5. E. Y. Hua and Z. J. Haas, Study of the Effects of Mobility on Residual Path Lifetime in Mobile Ad Hoc Networks, submitted to Second IEEE Upstate NY workshop on Communication and Networking, Nov. 2005
6. S. –J. Lee and M. Gerla, Split Multi-path Routing with Maximally Disjoint Paths in Ad hoc Networks, IEEE International Conference on Communications, 2001, Vol. 10, pp 3201–3205
7. B. Liang, Z. J. Haas, Predictive Distance-Based Mobility Management for Multidimensional PCS Networks, ACM Transactions on Networking, Vol 11, No. 5, Oct. 2003. pp718–732
8. Nasipuri and S. R. Das, On–Demand Multi–path Routing for Mobile Ad Hoc Networks, Computer Communications and Networks, 1999, pp 64–70
9. A. Nasipuri, R. Casta~neda, and S. R. Das, Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks, Mobile Netwokrs Application Journal, 2001, vol. 6, no. 4, pp 339–349
10. P. Samar and S. B. Wicker, On the Behavior of Communication Links of a Node in a Multi-hop Mobile Environment, Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2004
11. W. Su, S. -J. Lee, and M. Gerla, Mobility Prediction and Routing in Adhoc Wireless Networks, International Journal of Network Management, 2001, vol. 11, pp3–30
12. A. Tsirigos and Z. Haas, Multi-path Routing in the Presence of Frequent Topological Changes, IEEE Communications, vol. 39, issue 11, Nov. , 2001, pp132–138
13. A. Tsirigos and Z. J. Haas, Analysis of Multipath Routing - Part I: The Effect on the Packet Delivery Ratio, IEEE Transactions on Wireless Communications,vol. 3, no. 1, Jan. 2004, pp. 138–146
14. C. -K. Toh, Associativity Based Routing for Ad Hoc Mobile Networks Wireless Personal Communications Journal, Special Issue on Mobile Networking and Computing Systems, Mar. 1997. pp103-139

Quality Of Service Performance Metrics Mobile Ad Hoc Network Full Link Lifetime