Social-Aware Stateless Routingin Pocket Switched Networks

Existing social-aware routing protocols for packet switched networks make use of the information about the social structure of the network deduced by state information of nodes (e.g., history of past encounters) to optimize routing. Although these approaches are shown to have superior performance to social-oblivious, stateless routing protocols (BinarySW, Epidemic), the improvement comes at the cost of considerable storage overhead required on the nodes. In this paper we present SANE, the first routing mechanism that combines the advantages of both social-aware and stateless approaches. SANE is based on the observation - that we validate on a real-world trace - that individuals with similar interests tend to meet more often. In SANE, individuals (network members) are characterized by their interest profile, a compact representation of their interests. By implementing a simple routing rule based on interest profile similarity, SANE is free of network state information, thus overcoming the storage capacity problem with existing social-aware approaches. Through thorough experiments, we show the superiority of SANE over existing approaches, both stateful, social-aware and stateless, social-oblivious. We discuss the statelessness of our approach in the supplementary file, which can be found on the Computer Society Digital Library at http://doi.ieeecomputersociety.org/10.1109/TPDS.2014.2307857, of this manuscript. Our interest-based approach easily enables innovative networking services, such as interest-casting. An interest-casting protocol is also introduced in this paper, and evaluated through experiments based on both real-world and synthetic mobility traces.

[1]  Paolo Santi,et al.  An implementation of secure two-party computation for smartphones with application to privacy-preserving interest-cast , 2012, Mobicom '12.

[2]  Jie Wu,et al.  LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

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

[4]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.

[5]  Gerard Salton,et al.  A vector space model for automatic indexing , 1975, CACM.

[6]  Paolo Santi,et al.  Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks , 2011, ESA.

[7]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[8]  Jie Wu,et al.  Hypercube-Based Multipath Social Feature Routing in Human Contact Networks , 2014, IEEE Transactions on Computers.

[9]  Thrasyvoulos Spyropoulos,et al.  Collection and analysis of multi-dimensional network data for opportunistic networking research , 2012, Comput. Commun..

[10]  Paolo Santi,et al.  Social-aware stateless forwarding in pocket switched networks , 2011, 2011 Proceedings IEEE INFOCOM.

[11]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[12]  Mark Claypool,et al.  Inferring User Interest , 2001, IEEE Internet Comput..

[13]  Marco Conti,et al.  ContentPlace: social-aware data dissemination in opportunistic networks , 2008, MSWiM '08.

[14]  Guohong Cao,et al.  User-centric data dissemination in disruption tolerant networks , 2011, 2011 Proceedings IEEE INFOCOM.

[15]  Alessandro Puiatti,et al.  Probabilistic Routing Protocol for Intermittently Connected Mobile Ad hoc Network (PROPICMAN) , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[16]  Ahmed Helmy,et al.  CSI: A paradigm for behavior-oriented profile-cast services in mobile networks , 2012, Ad Hoc Networks.

[17]  Sokol Kosta,et al.  Small World in Motion (SWIM): Modeling Communities in Ad-Hoc Mobile Networking , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

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

[19]  Jie Wu,et al.  Social feature-based multi-path routing in delay tolerant networks , 2012, 2012 Proceedings IEEE INFOCOM.

[20]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[21]  Athina Markopoulou,et al.  Proactive seeding for information cascades in cellular networks , 2012, 2012 Proceedings IEEE INFOCOM.

[22]  Marco Conti,et al.  Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution , 2008, Pervasive Mob. Comput..

[23]  Paolo Santi,et al.  Privacy-preserving interest-casting in opportunistic networks , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[24]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2006, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[25]  Stratis Ioannidis,et al.  Optimal and scalable distribution of content updates over a mobile social network , 2009, IEEE INFOCOM 2009.

[26]  Cecilia Mascolo,et al.  Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.

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

[28]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[29]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[30]  Sokol Kosta,et al.  Large-Scale Synthetic Social Mobile Networks with SWIM , 2014, IEEE Transactions on Mobile Computing.

[31]  Cecilia Mascolo,et al.  Exploiting place features in link prediction on location-based social networks , 2011, KDD.

[32]  Pan Hui,et al.  Distributed community detection in delay tolerant networks , 2007, MobiArch '07.

[33]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[34]  Timur Friedman,et al.  Evaluating Mobility Pattern Space Routing for DTNs , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[35]  Timur Friedman,et al.  Evaluating MobySpace-based routing strategies in delay-tolerant networks , 2007, Wirel. Commun. Mob. Comput..

[36]  Jennifer Golbeck,et al.  Trust and nuanced profile similarity in online social networks , 2009, TWEB.

[37]  M. Pontil,et al.  Inferring Interests from Mobility and Social Interactions , 2009 .

[38]  Julinda Stefa,et al.  SWIM: A Simple Model to Generate Small Mobile Worlds , 2008, IEEE INFOCOM 2009.

[39]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[40]  David Eppstein,et al.  Category-based routing in social networks: Membership dimension and the small-world phenomenon , 2011, 2011 International Conference on Computational Aspects of Social Networks (CASoN).

[41]  Ioannis Stavrakakis,et al.  ISCoDe: A framework for interest similarity-based community detection in social networks , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[42]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .