Sciweavers

247 search results - page 15 / 50
» Extracting All the Randomness from a Weakly Random Source
Sort
View
MOBIHOC
2002
ACM
14 years 7 months ago
Weak duplicate address detection in mobile ad hoc networks
Auto-configuration is a desirable goal in implementing mobile ad hoc networks. Specifically, automated dynamic assignment (without manual intervention) of IP addresses is desirabl...
Nitin H. Vaidya
MSWIM
2005
ACM
14 years 1 months ago
Randomized energy aware routing algorithms in mobile ad hoc networks
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
Israat Tanzeena Haque, Chadi Assi, J. William Atwo...
NTMS
2009
IEEE
14 years 2 months ago
An Adaptive Quantization Algorithm for Secret Key Generation Using Radio Channel Measurements
—New approaches that generate secret keys from radio channel characteristics have been recently proposed. The security of these schemes usually relies on the reciprocity principl...
Sana Tmar Ben Hamida, Jean-Benoît Pierrot, C...
DATE
2006
IEEE
127views Hardware» more  DATE 2006»
14 years 1 months ago
A signal theory based approach to the statistical analysis of combinatorial nanoelectronic circuits
In this paper we present a method which allows the statistical analysis of nanoelectronic Boolean networks with respect to timing uncertainty and noise. All signals are considered...
Oliver Soffke, Peter Zipf, Tudor Murgan, Manfred G...
FOCS
2008
IEEE
14 years 2 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson