Sciweavers

NETCOOP
2009
Springer
13 years 10 months ago
Competition and Cooperation between Nodes in Delay Tolerant Networks with Two Hop Routing
This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) using simple probabilistic arguments. Closed form expressions are derived for the main performan...
Eitan Altman
WASA
2009
Springer
80views Algorithms» more  WASA 2009»
13 years 10 months ago
Dynamic Scheduling of Pigeons for Delay Constrained Applications
Information collection in the disaster area is an important application of pigeon networks - a special type of delay tolerant networks (DTN). The aim of this paper is to explore hi...
Jiazhen Zhou, Jiang Li, Legand L. Burge III
INFOCOM
2009
IEEE
13 years 10 months ago
Fair Routing in Delay Tolerant Networks
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
MSWIM
2009
ACM
13 years 10 months ago
HUBCODE: message forwarding using hub-based network coding in delay tolerant networks
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...
Shabbir Ahmed, Salil S. Kanhere
ASUNAM
2009
IEEE
13 years 10 months ago
Dynamics of Inter-Meeting Time in Human Contact Networks
—We envision new communication paradigms, using physical dynamic interconnectedness among people. Delay Tolerant Networks (DTNs) are a new communication paradigm to support such ...
Eiko Yoneki, Dan Greenfield, Jon Crowcroft
MOBIHOC
2008
ACM
14 years 3 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu