Open Access   Article Go Back

A Review on an optimized path finding on road network using Ant colony algorithm

Gitali Rakshak1 , Amit Pimpalkar2

Section:Review Paper, Product Type: Journal Paper
Volume-2 , Issue-10 , Page no. 26-29, Oct-2014

Online published on Nov 02, 2014

Copyright © Gitali Rakshak , Amit Pimpalkar . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Gitali Rakshak , Amit Pimpalkar, “A Review on an optimized path finding on road network using Ant colony algorithm,” International Journal of Computer Sciences and Engineering, Vol.2, Issue.10, pp.26-29, 2014.

MLA Style Citation: Gitali Rakshak , Amit Pimpalkar "A Review on an optimized path finding on road network using Ant colony algorithm." International Journal of Computer Sciences and Engineering 2.10 (2014): 26-29.

APA Style Citation: Gitali Rakshak , Amit Pimpalkar, (2014). A Review on an optimized path finding on road network using Ant colony algorithm. International Journal of Computer Sciences and Engineering, 2(10), 26-29.

BibTex Style Citation:
@article{Rakshak_2014,
author = {Gitali Rakshak , Amit Pimpalkar},
title = {A Review on an optimized path finding on road network using Ant colony algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {10 2014},
volume = {2},
Issue = {10},
month = {10},
year = {2014},
issn = {2347-2693},
pages = {26-29},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=278},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=278
TI - A Review on an optimized path finding on road network using Ant colony algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - Gitali Rakshak , Amit Pimpalkar
PY - 2014
DA - 2014/11/02
PB - IJCSE, Indore, INDIA
SP - 26-29
IS - 10
VL - 2
SN - 2347-2693
ER -

VIEWS PDF XML
4022 3636 downloads 3616 downloads
  
  
           

Abstract

The large usage of smart phones and GPS enabled devices, which provides location based services, the necessity of outsourcing spatial data has grown rapidly over the past some years. Nevertheless a challenging problem remains in the database outsourcing paradigm is that the authentication of the query results at the client side. In this data owner delegates management of its database to the third party instant of directly served the request of clients. Ensuring spatial query integrity is critical because third party service provider is not always trustworthy. We propose an efficient road network optimized path finding technique using ant colony algorithm which utilizes the network Voronoi diagram and neighbors to prove the integrity of query results. Unlike previous work that consider only one data owner party but we are considering multi data owner party. This experiment will run on Google Android mobile devices.

Key-Words / Index Term

Spatial database outsourcing, location-based service, service provider, voronoi diagram, spatial query

References

[1] Yinan Jing, Ling Hu, Wei-Shinn Ku and Cyrus Shahabi “Authentication of k Nearest Neighbor Query on Road Networks”, IEEE transactions, vol. 26, no. 6, June 2014.
[2] Preeti Tiwari, Dr. Swati V. Chande “Optimization of Distributed Database Queries Using Hybrids of Ant Colony Optimization Algorithm” International Journal of Advanced Research in Computer Science and Software Engineering 3(6), pp. 609-614 June - 2013.
[3] Xuefeng Liu, Yuqing Zhang, Member, IEEE, Boyang Wang, and Jingbo Yan “Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud” IEEE transactions on parallel and distributed systems, vol. 24, no. 6, June 2013.
[4] Krzysztof Jankowski and Pierre Laurent, “Packed AES-GCM Algorithm Suitable for AES/PCLMULQDQ Instructions” IEEE transactions on computers, vol. 60, no. 1, January 2011.
[5] H. Samet, J. Sankaranarayanan, and H. Alborzi, “Scalable network distance browsing in spatial databases”, SIGMOD, New York, NY, USA, pp. 43–54, 2008.
[6] K. C. K. Lee, W.-C. Lee, B. Zheng, and Y. Tian, “ROAD: A new spatial object search framework for road networks,” IEEE Transactions., vol. 24, no. 3, pp. 547–560, Mar. 2012.
[7] E. Mykletun, M. Narasimha, and G. Tsudik, “Authentication and integrity in outsourced databases,” TOS, vol. 2, no. 2, pp. 107–138, May 2006.
[8] H. Pang, A. Jain, K. Ramamritham and K.-L. Tan, “Verifying completeness of relational query results in data publishes”, SIGMOD Conference Baltimore, MD, USA, pp. 407–418, 2005.
[9] Majid Khan and M. N. A. Khan “ Exploring Query Optimization Techniques in Relational Databases” International Journal of Database Theory and Application Vol. 6, No. 3, June, 2013.
[10] Lei Zhang, Qianhong Wu, Agusti Solanas, Member, IEEE, and Josep Domingo-Ferrer, Senior Member, IEEE “A Scalable Robust Authentication Protocol for Secure Vehicular Communications” IEEE transactions on vehicular technology, vol. 59, no. 4, may 2010.