A New Data Transmission Strategy in Mobile D2D Networks—Deterministic, Greedy, or Planned Opportunistic Routing?

In this paper, we study the problem of delay-constrained data transmission in mobile opportunistic device-to-device networks. In contrast to the deterministic or greedy single-copy single-path (SCSP) and multicopy multipath (MCMP) routing schemes that have been discussed in the literature, we develop a planned opportunistic routing scheme that aims to determine the optimal single-copy multipath (SCMP) transmission strategy that satisfies the delay requirement and, at the same time, minimizes communication cost. We first address the unicast by formulating the optimization problem and developing a distributed routing algorithm under practical network settings. Then, we explore optimal multicast strategies based on the SCMP transmissions. We implement the proposed algorithms on Android tablets and carry out extensive experiments, each with 25 nodes, for a period of two weeks. Moreover, we extract the algorithm codes from our prototype and run simulations based on the Haggle trace to study performance trends under various network settings. The experimental and simulation results show that the proposed protocols achieve significant performance gain in comparison with their counterparts based on SCSP and MCMP transmissions.

[1]  Wentong Cai,et al.  Application Layer Multicast in P2P Distributed Interactive Applications , 2013, 2013 International Conference on Parallel and Distributed Systems.

[2]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

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

[4]  Sagar Naik,et al.  SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping , 2013, IEEE Transactions on Parallel and Distributed Systems.

[5]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[6]  Ying Zhu,et al.  A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects , 2013, IEEE Communications Surveys & Tutorials.

[7]  Ulrich Dorndorf,et al.  A Branch-and-Bound Algorithm , 2002 .

[8]  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).

[9]  Rabin K. Patra,et al.  Using redundancy to cope with failures in a delay tolerant network , 2005, SIGCOMM '05.

[10]  Richard E. Hansen,et al.  Prioritized epidemic routing for opportunistic networks , 2007, MobiOpp '07.

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

[12]  Ramachandran Ramjee,et al.  Nericell: rich monitoring of road and traffic conditions using mobile smartphones , 2008, SenSys '08.

[13]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[14]  Mostafa Ammar,et al.  Multicasting in delay tolerant networks: semantic models and routing algorithms , 2005, WDTN '05.

[15]  Mario Gerla,et al.  Scalable Multicast Routing in Delay Tolerant Networks , 2008 .

[16]  Zhu Han,et al.  Self-Interest-Driven incentives for ad dissemination in autonomous mobile social networks , 2013, 2013 Proceedings IEEE INFOCOM.

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

[18]  Mirco Musolesi,et al.  Sensing meets mobile social networks: the design, implementation and evaluation of the CenceMe application , 2008, SenSys '08.

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

[20]  Arun Venkataramani,et al.  R3: robust replication routing in wireless networks with diverse connectivity characteristics , 2011, MobiCom '11.

[21]  Ness B. Shroff,et al.  Optimal Energy-Aware Epidemic Routing in DTNs , 2015, IEEE Trans. Autom. Control..

[22]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[23]  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).

[24]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

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

[26]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[27]  Cecilia Mascolo,et al.  CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks , 2009, IEEE Transactions on Mobile Computing.

[28]  M. Chuah,et al.  Efficient Interdomain Multicast Delivery in Disruption Tolerant Networks , 2008, 2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks.

[29]  Yan Wang,et al.  Incentive driven information sharing in delay tolerant mobile networks , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[30]  Jie Wu,et al.  Distributed network coding-based opportunistic routing for multicast , 2012, MobiHoc '12.

[31]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[32]  Jörg Ott,et al.  Floating content: Information sharing in urban areas , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[33]  Dong Xuan,et al.  P3-coupon: A probabilistic system for Prompt and Privacy-preserving electronic coupon distribution , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[34]  Jie Wu,et al.  An Efficient Prediction-Based Routing in Disruption-Tolerant Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[35]  Cauligi S. Raghavendra,et al.  Performance analysis of mobility-assisted routing , 2006, MobiHoc '06.

[36]  David Kotz,et al.  Extracting a Mobility Model from Real User Traces , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

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

[39]  Wentong Cai,et al.  Automated Partial Reconfiguration Design for Adaptive Systems with CoPR for Zynq , 2013, FCCM 2013.

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

[41]  Jiannong Cao,et al.  A Motion Tendency-Based Adaptive Data Delivery Scheme for Delay Tolerant Mobile Sensor Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[42]  Li Xiao,et al.  Efficient Opportunistic Multicast via Tree Backbone for Wireless Mesh Networks , 2011, 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems.

[43]  Robin Kravets,et al.  Encounter-Based Routing in DTNs , 2009, INFOCOM.

[44]  Dimitrios Koutsonikolas,et al.  Pacifier: High-Throughput, Reliable Multicast without ``Crying Babies'' in Wireless Mesh Networks , 2009, IEEE INFOCOM 2009.

[45]  Daniele Quercia,et al.  Mobile Phones and Outdoor Advertising: Measurable Advertising , 2011, IEEE Pervasive Computing.

[46]  Taejin Kim,et al.  Fully-distributed multicast routing protocol for IEEE 802.15.8 peer-aware communications , 2014, The International Conference on Information Networking 2014 (ICOIN2014).

[47]  Anders Lindgren,et al.  Routing in intermittently connected networks using a probabilistic approach , 2003 .