English
Related papers

Related papers: Finite-Horizon Throughput Region for Wireless Mult…

200 papers

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

Information Theory · Computer Science 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai

Characterizing the global maximum of weighted sum-rate (WSR) for the K-user Gaussian interference channel (GIC), with the interference treated as Gaussian noise, is a key problem in wireless communication. However, due to the users' mutual…

Information Theory · Computer Science 2016-11-17 Liang Liu , Rui Zhang , Kee-Chaing Chua

We study a nonlinear fiber optical channel impaired by cross-phase modulation and dispersion from the viewpoint of an interference channel. We characterize an outer bound on the capacity region of simultaneously achievable rate pairs,…

Information Theory · Computer Science 2021-07-06 Viswanathan Ramachandran , Astrid Barreiro , Gabriele Liga , Alex Alvarado

We model the self-interference in a multiple input single output (MISO) full-duplex two-way channel and evaluate the achievable rate region. We formulate the boundary of the achievable rate region termed as the Pareto boundary by a family…

Information Theory · Computer Science 2015-01-20 Shuqiao Jia , Behnaam Aazhang

In this paper, we propose an achievable rate region for discrete memoryless interference channels with conferencing at the transmitter side. We employ superposition block Markov encoding, combined with simultaneous superposition coding,…

Information Theory · Computer Science 2007-07-13 Yi Cao , Biao Chen

The rate regions of many variations of the standard and wire-tap channels have been thoroughly explored. Secrecy capacity characterizes the loss of rate required to ensure that the adversary gains no information about the transmissions.…

Information Theory · Computer Science 2018-06-27 Jake Perazzone , Eric Graves , Paul Yu , Rick Blum

We consider a single hop wireless X network with $K$ transmitters and $J$ receivers, all with single antenna. Each transmitter conveys for each receiver an independent message. The channel is assumed to have constant coefficients. We…

Information Theory · Computer Science 2011-09-15 Zhengdao Wang

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…

Information Theory · Computer Science 2016-11-17 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj , Kasra Alishahi , Hamed Shah-Mansouri

When simultaneous wireless information and power transfer is carried out, a fundamental tradeoff between achievable rate and harvested energy exists because the received power is used for two different purposes. The tradeoff is well…

Information Theory · Computer Science 2018-02-06 Young-bin Kim , Dae Kyu Shin , Wan Choi

This paper studies evaluation of the capacity region for interference networks with point-to-point (p2p) capacity-achieving codes. Such capacity region has recently been characterized as union of several sub-regions each of which has…

Information Theory · Computer Science 2013-01-29 Jung Hyun Bae , Jungwon Lee , Inyup Kang

In this paper we analyze the interference channel as a conflict situation. This viewpoint implies that certain points in the rate region are unreasonable to one of the players. Therefore these points cannot be considered achievable based on…

Information Theory · Computer Science 2007-07-13 Amir Leshem , Ephraim Zehavi

The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity. Classical broadcast algorithms treat messages as…

Data Structures and Algorithms · Computer Science 2014-08-29 Noga Alon , Mohsen Ghaffari , Bernhard Haeupler , Majid Khabbazian

In a multi-user channel, completion time refers to the number of channel uses required for users, each with some given fixed bit pool, to complete the transmission of all their data bits. This paper extends the information theoretic…

Information Theory · Computer Science 2011-10-04 Yuanpeng Liu , Elza Erkip

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi

Passive and linear nonreciprocal networks at microwave frequencies hold great promises in enabling new front-end architectures for wireless communication systems. Their nonreciprocity has been achieved by disrupting the time-reversal…

Signal Processing · Electrical Eng. & Systems 2019-01-03 Ruochen Lu , John Krol , Liuqing Gao , Songbin Gong

New achievable rate regions are derived for the two-user additive white Gaussian multiple-access channel with noisy feedback. The regions exhibit the following two properties. Irrespective of the (finite) Gaussian feedback-noise variances,…

Information Theory · Computer Science 2010-04-13 Amos Lapidoth , Michele A. Wigger

For a multi-user interference channel with multi-antenna transmitters and single-antenna receivers, by restricting each receiver to a single-user detector, computing the largest achievable rate region amounts to solving a family of…

Information Theory · Computer Science 2009-08-24 Xiaohu Shang , Biao Chen , H. Vincent Poor

An achievable rate region is obtained for a primary multiple access network coexisting with a secondary link of one transmitter and a corresponding receiver. The rate region depicts the sum primary rate versus the secondary rate and is…

Information Theory · Computer Science 2015-03-18 John Tadrous , Mohammed Nafie

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

In this paper, we consider a full duplex wireless powered communication network where multiple users with RF energy harvesting capabilities communicate to a hybrid energy and information access point. An optimization framework is proposed…

Information Theory · Computer Science 2019-10-30 Muhammad Shahid Iqbal , Yalcin Sadi , Sinem Coleri