The problem of choosing the best forwarders in Delay-Tolerant Networks (DTNs) is crucial for minimizing the delay in packet delivery and for keeping the amount of generated traffic under control. In this paper, we introduce sociable routing, a novel
Delay tolerant networks (DTNs) are a special type of wireless mobile networks which may lack continuous network connectivity. Multicast is an important routing function that supports the distribution of data to a group of users, a service needed for
Delay tolerant networks (DTNs) are resource-constrained networks where messages are relayed in a store-carry-forward fashion. In most routing protocols of DTNs, each node is required to honestly relay messages. However, some nodes may violate this pr
Deep space networks, satellite networks, ad hoc networks, and the Internet can be modeled as DTNs (Delay Tolerant Networks). As a fundamental problem, the maximum flow problem is of vital importance for routing and service scheduling in networks. How
