Department of Computer Engineering
S E M I N A R
Exploiting Connectivity Patterns for Social Routing in Delay Tolerant Networks
Computer Engineering Department
In delay tolerant networks (DTNs), the network may not be connected at any instance of time, but connections occurring between nodes at different times make the network connected through the entire time continuum. In such a case, traditional routing methods fail to operate as there are no contemporaneous end-to-end paths between sources and destinations. In this study we examine mobility and connectivity patterns of users to build a social graph over which routing algorithms run. We are particularly interested in relationships among partitions of the network so that they can be used to deliver a packet to its destination as fast as possible.
DATE: 14 March, 2011, Monday @ 16:40