Sciweavers

184 search results - page 18 / 37
» Communication in Networks with Random Dependent Faults
Sort
View
CCS
2007
ACM
14 years 2 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
SIGCOMM
1997
ACM
14 years 21 days ago
Dynamics of Random Early Detection
In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as nonadaptive, fragile and robust, according to their responses to con...
Dong Lin, Robert Morris
ICC
2007
IEEE
144views Communications» more  ICC 2007»
14 years 2 months ago
Binary Repetition Codes and SPC Product Codes for Coded and Cooperative Diversity Systems
— A three stage network protocol that can achieve coded and cooperative diversity to improve network coverage is investigated. In Stage 1, a cyclic redundancy check code is used ...
Pavel Loskot, Norman C. Beaulieu
ICALP
2009
Springer
14 years 8 months ago
A Distributed and Oblivious Heap
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Christian Scheideler, Stefan Schmid
MWCN
2004
Springer
14 years 1 months ago
Enabling Energy Demand Response with Vehicular Mesh Networks
Inter-vehicle communication is becoming increasingly important in recent years. Traditional research efforts on vehicular networks have been put into safety or infotainment applica...
Howard CheHao Chang, Haining Du, Joey Anda, Chen-N...