Collaborative Computing: Networking, Applications and Worksharing. 13th International Conference, CollaborateCom 2017, Edinburgh, UK, December 11–13, 2017, Proceedings

Research Article

Shortest Path Discovery in Consideration of Obstacle in Mobile Social Network Environments

Download
13 downloads
  • @INPROCEEDINGS{10.1007/978-3-030-00916-8_58,
        author={Dawei Sun and Wentian Qu and Shang Gao and Li Liu},
        title={Shortest Path Discovery in Consideration of Obstacle in Mobile Social Network Environments},
        proceedings={Collaborative Computing: Networking, Applications and Worksharing. 13th International Conference, CollaborateCom 2017, Edinburgh, UK, December 11--13, 2017, Proceedings},
        proceedings_a={COLLABORATECOM},
        year={2018},
        month={10},
        keywords={Mobile social network Location-based service Shortest path discovery A-star algorithm},
        doi={10.1007/978-3-030-00916-8_58}
    }
    
  • Dawei Sun
    Wentian Qu
    Shang Gao
    Li Liu
    Year: 2018
    Shortest Path Discovery in Consideration of Obstacle in Mobile Social Network Environments
    COLLABORATECOM
    Springer
    DOI: 10.1007/978-3-030-00916-8_58
Dawei Sun1,*, Wentian Qu1,*, Shang Gao2,*, Li Liu3,*
  • 1: China University of Geosciences
  • 2: Deakin University
  • 3: University of Science and Technology Beijing
*Contact email: sundaweicn@cugb.edu.cn, qunty496047796@163.com, shang.gao@deakin.edu.au, liuli@ustb.edu.cn

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.