English
Related papers

Related papers: Multiple Unicast Capacity of 2-Source 2-Sink Netwo…

200 papers

Planning the movement of the sink to maximize the lifetime in wireless sensor networks is an essential problem of great research challenge and practical value. Many existing mobile sink techniques based on mathematical programming or…

Networking and Internet Architecture · Computer Science 2024-07-11 Xiaoxu Han , Xin Mu , Jinghui Zhong

We consider a diamond-shaped dual-hop communication system consisting a source, two parallel half-duplex relays and a destination. In a single antenna configuration, it has been previously shown that a two-phase node-scheduling algorithm,…

Information Theory · Computer Science 2008-05-20 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

In this paper we study the capacity region of the multi-pair bidirectional (or two-way) wireless relay network, in which a relay node facilitates the communication between multiple pairs of users. This network is a generalization of the…

Information Theory · Computer Science 2016-11-17 Salman Avestimehr , Amin Khajehnejad , Aydin Sezgin , Babak Hassibi

A multiple input multiple output (MIMO) two-way relay channel is considered, where two sources want to exchange messages with each other using multiple relay nodes, and both the sources and relay nodes are equipped with multiple antennas.…

Information Theory · Computer Science 2008-04-07 Rahul Vaze , Robert W. Heath

Dimensionality requirement poses a major challenge for Interference alignment (IA) in practical systems. This work evaluates the necessary and sufficient conditions on channel structure of a fully connected general interference network to…

Information Theory · Computer Science 2016-01-25 Zainalabedin Samadi , Vahid Tabatabavakili , Farzan Haddadi

Full-duplex communication has the potential to substantially increase the throughput in wireless networks. However, the benefits of full-duplex are still not well understood. In this paper, we characterize the full-duplex rate gains in both…

Information Theory · Computer Science 2016-06-10 Jelena Marašević , Jin Zhou , Harish Krishnaswamy , Yuan Zhong , Gil Zussman

A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel…

Data Structures and Algorithms · Computer Science 2009-09-29 Javad Ebrahimi , Christina Fragouli

Interference alignment allows multiple users to share the same frequency and time resource in a wireless communications system. At present, two performance bounds, in terms of degree of freedom, have been proposed. One is for…

Information Theory · Computer Science 2015-11-02 Feng Ouyang

Almost all the WiFi networks today provide single band (either 2.4 GHz or 5.8 GHz) wireless communication functionality for connected mobile nodes. In a single band network, the interference depends on number of nodes in the network and the…

Networking and Internet Architecture · Computer Science 2020-07-02 Sabur Baidya , Pramod Shirol , Abhishek Basu , Ravi Prakash

This paper studies the capacity of massive random-access cellular networks, modeled as a MIMO fading channel with an infinite number of interfering cells. To characterize the symmetric sum rate of the network, a random-coding argument is…

Information Theory · Computer Science 2025-09-26 Grace Villacrés , Tobias Koch , Gonzalo Vazquez-Vilar

We investigate the total degrees of freedom (DoF) of the K-user rank-deficient interference channel with feedback. For the two-user case, we characterize the total DoF by developing an achievable scheme and deriving a matching upper bound.…

Information Theory · Computer Science 2016-11-17 Sung Ho Chae , Changho Suh , Sae-Young Chung

Two coexisting ad-hoc networks, primary and secondary, are considered, where each node of the primary network has a single antenna, while each node of the secondary network is equipped with multiple antennas. Using multiple antennas, each…

Information Theory · Computer Science 2015-03-17 Rahul Vaze

This paper considers a two-hop network architecture known as a combination network, where a layer of relay nodes connects a server to a set of end users. In particular, a new model is investigated where the intermediate relays employ caches…

Information Theory · Computer Science 2017-12-14 Ahmed A. Zewail , Aylin Yener

In this paper, we study the degrees of freedom (DoF) of the frequency-selective K-user interference channel in the presence of an instantaneous relay (IR) with multiple receive and transmit antennas. We investigate two scenarios based on…

Information Theory · Computer Science 2021-09-21 Ali H. Abdollahi Bafghi , Mahtab Mirmohseni , Masoumeh Nasiri-Kenari

We study the Degrees of Freedom (DoF) of the K-user interference channel with coordinated multi-point (CoMP) transmission and reception. Each message is jointly transmitted by M_t successive transmitters, and is jointly received by M_r…

Information Theory · Computer Science 2016-11-18 V. Sreekanth Annapureddy , Aly El Gamal , Venugopal V. Veeravalli

It is known that the capacity of parallel (e.g., multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across…

Information Theory · Computer Science 2010-01-26 Viveck R. Cadambe , Syed A. Jafar

The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Assuming that the transmitter locations are…

Information Theory · Computer Science 2016-11-15 Rahul Vaze , Robert W. Heath

We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor…

Information Theory · Computer Science 2019-01-08 Jad Hachem , Urs Niesen , Suhas Diggavi

Capacity scaling of a large hybrid network with unit node density, consisting of $n$ wireless ad hoc nodes, base stations (BSs) equipped with multiple antennas, and one remote central processor (RCP), is analyzed when wired backhaul links…

Information Theory · Computer Science 2014-07-29 Cheol Jeong , Won-Yong Shin

Consider a relay cascade, i.e. a network where a source node, a sink node and a certain number of intermediate source/relay nodes are arranged on a line and where adjacent node pairs are connected by error-free (q+1)-ary pipes. Suppose the…

Information Theory · Computer Science 2016-11-17 Tobias Lutz , Christoph Hausl , Ralf Kötter
‹ Prev 1 8 9 10 Next ›