Abstract
The Global Positioning System (GPS) tracking data is essential for sensor data sources. It plays an important role for various systems like Traffic assessment and Prediction, routing and navigation, Fleet management etc. Trajectory data accuracy is key factor for sampling based vehicle movement using
Highlights
Wireless sensor are very helpful for environment monitoring and communication process; researchers face challenges like computational constraints, link failure, fault tolerance for coverage network which would improve with wireless sensor coverage performance and generation sensor technologies is necessary for mobile communication systems which will helpful on high speed mobility and tracking services [1]
Global Position System (GPS) receivers are unified into various systems like Navigation system, Vehicle telemetric system, Intelligent Transport System (ITS), Smartphone etc
This paper introduces, map matching issues and algorithms including optimum outcomes
Summary
Wireless sensor are very helpful for environment monitoring and communication process; researchers face challenges like computational constraints, link failure, fault tolerance for coverage network which would improve with wireless sensor coverage performance and generation sensor technologies is necessary for mobile communication systems which will helpful on high speed mobility and tracking services [1]. This paper exploits GPS tracking trajectory data errors to pare down on the road network, presumably in the right tracking approach for high accuracy using fast map matching algorithm and adaptive clipping algorithm, which compute approximate real path between nearest road polygon’s circumferences. GPS trajectory data errors are finding; and reduce by computing frechet distance, between active surfaces of polygon circumferences [3]. Existing Adaptive Clipping algorithms provide local and global map EAI Endorsed Transactions on Industrial Networks and Intelligent Systems matching approach using Strong Frechet distance. Yin et al [11] proposed, a high quality map matching method for computing nearest point’s trajectory data; on active surface area of the road network which is indicates through a weighted graph, every weighted edges are decoding the distance between vehicles position for calculate shortest Path value using Dijkstra’s Algorithm
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
