liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Exploiting resource heterogeneity in delay-tolerant networks
University of Luxembourg . (Computer Science and Communications Research Unit (CSC))
University of Luxembourg . (Interdisciplinary Centre for Security Reliability and Trust (SNT))
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology. (Real-time Systems Laboratory)
2013 (English)In: Wireless Communications & Mobile Computing, ISSN 1530-8669, E-ISSN 1530-8677, Vol. 13, no 3, 230-243 p.Article in journal (Refereed) Published
Abstract [en]

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

Place, publisher, year, edition, pages
2013. Vol. 13, no 3, 230-243 p.
Keyword [en]
routing, resource management, delay-tolerant networks
National Category
Computer and Information Science
URN: urn:nbn:se:liu:diva-78962DOI: 10.1002/wcm.2195ISI: 000314847500004OAI: diva2:537268
Available from: 2012-06-26 Created: 2012-06-26 Last updated: 2013-03-21

Open Access in DiVA

fulltext(1056 kB)274 downloads
File information
File name FULLTEXT02.pdfFile size 1056 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Nadjm-Tehrani, Simin
By organisation
Software and SystemsThe Institute of Technology
In the same journal
Wireless Communications & Mobile Computing
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 274 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 78 hits
ReferencesLink to record
Permanent link

Direct link