English
Related papers

Related papers: Power Optimal Scheduling for Guaranteed Throughput…

200 papers

In this paper, we consider a multiple-access fading channel where $N$ users transmit to a single base station (BS) within a limited number of time slots. We assume that each user has a fixed amount of energy available to be consumed over…

Information Theory · Computer Science 2017-02-10 Antonious M. Girgis , Amr El-Keyi , Mohammed Nafie

We consider a communication system with multi-access fading channel. Each user in the system requires certain rate guarantee. Our main contribution is to devise a scheduling scheme called "Opportunistic Super-position Coding" that satisfies…

Information Theory · Computer Science 2009-11-24 Prasanna Chaporkar , Kimmo Kansanen , Ralf R. Müller

The performance of systems where multiple users communicate over wireless fading links benefits from channel-adaptive allocation of the available resources. Different from most existing approaches that allocate resources based on perfect…

Information Theory · Computer Science 2009-09-07 Antonio G. Marques , Georgios B. Giannakis , Javier Ramos

The problem of user scheduling and power allocation in full-duplex (FD) cellular networks is considered, where a FD base station communicates simultaneously with one half-duplex (HD) user on each downlink and uplink channel. First, we…

Information Theory · Computer Science 2016-11-17 George C. Alexandropoulos , Marios Kountouris , Italo Atzeni

In this paper, we consider the problem of power efficient uplink scheduling in a Time Division Multiple Access (TDMA) system over a fading wireless channel. The objective is to minimize the power expenditure of each user subject to…

Networking and Internet Architecture · Computer Science 2007-10-08 Nitin Salodkar , Abhay Karandikar , Vivek S. Borkar

Multi-connectivity is emerging as promising solution to provide reliable communications and seamless connectivity at the millimeter-wave frequency range. Due to the obstacles that cause frequent interruptions at such high frequency range,…

Networking and Internet Architecture · Computer Science 2018-12-18 Cristian Tatino , Ilaria Malanchini , Nikolaos Pappas , Di Yuan

We consider the problem of rate and power allocation in a fading multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a utility function defined over average transmission rates. In contrast…

Information Theory · Computer Science 2008-10-08 Ali ParandehGheibi , Atilla Eryilmaz , Asuman Ozdaglar , Muriel Medard

In this work, we address the delay optimal scheduling problem for wireless transmission with fixed modulation over multi-state fading channels. We propose a stochastic scheduling policy which schedules the source to transmit with…

Information Theory · Computer Science 2015-09-18 Juan Liu , Wei Chen , Khaled B. Letaief

The multiple access scheduling decides how the channel is shared among the nodes in the network. Typical scheduling algorithms aims at increasing the channel utilization and thereby throughput of the network. This paper describes several…

Information Theory · Computer Science 2025-09-30 Vijaya Yajnanarayana , Klas E. G. Magnusson , Rasmus Brandt , Satyam Dwivedi , Peter Händel

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, the effective capacity region…

Information Theory · Computer Science 2010-09-17 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates on the…

Information Theory · Computer Science 2016-11-15 Ali ParandehGheibi , Atilla Eryilmaz , Asuman Ozdaglar , Muriel Medard

This paper is motivated by the observation that the average queueing delay can be decreased by sacrificing power efficiency in wireless communications. In this sense, we naturally wonder what is the minimum queueing delay when the available…

Information Theory · Computer Science 2018-07-27 Meng Wang , Juan Liu , Wei Chen , Anthony Ephremides

In this paper, a downlink scenario in which a single-antenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. It is assumed that channel state information is perfectly known at…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Alireza Bayesteh , Amir K. Khandani

We consider coded caching over the fading broadcast channel, where the users, equipped with a memory of finite size, experience asymmetric fading statistics. It is known that a naive application of coded caching over the channel at hand…

Information Theory · Computer Science 2018-01-16 Richard Combes , Asma Ghorbel , Mari Kobayashi , Sheng Yang

We consider a scheduler for the downlink of a wireless channel when only partial channel-state information is available at the scheduler. We characterize the network stability region and provide two throughput-optimal scheduling policies.…

Optimization and Control · Mathematics 2014-08-19 Santanu Mondal , Vinod Sharma

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, we study the achievable…

Information Theory · Computer Science 2009-10-22 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…

Information Theory · Computer Science 2011-12-05 Qiao Li , Rohit Negi

Resource allocation is a fundamental task in cell-free (CF) massive multi-input multi-output (MIMO) systems, which can effectively improve the network performance. In this paper, we study the downlink of CF MIMO networks with network…

Information Theory · Computer Science 2023-12-22 S. Mashdour , A. Schmeink , R. C. de Lamare , J. P. Sales

We consider a joint scheduling-and-power-allocation problem of a downlink cellular system. The system consists of two groups of users: real-time (RT) and non-real-time (NRT) users. Given an average power constraint on the base station, the…

Information Theory · Computer Science 2017-05-08 Ahmed Ewaisha , Cihan Tepedelenlioglu

We consider the problem of simultaneous user-scheduling, power-allocation, and rate-selection in an OFDMA downlink, with the goal of maximizing expected sum-utility under a sum-power constraint. In doing so, we consider a family of generic…

Information Theory · Computer Science 2015-05-20 Rohit Aggarwal , Mohamad Assaad , C. Emre Koksal , Philip Schniter
‹ Prev 1 2 3 10 Next ›