Drop Less Known strategy for buffer management in DTN Nodes

ABSTRACT

Certain kinds of delay and disruption tolerant networks need the human support to send data between users without a contemporaneous end-to-end path between them. However, humans are socially selfish and tend to cooperate with whom they have a social relationship, fact that affects the overall performance. Memory space is a critical resource on mobile devices, and since the intermediate nodes have to store the messages, buffer management strategy becomes a crucial factor to achieve a satisfactory network performance. Very little attention has been directed towards applying the social characteristics of the users to mitigate the congestion in DTN. This paper presents a buffer management strategy for DTNs that takes into account a value associated with the social relationship strength among the users. We evaluated this policy in conjunction with the Epidemic and PRoPHET routing algorithms. By means of a thoroughly planned set of steady-state simulation experiments, we found that the proposed scheme can increase the delivery rate besides decreasing the average delay.

References

1. Q. Ayub and S. Rashid. T-drop: An optimal buffer management policy to improve qos in dtn routing protocols. Journal of Computing, 2(10):46--50, 2010.
2. P.-A. Chen and D. Kempe. Altruism, selfishness, and spite in traffic routing. In Proceedings of the 9th ACM conference on Electronic commerce, pages 140--149. ACM, 2008.
3. C. T. de Oliveira, M. D. Moreira, M. G. Rubinstein, L. H. M. Costa, and O. C. M. Duarte. Redes tolerantes a atrasos e desconexões. SBRC Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos, 2007.
4. C. Diot et al. Haggle project, 2004.
5. N. Eagle and A. S. Pentland. CRAWDAD data set mit/reality (v. 2005-07-01). Downloaded from http://crawdad.cs.dartmouth.edu/mit/reality, July 2005.
6. G. Fathima and R. Wahidabanu. Buffer management for preferential delivery in opportunistic delay tolerant networks. International Journal of Wireless & Mobile Networks (IJWMN), 3(5):15--28, 2008.
7. W. W. Franklin and K. White. Stationarity tests and mser-5: exploring the intuition behind mean-squared-error-reduction in detecting and correcting initialization bias. In Simulation Conference, 2008. WSC 2008. Winter, pages 541--546. IEEE, 2008.
8. A. Keränen, J. Ott, and T. Kärkkäinen. The ONE Simulator for DTN Protocol Evaluation. In SIMUTools '09: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, New York, NY, USA, 2009. ICST.
9. A. Krifa, C. Baraka, and T. Spyropoulos. Optimal buffer management policies for delay tolerant networks. In Sensor, Mesh and Ad Hoc Communications and Networks, 2008. SECON'08. 5th Annual IEEE Communications Society Conference on, pages 260--268. IEEE, 2008.
10. Q. Li, S. Zhu, and G. Cao. Routing in socially selfish delay tolerant networks. In INFOCOM, 2010 Proceedings IEEE, pages 1--9. IEEE, 2010.
11. Y. Li, L. Zhao, Z. Liu, and Q. Liu. N-drop: congestion control strategy under epidemic routing in dtn. In Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, pages 457--460. ACM, 2009.
12. A. Lindgren, A. Doria, and O. Schelén. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3):19--20, 2003.
13. A. Lindgren and K. S. Phanse. Evaluation of queueing policies and forwarding strategies for routing in intermittently connected networks. In Communication System Software and Middleware, 2006. Comsware 2006. First International Conference on, pages 1--10. IEEE, 2006.
14. Y. Liu, J. Wang, S. Zhang, and H. Zhou. A buffer management scheme based on message transmission status in delay tolerant networks. In Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE, pages 1--5, dec. 2011.
15. M. S. Meketon and B. Schmeiser. Overlapping batch means: Something for nothing? In Proceedings of the 16th conference on Winter simulation, pages 226--230. IEEE Press, 1984.
16. E. Mota. Performance of Sequential Batching-based Methods of Output Data Analysis in Distributed Steady-state Stochastic. PhD thesis, Technical University of Berlin, 2002.
17. J. F. Naves, I. M. Moraes, and C. V. Albuquerque. Lps e lrf: Politicas de gerenciamento de buffer eficientes para redes tolerantes a atrasos e desconexões. Simpósio Brasileiro de Redes de Computadores (SBRC 2012), pages 293--305, 2012.
18. S. Okasha. Altruism, group selection and correlated interaction. The British journal for the philosophy of science, 56(4):703--725, 2005.
19. T. Settawatcharawanit, S. Yamada, E. Haque, K. Rojviboonchai, et al. Message dropping policy in congested social delay tolerant networks. In Computer Science and Software Engineering (JCSSE), 2013 10th International Joint Conference on, pages 116--120. IEEE, 2013.
20. L. Tang, Y. Chai, Y. Li, and B. Weng. Buffer management policies in opportunistic networks. Journal of Computational Information Systems, 8(12):5149--5159, 2012.
21. A. Vahdat, D. Becker, et al. Epidemic routing for partially connected ad hoc networks. Technical report, Technical Report CS-200006, Duke University, 2000.
22. K. Xu, P. Hui, V. O. K.Li, J. Crowcroft, V. Latora, and P. Lio. Impact of altruism on opportunistic communications. In Proceedings of the first international conference on Ubiquitous and future networks, ICUFN'09, pages 153--158, Piscataway, NJ, USA, 2009.
23. Y. Zhu, B. Xu, X. Shi, and Y. Wang. A survey of social-based routing in delay tolerant networks: positive and negative social effects. 2012.

Index Terms

• General and reference

  • Cross-computing tools and techniques

• Networks

  • Network protocols

    • Network layer protocols

      • Routing protocols

  • Network types

    • Mobile networks