Smart mobile device to trace moving rogue objects in smart city utilizing dynamic source dynamic destination tracking algorithm

In the present literature, various algorithms are available for computing the shortest path between two objects. The maximum number of these algorithms compute the shortest path either between two static objects or one static object and one dynamic object. This article presents an insight to integrated Mobile Edge Computing (MEC) based smart devices for tracking mobile rogue objects based on dynamic source and dynamic destination optimal cost estimation. This device considers any two mobile objects to estimate the shortest path between them. The proposed Ant Colony Optimization (ACO) based algorithm considers the property of dead-end removal and nth path exploration with efficient self-loop removal strategy. To review the performance of the proposed algorithm, experimentations are carried out and compared with several well-established shortest cost estimation techniques available in the literature – Floyd Warshall, Bellman Ford, Dijkstra, A* algorithms and the only dynamic shortest path algorithm. The detailed algorithmic comparisons clearly indicate the superiority of the proposed one over the existing dynamic and present state-of-the-art shortest path estimation methodologies.