English
Related papers

Related papers: Hard Latency-Constraints for High-Throughput Rando…

200 papers

Modern wireless machine-to-machine-type communications aim to provide both ultra reliability and low latency, stringent requirements that appear to be mutually exclusive. From the noisy channel coding theorem, we know that reliable…

Information Theory · Computer Science 2020-12-04 Diego Barragán Guerrero , Minh Au , Ghyslain Gagnon , François Gagnon , Pascal Giard

In this paper, we investigate the effect of bursty traffic and random availability of caching helpers in a wireless caching system. More explicitly, we consider a general system consisting of a caching helper with its dedicated user in…

Information Theory · Computer Science 2017-09-04 Nikolaos Pappas , Zheng Chen , Ioannis Dimitriou

We consider a stochastic queueing system modelling the behaviour of a wireless network with nodes employing a discrete-time version of the standard decentralised medium access algorithm. The system is {\em unsaturated} -- each node receives…

Networking and Internet Architecture · Computer Science 2018-03-21 Seva Shneer , Alexander Stolyar

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

The prevalence of location tracking systems has resulted in large volumes of spatiotemporal data generated every day. Addressing reachability queries on such datasets is important for a wide range of applications (surveillance, public…

Databases · Computer Science 2021-05-19 Elena V. Strzheletska , Vassilis J. Tsotras

This PhD thesis considers the performance evaluation and enhancement of video communication over wireless channels. The system model considers hybrid automatic repeat request (HARQ) with Chase combining and turbo product codes (TPC). The…

Information Theory · Computer Science 2017-06-12 Husameldin Mukhtar

Control applications for cyber-physical systems must make reliably safe control decisions in the presence of continuous dynamics as well as stochastic uncertainty. Providing safety guarantees for such systems requires formal modeling and…

Formal Languages and Automata Theory · Computer Science 2026-04-28 Joanna Delicaris , Erika Ábrahám , Anne Remke

A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's…

Information Theory · Computer Science 2009-04-14 Tal Philosof , Ram Zamir , Uri Erez , Ashish Khisti

Accommodating Machine-to-Machine applications and their requirements is one of the challenges on the way from LTE towards 5G networks. The envisioned high density of devices, alongside with their sporadic and synchronized transmission…

Networking and Internet Architecture · Computer Science 2017-11-16 Mikhail Vilgelm , Sergio Rueda Liñares , Wolfgang Kellerer

In this paper, we study resource allocation for downlink orthogonal frequency division multiple access (OFDMA) systems with the objective to enable ultra-reliable low latency communication (URLLC). To meet the stringent delay requirements…

Information Theory · Computer Science 2019-01-18 Walid R. Ghanem , Vahid Jamali , Yan Sun , Robert Schober

Hybrid Automatic ReQuest (HARQ) protocol enables reliable communications in wireless systems. Usually, several parallel streams are sent in successive timeslots following a time-sharing approach. Recently, multi-layer HARQ has been proposed…

Information Theory · Computer Science 2020-04-03 Alla Khreis , Francesca Bassi , Philippe Ciblat , Pierre Duhamel

The continuously increasing degree of automation in many areas (e.g. manufacturing engineering, public infrastructure) lead to the construction of cyber-physical systems and cyber-physical networks. To both, time and energy are the most…

Networking and Internet Architecture · Computer Science 2019-05-29 Stefan Reif , Andreas Schmidt , Timo Hönig , Thorsten Herfet , Wolfgang Schröder-Preikschat

We give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulation for capacity problems. First, we give a new…

Data Structures and Algorithms · Computer Science 2012-01-20 Magnus M. Halldorsson , Pradipta Mitra

Wireless communication systems operate in complex time-varying environments. Therefore, selecting the optimal configuration parameters in these systems is a challenging problem. For wireless links, \emph{rate selection} is used to select…

Machine Learning · Computer Science 2020-04-21 Vidit Saxena , Joseph E. Gonzalez , Ion Stoica , Hugo Tullberg , Joakim Jaldén

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…

Information Theory · Computer Science 2011-12-05 Qiao Li , Rohit Negi

This paper proposes an adaptive transmission algorithm for slotted random access systems supporting the successive interference cancellation (SIC) at the access point (AP). When multiple users transmit packets simultaneously in a slot,…

Information Theory · Computer Science 2020-01-13 Sang-Woon Jeon , Hu Jin

In this paper, we consider the performance of a random-access time-slotted wireless network with a single access point and a mix of half- and full- duplex stations. Full-duplex transmissions involve data transmitted simultaneously in both…

Information Theory · Computer Science 2014-07-15 Vaneet Aggarwal , N. K. Shankaranarayanan

Electronic control systems used for quantum computing have become increasingly complex as multiple qubit technologies employ larger numbers of qubits with higher fidelity targets. Whereas the control systems for different technologies share…

This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a…

Information Theory · Computer Science 2017-05-15 Olga Galinina , Andrey Turlikov , Sergey Andreev , Yevgeni Koucheryavy

We consider a wireless communication system with a passive eavesdropper, in which a transmitter and legitimate receiver generate and use key bits to secure the transmission of their data. These bits are added to and used from a pool of…

Information Theory · Computer Science 2024-02-19 Karl-Ludwig Besser , Rafael F. Schaefer , H. Vincent Poor