Analysis of a Hypercube-Based Social Feature Multipath Routing in Delay Tolerant Networks

Social behavior plays a more and more important role in delay tolerant networks (DTNs). In this paper, we present an analytical model for a hypercube-based social feature multipath routing protocol in DTNs. In this routing protocol, we use the internal social features of each node (individual) in the network for routing guidance. This approach is motivated from several real social contact networks, which show that people contact each other more when they have more social features in common. This routing scheme converts a routing problem in a highly mobile and unstructured contact space (M-space) to a static and structured feature space (F-space). The multipath routing process is a hypercube-based feature matching process where the social feature differences are resolved step-by-step. A feature matching shortcut algorithm for fast searching is presented where more than one feature difference is resolved at one time. The multiple paths for the routing process are node-disjoint. We formally analyze the delivery rate and latency by using hypercube-based routing. The solutions for the expected values of latency and delivery rate are given under different path conditions: single-/multipath and feature difference resolutions with/without shortcuts. Extensive simulations on both real and synthetic traces are conducted in comparison to several existing state-of-the-art DTN routing protocols.

[1]  Jie Wu,et al.  A non-replication multicasting scheme in delay tolerant networks , 2010, The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010).

[2]  Injong Rhee,et al.  Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[3]  D. Lazer,et al.  Inferring Social Network Structure using Mobile Phone Data , 2006 .

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

[5]  Stefan Mangold,et al.  Opportunistic wireless communication in theme parks: a study of visitors mobility , 2011, CHANTS '11.

[6]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[7]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[8]  Hongke Zhang,et al.  Virtual Hypercube Routing in wireless sensor networks for health care systems , 2009, 2009 First International Conference on Future Information Networks.

[9]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

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

[11]  Parameswaran Ramanathan,et al.  Reliable Broadcast in Hypercube Multicomputers , 1988, IEEE Trans. Computers.

[12]  Kevin R. Fall,et al.  Alternative custodians for congestion control in delay tolerant networks , 2006, CHANTS '06.

[13]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[14]  Kang-Won Lee,et al.  RelayCast: Scalable multicast routing in Delay Tolerant Networks , 2008, 2008 IEEE International Conference on Network Protocols.

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

[16]  Pan Hui,et al.  Haggle: A networking architecture designed around mobile users , 2006 .

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

[18]  Ahmed Helmy,et al.  Similarity analysis and modeling in mobile societies: the missing link , 2010, CHANTS '10.

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

[20]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[21]  Ioannis Stavrakakis,et al.  How much off-center are centrality metrics for routing in opportunistic networks , 2011, CHANTS '11.

[22]  David Lazer,et al.  Inferring friendship network structure by using mobile phone data , 2009, Proceedings of the National Academy of Sciences.

[23]  R. Manoharan,et al.  Hypercube based Team Multicast Routing Protocol for Mobile Ad hoc Networks , 2006, 9th International Conference on Information Technology (ICIT'06).

[24]  Isabelle Guyon,et al.  An Introduction to Variable and Feature Selection , 2003, J. Mach. Learn. Res..

[25]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

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

[27]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[28]  Mostafa H. Ammar,et al.  PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.

[29]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[30]  Do Young Eun,et al.  Crossing Over the Bounded Domain: From Exponential to Power-Law Intermeeting Time in Mobile Ad Hoc Networks , 2009, IEEE/ACM Transactions on Networking.