Sciweavers

237 search results - page 13 / 48
» Anonymous Networking with Minimum Latency in Multihop Networ...
Sort
View
PET
2009
Springer
15 years 10 months ago
Scalable Link-Based Relay Selection for Anonymous Routing
The performance of an anonymous path can be described using many network metrics – e.g., bandwidth, latency, jitter, loss, etc. However, existing relay selection algorithms have ...
Micah Sherr, Matt Blaze, Boon Thau Loo
TELSYS
2008
94views more  TELSYS 2008»
15 years 3 months ago
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks
This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the ex...
Nelson Antunes, Gonçalo Jacinto, Antó...
141
Voted
WIOPT
2006
IEEE
15 years 9 months ago
On the macroscopic effects of local interactions in multi-hop wireless networks
Abstract— The objective of the paper is to provide qualitative insight into the global effects of distributed mechanisms, such as carrier sense multiple access (CSMA) and rate co...
Venkatesh Saligrama, David Starobinski
PET
2005
Springer
15 years 9 months ago
An Analysis of Parallel Mixing with Attacker-Controlled Inputs
Parallel mixing [7] is a technique for optimizing the latency of a synchronous re-encryption mix network. We analyze the anonymity of this technique when an adversary can learn the...
Nikita Borisov
126
Voted
MOBICOM
2003
ACM
15 years 8 months ago
A high-throughput path metric for multi-hop wireless routing
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of pac...
Douglas S. J. De Couto, Daniel Aguayo, John C. Bic...