Abstract
We consider the data delivery problem in delay tolerant networks, where a data content is located in a fixed source need to be delivered to a specific destination. We assume nodes have limited storage and computational capabilities. In this paper, we initially, explore the data delivery problem, for both unbiased and biased contact models. Based on our observations, we propose a data delivery scheme that can reduce both storage overhead and delivery delay. Our scheme combines erasure coding technique and the framework of simulated annealing optimization, in order to maximize the content delivery probability to the destination.
This is a preview of subscription content, log in via an institution to check access.
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
Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2003, pp. 27–34. ACM (2003)
Massri, K., Vernata, A., Vitaletti, A.: Routing protocols for delay tolerant networks: a quantitative evaluation. In: PM2HW2N 2012, pp. 107–114. ACM (2012)
Lin, W.K., Chiu, D.M., Lee, Y.B.: Erasure code replication revisited, pp. 90–97 (2004)
Picu, A., Spyropoulos, T.: Distributed stochastic optimization in opportunistic networks: the case of optimal relay selection, pp. 21–28 (2010)
Fragouli, C., Le Boudec, J.-Y., Widmer, J.: Network coding: an instant primer. SIGCOMM Comput. Commun. Rev. 36(1), 63–68 (2006)
Wang, Y., Jain, S., Martonosi, M., Fall, K.: Erasure-coding based routing for opportunistic networks, pp. 229–236 (2005)
Jain, S., Demmer, M., Patra, R., Fall, K.: Using redundancy to cope with failures in a delay tolerant network, pp. 109–120 (2005)
Liao, Y., Tan, K., Zhang, Z., Gao, L.: Estimation based erasure-coding routing in delay tolerant networks, pp. 557–562 (2006)
Tang, X., Yang, P., Tian, C., Peng, L., Yan, Y.: Inter-coding: An interleaving and erasure coding based stable routing scheme in multi-path dtn, pp. 446–451 (2010)
Bulut, E., Wang, Z., Szymanski, B.K.: Cost efficient erasure coding based routing in delay tolerant networks, pp. 1–5 (2010)
Keränen, A., Ott, J., Kärkkäinen, T.: The ONE Simulator for DTN Protocol Evaluation. ICST Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (2009)
Hsu, W.J., Spyropoulos, T., Psounis, K., Helmy, A.: Modeling time-variant user mobility in wireless mobile networks, pp. 758–766 (2007)
Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., Chaintreau, A.: CRAWDAD trace cambridge/haggle/imote/infocom2006 (May 29, 2009)
Dartmouth. A community resource for archiving wireless data, http://crawdad.cs.dartmouth.edu/
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks, pp. 252–259. ACM (August 2005)
Dang, H., Wu, H.: Clustering and cluster-based routing protocol for delay-tolerant mobile networks. IEEE Transactions on Wireless Communications, 1874–1881 (June 2010)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility, pp. 79–85 (March 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Massri, K., Beraldi, R., Vitaletti, A. (2013). Erasure-Coding Based Data Delivery in Delay Tolerant Networks. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds) Internet of Things, Smart Spaces, and Next Generation Networking. ruSMART NEW2AN 2013 2013. Lecture Notes in Computer Science, vol 8121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40316-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-40316-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40315-6
Online ISBN: 978-3-642-40316-3
eBook Packages: Computer ScienceComputer Science (R0)