Abstract
The issue of shortest path discovery in consideration of obstacle is one of the problems for location-based services in mobile social network environments. Currently, most research focuses on quickly discovering the shortest path in obstacle free area with reasonable latency, while the obstacle issue, especially the obstacles that enter temporarily is not fully considered. This creates the need for investigation on shortest path discovery at the same time avoiding detected obstacles. In this paper, a shortest path discovery approach is proposed. The following contributions are made: (1) Modeling the shortest path discovery problem in consideration of obstacle. (2) Discovering the shortest path using an improved A-star algorithm with reasonable latency. (3) Evaluating the accuracy rate of shortest path discovery with acceptable latency for a location-based service in a mobile social network. Experimental results conclusively demonstrate the efficiency and effectiveness of the proposed approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Hong, J., Park, K., Han, Y., Rasel, M.K., Vonvou, D., Lee, Y.K.: Disk-basedshortest path discovery using distance index over large dynamic graphs. Inf. Sci. 382–383, 201–215 (2017)
He, K., Xu, Z.Z., Wang, P., Deng, L.B., Tu, L.: Congestion avoidance routing based on large-scale social signals. IEEE Trans. Intell. Transp. Syst. 17(9), 2613–2626 (2016)
Lai, C.N.: Constructing all shortest node-disjoint paths in torus networks. J. Parallel Distrib. Comput. 75, 123–132 (2015)
Wang, X., Li, J., Li, X., Wang, H.: Applying the locality principle to improve the shortest path algorithm. Clust. Comput. 20(1), 301–309 (2017)
Qu, W.T., Sun, D.W.: A fast search strategy to optimize path finding in big data graph computing environments. Int. J. Wirel. Mobile Comput. 13(2), 139–143 (2017)
Mao, G., Zhang, N.: Fast approximation of average shortest path length of directed BA networks. Phys. A Stat. Mech. Appl. 466, 243–248 (2017)
Huang, W., Wang, J.: The shortest path problem on a time-dependent network with mixed uncertainty of randomness and fuzziness. IEEE Trans. Intell. Transp. Syst. 17(11), 3194–3204 (2016)
Feng, G., Korkmaz, T.: Finding multi-constrained multiple shortest paths. IEEE Trans. Comput. 64(9), 2559–2572 (2015)
Sang, Y., Lv, J., Qu, H., Yi, Z.: Shortest path computation using pulse-coupled neural networks with restricted autowave. Knowl. Based Syst. 114, 1–11 (2016)
AlShawi, I.S., Yan, L., Luo, W., Pan, W., Luo, B.: Lifetime enhancement in wireless sensor networks using fuzzy approach and A-star algorithm. IEEE Sens. J. 12(10), 3010–3018 (2012)
Wei, Q., Liang, X., Fang, J.: A new star identification algorithm based on improved hausdorff distance for star sensors. IEEE Trans. Aerosp. Electron. Syst. 49(3), 2101–2109 (2013)
Li, B., Sun, Q., Zhang, T.: A star pattern recognition algorithm for the double-FOV star sensor. IEEE Aerosp. Electron. Syst. Mag. 30(8), 24–31 (2015)
Huang, J., Sun, L., Du, F., Wan, H., Zhao, X.: Genetic adaptive A-star approach for ttrain trip profile optimization problems. In: Proceedings of the 2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems, CIVTS 2014, pp. 1–6. IEEE Press (2014)
Zhang, X.G., Chan, F.T.S., Yang, H., Deng, Y.: An adaptive amoeba algorithm for shortest path tree computation in dynamic graphs. Inf. Sci. 405, 123–140 (2017)
Chiu, W.Y., Yen, G.G., Juan, T.K.: Minimum manhattan distance approach to multiple criteria decision making in multiobjective optimization problems. IEEE Trans. Evolut. Comput. 20(6), 972–985 (2016)
Ghaffari, A.: An energy efficient routing protocol for wireless sensor networks using A-star algorithm. J. Appl. Res. Technol. 12(4), 815–822 (2014)
Cui, X., Shi, H.: A*-based pathfinding in modern computer games. Int. J. Comput. Sci. Netw. Secur. 11(1), 125–130 (2011)
Ducho, F., et al.: Path planning with modified a Star algorithm for a mobile robot. Procedia Eng. 96, 59–69 (2014)
Acknowledgment
This work is supported by the National Natural Science Foundation of China under Grant No. 61602428 and 61370132; the Fundamental Research Funds for the Central Universities under Grant No. 2652015338.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Sun, D., Qu, W., Gao, S., Liu, L. (2018). Shortest Path Discovery in Consideration of Obstacle in Mobile Social Network Environments. In: Romdhani, I., Shu, L., Takahiro, H., Zhou, Z., Gordon, T., Zeng, D. (eds) Collaborative Computing: Networking, Applications and Worksharing. CollaborateCom 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 252. Springer, Cham. https://doi.org/10.1007/978-3-030-00916-8_58
Download citation
DOI: https://doi.org/10.1007/978-3-030-00916-8_58
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00915-1
Online ISBN: 978-3-030-00916-8
eBook Packages: Computer ScienceComputer Science (R0)