Sciweavers

415 search results - page 81 / 83
» Reactive routing overhead in networks with unreliable nodes
Sort
View
GI
2004
Springer
14 years 25 days ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
CCS
2009
ACM
14 years 2 months ago
As-awareness in Tor path selection
Tor is an anonymous communications network with thousands of router nodes worldwide. An intuition reflected in much of the literature on anonymous communications is that, as an a...
Matthew Edman, Paul F. Syverson
SIGCOMM
2009
ACM
14 years 1 months ago
A standalone content sharing application for spontaneous communities of mobile handhelds
This demo illustrates the benefits of BitHoc, a standalone protocol for content sharing among spontaneous communities of mobile handhelds using wireless multi-hop connections. Bi...
Amir Krifa, Mohamed Karim Sbai, Chadi Barakat, Thi...
DBSEC
2007
112views Database» more  DBSEC 2007»
13 years 9 months ago
Reliable Delivery of Event Data from Sensors to Actuators in Pervasive Computing Environments
Abstract. The event-condition-action (ECA) paradigm holds enormous potential in pervasive computing environments. However, the problem of reliable delivery of event data, generated...
Sudip Chakraborty, Nayot Poolsappasit, Indrajit Ra...
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
14 years 20 days ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan