English
Related papers

Related papers: Interference Cancellation at Receivers in Cache-En…

200 papers

Interference is a major issue that limits the performance in wireless networks, and cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited…

Information Theory · Computer Science 2009-08-20 I-Hsiang Wang , David N. C. Tse

In wireless networks, the rate achieved depends on factors like level of interference, hardware impairments, and channel gain. Often, instantaneous values of some of these factors can be measured, and they provide useful information about…

Information Theory · Computer Science 2022-02-24 Manjesh K. Hanawal , Sumit J. Darak

We study the problem of cache-aided communication for cellular networks with multi-user and multiple antennas at finite signal-to-noise ratio. Users are assumed to have non-symmetric links, modeled by wideband fading channels. We show that…

Information Theory · Computer Science 2018-08-09 Itsik Bergel , Soheil Mohajer

Degraded K-user broadcast channels (BC) are studied when receivers are facilitated with cache memories. Lower and upper bounds are derived on the capacity-memory tradeoff, i.e., on the largest rate of reliable communication over the BC as a…

Information Theory · Computer Science 2017-02-28 Shirin Saeedi Bidokhti , Michele Wigger , Aylin Yener

This paper discusses transmission strategies for dealing with the problem of self-interference in multi-hop wireless networks in which the nodes communicate in a full- duplex mode. An information theoretic study of the simplest such…

Information Theory · Computer Science 2011-11-04 Evan Everett , Debashis Dash , Chris Dick , Ashutosh Sabharawal

We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through…

Information Theory · Computer Science 2010-09-23 I-Hsiang Wang

In this paper we determine the delivery time for a multi-server coded caching problem when the cache size of each user is small. We propose an achievable scheme based on coded cache content placement, and employ zero-forcing techniques at…

Information Theory · Computer Science 2018-03-22 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj

Multi-tier architecture improves the spatial reuse of radio spectrum in cellular networks, but it introduces complicated heterogeneity in the spatial distribution of transmitters, which brings new challenges in interference analysis. In…

Networking and Internet Architecture · Computer Science 2014-10-28 Wei Bao , Ben Liang

With the crowding of the electromagnetic spectrum and the shrinking cell size in wireless networks, crosstalk between base stations and users is a major problem. Although hand-crafted functional blocks and coding schemes are proven…

Signal Processing · Electrical Eng. & Systems 2020-09-14 Yiming Zhou , Ashkan Samiee , Tingyi Zhou , Bahram Jalali

In wireless caching networks, a user generally has a concrete purpose of consuming contents in a certain preferred category, and requests multiple contents in sequence. While most existing research on wireless caching and delivery has…

Networking and Internet Architecture · Computer Science 2020-02-18 Minseok Choi , Andreas F. Molisch , Dong-Jun Han , Joongheon Kim , Jaekyun Moon

In this paper, we examine the benefits of multiple antenna communication in random wireless networks, the topology of which is modeled by stochastic geometry. The setting is that of the Poisson bipolar model introduced in [1], which is a…

Information Theory · Computer Science 2016-08-23 Junse Lee , Namyoon Lee , Francois Baccelli

We consider a server connected to $L$ users over a shared finite capacity link. Each user is equipped with a cache. File requests at the users are generated as independent Poisson processes according to a popularity profile from a library…

Performance · Computer Science 2018-04-30 Mahadesh Panju , Ramkumar Raghu , Vinod Sharma , Rajesh Ramachandran

We consider a hierarchical network that consists of mobile users, a two-tiered cellular network (namely small cells and macro cells) and central routers, each of which follows a Poisson point process (PPP). In this scenario, small cells…

Information Theory · Computer Science 2016-05-05 Ejder Baştuğ , Marios Kountouris , Mehdi Bennis , Mérouane Debbah

In this paper we study the relay-interference wireless network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We examine this in the context of a deterministic wireless interaction…

Information Theory · Computer Science 2008-12-10 Soheil Mohajer , Suhas N. Diggavi , Christina Fragouli , David N. C. Tse

Large-scale blockages like buildings affect the performance of urban cellular networks, especially at higher frequencies. Unfortunately, such blockage effects are either neglected or characterized by oversimplified models in the analysis of…

Information Theory · Computer Science 2013-09-18 Tianyang Bai , Rahul Vaze , Robert W. Heath

Content caching at the small-cell base stations (sBSs) in a heterogeneous wireless network is considered. A cost function is proposed that captures the backhaul link load called the `offloading loss', which measures the fraction of the…

Information Theory · Computer Science 2018-05-18 B. N. Bharath , K. G. Nagananda , D. Gündüz , H. Vincent Poor

This thesis focuses on link scheduling in wireless mesh networks by taking into account physical layer characteristics. The assumption made throughout is that a packet is received successfully only if the Signal to Interference and Noise…

Networking and Internet Architecture · Computer Science 2008-12-31 Ashutosh Deepak Gore

The use of Aloha-based Random Access protocols is interesting when channel sensing is either not possible or not convenient and the traffic from terminals is unpredictable and sporadic. In this paper an analytic model for packet…

Information Theory · Computer Science 2015-02-05 Alessio Meloni , Maurizio Murroni

In this paper, we show that by investigating inherent time delays between different users in a multiuser scenario, we are able to cancel interference more efficiently. Time asynchrony provides another tool to cancel interference which…

Information Theory · Computer Science 2016-09-23 Mehdi Ganji , Hamid Jafarkhani

In this paper, we consider a cache-aided relay network, where a single server consisting of a library of N files connects with K1 relays through a shared noiseless link, and each relay connects with K2 users through a shared noiseless link.…

Information Theory · Computer Science 2020-10-20 Ke Wang , Youlong Wu , Shujie Cao , Jiahui Chen
‹ Prev 1 8 9 10 Next ›