Sciweavers

82 search results - page 4 / 17
» Information dissemination in highly dynamic graphs
Sort
View
ICNP
2006
IEEE
13 years 11 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
ISCC
2003
IEEE
120views Communications» more  ISCC 2003»
13 years 10 months ago
DIP: Distance Information Protocol for IDMaps
The Internet Distance Map Service (IDMaps) [3] provides distance estimates between any pair of hosts connected to the Internet. The IDMaps system comprises two component types: Tr...
Yixin Jin, Beichuan Zhang, Vasileios Pappas, Lixia...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
13 years 10 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
SENSYS
2003
ACM
13 years 10 months ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song
SAC
2010
ACM
14 years 5 days ago
Infrastructureless storage in dynamic environments
This paper studies the use of highly dynamic networks as infrastructures for persistent storage of data that offer services at specific geographical zones in a decentralized and...
Jose Luis Fernandez-Marquez, Josep Lluís Ar...