Exploiting Resource Heterogeneity in Delay-Tolerant Networks
Routing in delay and Disruption-Tolerant Networks (DTNs) relies on intermediary nodes, called custodians, to deliver messages to destination. However, nodes usually differ significantly in terms of available resources: energy, buffer space, and bandwidth. Routing algorithms need to make the most efficient use of custodian resources while also making sure those in limited supply are not exhausted. This paper proposes a distributed scheme for calculating resources available in node vicinity, as a tool to support meaningful routing decisions. A generic model is developed first, and is then applied to individual network assets. The model is based on a sparse network, where resources are potentially not uniformly distributed.