In this paper we present a first attempt to study analytically the tradeoff between delivery delay and resource consumption for epidemic routing in Delay Tolerant Networks. We assume that the nodes cooperate in order to minimize a common cost equal to a weighted sum of the packet delivery delay and the total number of copies, which is strongly related to the power consumption. In this framework we determine the best policy each node should deploy in a very simple scenario where all the nodes have perfect knowledge of the system status. The result is used as an ideal reference to evaluate the performance of some heuristics proposed, investigating potential performance improvements and configuration criteria. Copyright 2006 ACM.
CITATION STYLE
Neglia, G., & Zhang, X. (2006). Optimal delay-power tradeoff in sparse delay tolerant networks: A preliminary study. In Proceedings of ACM SIGCOMM 2006 - Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (Vol. 2006, pp. 237–244). https://doi.org/10.1145/1162654.1162661
Mendeley helps you to discover research relevant for your work.