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

Abstract 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.

[1]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[2]  Zaher Dawy,et al.  A Social-Aware Framework for Efficient Information Dissemination in Wireless Ad Hoc Networks , 2017, IEEE Communications Magazine.

[3]  Jörg Ott,et al.  Searching a needle in (linear) opportunistic networks , 2014, MSWiM '14.

[4]  J. Neil Bearden,et al.  A new secretary problem with rank-based selection and cardinal payoffs , 2006 .

[5]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[6]  Luigi Paura,et al.  Human-mobility enabled wireless networks for emergency communications during special events , 2013, Pervasive Mob. Comput..

[7]  P. Freeman.  The Secretary Problem and its Extensions: A Review , 1983 .

[8]  Sergi Robles,et al.  Softwarecast: A code-based delivery Manycast scheme in heterogeneous and Opportunistic Ad Hoc Networks , 2017, Ad Hoc Networks.

[9]  J. Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[10]  Zhiyuan Li,et al.  Explore and wait: A composite routing-delivery scheme for relative profile-casting in opportunistic networks , 2017, Comput. Networks.

[11]  Sophie Stalla-Bourdillon,et al.  From porn to cybersecurity passing by copyright: How mass surveillance technologies are gaining legitimacy ... The case of deep packet inspection technologies , 2014, Comput. Law Secur. Rev..

[12]  Jie Wu,et al.  Opportunistic Mobile Social Networks , 2014 .

[13]  Sung-Bong Yang,et al.  A forwarding scheme based on swarm intelligence and percolation centrality in opportunistic networks , 2016, Wirel. Networks.

[14]  Vikram Srinivasan,et al.  PeopleNet: engineering a wireless virtual social network , 2005, MobiCom '05.

[15]  Mieso K. Denko,et al.  Mobile Opportunistic Networks: Architectures, Protocols and Applications , 2011 .

[16]  Bernhard Plattner,et al.  A Decade of Research in Opportunistic Networks: Challenges, Relevance, and Future Directions , 2017, IEEE Communications Magazine.

[17]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[18]  Qinghua Li,et al.  Social-Aware Multicast in Disruption-Tolerant Networks , 2012, IEEE/ACM Transactions on Networking.

[19]  Athanasios V. Vasilakos,et al.  BASA: building mobile Ad-Hoc social networks on top of android , 2014, IEEE Network.

[20]  Carlo Ratti,et al.  Human mobility prediction based on individual and collective geographical preferences , 2010, 13th International IEEE Conference on Intelligent Transportation Systems.

[21]  Carlos Borrego,et al.  A store-carry-process-and-forward paradigm for intelligent sensor grids , 2013, Inf. Sci..

[22]  Xiaodong Lin,et al.  SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks , 2009, IEEE Transactions on Vehicular Technology.

[23]  Angela Fabregues,et al.  A mobile code bundle extension for application-defined routing in delay and disruption tolerant networking , 2015, Comput. Networks.

[24]  M. Barthelemy.  Betweenness centrality in large complex networks , 2003, cond-mat/0309436.

[25]  Juan-Carlos Cano,et al.  DTN Protocols for Vehicular Networks: An Application Oriented Overview , 2015, IEEE Communications Surveys & Tutorials.

[26]  Martin Everett,et al.  Ego network betweenness , 2005, Soc. Networks.

[27]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2011 .

[28]  Salil S. Kanhere,et al.  HUBCODE: hub-based forwarding using network coding in delay tolerant networks , 2013, Wirel. Commun. Mob. Comput..

[29]  M. Sarvary,et al.  Network Effects and Personal Influences: The Diffusion of an Online Social Network , 2011 .

[30]  Ciprian Dobre,et al.  Adaptive method to support social‐based mobile networks using a pagerank approach , 2015, Concurr. Comput. Pract. Exp..

[31]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[32]  Mohan Kumar,et al.  Opportunities in Opportunistic Computing , 2010, Computer.

[33]  Zhenfu Cao,et al.  A Probabilistic Misbehavior Detection Scheme toward Efficient Trust Establishment in Delay-Tolerant Networks , 2014 .

[34]  Thomas S. Ferguson,et al.  Who Solved the Secretary Problem , 1989 .

[35]  John Skvoretz,et al.  Node centrality in weighted networks: Generalizing degree and shortest paths , 2010, Soc. Networks.

[36]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

[37]  Victor C. M. Leung,et al.  A Survey on Mobile Social Networks: Applications, Platforms, System Architectures, and Future Research Directions , 2015, IEEE Communications Surveys & Tutorials.

[38]  Morteza Zadimoghaddam,et al.  Submodular secretary problem and extensions , 2013, TALG.

[39]  Ciprian Dobre,et al.  ONSIDE: Socially-aware and Interest-based dissemination in opportunistic networks , 2014, 2014 IEEE Network Operations and Management Symposium (NOMS).

[40]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[41]  Luigi Paura,et al.  Human-mobility enabled networks in urban environments: Is there any (mobile wireless) small world out there? , 2012, Ad Hoc Networks.

[42]  Peter V. Marsden,et al.  Egocentric and sociocentric measures of network centrality , 2002, Soc. Networks.

[43]  Sergi Robles,et al.  Striving for sensing: Taming your mobile code to share a robot sensor network , 2014, Inf. Sci..

[44]  Linton C. Freeman,et al.  Centered graphs and the structure of ego networks , 1982, Math. Soc. Sci..

[45]  Ahmed Helmy,et al.  Profile-Cast: Behavior-Aware Mobile Networking , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[46]  Xiang-Yang Li,et al.  Ranking of Closeness Centrality for Large-Scale Social Networks , 2008, FAW.