Abstract
Buffer dimensioning of nodes is essential to design a practical and efficient Delay-Tolerant Network (DTN). The existing literature on DTN assumes either infinite or finite (arbitrary) buffer size of the nodes in the system model; however, it does not quantify the buffer size. In this paper, we propose a large deviations framework to quantify the buffer size of DTN nodes moving according to Random WayPoint (RWP) mobility model and investigate the effect of buffer size in terms of its impact on the performance of underlying message forwarding protocol. Our extensive simulation results show that the performance of the proposed dimensioned buffer model is statistically equivalent to that of the infinite buffer model.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bettstetter, C., Hartenstein, H., Pérez-Costa, X.: Stochastic Properties of the Random Waypoint Mobility Model. Wireless Networks 10, 555–567 (2004)
Cerf, V., Burleigh, S., Hooke, A., Torgerson, L., Durst, R., Scott, K., Fall, K., Weiss, H.: RFC 4838, Delay-Tolerant Networking Architecture. IRTF DTN Research Group (2007)
Ganesh, A., O’Connell, N., Wischik, D.: Big Queues. Springer, Berlin (2004)
Groenevelt, R.: Stochastic Models for Mobile Ad Hoc Networks. Ph.D. thesis, University of Nice Sophia Antipolis (2005)
Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., Diot, C.: Pocket Switched Networks and Human Mobility in Conference Environments. In: WDTN 2005: Proceedings of the ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 244–251 (2005)
Krifa, A., Barakat, C., Spyropoulos, T.: An Optimal Joint Scheduling and Drop Policy for Delay Tolerant Networks. In: WoWMoM 2008: Proceedings of the International Symposium on World of Wireless, Mobile, and Multimedia Networks, pp. 1–6 (2008)
Lewis, J., O’Connell, N., Russell, R.: An Introduction to Large Deviations for Teletraffic Engineers (1995), http://www.statslab.cam.ac.uk/~rrw1/ld/LD-tutorial.ps
Matsuda, T., Takine, T.: (p, q)-Epidemic Routing for Sparsely Populated Mobile Ad hoc Networks. IEEE Journal on Selected Areas in Communications 26(5), 783–793 (2008)
Petz, A., Enderle, J., Julien, C.: A Framework for Evaluating DTN Mobility Models. In: Simutools 2009: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, pp. 1–8 (2009)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In: WDTN 2005: Proceedings of the ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 252–259 (2005)
Thompson, N., Nelson, S., Bakht, M., Abdelzaher, T., Kravets, R.: Retiring Replicants: Congestion Control for Intermittently-Connected Networks. In: INFOCOM 2010: Proceedings of the IEEE Conference on Computer Communications, pp. 1–9 (2010)
Vahdat, A., Becker, D.: Epidemic Routing for Partially Connected Ad hoc Networks. Tech. Rep. CS-2000-06, Duke University (2000)
Wang, Y., Wu, H.: Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN): A New Paradigm for Pervasive Information Gathering. IEEE Transactions on Mobile Computing 6(9), 1021–1034 (2007)
Xu, B., Wolfson, O., Naiman, C.: Machine Learning in Disruption-Tolerant MANETs. ACM Transactions on Autonomous and Adaptive Systems 4(4), 1–36 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahendran, V., Praveen, T., Murthy, C.S.R. (2012). Buffer Dimensioning of Delay-Tolerant Network Nodes - A Large Deviations Approach. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds) Distributed Computing and Networking. ICDCN 2012. Lecture Notes in Computer Science, vol 7129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25959-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-25959-3_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25958-6
Online ISBN: 978-3-642-25959-3
eBook Packages: Computer ScienceComputer Science (R0)