Title: Building routing overlays in disrupted networks: inferring contacts in challenged sensor internetworks

Authors: Edward J. Birrane III

Addresses: Space Department, The Johns Hopkins University Applied Physics Laboratory, 11100 Johns Hopkins Rd, Laurel, MD 20723, USA

Abstract: Current routing approaches in Delay-Tolerant Networks (DTNs) focus on the exchange of information across homogenous addressing domains without addressing DTNs constructed from a set of cooperating networks using different protocols and mobility models. We present inference-based Contact Graph Routing (iCGR), a logical-level routing method for DTN internetworks that comprise heterogeneous data link and/or network layers. iCGR constructs a time-variant 'Contact Graph' at each node in the network to describe logical contact opportunities regardless of underlying physical media access. The iCGR approach extends the established approach of graph based routing beyond static networks and provides a mechanism for multiple data link protocols to co-exist in an internetwork. This overlay-routing approach allows otherwise routing-protocol-incompatible networks to join an internetwork with little overhead. iCGR is validated through NS3 simulation of a DTN internetwork comprising manually asserted contact opportunities, a non-DTN routing protocol, and probabilistic DTN routing protocol.

Keywords: delay tolerant networks; wireless routing; contact graph routing; challenged sensor internetworks; routing overlays; disrupted networks; sensor networks; simulation; routing protocols.

DOI: 10.1504/IJAHUC.2012.050271

International Journal of Ad Hoc and Ubiquitous Computing, 2012 Vol.11 No.2/3, pp.139 - 156

Received: 28 Jan 2012
Accepted: 02 Jun 2012

Published online: 06 Nov 2012 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article