TY - GEN

T1 - Green wave

T2 - IEEE INFOCOM 2010

AU - Guha, Saikat

AU - Chau, Chi Kin

AU - Basu, Prithwish

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/INFCOM.2010.5462011

DO - 10.1109/INFCOM.2010.5462011

M3 - Conference contribution

AN - SCOPUS:77953306738

SN - 9781424458363

T3 - Proceedings - IEEE INFOCOM

BT - 2010 Proceedings IEEE INFOCOM

Y2 - 14 March 2010 through 19 March 2010

ER -