Sciweavers

58 search results - page 4 / 12
» Probabilistic Routing in Intermittently Connected Networks
Sort
View
INFOCOM
2007
IEEE
15 years 3 months ago
A Graph-Based Model for Disconnected Ad Hoc Networks
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
Francesco De Pellegrini, Daniele Miorandi, Iacopo ...
INFOCOM
2009
IEEE
15 years 4 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
ICC
2007
IEEE
125views Communications» more  ICC 2007»
15 years 3 months ago
Disruption-Tolerant Routing with Scoped Propagation of Control Information
— We consider the problem of routing messages through a network with episodic connectivity without a priori knowledge of node schedules or locations. We present Steward Assisted ...
Jay Boice, Jose Joaquin Garcia-Luna-Aceves, Katia ...
NAS
2010
IEEE
14 years 7 months ago
A Probabilistic Routing Protocol for Heterogeneous Sensor Networks
The past five years witnessed a rapid development in wireless sensor networks, which have been widely used in military and civilian applications. Due to different requirements in t...
Yuefei Hu, Wenzhong Li, Xiao Chen, Xin Chen, Sangl...
AICT
2006
IEEE
15 years 3 months ago
Networks without Borders: Communication despite Disconnection
Communication in the face of intermittent, short-lived and unreliable connectivity can be difficult when relying solely on Internet protocols which have an implicit assumption of...
Gregory Kempe, Norman C. Hutchinson