English
Related papers

Related papers: Wireless Networks with Asynchronous Users

200 papers

We study the interaction of WiFi and 5G cellular networks as they exploit the recently unlocked 6-GHz spectrum for unlicensed access while conforming to the constraints imposed by the incumbent users. We derive the theoretical performance…

Systems and Control · Electrical Eng. & Systems 2024-10-30 Aniq Ur Rahman , Mustafa A. Kishk , Mohamed-Slim Alouini

We consider three capacity definitions for general channels with channel side information at the receiver, where the channel is modeled as a sequence of finite dimensional conditional distributions not necessarily stationary, ergodic, or…

Information Theory · Computer Science 2016-11-17 Michelle Effros , Andrea Goldsmith , Yifan Liang

An asymptotic technique is presented to characterize the bits/symbol achievable on a representative wireless link in a spatially distributed network with active interferers at correlated positions, N receive diversity branches, and linear…

Information Theory · Computer Science 2013-12-30 Siddhartan Govindasamy

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

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

In this paper, we investigate effective capacity by modeling a cognitive radio broadcast channel with one secondary transmitter (ST) and two secondary receivers (SRs) under quality-of-service constraints and interference power limitations.…

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

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

This article re-examines the fundamental notion of interference in wireless networks by contrasting traditional approaches to new concepts that handle interference in a creative way. Specifically, we discuss the fundamental limits of the…

Ubiquitous densification of wireless networks has brought up the issue of inter-and intra-cell interference. Interference significantly degrades network throughput and leads to unfair channel resource usage, especially in Wi-Fi networks,…

Networking and Internet Architecture · Computer Science 2019-08-19 Evgeny Khorov , Anton Kiryanov , Alexander Krotov

The role of cooperation in managing interference - a fundamental feature of the wireless channel - is investigated by studying the two-user Gaussian interference channel where the source nodes can both transmit and receive in full-duplex.…

Information Theory · Computer Science 2011-01-28 Vinod M. Prabhakaran , Pramod Viswanath

We analyze the achievable rate in interference-free wireless networks with physical layer fading channels and orthogonal multiple access. As a starting point, the point-to-point channel is considered. We find the optimal physical and…

Information Theory · Computer Science 2016-11-18 Tao Cui , Tracey Ho , Joerg Kliewer

Communication over a multiple access channel is considered. Each user modulates his signal as a superposition of redundant data streams where interconnection of data bits can be represented by means of a sparse graph. The receiver observes…

Information Theory · Computer Science 2011-11-28 Dmitri Truhachev

We consider the problem of cross-layer resource allocation in time-varying cellular wireless networks, and incorporate information theoretic secrecy as a Quality of Service constraint. Specifically, each node in the network injects two…

Information Theory · Computer Science 2015-03-17 C. Emre Koksal , Ozgur Ercetin , Yunus Sarikaya

This paper studies joint spectrum allocation and user association in large heterogeneous cellular networks. The objective is to maximize some network utility function based on given traffic statistics collected over a slow timescale,…

Information Theory · Computer Science 2018-10-17 Binnan Zhuang , Dongning Guo , Ermin Wei , Michael L. Honig

This paper studies how to maximize the per-user-based throughput in an M-tier heterogeneous wireless network (HetNet) by optimally managing traffic flows between the access points (APs) in the HetNet. The APs in the first M-1 tiers can use…

Information Theory · Computer Science 2017-02-17 Chun-Hung Liu , Hong-Cheng Tsai

This work considers an asynchronous $\textsf{K}_\text{a}$-active-user unsourced multiple access channel (AUMAC) with the worst-case asynchronicity. The transmitted messages must be decoded within $n$ channel uses, while some codewords are…

Information Theory · Computer Science 2024-01-31 Jyun-Sian Wu , Pin-Hsun Lin , Marcel A. Mross , Eduard A. Jorswieck

We consider random-access networks where nodes represent servers with a queue and can be either active or inactive. A node deactivates at unit rate, while it activates at a rate that depends on its queue length, provided none of its…

Probability · Mathematics 2023-09-13 Sem C. Borst , Frank den Hollander , Francesca R. Nardi , Matteo Sfragara

In this paper, we introduce an application-aware spectrum sharing approach for sharing the Federal under-utilized 3.5 GHz spectrum with commercial users. In our model, users are running elastic or inelastic traffic and each application…

Networking and Internet Architecture · Computer Science 2016-11-18 Haya Shajaiah , Ahmed Abdelhadi , Charles Clancy

This paper addresses the following question, which is of interest in the design and deployment of a multiuser decentralized network. Given a total system bandwidth of W Hz and a fixed data rate constraint of R bps for each transmission, how…

Information Theory · Computer Science 2007-07-13 Nihar Jindal , Jeffrey Andrews , Steven Weber

An interference alignment example is constructed for the deterministic channel model of the $K$ user interference channel. The deterministic channel example is then translated into the Gaussian setting, creating the first known example of a…

Information Theory · Computer Science 2007-11-19 Viveck Cadambe , Syed A. Jafar , Shlomo Shamai
‹ Prev 1 4 5 6 7 8 10 Next ›