English
Related papers

Related papers: Maximum Sum Rate of Slotted Aloha with Capture

200 papers

We consider a slotted-ALOHA LAN with loss-averse, noncooperative greedy users. To avoid non-Pareto equilibria, particularly deadlock, we assume probabilistic loss-averse behavior. This behavior is modeled as a modulated white noise term, in…

Computer Science and Game Theory · Computer Science 2012-02-28 George Kesidis , Youngmi Jin

Transmission capacity of an ad hoc wireless network is analyzed when each node of the network harvests energy from nature, e.g. solar, wind, vibration etc. Transmission capacity is the maximum allowable density of nodes, satisfying a per…

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

MIMO systems in the lower part of the millimeter-wave spectrum band (i.e., below 28 GHz) do not exhibit enough directivity and selectively, as their counterparts in higher bands of the spectrum (i.e., above 60 GHz), and thus still suffer…

Information Theory · Computer Science 2018-03-01 Hadi Ghauch , Taejoon Kim , Mats Bengtsson , Mikael Skoglund

In applications of remote sensing, estimation, and control, timely communication is not always ensured by high-rate communication. This work proposes distributed age-efficient transmission policies for random access channels with $M$…

Networking and Internet Architecture · Computer Science 2022-06-07 Xingran Chen , Konstantinos Gatsis , Hamed Hassani , Shirin Saeedi Bidokhti

Flanking traditional metrics such as throughput and reliability, age of information (AoI) is emerging as a fundamental tool to capture the performance of IoT systems. In this context, we focus on a setup in which a large number of nodes…

Networking and Internet Architecture · Computer Science 2020-05-19 Andrea Munari , Alexey Frolov

LoRaWAN is one of the most promising standards for IoT applications. Nevertheless, the high density of end-devices expected for each gateway, the absence of an effective synchronization scheme between gateway and end-devices, challenge the…

Networking and Internet Architecture · Computer Science 2018-09-17 Tommaso Polonelli , Davide Brunelli , Luca Benini

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…

Information Theory · Computer Science 2016-11-17 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj , Kasra Alishahi , Hamed Shah-Mansouri

The capacity of wireless networks is fundamentally limited by interference. However, little research has focused on the interference correlation, which may greatly increase the local delay (namely the number of time slots required for a…

Networking and Internet Architecture · Computer Science 2016-11-15 Yi Zhong , Wenyi Zhang , Martin Haenggi

Massive machine-type communications protocols have typically been designed under the assumption that coordination between users requires significant communication overhead and is thus impractical. Recent progress in efficient activity…

Information Theory · Computer Science 2022-07-12 Justin Kang , Wei Yu

In this paper, we investigate the random access problem for a delay-constrained heterogeneous wireless network. As a first attempt to study this new problem, we consider a network with two users who deliver delay-constrained traffic to an…

Networking and Internet Architecture · Computer Science 2021-07-16 Danzhou Wu , Lei Deng , Zilong Liu , Yijin Zhang , Yunghsiang S. Han

In nonorthogonal multiple access (NOMA), the power difference of multiple signals is exploited for multiple access and successive interference cancellation (SIC) is employed at a receiver to mitigate co-channel interference. Thus, NOMA is…

Information Theory · Computer Science 2017-06-28 Jinho Choi

In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate…

Networking and Internet Architecture · Computer Science 2016-11-15 Manolis Ploumidis , Nikolaos Pappas , Apostolos Traganitis

The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals…

Information Theory · Computer Science 2012-04-24 Samar Agnihotri , Sidharth Jaggi , Minghua Chen

We consider a cooperative non-orthogonal multiple access system with radio frequency energy harvesting, in which a user with good channel harvests energy from its received signal and serves as a decode-and-forward relay for enhancing the…

Information Theory · Computer Science 2018-06-07 Binh Van Nguyen , Quang-Doanh Vu , Kiseon Kim

Given the surge in wireless data traffic driven by the emerging Internet of Things (IoT), unmanned aerial vehicles (UAVs), cognitive radio (CR), and non-orthogonal multiple access (NOMA) have been recognized as promising techniques to…

Signal Processing · Electrical Eng. & Systems 2023-09-21 Felix Obite , Ali Krayani , Atm S. Alam , Lucio Marcenaro , Arumugam Nallanathan , Carlo Regazzoni

In this paper, we study the performance of an amplify-and-forward (AF) based analog network coding (ANC) relay scheme in a multi-hop wireless network under individual power constraints. In the first part, a unicast scenario is considered.…

Information Theory · Computer Science 2012-03-23 Binyue Liu , Ning Cai

Slotted ALOHA (SA) algorithms with Successive Interference Cancellation (SIC) decoding have received significant attention lately due to their ability to dramatically increase the throughput of traditional SA. Motivated by increased density…

Information Theory · Computer Science 2017-06-30 Aleksandar Mastilovic , Dejan Vukobratovic , Dusan Jakovetic , Dragana Bajovic

We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling…

Information Theory · Computer Science 2016-05-20 Jesper H. Sørensen , Elisabeth de Carvalho , Čedomir Stefanović , Petar Popovski

In the recent past, new enhancements based on the well established Aloha technique (CRDSA, CRDSA++, IRSA) have demonstrated the capability to reach higher throughput than traditional SA, in bursty traffic conditions and without any need of…

Information Theory · Computer Science 2015-01-26 Alessio Meloni , Maurizio Murroni

This paper studies low-power random access protocols for timely status update systems with information freshness requirements, measured by age of information (AoI). In an extensive network, a fundamental challenge is scheduling a large…

Networking and Internet Architecture · Computer Science 2023-12-14 Tse-Tin Chan , Jian Feng , Haoyuan Pan