Sciweavers

376 search results - page 27 / 76
» Self-Stabilizing Graph Protocols
Sort
View
PODC
1989
ACM
15 years 6 months ago
Multiple Communication in Multi-Hop Radio Networks
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Effi...
Reuven Bar-Yehuda, Amos Israeli
110
Voted
ICALP
2009
Springer
15 years 9 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
123
Voted
SIGCOMM
1998
ACM
15 years 6 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam
102
Voted
TACAS
2001
Springer
119views Algorithms» more  TACAS 2001»
15 years 6 months ago
Compositional Message Sequence Charts
Abstract. A message sequence chart (MSC) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication pro...
Elsa L. Gunter, Anca Muscholl, Doron Peled
115
Voted
MSN
2007
Springer
15 years 8 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...