13 search results - page 2 / 3 » Hyperbolic Embedding and Routing for Dynamic Graphs |
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
SENSYS
2003
ACM
13 years 10 months ago
2003
ACM
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...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
ICNP
2006
IEEE
13 years 11 months ago
2006
IEEE
— 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 ...