Message Drop and Scheduling in DTNs: Theory and Practice

IEEE Transactions on Mobile Computing

Volumn 11, Issue 9, 2012, Pages 1470-1483

  Krifa, Amir ^a   Barakat, Chadi ^a   Spyropoulos, Thrasyvoulos ^b  

^a INRIA   (France)

^b EURECOM   (France)

Author keywords

congestion; Delay tolerant network; drop policy; scheduling policy

Indexed keywords

EID: 85008536999     PISSN: 15361233     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMC.2011.163     Document Type: Article

References (31)

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ʼnl 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ʼnl 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ʼnl 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ʼnl 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/RWG/book.html, 2012.
19. T. Karagiannis, J. -Y. Le Boudec, and M. Vojnovic, “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ʼnl 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ʼnl 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 DelayTolerant Networks,” Proc. IEEE Intʼnl Symp. World of Wireless, Mobile and Multimedia Networks and Workshops (WoWMoM), pp. 17, 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: SocialAware Data Dissemination in Opportunistic Networks,” Proc. ACM 11th Intʼnl Symp. Modeling, Analysis, and Simulation of Wireless and Mobile Systems (MSWiM), 2008.
31. Nyquist Shannon Sampling Theorem, http://en.wikipedia.org/wiki/Nyquist, 2012.