Sciweavers

5 search results - page 1 / 1
» Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wi...
Sort
View
ESA
2001
Springer
110views Algorithms» more  ESA 2001»
13 years 9 months ago
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...
SPAA
2010
ACM
13 years 9 months ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
CCS
2007
ACM
13 years 10 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
COMCOM
2004
142views more  COMCOM 2004»
13 years 4 months ago
An adaptive power-conserving service discipline for bluetooth (APCB) wireless networks
Bluetooth is a new short-range radio technology to form a small wireless system. In most of the current Bluetooth products, the master polls the slaves in a round robin manner and...
Hao Zhu, Guohong Cao, George Kesidis, Chita R. Das
ICC
2007
IEEE
136views Communications» more  ICC 2007»
13 years 11 months ago
Achievable Diversity-Multiplexing-Delay Tradeoff for ARQ Cooperative Broadcast Channels
—Cooperative broadcast aims to deliver common messages to all receiver nodes in the wireless network by utilizing cooperation between them. This can have many important applicati...
Lingfan Weng, Ross D. Murch