Measures of node centrality in mobile social networks

被引:22
|
作者
Gao, Zhenxiang [1 ]
Shi, Yan [1 ]
Chen, Shanzhi [2 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[2] China Acad Telecommun Technol, State Key Lab Wireless Mobile Commun, Beijing 100083, Peoples R China
来源
基金
美国国家科学基金会;
关键词
Mobile social networks; human mobility patterns; temporal evolution graph model; node centrality metrics; PREDICTION;
D O I
10.1142/S0129183115501077
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Mobile social networks exploit human mobility and consequent device-to-device contact to opportunistically create data paths over time. While links in mobile social networks are time-varied and strongly impacted by human mobility, discovering influential nodes is one of the important issues for efficient information propagation in mobile social networks. Although traditional centrality definitions give metrics to identify the nodes with central positions in static binary networks, they cannot effectively identify the influential nodes for information propagation in mobile social networks. In this paper, we address the problems of discovering the influential nodes in mobile social networks. We first use the temporal evolution graph model which can more accurately capture the topology dynamics of the mobile social network over time. Based on the model, we explore human social relations and mobility patterns to redefine three common centrality metrics: degree centrality, closeness centrality and betweenness centrality. We then employ empirical traces to evaluate the benefits of the proposed centrality metrics, and discuss the predictability of nodes' global centrality ranking by nodes' local centrality ranking. Results demonstrate the efficiency of the proposed centrality metrics.
引用
收藏
页数:20
相关论文
共 50 条
  • [21] Centrality Measures in Biological Networks
    Ghasemi, Mahdieh
    Seidkhani, Hossein
    Tamimi, Faezeh
    Rahgozar, Maseud
    Masoudi-Nejad, Ali
    [J]. CURRENT BIOINFORMATICS, 2014, 9 (04) : 426 - 441
  • [22] A simple approach for quantifying node centrality in signed and directed social networks
    Liu, Wei-Chung
    Huang, Liang-Cheng
    Liu, Chester Wai-Jen
    Jordan, Ferenc
    [J]. APPLIED NETWORK SCIENCE, 2020, 5 (01)
  • [23] A simple approach for quantifying node centrality in signed and directed social networks
    Wei-Chung Liu
    Liang-Cheng Huang
    Chester Wai-Jen Liu
    Ferenc Jordán
    [J]. Applied Network Science, 5
  • [24] Privacy and Node Cooperation in Mobile Social Networks
    Altamimi, Ahmed B.
    Gulliver, T. Aaron
    [J]. 2014 IEEE 28TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2014, : 1007 - 1010
  • [25] Partition-aware centrality measures for connectivity restoration in mobile sensor networks
    Senturk, Izzet Fatih
    [J]. INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2019, 30 (01) : 1 - 12
  • [26] Comparing Community-Aware Centrality Measures in Online Social Networks
    Rajeh, Stephany
    Savonnet, Marinette
    Leclercq, Eric
    Cherifi, Hocine
    [J]. COMPUTATIONAL DATA AND SOCIAL NETWORKS, CSONET 2021, 2021, 13116 : 279 - 290
  • [27] On the robustness of centrality measures against link weight quantization in social networks
    Sho Tsugawa
    Yukihiro Matsumoto
    Hiroyuki Ohsaki
    [J]. Computational and Mathematical Organization Theory, 2015, 21 : 318 - 339
  • [28] Combined centrality measures for an improved characterization of influence spread in social networks
    Simsek, Mehmet
    Meyerhenke, Henning
    [J]. JOURNAL OF COMPLEX NETWORKS, 2020, 8 (01)
  • [29] On the robustness of centrality measures against link weight quantization in social networks
    Tsugawa, Sho
    Matsumoto, Yukihiro
    Ohsaki, Hiroyuki
    [J]. COMPUTATIONAL AND MATHEMATICAL ORGANIZATION THEORY, 2015, 21 (03) : 318 - 339
  • [30] Centrality measures for node-weighted networks via line graphs and the matrix exponential
    De la Cruz Cabrera, Omar
    Matar, Mona
    Reichel, Lothar
    [J]. NUMERICAL ALGORITHMS, 2021, 88 (02) : 583 - 614