This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Message Drop and Scheduling in DTNs: Theory and Practice
Sept. 2012 (vol. 11 no. 9)
pp. 1470-1483
Amir Krifa, INRIA Sophia Antipolis, Sophia Antipolis
Chadi Barakat, INRIA Sophia Antipolis, Sophia Antipolis
Thrasyvoulos Spyropoulos, EUROCOM, Sophia-Antipolis
In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carry-and-forward protocols: a node there may store a message in its buffer and carry it along for long periods of time, until an appropriate forwarding opportunity arises. This way, messages can traverse disconnected parts of the network. Multiple message replicas are often propagated to further increase delivery probability. This combination of long-term storage and message replication imposes a high storage and bandwidth overhead. Thus, efficient scheduling and drop policies are necessary to 1) decide on the order by which messages should be replicated when contact durations are limited, and 2) which messages should be discarded when nodes' buffers operate close to their capacity. In this paper, we propose a practical and efficient joint scheduling and drop policy that can optimize different performance metrics, such as average delay and delivery probability. We first use the theory of encounter-based message dissemination to derive the optimal policy based on global knowledge about the network. Then, we introduce a method that estimates all necessary parameters using locally collected statistics. Based on this, we derive a distributed scheduling and drop policy that can approximate the performance of the optimal policy in practice. Using simulations based on synthetic and real mobility traces, we show that our optimal policy and its distributed variant outperform existing resource allocation schemes for DTNs. Finally, we study how sampled statistics can reduce the signaling overhead of our algorithm and examine its behavior under different congestion regimes. Our results suggest that close to optimal performance can be achieved even when nodes sample a small percentage of the available statistics.

