Publications associées à General Packet Radio Service

Arvin: Greybox Fuzzing Using Approximate Dynamic CFG Analysis

Fuzzing has emerged as the most broadly used testing technique to discover bugs. Effective fuzzers rely on coverage to prioritize inputs that exercise new program areas. Edge-based code coverage of the Program Under Test (PUT) is the most commonly used cov ...

ASSOC COMPUTING MACHINERY2023

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Yunus Inan

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

EPFL2023

A Maximum-Likelihood-Based Two-User Receiver for LoRa Chirp Spread-Spectrum Modulation

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Orion Afisiadis, Joachim Tobias Tapparel, Mathieu Pierre Xhonneux

Long Range (LoRa) is an emerging low-power wide-area network technology offering long-range wireless connectivity to Internet of Things (IoT) devices. For energy efficiency reasons, LoRa end nodes implement a nonslotted ALOHA multiple access scheme to tran ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Fast Sequence Repetition Node-Based Successive Cancellation List Decoding for Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Andreas Toftegaard Kristensen, Yifei Shen, Yuqing Ren, Chuan Zhang

Compared with the bit-wise successive cancellation list (SCL) decoding of polar codes, the node-based Fast SCL decoding significantly reduces the decoding latency by identifying special constituent codes and decoding these in parallel. To further reduce th ...

IEEE2022

Enhancing the Reliability of Dense LoRaWAN Networks With Multi-User Receivers

Andreas Peter Burg, Joachim Tobias Tapparel, Mathieu Pierre Xhonneux

LoRaWAN is a low-power wireless technology that provides long-range connectivity to battery-powered Internet of Things (IoT) devices. To minimize the energy consumption of the IoT nodes, LoRaWAN networks use for the uplink a pure non-slotted ALOHA multiple ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Improved Delay Bound for a Service Curve Element with Known Transmission Rate

Jean-Yves Le Boudec, Eleni Stai, Ehsan Mohammadpour

Network calculus is often used to prove delay bounds in deterministic networks, using arrival and service curves. We consider a FIFO system that offers a rate-latency service curve and where packet transmission occurs at line rate without pre-emption. The ...

2019

A Theory of Traffic Regulators for Deterministic Networks With Application to Interleaved Regulators

Jean-Yves Le Boudec

We introduce Pi-regulation, a new definition of traffic regulation which extends both the arrival curves of network calculus and Chang's max-plus g-regulation, and also includes new types of regulation, such as packet rate limitations. We provide a new exa ...

2018

Compute-forward multiple access (CFMA) with nested LDPC codes

Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu, Erixhen Sula, Adriano Pastore

Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages ...

2017

CFMA (Compute-Forward Multiple Access) and its Applications in Network Information Theory

Jingge Zhu

While both fundamental limits and system implementations are well understood for the point-to-point communication system, much less is developed for general communication networks. This thesis contributes towards the design and analysis of advanced coding ...

EPFL2016

Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages

Michael Christoph Gastpar, Jingge Zhu

A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of codewords, our scheme im ...

Institute of Electrical and Electronics Engineers2015

Random Access With Physical-Layer Network Coding

Michael Christoph Gastpar, Jasper Goseling

We consider a physical-layer network coding strategy for the random-access channel, based on compute-and-forward. When packets collide, it is possible to reliably recover a linear combination of the packets at the receiver. Over many rounds of transmission ...

Institute of Electrical and Electronics Engineers2015

Distributed Rate Allocation in Inter-Session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user ...

Institute of Electrical and Electronics Engineers2014

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

EPFL2013

Physical-layer Network Coding on the Random-access Channel

Michael Christoph Gastpar, Jasper Goseling

We consider a physical-layer network coding strat- egy for the random-access channel, based on compute-and- forward. When packets collide, it is possible to reliably recover a linear combination of the packets at the receiver. Over many rounds of transmiss ...

2013

Feedback-based coding algorithms for broadcast erasure channels with degraded message sets

Christina Fragouli, Shirin Saeedi Bidokhti

We consider single-hop broadcast packet erasure channels (BPEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual-queue-based algorithms in [1], which were ...

2012

Feedback-based Coding Algorithms for Braodcast Erasure Channels with Degraded Message Sets

Christina Fragouli

We consider single-hop broadcast packet erasure channels (BPEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual-queue-based algorithms in [1], which were ...

2012

Distributed Rate Allocation With Intersession Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this paper, we propose a distributed rate allocation algorithm for delay minimal data delivery in overlay networks where multiple sources compete simultaneously for the available network resources. In order to efficiently utilize the network resources, ...

IEEE2012

Prioritized Distributed Video Delivery with Randomized Network Coding

Pascal Frossard, Jakov Cakareski, Nikolaos Thomos

We address the problem of prioritized video streaming over lossy overlay networks. We propose to exploit network path diversity via a novel Randomized Network Coding (RNC) approach that provides unequal error protection (UEP) to the packets conveying the v ...

2011

Scalable Video Dissemination with Prioritized Network Coding

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

In this paper, we present a pull-based dissemination protocol for efficient distribution of scalable video content in overlay peer-to-peer networks with mesh structures. The proposed protocol employs prioritized network coding, where the network coded pack ...

2011

Channel State Feedback Over the MIMO-MAC

Krishna Kumar

In order to exploit the full multiplexing gain of multi-antenna multi-user downlink schemes, accurate channel state information at the transmitter (i.e., at the base station) is required. We consider the design of a closed-loop channel state information fe ...

2011