### Abstract

While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing optimal sleep schedules in wireless networks, and show that finding sleep schedules that can minimize the latency over a given subset of source-destination pairs is NP-hard. We also derive a latency lower bound given by d+O(1/p) for any sleep schedule with a required active rate (i.e., the fraction of active slots of each node) p, and the shortest path length d. We offer a novel solution to optimal sleep scheduling using green-wave sleep scheduling (GWSS), inspired by coordinated traffic lights, which is shown to meet our latency lower bound (hence is latency-optimal) for topologies such as the line, grid, ring, torus and tree networks, under light traffic. For high traffic loads, we propose non-interfering GWSS, which can achieve the maximum throughput scaling law given by T(n, p) = Ω(p/√n) bits/sec on a grid network of size n, with a latency scaling law D(n, p) = O(√n)+O(1/p). Finally, we extend GWSS to a random network with n Poisson-distributed nodes, for which we show an achievable throughput scaling law of T(n, p) = Ω(p/√n log n) bits/sec and a corresponding latency scaling law D(n, p) = O(√n/ log n) + O(1/p); hence meeting the well-known Gupta-Kumar achievable throughput rate Ω(1/√n log n) when p → 1.

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

Title of host publication | 2010 Proceedings IEEE INFOCOM |

DOIs | |

State | Published - Jun 15 2010 |

Externally published | Yes |

Event | IEEE INFOCOM 2010 - San Diego, CA, United States Duration: Mar 14 2010 → Mar 19 2010 |

### Publication series

Name | Proceedings - IEEE INFOCOM |
---|---|

ISSN (Print) | 0743-166X |

### Other

Other | IEEE INFOCOM 2010 |
---|---|

Country | United States |

City | San Diego, CA |

Period | 3/14/10 → 3/19/10 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

### Cite this

*2010 Proceedings IEEE INFOCOM*[5462011] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2010.5462011