### Abstract

We present an improved algorithm to wake up a multi-hop ad-hoc radio network. The goal is to have all the nodes activated, when some of them may wake up spontaneously at arbitrary times and the remaining nodes need to be awoken by the already active ones. The best previously known wake-up algorithm was given by Chrobak, Ga̧sieniec and Kowalski [11], and operated in time script O sign(n^{5/3}log n), where n is the number of nodes. We give an algorithm with the running time script O sign(n^{3/2}log n). This also yields better algorithms for other synchronization-type primitives, like leader election and local-clocks synchronization, each with a time performance that differs from that of wake-up by an extra factor of script O sign(log n) only, and improves the best previously known method for the problem by a factor of n^{1/6}. A wakeup algorithm is a schedule of transmissions for each node. It can be represented as a collection of binary sequences. Useful properties of such collections have been abstracted to define a (radio) synchronizer. It has been known that good radio synchronizers exist and previous algorithms [17, 11] relied on this. We show how to construct such synchronizers in polynomial time, from suitable constructible expanders. As an application, we obtain a wake-up protocol for a multiple-access channel that activates the network in time script O sign(k^{2} polylog n), where k is the number of stations that wake up spontaneously, and which can be found in time polynomial in n. We extend the notion of synchronizers to universal synchronizers. We show that there exist universal synchronizers with parameters that guarantee time script O sign(n^{3/2}log n) of wake-up.

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

Pages | 266-274 |

Number of pages | 9 |

State | Published - Dec 27 2004 |

Externally published | Yes |

Event | Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing - St. John's, Nfld., Canada Duration: Jul 25 2004 → Jul 28 2004 |

### Conference

Conference | Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing |
---|---|

Country | Canada |

City | St. John's, Nfld. |

Period | 7/25/04 → 7/28/04 |

### Fingerprint

### Keywords

- Ad-hoc network
- Expander
- Leader election
- Multi-hop radio network
- Radio synchronizer
- Synchronization
- Wake-up problem

### ASJC Scopus subject areas

- Software
- Hardware and Architecture
- Computer Networks and Communications

### Cite this

*A better wake-up in radio networks*. 266-274. Paper presented at Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, St. John's, Nfld., Canada.

**A better wake-up in radio networks.** / Chlebus, Bogdan S.; Kowalski, Dariusz R.

Research output: Contribution to conference › Paper

}

TY - CONF

T1 - A better wake-up in radio networks

AU - Chlebus, Bogdan S.

AU - Kowalski, Dariusz R.

PY - 2004/12/27

Y1 - 2004/12/27

N2 - We present an improved algorithm to wake up a multi-hop ad-hoc radio network. The goal is to have all the nodes activated, when some of them may wake up spontaneously at arbitrary times and the remaining nodes need to be awoken by the already active ones. The best previously known wake-up algorithm was given by Chrobak, Ga̧sieniec and Kowalski [11], and operated in time script O sign(n5/3log n), where n is the number of nodes. We give an algorithm with the running time script O sign(n3/2log n). This also yields better algorithms for other synchronization-type primitives, like leader election and local-clocks synchronization, each with a time performance that differs from that of wake-up by an extra factor of script O sign(log n) only, and improves the best previously known method for the problem by a factor of n1/6. A wakeup algorithm is a schedule of transmissions for each node. It can be represented as a collection of binary sequences. Useful properties of such collections have been abstracted to define a (radio) synchronizer. It has been known that good radio synchronizers exist and previous algorithms [17, 11] relied on this. We show how to construct such synchronizers in polynomial time, from suitable constructible expanders. As an application, we obtain a wake-up protocol for a multiple-access channel that activates the network in time script O sign(k2 polylog n), where k is the number of stations that wake up spontaneously, and which can be found in time polynomial in n. We extend the notion of synchronizers to universal synchronizers. We show that there exist universal synchronizers with parameters that guarantee time script O sign(n3/2log n) of wake-up.

AB - We present an improved algorithm to wake up a multi-hop ad-hoc radio network. The goal is to have all the nodes activated, when some of them may wake up spontaneously at arbitrary times and the remaining nodes need to be awoken by the already active ones. The best previously known wake-up algorithm was given by Chrobak, Ga̧sieniec and Kowalski [11], and operated in time script O sign(n5/3log n), where n is the number of nodes. We give an algorithm with the running time script O sign(n3/2log n). This also yields better algorithms for other synchronization-type primitives, like leader election and local-clocks synchronization, each with a time performance that differs from that of wake-up by an extra factor of script O sign(log n) only, and improves the best previously known method for the problem by a factor of n1/6. A wakeup algorithm is a schedule of transmissions for each node. It can be represented as a collection of binary sequences. Useful properties of such collections have been abstracted to define a (radio) synchronizer. It has been known that good radio synchronizers exist and previous algorithms [17, 11] relied on this. We show how to construct such synchronizers in polynomial time, from suitable constructible expanders. As an application, we obtain a wake-up protocol for a multiple-access channel that activates the network in time script O sign(k2 polylog n), where k is the number of stations that wake up spontaneously, and which can be found in time polynomial in n. We extend the notion of synchronizers to universal synchronizers. We show that there exist universal synchronizers with parameters that guarantee time script O sign(n3/2log n) of wake-up.

KW - Ad-hoc network

KW - Expander

KW - Leader election

KW - Multi-hop radio network

KW - Radio synchronizer

KW - Synchronization

KW - Wake-up problem

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

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

M3 - Paper

AN - SCOPUS:10444222995

SP - 266

EP - 274

ER -