English
Related papers

Related papers: Interference Calculation in Asynchronous Random Ac…

200 papers

We deal with the problem of streaming multiple video streams between pairs of nodes in a multi-hop wireless ad hoc network. The nodes are static, know their locations, and are synchronized (via GPS). We introduce a new interference model…

Networking and Internet Architecture · Computer Science 2011-08-09 Guy Even , Yaniv Fais , Moti Medina , Shimon , Shahar , Alexander Zadorojniy

This paper considers the slotted ALOHA protocol in a communication channel shared by N users. It is assumed that the channel has the multiple-packet reception (MPR) capability that allows the correct reception of up to M ($1 \leq M < N$)…

Information Theory · Computer Science 2017-07-26 Yijin Zhang , Yuan-Hsun Lo , Feng Shu , Jun Li

We investigate the problem of obtaining agreement protocols in the presence of a mobile adversary, who can control an ever-changing selection of processors. We make improvements to previous results for the case when the communications…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-06-22 Chris Dowden

The interference at a wireless node s can be modelled by the number of wireless nodes whose transmission ranges cover s. Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius…

Computational Geometry · Computer Science 2011-11-30 Majid Khabbazian , Stephane Durocher , Alireza Haghnegahdar

In overlay networks, both local and long-distance links appear as a single hop to a routing protocol. Traditional routing metrics (based on hop count or packet loss) fail to take the differences between such links into account. In this…

Networking and Internet Architecture · Computer Science 2014-03-17 Baptiste Jonglez , Matthieu Boutier , Juliusz Chroboczek

The random access scheme is a fundamental scenario in which users transmit through a shared channel and cannot coordinate each other. In recent years, successive interference cancellation (SIC) was introduced into the random access scheme.…

Information Theory · Computer Science 2018-04-16 Tomokazu Emoto , Takayuki Nozaki

In the current DVB generation, satellite terminals are expected to be interactive and capable of transmission in the return channel with satisfying quality. Considering the bursty nature of their traffic and the long propagation delay, the…

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

We address the problem of optimizing the throughput of network coded traffic in mobile networks operating in challenging environments where connectivity is intermittent and locally available memory space is limited. Random linear network…

Information Theory · Computer Science 2011-04-19 Gabriel Popa

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

One of the novelties brought by 5G is that wireless system design has increasingly turned its focus on guaranteeing reliability and latency. This shifts the design objective of random access protocols from throughput optimization towards…

Information Theory · Computer Science 2017-09-08 Cedomir Stefanovic , Francisco Lazaro , Petar Popovski

We develop an anomaly-detection method when systematic anomalies, possibly statistically very similar to genuine inputs, are affecting control systems at the input and/or output stages. The method allows anomaly-free inputs (i.e., those…

Methodology · Statistics 2022-02-01 Ning Sun , Chen Yang , Ričardas Zitikis

The construction of preamble sequences for channel estimation by superposition of orthogonal pilots can improve performance of massive grant-free uplink from machine-type devices. In this letter, a technique is proposed to obtain full…

Information Theory · Computer Science 2023-12-25 Lorenzo Valentini , Elena Bernardi , Enrico Paolini

The present PhD dissertation focuses on modern random access (RA) techniques. In the first part an slot- and frame-asynchronous RA scheme adopting replicas, successive interference cancellation and combining techniques is presented and its…

Information Theory · Computer Science 2017-07-03 Federico Clazzer

We study the problem of scheduling jobs on fault-prone machines communicating via a shared channel, also known as multiple-access channel. We have $n$ arbitrary length jobs to be scheduled on $m$ identical machines, $f$ of which are prone…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-07-26 Marek Klonowski , Dariusz R. Kowalski , Jarosław Mirek , Prudence W. H. Wong

We consider the following interference model for wireless sensor and ad hoc networks: the receiver interference of a node is the number of transmission ranges it lies in. We model transmission ranges as disks. For this case we show that…

Networking and Internet Architecture · Computer Science 2011-10-11 Kevin Buchin

We study broadcast in multiple access channels in dynamic adversarial settings. There is an unbounded supply of anonymous stations attached to a synchronous channel. There is an adversary who injects packets into stations to be broadcast on…

Networking and Internet Architecture · Computer Science 2018-07-19 Lakshmi Anantharamu , Bogdan S. Chlebus

This work analyzes the gains of cooperative relaying in interference-limited networks, in which outages can be due to interference and fading. A stochastic model based on point process theory is used to capture the spatial randomness…

Information Theory · Computer Science 2016-11-17 Ralph Tanbourgi , Holger Jäkel , Friedrich K. Jondral

Communication over the i.i.d. Rayleigh slow-fading MAC is considered, where all terminals are equipped with a single antenna. Further, a communication protocol is considered where all users transmit at (just below) the symmetric capacity…

Information Theory · Computer Science 2024-10-30 Elad Domanovitz , Uri Erez

The need for scalable numerical solutions has motivated the development of asynchronous parallel algorithms, where a set of nodes run in parallel with little or no synchronization, thus computing with delayed information. This paper studies…

Optimization and Control · Mathematics 2017-08-18 Robert Hannah , Wotao Yin

In this paper, we review the key figures of merit to assess the performance of advanced random access (RA) schemes exploiting physical layer coding, repetitions and collision resolution techniques. We then investigate RA modeling aspects…

Information Theory · Computer Science 2018-01-22 Alberto Mengali , Riccardo De Gaudenzi , Cedomir Stefanovic