Optimal Replication Based on Optimal Path Hops for Opportunistic Networks

Opportunistic Networks are highly mobile networks which may lack a reliable path between some source and destination. Therefore, this type of network uses Store, Carry and Forward and delivers messages based on hop-by-hop routing. Epidemic is the simplest routing protocol for Opportunistic Networks, as it replicates messages to all encountered nodes. For messages spread by Epidemic replication, we study and analyze the trade-off between the messages' delivery ratio, delay, and overhead. We consider that all members of the network, at any given time, know the amount of relay nodes that pass the message and each message carrier knows the amount of infected nodes that already have acquired the message. We address the problem of deriving the optimal closed-loop control for the replication strategy in our network. We draft this issue as a controlled, discrete-time and finite-state Markov Chain with an All Hops Optimal Path formulation. In real life scenarios, however, due to the intermittent correspondence in Opportunistic Networks the nodes do not have insight of the network's global state. We try to solve this issue by obtaining an Ordinary Differential Equation approximation of the Markov Chain for the replication process of messages. Furthermore, our model considers All Hops Optimal Path as network graph analysis for the optimally controlled replication. Lastly, we present the performance evaluation of these replication control conditions in finite networks. Our results show that this proposed Optimal Replication Based on Optimal Path Hops performs better than the omni-directional and contact-based Epidemic routing replication.

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

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

[3]  Jie Wu,et al.  An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.

[4]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[5]  Eitan Altman,et al.  Performance of ad hoc networks with two-hop relay routing and limited packet lifetime (extended version) , 2008, Perform. Evaluation.

[6]  Jörg Ott,et al.  Simulating Mobility and DTNs with the ONE (Invited Paper) , 2010, J. Commun..

[7]  Laura Ricci,et al.  DiDuSoNet: A P2P architecture for distributed Dunbar-based social networks , 2016, Peer-to-Peer Netw. Appl..

[8]  Jia Xu,et al.  Optimal Joint Expected Delay Forwarding in Delay Tolerant Networks , 2013, Int. J. Distributed Sens. Networks.

[9]  Ariel Orda,et al.  Computing shortest paths for any number of hops , 2002, TNET.

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

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

[12]  Anders Lindgren,et al.  Probabilistic Routing Protocol for Intermittently Connected Networks , 2012, RFC.

[13]  Kalman Graffi,et al.  Infrastructure Mode Based Opportunistic Networks on Android Devices , 2017, 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA).

[14]  Giovanni Neglia,et al.  Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study , 2006, CHANTS '06.

[15]  Alexandre Proutière,et al.  Hop limited flooding over dynamic networks , 2011, 2011 Proceedings IEEE INFOCOM.

[16]  Jörg Ott,et al.  Analysis of hop limit in opportunistic networks by static and time-aggregated graphs , 2015, 2015 IEEE International Conference on Communications (ICC).

[17]  Kálmán György Graffi,et al.  Monitoring and management of peer-to-peer systems , 2010, ACMMR.

[18]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[19]  Donald F. Towsley,et al.  Performance Modeling of Epidemic Routing , 2006, Networking.