Research Article | Open Access | Download PDF
Volume 59 | Number 2 | Year 2018 | Article Id. IJETT-V59P236 | DOI : https://doi.org/10.14445/22315381/IJETT-V59P236
A Simple and Secure Data Transfer Over Location Based Cloud Services
Doppa Alekhya, Dr.Gandi Satyanarayana
Citation :
Doppa Alekhya, Dr.Gandi Satyanarayana, "A Simple and Secure Data Transfer Over Location Based Cloud Services," International Journal of Engineering Trends and Technology (IJETT), vol. 59, no. 2, pp. 196-199, 2018. Crossref, https://doi.org/10.14445/22315381/IJETT-V59P236
Abstract
We propose a novel model of secure location based query search implementation with Path server to identity the route and spatial system or location based server identifies the spatial query results. Even though various models proposed by various researchers from the years of research, every model has its own advantages and disadvantages. Initially user makes the spatial query request, in turn it forwards to location based server and followed by path or route server. It computes the path and forwards to LBS and gets the respective spatial results and forwards to requested user. Our proposed model gives efficient results than traditional models.
Keywords
Path server,LBS
References
[1] Statistics of Usage. (2013). [Online]. Available: http://www. quantcast.com
[2] US Maps from Government. (2013). [Online]. Available: http:// www.usgs.gov/pubprod/
[3] N. Bruno, S. Chaudhuri, and L. Gravano, ?STHoles: A multidimensional workload-aware histogram,? in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2001, pp. 211–222.
[4] E. P. F. Chan and Y. Yang, ?Shortest path tree computation in dynamic graphs,? IEEE Trans. Comput., vol. 58, no. 4, pp. 541–557, Apr. 2009.
[5] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. Cambridge, MA, USA: MIT Press, 2009.
[6] U. Demiryurek, F. B. Kashani, C. Shahabi, and A. Ranganathan, ?Online computation of fastest path in time-dependent spatial networks,? in Proc. 12th Int. Symp. Adv. Spatial Temporal Databases, 2011, pp. 92–111.
[7] A.Dingle and T. Partl, ?Web cache coherence,? Comput.Netw., vol. 28, pp. 907–920, 1996.
[8] M.Drozdowski, Scheduling for Parallel Processing, 1st ed. New York, NY, USA: Springer, 2009.
[9] H. Hu, D. L. Lee, and V. C. S. Lee, ?Distance indexing on road networks,? in Proc. 32nd Int. Conf. Very Large Data Bases, 2006, pp. 894–905.
[10] S. Jung and S. Pramanik, ?An efficient path computation model for hierarchically structured topographical road maps,? IEEE Trans. Knowl. Data Eng., vol. 14, no, 5, pp. 1029–10.