Title:
Message Ferries as Generalized Dominating Sets in Intermittently Connected Mobile Networks
Message Ferries as Generalized Dominating Sets in Intermittently Connected Mobile Networks
Authors
Ammar, Mostafa H.
Polat, Bahadir K.
Sachdeva, Pushkar
Zegura, Ellen W.
Polat, Bahadir K.
Sachdeva, Pushkar
Zegura, Ellen W.
Authors
Advisors
Advisors
Associated Organizations
Collections
Supplementary to
Permanent Link
Abstract
Message ferrying is a technique for routing
data in wireless and mobile networks in which one or more
mobile nodes are tasked with storing and carrying data
between sources and destinations. To achieve connectivity
between all nodes, message ferries may need to relay data
to each other. While useful as a routing technique for
wireless mobile networks in general, message ferrying is
particularly useful in intermittently connected networks
where traditional MANET routing protocols are not usable.
A wireless and mobile network is said to possess intrinsic
message ferrying capability if a subset of the nodes can
act as message ferries by virtue of their own mobility
pattern, without introducing additional nodes or modifying
existing node mobility. Our goal in this work is to provide a
formalism by which one can characterize intrinsic message
ferrying capability. We first observe that the use of message
ferries is the mobile generalization of the well-known
use of connected dominating set-based routing in wireless
networks. We next consider the problem of identifying
the set of nodes in a mobile network which can act as
message ferries by virtue of their mobility pattern. To
this end, we define the concept of a connected message
ferry dominating set (CMFDS) in a manner that achieves
data delivery within certain performance bounds. We then
develop algorithms that can be used to find such a set
within a mobile, wireless network. The general CMFDS
algorithm is built around a core algorithm that determines
whether a single node in the network can act as a ferry. We
provide some illustrative examples to show the application
of our algorithm to several mobility patterns.
Sponsor
Date Issued
2009
Extent
Resource Type
Text
Resource Subtype
Technical Report