SRMM: A Social Relationship-Aware Human Mobility Model

被引:2
|
作者
Duong, Dat Van Anh [1 ]
Yoon, Seokhoon [1 ]
机构
[1] Univ Ulsan, Dept Elect & Comp Engn, Ulsan 44610, South Korea
基金
新加坡国家研究基金会;
关键词
mobility model; opportunistic networking; social relationship; human movement characteristics;
D O I
10.3390/electronics9020221
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Since human movement patterns are important for validating the performance of wireless networks, several traces of human movements in real life have been collected. However, collecting data about human movements is costly and time-consuming. Moreover, multiple traces are demanded to test various network scenarios. As a result, a lot of synthetic models of human movement have been proposed. Nevertheless, most of the proposed models were often based on random generation, and cannot produce realistic human movements. Although there have been a few models that tried to capture the characteristics of human movement in real life (e.g., flights, inter-contact times, and pause times following the truncated power-law distribution), those models still cannot reflect realistic human movements due to a lack of consideration for social context among people. To address those limitations, in this paper, we propose a novel human mobility model called the social relationship-aware human mobility model (SRMM), which considers social context as well as the characteristics of human movement. SRMM partitions people into social groups by exploiting information from a social graph. Then, the movements of people are determined by considering the distances to places and social relationships. The proposed model is first evaluated by using a synthetic map, and then a real road map is considered. The results of SRMM are compared with a real trace and other synthetic mobility models. The obtained results indicate that SRMM is consistently better at reflecting both human movement characteristics and social relationships.
引用
收藏
页数:22
相关论文
共 50 条
  • [1] A Social Relationship-aware Mobility Model
    Dat Van Anh Duong
    Yoon, Seokhoon
    [J]. 2018 IEEE 4TH WORLD FORUM ON INTERNET OF THINGS (WF-IOT), 2018, : 658 - 663
  • [2] Relationship-aware contrastive learning for social recommendations
    Ji, Jinchao
    Zhang, Bingjie
    Yu, Junchao
    Zhang, Xudong
    Qiu, Dinghang
    Zhang, Bangzuo
    [J]. INFORMATION SCIENCES, 2023, 629 : 778 - 797
  • [3] KGCF: Social relationship-aware graph collaborative filtering for recommendation
    Chen, Yunliang
    Xie, Tianyu
    Chen, Haofeng
    Huang, Xiaohui
    Cui, Ningning
    Li, Jianxin
    [J]. INFORMATION SCIENCES, 2024, 680
  • [4] Learning Relationship-Aware Visual Features
    Messina, Nicola
    Amato, Giuseppe
    Carrara, Fabio
    Falchi, Fabrizio
    Gennaro, Claudio
    [J]. COMPUTER VISION - ECCV 2018 WORKSHOPS, PT IV, 2019, 11132 : 486 - 501
  • [5] Fuzzy-Based Social Relationship-Aware Routing Scheme for Opportunistic Networks
    Rani
    Malik, Amita
    [J]. International Journal of Fuzzy System Applications, 2022, 11 (03)
  • [6] Object affordance detection with relationship-aware network
    Zhao, Xue
    Cao, Yang
    Kang, Yu
    [J]. NEURAL COMPUTING & APPLICATIONS, 2020, 32 (18): : 14321 - 14333
  • [7] A relationship-aware methodology for context-aware service selection
    Kwon, Ohbyung
    Lee, Namyeon
    [J]. EXPERT SYSTEMS, 2011, 28 (04) : 375 - 390
  • [8] Object affordance detection with relationship-aware network
    Xue Zhao
    Yang Cao
    Yu Kang
    [J]. Neural Computing and Applications, 2020, 32 : 14321 - 14333
  • [9] Moving Towards "Relationship-aware" Applications and Services A Social Machine-oriented Approach
    Buregio, Vanilson Arruda
    Meira, Silvio Lemos
    Rosa, Nelson Souto
    Garcia, Vinicius Cardoso
    [J]. 17TH IEEE INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING CONFERENCE WORKSHOPS (EDOCW 2013), 2013, : 43 - 52
  • [10] RAQ: Relationship-Aware Graph Querying in Large Networks
    Vachery, Jithin
    Arora, Akhil
    Ranu, Sayan
    Bhattacharya, Arnab
    [J]. WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 1886 - 1896