Energy-Aware Wireless Scheduling with Near Optimal Backlog and\n Convergence Time Tradeoffs

2014/11/18 by Michael J. Neely, Neely, Michael J.
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Advanced Wireless Network Optimization #Age of Information Optimization #Cooperative Communication and Network Coding #FOS: Mathematics #Optimization and Control (math.OC)

paper · pdf · doi:10.48550/arxiv.1411.4740

openalex publication_date 2014/11/18 · openalex created_date 2025/10/24 · openalex updated_date 2026/07/28

Abstract

This paper considers a wireless link with randomly arriving data that is\nqueued and served over a time-varying channel. It is known that any algorithm\nthat comes within \ε of the minimum average power required for queue\nstability must incur average queue size at least \Ω(\log(1/\ε)).\nHowever, the optimal convergence time is unknown, and prior algorithms give\nconvergence time bounds of O(1/\ε²). This paper develops a scheduling\nalgorithm that, for any \ε>0, achieves the optimal\nO(\log(1/\ε)) average queue size tradeoff with an improved convergence\ntime of O(\log(1/\ε)/\ε). This is shown to be within a\nlogarithmic factor of the best possible convergence time. The method uses the\nsimple drift-plus-penalty technique with an improved convergence time analysis.\n

Related

• Delay Optimal Power Aware Opportunistic Scheduling with Mutual Information Accumulation
• Joint Queue-Aware and Channel-Aware Delay Optimal Scheduling of Arbitrarily Bursty Traffic over Multi-State Time-Varying Channels
• A Stable On-line Algorithm for Energy Efficient Multi-user Scheduling
• Energy Efficient Greedy Link Scheduling and Power Control in wireless\n networks
• A Greedy Link Scheduler for Wireless Networks with Fading Channels