Efficient Location Services Using Hierarchical Topology of Mobile Ad Hoc Networks
Prasad Naik Hamsavath, G. V. Singh
DOI: 10.4236/jsea.2012.51003   PDF    HTML   XML   4,820 Downloads   8,051 Views   Citations


The thesis work was carried out in two phases. Firstly, we have designed the Cluster-Based Object Location Algorithm (CBOLA) for finding the object location in a cluster based network topology. Secondly, to take the advantages of clustering architecture of Mobile Ad hoc Networks, we have especially designed Object Location Clusters Algorithm (OLCA) for efficient Object Location management in MANET. Our comparison of simulation analysis shows that the CBOLA is more efficient and accurate in location information services and more robust than GLS and HRLS. In addition, we believe that our comparative study with the various location services schemes was facilitated accurate results in ad hoc networks. we are portioned our network area by designing a new clustering algorithm called OLCA (Object Location Clusters Algorithm) for efficient object location in Mobile Ad hoc Networks. Simulation results and comparative analysis shows the performance and effectiveness of CBOLA and OLCA.

Share and Cite:

P. Hamsavath and G. Singh, "Efficient Location Services Using Hierarchical Topology of Mobile Ad Hoc Networks," Journal of Software Engineering and Applications, Vol. 5 No. 1, 2012, pp. 14-20. doi: 10.4236/jsea.2012.51003.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] C. K. Toh, “Ad Hoc Mobile Wireless Networks: Protocols & Systems,” 2nd Edition, Prentice Hall, Inc., 2002.
[2] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” SpringerLink, 26 August, 2007, pp. 153-181.
[3] C. E. Perkins and E. M. Royer, “Ad-hoc On-Demand Distance Vector Routing,” Workshop on Mobile Computing Systems and Applications, 1999, p. 90.
[4] N. Beijar, “Zone Routing Protocol.” www.netlab.tkk.fi/opetus/s38030/k02/Papers/08-Niclas.pdf
[5] Y.-B. Ko and N. H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,” Wireless Networks, Vol. 6, No. 4, 2000, pp. 307-321. doi:10.1023/A:1019106118419
[6] S. Basagni, I. Chlamtac, V. R. Syrotiuk and B. A. Woodward, “A Distance Routing Effect Algorithm for Mobility,” ACM Digital Library, 1998, pp. 76-84.
[7] T. Camp, J. Boleng and L. Wilcox, “Location Information Services in Mobile Ad Hoc Networks,” Proceedings of the IEEE International Conference on Communications, 2002, pp. 3318-3324.
[8] M. Kasemann, H. Fubler, H. Hartenstein and M. Mauve, “A Reactive Location Service for Mobile Ad Hoc Networks,” Report, 2002.
[9] N. K. Guba and T. Camp, “GLS: A Location Service for an Ad Hoc Network,” http://toilers.mines.edu
[10] G. Owen and M. Adda, “SOLS: Self Organizing Distributed Location Server for Wireless Ad Hoc Networks,” International Journal of Computer Networks & Communications, Vol. 1, No. 1, 2009.
[11] I. Stojmenovic, “Location Updates for Efficient Routing in Ad Hoc Networks,” Handbook of Wireless Networks and Mobile Computing, John Wiley & Sons, Inc., 2002.
[12] R. Jain, A. Puri and R. Sengupta, “Geographical Routing Using Partial Information for Wireless Ad Hoc Networks,” IEEE Personal Communications, February 2001.
[13] Garmin, “GPS Beginner’s Guide,” July 2008.
[14] J. Nuevo, “Comprehensible GloMoSim Tutorial,” 2004. INRS—Universite du Quebec Nuevo@inrstelecom. Uquebec.ca
[15] R. A. Meyer and R. Bagrodia, “PARSEC User Manual for PARSEC,” 1999. http://pcl.cs.ucla.edu/

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.