Energy-efficient sparse routing protocol for Delay Tolerant Networks

Abstract

In this paper we demonstrate how limiting the number of copies each message that a node can send out as seen in Spray And Wait can be combined with probabilistic protocols such as Prophet, ProphetV2, and one that we created called Sparse. By limiting the number of copies that each node can send out we allow the routing protocols to scale much better than before when the number of nodes and messages created are increased.