Optimal F-reliable protocols for the Do-All problem on single-hop wireless networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 320-331

  Clementi, Andrea E F ^a   Monti, Angelo ^b   Silvestri, Riccardo ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION DETECTION; COMPLETION TIME; LOWER BOUNDS; PROTOCOL EXECUTION; SINGLE-HOP WIRELESS NETWORKS; SYNCHRONOUS NETWORKS; TIGHT BOUND; WORK COMPLEXITY;

ALGORITHMS; COMPLEX NETWORKS; OBJECT DETECTION; WIRELESS NETWORKS;

WIRELESS NETWORKS; COMPLEX NETWORKS;

EID: 57549092507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_29     Document Type: Conference Paper

References (11)

1. B.S. Chlebus, D.R. Kowalski (1999). Randomization helps to perform tasks on processors prone to failures. 13th DISC'99, LNCS, 1693.
2. B.S. Chlebus, D.R. Kowalski, and A. Lingas (2001). The Do-All problem in Broadcast networks, ACM-PODC'01.
3. B.S. Chlebus, R. De Prisco, and A.A. Shvartsman (2001). Performing tasks on synchronous restartable message-passing processors. Distributed Computing, 14, 49-64. (Pubitemid 32779973)
4. C. Dwork, J. Halpern, and O. Waarts (1998). Performing work efficiently in the presence of faults, SIAM J.on Computing, 27, 1457-1491. (Pubitemid 128689482)
5. R. De Prisco, A. Mayer, and M. Yung (1994). Time-optimal message-efficient work performance in the presence of faults, ACM PODC'94, 161-172.
6. Z. Galil, A. Mayer, and M. Yung (1995). Resolving message complexity of byzantine agreement and beyond, IEEE FOCS'95, 724-733.
7. D. Gelernter and D. Kaminsky (1992). Supercomputing out of recycled garbage: preliminary experience with Piranha. ACM Int. Conf. on Supercomputing, 417-427.
8. J.D. Gibson (Ed.) (1996). The Mobile Communications Handbook, CRC Press.
9. P.C. Kanellakis, and A.A. Shavartsman (1992). Efficient Parallel Algorithms Can Be Made Robust, Distributed Computing, 5, 201-217.
10. P.C. Kanellakis, and A.A. Shavartsman (1997) Fault-Tolerant Parallel Computation, ISBN 0-7923-9922-6, Klunder Academic Publishers.
11. J.F. Shoch and J.A. Hupp (1982). The Worm programs - early experience with a distributed computation, Comm. Assoc. Comput. Mach., 25, 95-103.