Learn More
—In this paper, we consider the problem of energy efficient scheduling under average delay constraint for a single user fading channel. We propose a new approach for on-line implementation of the optimal packet scheduling algorithm. This approach is based on reformulating the value iteration equation by introducing a virtual state called post-decision(More)
In this paper, we consider the problem of energy-efficient uplink scheduling with delay constraint for a multiuser wireless system. We address this problem within the framework of constrained Markov decision processes (CMDPs) wherein one seeks to minimize one cost (average power) subject to a hard constraint on another (average delay). We do not assume the(More)
—In this paper, we consider uplink transmissions involving multiple users communicating with a base station over a fading channel. We assume that the base station does not coordinate the transmissions of the users and hence the users employ random access communication. The situation is modeled as a non-cooperative repeated game with incomplete information.(More)
We consider the problem of scheduling users on the downlink of a Time Division Multiplexed(TDM) system with constraints on the average packet delays over a fading wireless channel. Our objective is to maximize the sum throughput with constraints on the user delays. Due to the difficulty in computing optimal policy, we propose a suboptimal scheduling(More)
Traditionally, automatic design rule correction (DRC) problem is modeled as a Linear Program (LP) with design rules as difference constraints under minimum perturbation objective. This yields Totally Uni-Modular (TUM) constraint matrices thereby guaranteeing integral grid-compliant solutions with LP solvers. However, advanced technology nodes introduce(More)
—In this paper, we consider uplink transmissions involving multiple users communicating with a base station over a fading channel. We assume that the base station does not coordinate the transmissions of the users and hence the users employ random access communication. The situation is modeled as a non-cooperative repeated game with incomplete information.(More)