Sciweavers

501 search results - page 96 / 101
» Communication Lower Bounds Using Dual Polynomials
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
On the Performance of IEEE 802.11 under Jamming
—In this paper, we study the performance of the IEEE 802.11 MAC protocol under a range of jammers that covers both channel-oblivious and channel-aware jamming. We study two chann...
Emrah Bayraktaroglu, Christopher King, Xin Liu, Gu...
INFOCOM
2003
IEEE
14 years 25 days ago
Internet Quarantine: Requirements for Containing Self-Propagating Code
— It has been clear since 1988 that self-propagating code can quickly spread across a network by exploiting homogeneous security vulnerabilities. However, the last few years have...
David Moore, Colleen Shannon, Geoffrey M. Voelker,...
PODC
2012
ACM
11 years 10 months ago
On the (limited) power of non-equivocation
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
Allen Clement, Flavio Junqueira, Aniket Kate, Rodr...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 12 days ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
MOBIHOC
2008
ACM
14 years 7 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang