English
Related papers

Related papers: Rate and Power Allocation in Fading Multiple Acces…

200 papers

Equal allocation of bandwidth and/or power may not be efficient for wireless multi-user networks with limited bandwidth and power resources. Joint bandwidth and power allocation strategies for wireless multi-user networks with and without…

Information Theory · Computer Science 2015-05-19 Xiaowen Gong , Sergiy A. Vorobyov , Chintha Tellambura

The problem of optimal resource allocation is studied for ergodic fading orthogonal multiaccess relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits on a…

Information Theory · Computer Science 2009-02-10 Lalitha Sankar , Yingbin Liang , Narayan Mandayam , H. Vincent Poor

In this paper, for a fading decode-and-forward full-duplex relay channel, we analytically derive optimum power allocations. Individual power constraints for the source and the relay are assumed and the related optimization problem is…

Information Theory · Computer Science 2012-02-07 Arash Gholami Davoodi , Mohammad Javad Emadi , Mohammad Reza Aref

This paper studies the optimal power allocation for outage minimization in point-to-point fading channels with the energy-harvesting constraints and channel distribution information (CDI) at the transmitter. Both the cases with non-causal…

Networking and Internet Architecture · Computer Science 2013-05-24 Chuan Huang , Rui Zhang , Shuguang Cui

In fading channels, power allocation over channel state may bring a rate increment compared to the fixed constant power mode. Such a rate increment is referred to power allocation gain. It is expected that the power allocation gain varies…

Information Theory · Computer Science 2014-12-25 Zhengchuan Chen , Pingyi Fan , Dapeng Wu , Liquan Shen

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

Power allocation with peak-to-average power ratio constraints is investigated for transmission over Nakagami-m fading channels with arbitrary input distributions. In the case of delay-limited block-fading channels, we find the solution to…

Information Theory · Computer Science 2008-02-26 Khoa D. Nguyen , Albert Guillen i Fabregas , Lars K. Rasmussen

In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input…

Information Theory · Computer Science 2016-08-08 Marwan Hammouda , Sami Akin , Jürgen Peissig

A network of $n$ wireless communication links is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between nodes. The objective is to analyze the achievable throughput of the network when power…

Information Theory · Computer Science 2016-11-17 Masoud Ebrahimi , Mohammad Maddah-Ali , Amir Khandani

We study the problem of decentralized power allocation in a multi-access channel (MAC) with non-cooperative users, additive noise of arbitrary distribution and a generalized power constraint, i.e., the transmit power constraint is modeled…

Information Theory · Computer Science 2023-05-26 Prashant Narayanan , Lakshmi Narasimhan Theagarajan

We investigate energy efficient packet scheduling and power allocation problem for the services which require reliable communication to guarantee a certain quality of experience (QoE). We establish links between average transmit power and…

Information Theory · Computer Science 2018-07-27 M. Majid Butt , Eduard A. Jorswieck , Nicola Marchetti

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

Greedy Maximal Scheduling (GMS) is an attractive low-complexity scheme for scheduling in wireless networks. Recent work has characterized its throughput for the case when there is no fading/channel variations. This paper aims to understand…

Networking and Internet Architecture · Computer Science 2012-03-12 Akula Aneesh Reddy , Sujay Sanghavi , Sanjay Shakkottai

We consider single cell multi-user OFDMA downlink resource allocation on a flat-fading channel such that average supply power is minimized while fulfilling a set of target rates. Available degrees of freedom are transmission power and…

Information Theory · Computer Science 2013-07-12 Hauke Holtkamp , Gunther Auer , Harald Haas

We consider the downlink of a cellular system and address the problem of multiuser scheduling with partial channel information. In our setting, the channel of each user is modeled by a three-state Markov chain. The scheduler indirectly…

Networking and Internet Architecture · Computer Science 2009-04-14 Sugumar Murugesan , Philip Schniter

We provide the solution for optimizing the power and resource allocation over block-fading relay-assisted broadcast channels in order to maximize the long term average achievable rates region of the users. The problem formulation assumes…

Information Theory · Computer Science 2012-05-02 Mohammad Shaqfeh , Hussein Alnuweiri

This paper presents the optimal power control policies maximizing the effective capacity achieved with arbitrary input distributions subject to an average power constraint and quality of service (QoS) requirements. The analysis leads to…

Information Theory · Computer Science 2018-05-21 Gozde Ozcan , M. Cenk Gursoy

A wireless system with multiple channels is considered, where each channel has several transmission states. A user learns about the instantaneous state of an available channel by transmitting a control packet in it. Since probing all…

Data Structures and Algorithms · Computer Science 2008-04-11 Sudipto Guha , Kamesh Munagala , Saswati Sarkar

We study the problem of power allocation over two identical Gilbert-Elliot communication channels. Our goal is to maximize the expected discounted number of bits transmitted over an infinite time horizon. This is achieved by choosing among…

Information Theory · Computer Science 2012-09-27 Junhua Tang , Parisa Mansourifard , Bhaskar Krishnamachari

We develop a general approach for designing scheduling policies for real-time traffic over wireless channels. We extend prior work, which characterizes a real-time flow by its traffic pattern, delay bound, timely-throughput requirement, and…

Networking and Internet Architecture · Computer Science 2009-08-06 I-Hong Hou , P. R. Kumar