Traffic-light scheduling on the grid
Proceedings of the international workshop on Broadcasting and gossiping 1990
SEEDEX: a MAC protocol for ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
JAVeLEN - An ultra-low energy ad hoc wireless network
Ad Hoc Networks
O-MAC: A Receiver Centric Power Management Protocol
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Energy and connectivity performance of routing groups in multi-radio multi-hop networks
Wireless Communications & Mobile Computing - Resources and Mobility Management in Wireless Networks
DW-MAC: a low latency, energy efficient demand-wakeup MAC protocol for wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Opportunistic forwarding in wireless networks with duty cycling
Proceedings of the third ACM workshop on Challenged networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
The capacity of wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Capacity of large-scale CSMA wireless networks
IEEE/ACM Transactions on Networking (TON)
Delay-SRLG constrained, backup-shared path protection in WDM networks with sleep scheduling
Computer Communications
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
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 noninterfering 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.