Exploiting resource heterogeneity in delay-tolerant networks

ABSTRACTRouting 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 m...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Wireless communications and mobile computing 2013-02, Vol.13 (3), p.230-243
Hauptverfasser: Sandulescu, Gabriel, Schaffer, Péter, Nadjm-Tehrani, Simin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:ABSTRACTRouting 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. It uses recent encounters to estimate resource availability in node vicinity. It is shown that a store‐carry‐forward scheme may benefit from accessing vicinity resource estimates. This knowledge allows nodes to implement meaningful custodian election and queue management strategies, approached here from a holistic perspective. It is demonstrated that routing protocols not only use up fewer resources overall but also consume resources preferentially from nodes with higher resource levels, sparing nodes with limited supplies. As a result, disparities in available resources across the node population are significantly reduced, and nodes are less likely to leave the network as a consequence of resource depletion. Copyright © 2012 John Wiley & Sons, Ltd. In resource‐constrained environments, store‐carry‐forward schemes need to make the most efficient use of custodian resources while also avoiding the exhaustion of resources in limited supply. However, in most real‐life scenarios, nodes usually differ significantly in terms of available resources, such as energy, buffer space and bandwidth. This paper proposes a distributed scheme for estimating resources available in node vicinity and provides support for meaningful node decisions in the custodian election and queue management strategies applied.
ISSN:1530-8669
1530-8677
1530-8677
DOI:10.1002/wcm.2195