Enhanced shortest Path and Query Response Time for Users in Location Based Service

Abstract

The most important brave on answering live shortest paths is scalability, in terms of the number of clients and the amount of live traffic updates. An innovative and talented solution to the shortest path computation is to televise an air index over the wireless network called index transmission model. The most important advantages of this model are that the network overhead is self-determining of the number of clients and each client only downloads a portion of the entire roadmap according to the index information. For occurrence the proposed index comprises a set of pair wise smallest amount and maximum travelling costs between every two sub partitions of the road map. Though, these methods only resolve the scalability issue for the number of clients but not for the amount of live traffic updates. There-computation time of the index takes 2 hours for the San Francisco (CA) road map. It is prohibitively costly to update the index for OSP, in order to keep up with live traffic situation.

Authors and Affiliations

G. Naresh Kumar, Y. Jayababu, G. Vijay Kumar

Keywords

Related Articles

Delay reduction for testing using LPFRSE

Tracing the memory with a BIST approach is phenomenal, but verifying each bit in the memory and tracing the result is a high time consuming, high power utilizing and area constrained process. Here we are approaching...

Extended Public Key Cryptosystem and Aggregate Key for Secure data Sharing In Cloud

Information sharing is a basic usefulness in cloud storage. We exhibit how to immovably, powerfully, and straight forwardly impart information to others in cloud storage. Cryptographic frameworks are more versatile a...

THE SECURED ANTI PHISHING APPROACH USING IMAGE BASED VALIDATION

Anti-phishing schemes in the websites presently work on helping users to confirm whether a web site is honest or not. Phishing on the web pages is an attempt by an individual or a group to threats/hackers seeking to...

An Efficient Searching and File Replication Consistency in Peer-to-Peer Networks

Unstructured Network with file sharing properties with peer-to-peer (P2P) is very popular in the market. Though it is so popular it produce flooding query messages and result a heavy network traffic and which may not...

Overlapping Clusters in Genes – An Overview

While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to nding overlapping clusters have come from work on analysis of biol...

Download PDF file
  • EP ID EP28214
  • DOI -
  • Views 241
  • Downloads 3

How To Cite

G. Naresh Kumar, Y. Jayababu, G. Vijay Kumar (2015). Enhanced shortest Path and Query Response Time for Users in Location Based Service. International Journal of Research in Computer and Communication Technology, 4(7), -. https://europub.co.uk/articles/-A-28214