Erasure-Coding Based Data Delivery in Delay Tolerant Networks

dc.contributor.author	Massri, Khalil
dc.contributor.author	Beraldi, Roberto
dc.contributor.author	Vitaletti, Andrea
dc.date.accessioned	2019-10-09T19:48:54Z
dc.date.available	2019-10-09T19:48:54Z
dc.date.issued	2013-01-01
dc.identifier.citation	10.1007/978-3-642-40316-3_17	en_US
dc.identifier.isbn	978-3-642-40316-3
dc.identifier.uri	http://dspace.hebron.edu:80/xmlui/handle/123456789/230
dc.description.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	en_US
dc.language.iso	en	en_US
dc.publisher	Springer Berlin Heidelberg	en_US
dc.title	Erasure-Coding Based Data Delivery in Delay Tolerant Networks	en_US
dc.type	Article	en_US