### Abstract

We consider anonymous complete networks whose links and nodes are subject to random independent failures with fixed probabilities p<1 and q<1, respectively. A single fault-free node has to wake up all fault-free nodes by propagating a wakeup message through the network. In a unit of time each node can communicate with at most one other node. Communications with a faulty node or via a faulty link do not succeed. For any ε>0 we present a wakeup algorithm for n-node networks, running in expected time O(log n), using an expected number of O(n log n) message bits and working correctly with probability exceeding 1-n^{-ε}, for sufficiently large n. It is proved that these orders of magnitude are optimal.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the Hawaii International Conference on System Sciences |

Editors | Jay F. Nunamaker, Ralph H.Jr. Sprague |

Publisher | Publ by IEEE |

Pages | 187-193 |

Number of pages | 7 |

ISBN (Print) | 0818650605 |

State | Published - Jan 1 1994 |

Externally published | Yes |

Event | Proceedings of the 27th Hawaii International Conference on System Sciences (HICSS-27). Part 4 (of 5) - Wailea, HI, USA Duration: Jan 4 1994 → Jan 7 1994 |

### Publication series

Name | Proceedings of the Hawaii International Conference on System Sciences |
---|---|

Volume | 2 |

ISSN (Print) | 1060-3425 |

### Conference

Conference | Proceedings of the 27th Hawaii International Conference on System Sciences (HICSS-27). Part 4 (of 5) |
---|---|

City | Wailea, HI, USA |

Period | 1/4/94 → 1/7/94 |

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

*Proceedings of the Hawaii International Conference on System Sciences*(pp. 187-193). (Proceedings of the Hawaii International Conference on System Sciences; Vol. 2). Publ by IEEE.

**Waking up an anonymous faulty network from a single source.** / Chlebus, Bogdan S.; Diks, Krzysztof; Pelc, Andrzej.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the Hawaii International Conference on System Sciences.*Proceedings of the Hawaii International Conference on System Sciences, vol. 2, Publ by IEEE, pp. 187-193, Proceedings of the 27th Hawaii International Conference on System Sciences (HICSS-27). Part 4 (of 5), Wailea, HI, USA, 1/4/94.

}

TY - GEN

T1 - Waking up an anonymous faulty network from a single source

AU - Chlebus, Bogdan S.

AU - Diks, Krzysztof

AU - Pelc, Andrzej

PY - 1994/1/1

Y1 - 1994/1/1

N2 - We consider anonymous complete networks whose links and nodes are subject to random independent failures with fixed probabilities p<1 and q<1, respectively. A single fault-free node has to wake up all fault-free nodes by propagating a wakeup message through the network. In a unit of time each node can communicate with at most one other node. Communications with a faulty node or via a faulty link do not succeed. For any ε>0 we present a wakeup algorithm for n-node networks, running in expected time O(log n), using an expected number of O(n log n) message bits and working correctly with probability exceeding 1-n-ε, for sufficiently large n. It is proved that these orders of magnitude are optimal.

AB - We consider anonymous complete networks whose links and nodes are subject to random independent failures with fixed probabilities p<1 and q<1, respectively. A single fault-free node has to wake up all fault-free nodes by propagating a wakeup message through the network. In a unit of time each node can communicate with at most one other node. Communications with a faulty node or via a faulty link do not succeed. For any ε>0 we present a wakeup algorithm for n-node networks, running in expected time O(log n), using an expected number of O(n log n) message bits and working correctly with probability exceeding 1-n-ε, for sufficiently large n. It is proved that these orders of magnitude are optimal.

UR - http://www.scopus.com/inward/record.url?scp=0028014774&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028014774&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0028014774

SN - 0818650605

T3 - Proceedings of the Hawaii International Conference on System Sciences

SP - 187

EP - 193

BT - Proceedings of the Hawaii International Conference on System Sciences

A2 - Nunamaker, Jay F.

A2 - Sprague, Ralph H.Jr.

PB - Publ by IEEE

ER -