Hey, influencer! Message delivery to social central nodes in social opportunistic networks

被引:19
作者
Borrego, Carlos [1 ]
Borrell, Joan [1 ]
Robles, Sergi [1 ]
机构
[1] Univ Autonoma Barcelona, Dept Informat & Commun Engn, Barcelona, Spain
关键词
OppNet; Opportunistic social networks; Optimisation; Centrality; SECRETARY PROBLEM; DELAY; SCHEME;
D O I
10.1016/j.comcom.2019.02.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a new strategy to efficiently deliver messages to influencers in social opportunistic networks. An influencer node is an important node in the network with a high social centrality and, as a consequence, it can have some characteristics such as high reputation, trustfulness and credibility, that makes it an interesting recipient. Social network analysis has already been used to improve routing in opportunistic networking, but there are no mechanisms to efficiently route and deliver messages to these network influencers. The delivery strategy proposed in this article uses optimal stopping statistical techniques to choose among the different delivery candidate nodes in order to maximise the social centrality of the node chosen for delivery. For this decision process, we propose a routing-delivery strategy that takes into account node characteristics such as how central a node is in terms of its physical encounters. We show, by means of simulations based on real traces and message exchange datasets, that our proposal is efficient in terms of influencer selection, overhead, delivery ratio and latency time. With the proposed strategy, a new venue of applications for opportunistic networks can be devised and developed using the leading figure of social influencers.
引用
收藏
页码:81 / 91
页数:11
相关论文
共 49 条
  • [1] HUBCODE: hub-based forwarding using network coding in delay tolerant networks
    Ahmed, Shabbir
    Kanhere, Salil S.
    [J]. WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2013, 13 (09) : 828 - 846
  • [2] [Anonymous], AD HOC NETW
  • [3] [Anonymous], 2006, CRAWDAD DATASET UPMC
  • [4] [Anonymous], ARXIV161006095
  • [5] [Anonymous], 2014, PROC 17 ACM INT C MO
  • [6] [Anonymous], 2003, ACM SIGMOBILE mobile computing and communications review, DOI DOI 10.1145/961268.961272
  • [7] [Anonymous], IEEE T MOBILE COMPUT
  • [8] [Anonymous], INFORM SCI
  • [9] Betweenness centrality in large complex networks
    Barthélemy, M
    [J]. EUROPEAN PHYSICAL JOURNAL B, 2004, 38 (02) : 163 - 168
  • [10] Submodular Secretary Problem and Extensions
    Bateni, Mohammadhossein
    Hajiaghayi, Mohammadtaghi
    Zadimoghaddam, Morteza
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2013, 9 (04)