Subscribe
Issue No.10 - October (2009 vol.8)
pp: 1412-1426
Hassan Artail , American University of Beirut, Beirut
ABSTRACT
This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Packet Forwarding (MDPF), uses routing information to select the node with the minimum distance. The goal of the proposed algorithm is to minimize the average number of hops taken to reach the node that holds the desired data. Numerical analysis and experimental evaluations using the network simulation software ns2 were performed to derive the lower and upper bounds of the confidence interval for the mean hop count between the source node of the data request, on one hand, and the node that holds the desired data and the last node in the set of search nodes, on the other hand. In the experimental evaluation, the performance of MDPF was compared to that of Random Packet Forwarding (RPF) and Minimal Spanning Tree Forwarding (MSTF). The results agreed with the numerical analysis results and demonstrated that MDPF offers significant hop count savings and smaller delays when compared to RPF and MSTF.
INDEX TERMS
Data search, message forwarding, routing, MANET, shortest path, simulations.
CITATION
Hassan Artail, "MDPF: Minimum Distance Packet Forwarding for Search Applications in Mobile Ad Hoc Networks", IEEE Transactions on Mobile Computing, vol.8, no. 10, pp. 1412-1426, October 2009, doi:10.1109/TMC.2009.56
REFERENCES
[1] T. Andrel and A. Yasinsac, “On Credibility of Manet Simulations,” Computer, vol. 39, no. 7, pp. 48-54, July 2006.
[2] C. Bettstetter and J. Eberspacher, “Hop Distances in Homogeneous Ad Hoc Networks,” Proc. IEEE Vehicular Technology Conf., vol. 4, pp. 2286-2290, 2003.
[3] C. Bettstetter, H. Hartenstein, and X. Perez-Costa, “Stochastic Properties of the Random Waypoint Mobility Model: Epoch Length, Direction Distribution, and Cell Change Rate,” Proc. Int'l Workshop Modeling, Analysis Simulation Wireless Mobile Systems, pp.7-14, Sept. 2002.
[4] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM, pp. 126-134, 1999.
[5] J. Broch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Source,” Proc. Fourth Ann. ACM/IEEE Int'l Conf. Mobile Computing Networking, pp. 85-97, 1998.
[6] C. Clopper and E. Pearson, “The Use of Confidence or Fiducial Limits Illustrated in the Case of the Binomial,” Biometrika, vol. 26, pp. 404-413, 1934.
[7] D. Espes and Z. Mammeri, “Adaptive Expanding Search Methods to Improve AODV Protocol,” Proc. 16th IST Mobile Wireless Comm. Summit, pp. 1-5, July 2007.
[8] C. Frank and H. Karl, “Consistency Challenges of Service Discovery in Mobile Ad Hoc Networks,” Proc. Int'l Symp. Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWim '04), Oct. 2004.
[9] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman Publisher, 1979.
[10] D. Johnson, L. McGeoch, and E. Rothberg, “Asymptotic Experimental Analysis for the Held Karp Traveling Salesman Bound,” Proc. Seventh ACM-SIAM Symp. Discrete Algorithms, pp. 341-350, 1996.
[11] G. Malkin, RIP Version 2, IETF RFC 1723, www.ietf.cnri. reston.va.us, Nov. 1994.
[12] J. Moy, OSPF Version 2, IETF RFC 1583, www.ietf.cnri.reston. va.us, Mar. 1994.
[13] A. Percus and O. Martin, “Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem,” Physical Rev. Letter, vol. 76, no. 8, pp. 1188-1191, 1996.
[14] H. Pucha, S.M. Das, and Y.C. Hu, “Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks,” Proc. Sixth IEEE Workshop Mobile Computing Systems Applications (WMCSA '04), Dec. 2004.
[15] D. Rosencrantz, R. Stearns, and P. Lewis, “An Analysis of Several Heuristics for the Traveling Salesman Problem,” SIAM J. Computing, vol. 6, pp. 563-581, 1977.
[16] J. van Leeuwen, “Algorithmic Modeling and Complexity,” lecture notes, Dept. of Information and Computing Sciences, Utrecht Univ., 2003.
[17] S. Vural and E. Ekici, “Analysis of Hop-Distance Relationship in Spatially Random Sensor Networks,” Proc. Sixth ACM Int'l Symp. Mobile Ad Hoc Networking Computing, pp. 320-331, 2005.
[18] Wikipedia, http://en.wikipedia.org/wikiOrder_statistic , 2009.
[19] Wikipedia, http://en.wikipedia.org/wikiBerry-Esseen_theorem , 2009.
[20] G. Zipf, Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949.
[21] S. Kurkowski, T. Camp, and M. Colagrosso, “MANET Simulation Studies: The Incredible,” ACM SIGMOBILE Mobile Computing Comm., vol. 9, no. 4, pp. 50-61, Oct. 2005.