Sciweavers

312 search results - page 13 / 63
» Protocols for Non-Deterministic Communication over Synchrono...
Sort
View
WDAG
2004
Springer
105views Algorithms» more  WDAG 2004»
15 years 3 months ago
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...
D. V. S. Ravikant, Muthuramakrishnan Venkitasubram...
FGCN
2007
IEEE
15 years 4 months ago
Supporting Deadline Monotonic Policy over 802.11 MAC Layer Service Time Distribution
In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario w...
Inès El Korbi, Leïla Azouz Saïdan...
CCS
2010
ACM
14 years 7 months ago
Developing security protocols by refinement
We propose a development method for security protocols based on stepwise refinement. Our refinement strategy guides sformation of abstract security goals into protocols that are s...
Christoph Sprenger, David A. Basin
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 1 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
80
Voted
JSAC
2008
92views more  JSAC 2008»
14 years 9 months ago
Multiband OFDM for Covert Acoustic Communications
A multiband OFDM transmitter and receiver are presented for underwater communications at low SNR. Compared with a single-band OFDM scheme, the multiband approach leads to a conside...
Geert Leus, Paul A. van Walree