Show simple item record

dc.contributor.authorErramilli, Vijayen_US
dc.contributor.authorChaintreau, Augustinen_US
dc.contributor.authorCrovella, Marken_US
dc.contributor.authorDiot, Christopheen_US
dc.date.accessioned2011-10-20T04:42:47Z
dc.date.available2011-10-20T04:42:47Z
dc.date.issued2007en_US
dc.identifier.urihttps://hdl.handle.net/2144/1682
dc.description.abstractForwarding in DTNs is a challenging problem. We focus on the specific issue of forwarding in an environment where mobile devices are carried by people in a restricted physical space (e.g. a conference) and contact patterns are not predictable. We show for the first time a path explosion phenomenon between most pairs of nodes. This means that, once the first path reaches the destination, the number of subsequent paths grows rapidly with time, so there usually exist many near-optimal paths. We study the path explosion phenomenon both analytically and empirically. Our results highlight the importance of unequal contact rates across nodes for understanding the performance of forwarding algorithms. We also find that a variety of well-known forwarding algorithms show surprisingly similar performance in our setting and we interpret this fact in light of the path explosion phenomenon.en_US
dc.description.sponsorshipNational Science Foundation (CCR-0325702, ANI-0322990); HAGGLE FET projecten_US
dc.language.isoen_USen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-2007-005en_US
dc.titleDiversity of Forwarding Paths in Pocket Switched Networksen_US
dc.typeTechnical Reporten_US


This item appears in the following Collection(s)

Show simple item record