English
Related papers

Related papers: Deterministic Patterns for Multiple Access with La…

200 papers

We consider the problem of linear network coding over communication networks, representable by directed acyclic graphs, with multiple groupcast sessions: the network comprises of multiple destination nodes, each desiring messages from…

Information Theory · Computer Science 2014-02-05 Abhik Kumar Das , Siddhartha Banerjee , Sriram Vishwanath

The design of medium access control protocols for a cognitive user wishing to opportunistically exploit frequency bands within parts of the radio spectrum having multiple bands is considered. In the scenario under consideration, the…

Information Theory · Computer Science 2016-11-17 Lifeng Lai , Hesham El Gamal , Hai Jiang , H. Vincent Poor

In this paper, we propose a robust transceiver design for the K-pair quasi-static MIMO interference channel. Each transmitter is equipped with M antennas, each receiver is equipped with N antennas, and the k-th transmitter sends L_k…

Information Theory · Computer Science 2010-09-23 Eddy Chiu , Vincent K. N. Lau , Huang Huang , Tao Wu , Sheng Liu

We study a delay-constrained grant-free random access system with a multi-antenna base station. The users randomly generate data packets with expiration deadlines, which are then transmitted from data queues on a first-in first-out basis.…

Information Theory · Computer Science 2024-10-23 Jianan Bai , Zheng Chen , Erik. G. Larsson

In this paper, we use the linear deterministic approximation model to study a two user multiple access channel mutually interfering with a point to point link, which represents a basic setup of a cellular system. We derive outer bounds on…

Information Theory · Computer Science 2011-05-12 Jörg Bühler , Gerhard Wunder

We present two interference alignment techniques such that an opportunistic point-to-point multiple input multiple output (MIMO) link can reuse, without generating any additional interference, the same frequency band of a similar…

Computer Science and Game Theory · Computer Science 2016-11-17 Samir Medina Perlaza , Merouane Debbah , Samson Lasaulce , Jean-Marie Chaufray

We consider the problem of dynamic spectrum access for network utility maximization in multichannel wireless networks. The shared bandwidth is divided into K orthogonal channels. In the beginning of each time slot, each user selects a…

Networking and Internet Architecture · Computer Science 2018-11-06 Oshri Naparstek , Kobi Cohen

We study a deterministic dynamics with two time scales in a continuous state attractor network. To the usual (fast) relaxation dynamics towards point attractors (``patterns'') we add a slow coupling dynamics that makes the visited patterns…

Neurons and Cognition · Quantitative Biology 2010-06-10 Juliana R. Dias , Rodrigo F. Oliveira , Osame Kinouchi

This article investigates the problem of dynamic spectrum access for canonical wireless networks, in which the channel states are time-varying. In the most existing work, the commonly used optimization objective is to maximize the…

Information Theory · Computer Science 2017-07-31 Yuhua Xu , Jinlong Wang , Qihui Wu , Jianchao Zheng , Liang Shen , Alagan Anpalagan

This paper focuses on robust transceiver design for throughput enhancement on the interference channel (IC), under imperfect channel state information (CSI). In this paper, two algorithms are proposed to improve the throughput of the…

Information Theory · Computer Science 2018-04-02 Ali Dalir , Hassan Aghaeinia , Mohammad Kazemi

The increasing number of wireless devices operating in unlicensed spectrum motivates the development of intelligent adaptive approaches to spectrum access. We consider decentralized contention-based medium access for base stations (BSs)…

Information Theory · Computer Science 2021-10-15 Akash Doshi , Srinivas Yerramalli , Lorenzo Ferrari , Taesang Yoo , Jeffrey G. Andrews

In multi-user wireless packet networks interference, typically modeled as packet collision, is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for…

Information Theory · Computer Science 2018-07-24 Alireza Vahid , Robert Calderbank

A wireless network in which packets are broadcast to a group of receivers through use of a random access protocol is considered in this work. The relation to previous work on networks of interacting queues is discussed and subsequently, the…

Information Theory · Computer Science 2007-11-05 Brooke Shrader , Anthony Ephremides

We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation…

Information Theory · Computer Science 2012-10-03 Čedomir Stefanović , Kasper F. Trilingsgaard , Nuno K. Pratas , Petar Popovski

A robust and resilient Medium Access Control (MAC) protocol is crucial for numerous machine-type devices to concurrently access the channel in a Machine-to-Machine (M2M) network. Simplex (reservation or contention based) MAC protocols are…

Networking and Internet Architecture · Computer Science 2014-05-27 Yi Liu , Chau Yuen , Xianghui Cao , Naveed Ul Hassan , Jiming Chen

We consider stability of scheduled multiaccess message communication with random coding and joint maximum-likehood decoding of messages. The framework we consider here models both the random message arrivals and the subsequent reliable…

Information Theory · Computer Science 2007-07-13 KCV Kalyanarama Sesha Sayee , Utpal Mukherji

Individual links in a wireless network may experience unequal fading coherence times due to differences in mobility or scattering environment, a practical scenario where the fundamental limits of communication have been mostly unknown. This…

Information Theory · Computer Science 2016-07-26 Mohamed Fadel , Aria Nosratinia

We consider deterministic distributed communication in wireless ad hoc networks of identical weak devices under the SINR model without predefined infrastructure. Most algorithmic results in this model rely on various additional features or…

Data Structures and Algorithms · Computer Science 2018-01-15 Tomasz Jurdzinski , Dariusz R. Kowalski , Michal Rozanski , Grzegorz Stachowiak

We investigate the unsourced random access scheme assuming that the base station is equipped with multiple antennas, and propose a high-performing solution utilizing on-off-division multiple access. We assume that each user spreads its…

Information Theory · Computer Science 2024-06-11 Mert Ozates , Mohammad Kazemi , Tolga M. Duman

Randomized backoff protocols, such as exponential backoff, are a powerful tool for managing access to a shared resource, often a wireless communication channel (e.g., [1]). For a wireless device to transmit successfully, it uses a backoff…

Data Structures and Algorithms · Computer Science 2022-07-26 Michael A. Bender , Seth Gilbert , Fabian Kuhn , John Kuszmaul , Muriel Médard