[1] S. Jain, K. Fall, and R. Patra, "Routing in a Delay Tolerant Network," Proc. ACM SIGCOMM, Aug. 2004.
[2] S. Jain, M. Demmer, R. Patra, and K. Fall, "Using Redundancy to Cope with Failures in a Delay Tolerant Network," Proc. ACM SIGCOMM, 2005.
[3] N. Glance, D. Snowdon, and J.-L. Meunier, "Pollen: Using People as a Communication Medium," Computer Networks, vol. 35, no. 4, pp. 429-442, Mar. 2001.
[4] Delay Tolerant Networking Research Group, http:/www.dtnrg. org, 2012.
[5] A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks," Technical Report CS-200006, Duke Univ., 2000.
[6] A. Lindgren, A. Doria, and O. Schelen, "Probabilistic Routing in Intermittently Connected Networks," ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 3, pp. 19-20, 2003.
[7] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, "Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case," IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 77-90, Feb. 2008.
[8] Z.J. Haas and T. Small, "A New Networking Model for Biological Applications of Ad Hoc Sensor Networks," IEEE/ACM Trans. Networking, vol. 14, no. 1, pp. 27-40, Feb. 2006.
[9] R. Groenevelt, G. Koole, and P. Nain, "Message Delay in Manet (Extended Abstract)," Proc. Int'l Conf. Measurement and Modeling of Computer Systems (ACM SIGMETRICS), 2005.
[10] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, "Performance Analysis of Mobility-Assisted Routing," Proc. ACM/IEEE MobiHoc, 2006.
[11] A. Balasubramanian, B. Levine, and A. Venkataramani, "DTN Routing as a Resource Allocation Problem," Proc. ACM SIGCOMM, 2007.
[12] A. Lindgren and K.S. Phanse, "Evaluation of Queuing Policies and Forwarding Strategies for Routing in Intermittently Connected Networks," Proc. First Int'l Conf. Comm. System Software and Middleware (COMSWARE), 2006.
[13] X. Zhang, G. Neglia, J. Kurose, and D. Towsley, "Performance Modeling of Epidemic Routing," Proc. Int'l Federation for Information Processing Networking (IFIP), 2006.
[14] H.P. Dohyung Kim and I. Yeom, "Minimizing the Impact of Buffer Overflow in DTN," Proc. Int'l Conf. Future Internet Technologies (CFI), 2008.
[15] A. Krifa, C. Barakat, and T. Spyropoulos, "Optimal Buffer Management Policies for Delay Tolerant Networks," Proc. IEEE Fifth Ann. Comm. Soc. Conf. Sensor, Mesh and Ad Hoc Comm., and Networks (SECON), 2008.
[16] L. Yong, Q. Mengjiong, J. Depeng, L. Su, and L. Zeng, "Adaptive Optimal Buffer Management Policies for Realistic DTN," Proc. IEEE Global Telecomm. Conf. (GlobeCom), 2009.
[17] T. Spyropoulos, T. Turletti, and K. Obrazcka, "Routing in Delay Tolerant Networks Comprising Heterogeneous Populations of Nodes," IEEE Trans. Mobile Computing, vol. 8, no. 8, pp. 1132-1147, Aug. 2009.
[18] D. Aldous and J. Fill, "Reversible Markov Chains and Random Walks on Graphs, (Monograph in Preparation)," http://stat-www.berkeley.edu/users/aldous/ RWGbook.html, 2012.
[19] T. Karagiannis, J.-Y. Le Boudec, and M. Vojnović, "Power Law and Exponential Decay of Inter Contact Times between Mobile Devices," Proc. ACM MobiCom, 2007.
[20] T. Spyropoulos, A. Jindal, and K. Psounis, "An Analytical Study of Fundamental Mobility Properties for Encounter-Based Protocols," Int'l J. Autonomous and Adaptive Comm. Systems, vol. 1, pp. 4-40, 2008.
[21] A. Chaintreau, J.-Y. Le Boudec, and N. Ristanovic, "The Age of Gossip: Spatial Mean Field Regime," Proc. ACM 11th Int'l Joint Conf. Measurement and Modeling of Computer Systems (SIGMETRICS), 2009.
[22] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ., 2004.
[23] H. Lilliefors, "On the Kolmogorov-Smirnov Test for Normality with Mean and Variance Unknown," J. Am. Statistical Assoc., vol. 62, pp. 399-402, 1967.
[24] A. Guerrieri, A. Montresor, I. Carreras, F.D. Pellegrini, and D. Miorandi, "Distributed Estimation of Global Parameters in Delay-Tolerant Networks," Proc. IEEE Int'l Symp. World of Wireless, Mobile and Multimedia Networks and Workshops (WoWMoM), pp. 1-7, 2009.
[25] DTN Architecture for NS-2, http://www-sop.inria.fr/members/Amir.Krifa DTN, 2012.
[26] C. Boldrini, M. Conti, and A. Passarella, "Users Mobility Models for Opportunistic Networks: The Role of Physical Locations," Proc. IEEE Wireless Rural and Emergency Comm. (WRECOM), 2007.
[27] Y. Wang, P. Zhang, T. Liu, C. Sadler, and M. Martonosi, "Movement Data Traces from Princeton Zebranet Deployments," CRAWDAD Database, http:/crawdad.cs.dartmouth.edu, 2007.
[28] Cabspotting Project, http:/cabspotting.org, 2012.
[29] "KAIST Mobility Traces," http://research.csc.ncsu.edu/netsrv/?q=node 4, 2012.
[30] C. Boldrini, M. Conti, and A. Passarella, "ContentPlace: Social-Aware Data Dissemination in Opportunistic Networks," Proc. ACM 11th Int'l Symp. Modeling, Analysis, and Simulation of Wireless and Mobile Systems (MSWiM), 2008.
[31] Nyquist Shannon Sampling Theorem, http://en.wikipedia.org/wikiNyquist, 2012.

Index Terms:
Delay,Fault tolerance,Data processing,Scheduling,scheduling policy.,Delay tolerant network,congestion,drop policy
Citation:
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulos, "Message Drop and Scheduling in DTNs: Theory and Practice," IEEE Transactions on Mobile Computing, vol. 11, no. 9, pp. 1470-1483, Sept. 2012, doi:10.1109/TMC.2011.163
Usage of this product signifies your acceptance of the Terms of Use.