Delay Tolerant Networks (DTNs) are characterized by large delays, frequent disruptions and lack of contemporaneous paths between nodes. Moreover, nodes may have limited computational power, storage, and battery capacity. Despite these challenges, DTNs have found applications in areas such as animal tracking, surveillance and facilitating education in remote areas. In these applications, a criti...

In this paper, we study the block delivery delay of random linear network coding in two-hop single-unicast delay-tolerant networks with grid-based mobility. By block delivery delay, we mean how long it takes the destination to receive all the K information packets of a single block. Our work includes two parts. First, we give a general analysis of the dependency between packet spaces spanned by...

Anycast routing is very useful for many applications such as resource discovery in Delay Tolerant Networks (DTNs). In this paper, we first analyze the anycast semantics for DTN based on a new DTN model. Then we present a novel metric named EMDDA (Expected Multi-Destination Delay for Anycast) and a corresponding routing algorithm for anycast routing in DTNs. Extensive simulation results show tha...

vii

Delay Tolerant Networks are well suited for longterm statistical data collection, where the installation of infrastructure is impossible or not worthwhile. Those scenarios generally employ wireless links and are often based on limited energy resources such as batteries or battery-buffered solar power. Hence, reducing energy consumption is of foremost importance. In-network data aggregation redu...

1 College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China 2 Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing, Jiangsu 210003, China 3 Key Lab of Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Ministry of Education Jiangsu Province, Nanjing, Jiangsu 210...

This document is a product of the Delay Tolerant Networking Research Group and has been reviewed by that group. No objections to its publication as an RFC were raised. This document defines PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transitivity. PRoPHET is a variant of the epidemic routing protocol for intermittently connected networks that operates by pruning th...