Vicinity resource cartography for delay-tolerant networks: A holistic perspective
Gabriel Sandulescu, Péter Schaffer, Simin Nadjm‐Tehrani · 2010
In this paper we propose a distributed approach to construct vicinity resource maps at each node in a delay-tolerant network. The scheme uses recent encounters to estimate the availability of the following resources: energy, buffer space, and bandwidth, in the vicinity of a given node. We then show how a store-carry-forward scheme may benefit from having access to these resource estimates. While knowledge about resources available in the vicinity allows nodes to implement meaningful custodian election strategies, an evaluation of available bandwidth and contact time allows them to carry out adaptive queue management strategies. Thus, such strategies can be approached from a holistic perspective based on the availability of the three resources under consideration in node proximity. We validate our model separately in time-varying and space-varying environments. In addition to synthetic mobility models (random waypoint) we validate our resource estimation in a disaster area mobility model (using Bonn motion traces). We show that by using this information a routing protocol may dramatically improve its delivery rate and reduce energy overhead while keeping delivery latency almost constant.