Sciweavers

41 search results - page 3 / 9
» Compact routing with name independence
Sort
View
FC
2010
Springer
191views Cryptology» more  FC 2010»
13 years 10 months ago
Using Sphinx to Improve Onion Routing Circuit Construction
This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit constru...
Aniket Kate, Ian Goldberg
INFOCOM
2009
IEEE
14 years 28 days ago
Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing
Abstract—Different geographic routing protocols have different requirements on routing metric designs to ensure proper operation. Combining a wrong type of routing metric with a ...
Yujun Li, Yaling Yang, Xianliang Lu
ICPR
2006
IEEE
14 years 7 months ago
Removing Temporal Stationary Blur in Route Panoramas
The Route Panorama is a continuous, compact and complete image representation of scenes along a route. It is generated continuously from reading a preset line in a camera frame th...
Jiang Yu Zheng, Min Shi
SPAA
2006
ACM
14 years 7 days ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
MOBICOM
2005
ACM
13 years 12 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang