Experimental Evaluation of Shortest Path and Distance Queries in Time-Dependent Spatial Networks

Abstract

The salient advantages of this representation are that network transparency is autonomous of number of clients and each client only downloads a piece of the complete roadmap in relation to index information. An innovative solution towards shortest path computation is in the direction of broadcasting an air index on wireless network. In our work we suggest a new way out towards index transmission representation by initiation of live traffic index as the important method. Live traffic index is expected to put forward comparatively short tune-in cost, rapid query response time; little broadcast size as well as light maintenance time for online shortest paths. In our work, we prioritize tune-in cost as vital optimized factor while it affects duration of client receivers into dynamic mode and power expenditure is determined by tuning cost. We moderate tune-in cost of one service, and then we reserve additional resources for other services. The proposed system maintains index in favour of live traffic situation by incorporating dynamic shortest path tree into hierarchical index methods effectively. It lessen tune-in cost as compared to modern competitors; while it still offers reasonable query response time, broadcast size, as well as maintenance time.
Keywords: Shortest path computation; Live traffic index; Broadcast; Hierarchical index