Title:
Message Ferries as Generalized Dominating Sets in Intermittently Connected Mobile Networks
Message Ferries as Generalized Dominating Sets in Intermittently Connected Mobile Networks
| dc.contributor.author | Ammar, Mostafa H. | |
| dc.contributor.author | Polat, Bahadir K. | |
| dc.contributor.author | Sachdeva, Pushkar | |
| dc.contributor.author | Zegura, Ellen W. | |
| dc.contributor.corporatename | Georgia Institute of Technology. College of Computing | |
| dc.contributor.corporatename | Georgia Institute of Technology. School of Computer Science | |
| dc.date.accessioned | 2009-11-17T19:15:54Z | |
| dc.date.available | 2009-11-17T19:15:54Z | |
| dc.date.issued | 2009 | |
| dc.description.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. | en |
| dc.identifier.uri | http://hdl.handle.net/1853/31217 | |
| dc.language.iso | en_US | en |
| dc.publisher | Georgia Institute of Technology | en |
| dc.relation.ispartofseries | SCS Technical Report ; GT-CS-09-13 | en |
| dc.subject | Algorithms | en |
| dc.subject | Data delivery | en |
| dc.subject | Message ferrying | en |
| dc.subject | Mobile networks | en |
| dc.subject | Nodes | en |
| dc.subject | Routing | en |
| dc.subject | Wireless networks | en |
| dc.title | Message Ferries as Generalized Dominating Sets in Intermittently Connected Mobile Networks | en |
| dc.type | Text | |
| dc.type.genre | Technical Report | |
| dspace.entity.type | Publication | |
| local.contributor.author | Ammar, Mostafa H. | |
| local.contributor.author | Zegura, Ellen W. | |
| local.contributor.corporatename | College of Computing | |
| local.contributor.corporatename | School of Computer Science | |
| local.relation.ispartofseries | College of Computing Technical Report Series | |
| local.relation.ispartofseries | School of Computer Science Technical Report Series | |
| relation.isAuthorOfPublication | 4e51b833-e4cb-4216-8619-cd543dd0315e | |
| relation.isAuthorOfPublication | 8816f8c5-732c-4e5a-a86e-99019028a7b6 | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isOrgUnitOfPublication | 6b42174a-e0e1-40e3-a581-47bed0470a1e | |
| relation.isSeriesOfPublication | 35c9e8fc-dd67-4201-b1d5-016381ef65b8 | |
| relation.isSeriesOfPublication | 26e8e5bc-dc81-469c-bd15-88e6f98f741d |