English
Related papers

Related papers: Throughput Scaling Laws for Wireless Networks with…

200 papers

In this paper, throughput and energy efficiency of secure wireless transmission of delay sensitive data generated by random sources is studied. A fading broadcast model in which the transmitter sends confidential and common messages to two…

Information Theory · Computer Science 2017-04-10 Mustafa Ozmen , M. Cenk Gursoy

In this paper, we present a detailed framework to analyze the evolution of the random topology of a time-varying wireless network via the information theoretic notion of entropy rate. We consider a propagation channel varying over time with…

Information Theory · Computer Science 2018-11-08 Arta Cika , Mihai-Alin Badiu , Justin P. Coon , Shahriar Etemadi Tajbakhsh

We address the optimization of the sum rate performance in multicell interference-limited singlehop networks where access points are allowed to cooperate in terms of joint resource allocation. The resource allocation policies considered…

Information Theory · Computer Science 2007-09-19 David Gesbert , Marios Kountouris

Consider a static wireless network that has two tiers with different priorities: a primary tier vs. a secondary tier. The primary tier consists of randomly distributed legacy nodes of density $n$, which have an absolute priority to access…

Information Theory · Computer Science 2008-12-31 Long Gao , Rui Zhang , Changchuan Yin , Shuguang Cui

Ultra-Reliable Low Latency Communication (URLLC) is one of the distinctive features of the upcoming 5G wireless communication, going down to packet error rates (PER) of $10^{-9}$. In this paper we discuss the statistical properties of the…

Information Theory · Computer Science 2018-01-15 Patrick C. F. Eggers , Marko Angjelichinoski , Petar Popovski

In a large-scale wireless ad hoc network in which all transmitters form a homogeneous of Poisson point process, the statistics of the signal-to-interference ratio (SIR) in prior work is only derived in closed-form for the case of Rayleigh…

Information Theory · Computer Science 2015-05-27 Chun-Hung Liu

Given the imperative for advanced wireless networks in the next generation and the rise of real-time applications within wireless communication, there is a notable focus on investigating data rate performance across various fading…

Information Theory · Computer Science 2023-11-21 Manpreet Kaur , Sandeep Kumar , Poonam Yadav , Puspraj Singh Chauhan

Motivated by the fact that full diversity order is achieved using the "best-relay" selection technique, we consider opportunistic amplify-and-forward and decode-and-forward relaying systems. We focus on the outage probability of such a…

Information Theory · Computer Science 2016-11-15 Ashkan Kalantari , Mohammadali Mohammadi , Mehrdad Ardebilipour

This paper investigates the uplink achievable rates of massive multiple-input multiple-output (MIMO) antenna systems in Ricean fading channels, using maximal-ratio combining (MRC) and zero-forcing (ZF) receivers, assuming perfect and…

Information Theory · Computer Science 2015-06-19 Qi Zhang , Shi Jin , Kai-Kit Wong , Hongbo Zhu , Michail Matthaiou

Throughput capacity is a critical parameter for the design and evaluation of ad-hoc wireless networks. Consider n identical randomly located nodes, on a unit area, forming an ad-hoc wireless network. Assuming a fixed per node transmission…

Information Theory · Computer Science 2007-07-13 Rohit Negi , Arjunan Rajeswaran

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

Information Theory · Computer Science 2010-04-13 O. Ozan Koyluoglu , C. Emre Koksal , Hesham El Gamal

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

In this paper, we propose a methodology for estimating the statistics of the intercell interference power in the downlink of a multicellular network. We first establish an analytical expression for the probability law of the interference…

Information Theory · Computer Science 2011-07-22 Benoit Pijcke , Marie Zwingelstein-Colin , Marc Gazalet , Mohamed Gharbi , Patrick Corlay

In this paper, we consider a wireless powered multi-relay network in which a multi-antenna hybrid access point underlaying a cellular system transmits information to distant receivers. Multiple relays capable of energy harvesting are…

Information Theory · Computer Science 2018-10-23 Jing Xu , Yuze Zou , Shimin Gong , Lin Gao , Dusit Niyato , Wenqing Cheng

The problem of interference management is considered in the context of a linear interference network that is subject to long term channel fluctuations due to shadow fading. The fading model used is one where each link in the network is…

Information Theory · Computer Science 2018-07-18 Tolunay Seyfi , Yasemin Karacora , Aly El Gamal

Interference is the most important issue for present wireless communication. There are various kinds of channel used in wireless communication. Here I want to show a performance analysis on the basis of two different channels - AWGN and…

Information Theory · Computer Science 2014-04-10 Sutani Ghosh

Interleaving is a mechanism universally used in wireless access technologies to alleviate the effect of channel correlation. In spite of its wide adoption, to the best of our knowledge, there are no analytical models proposed so far. In…

Information Theory · Computer Science 2018-01-31 Dmitri Moltchanov , Pavel Kustarev , Yevgeni Kucharyavy

This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading. Both transmitter and jammer are subject to power constraints which can be enforced over each codeword short-term…

Information Theory · Computer Science 2008-08-27 George T. Amariucai , Shuangqing Wei

Rateless codes have been shown to provide robust error correction over a wide range of binary and noisy channels. Using a stochastic geometry model, this paper studies the performance of rateless codes in the cellular downlink and compares…

Information Theory · Computer Science 2017-02-27 Amogh Rajanna , Martin Haenggi

We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading channels, under peak constraints in time and frequency and in time…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Helmut Bölcskei , Shlomo Shamai