English
Related papers

Related papers: From Weakly-terminating Binary Agreement and Relia…

200 papers

In this paper we consider an un-cooperative spectrum sharing scenario, wherein a radar system is to be overlaid to a pre-existing wireless communication system. Given the order of magnitude of the transmitted powers in play, we focus on the…

Systems and Control · Electrical Eng. & Systems 2023-04-06 Yinchuan Li , Le Zheng , Marco Lops , Xiaodong Wang

This paper studies the Byzantine Agreement problem where the nodes have access to a predictor that flags nodes for suspicion of faulty (Byzantine) behavior. We focus on algorithmic resilience -- the maximum number of faulty nodes an…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-20 Julien Dallot , Darya Melnyk , Tijana Milentijevic , Stefan Schmid , Patrik Welters

Several wireless networking problems are often posed as 0-1 mixed optimization problems, which involve binary variables (e.g., selection of access points, channels, and tasks) and continuous variables (e.g., allocation of bandwidth, power,…

Networking and Internet Architecture · Computer Science 2025-10-08 Kairong Ma , Yao Sun , Shuheng Hua , Muhammad Ali Imran , Walid Saad

Recent advances in quality adaptation algorithms leave adaptive bitrate (ABR) streaming architectures at a crossroads: When determining the sustainable video quality one may either rely on the information gathered at the client vantage…

Multimedia · Computer Science 2019-01-18 Bastian Alt , Trevor Ballard , Ralf Steinmetz , Heinz Koeppl , Amr Rizk

Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree on a message from a designated sender, even if some processes (including the sender) are Byzantine. Existing broadcast protocols for this setting…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-21 Rachid Guerraoui , Petr Kuznetsov , Matteo Monti , Matej Pavlovic , Dragos-Adrian Seredinschi , Yann Vonlanthen

Traditional techniques for handling Byzantine failures are expensive: digital signatures are too costly, while using $3f{+}1$ replicas is uneconomical ($f$ denotes the maximum number of Byzantine processes). We seek algorithms that reduce…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-04 M. K. Aguilera , N. Ben-David , R. Guerraoui , D. Papuc , A. Xygkis , I. Zablotchi

The strong Byzantine agreement (SBA) problem is defined among n processes, out of which t < n can be faulty and behave arbitrarily. SBA allows correct (non-faulty) processes to agree on a common value. Moreover, if all correct processes…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-08-08 Pierre Civit , Seth Gilbert , Rachid Guerraoui , Jovan Komatovic , Manuel Vidigueira

The adversarial wiretap channel (AWTC) model is a secure communication model in which adversary can directly read and write the transmitted bits in legitimate communication with fixed fractions. In this paper we propose a secure polar…

Information Theory · Computer Science 2021-01-01 Yizhi Zhao

We study downlink beamforming in a single-cell network with a multi-antenna base station serving cache-enabled users. Assuming a library of files with a common rate, we formulate the minimum transmit power with proactive caching and coded…

Information Theory · Computer Science 2020-07-24 Junlin Zhao , Mohammad Mohammadi Amiri , Deniz Gündüz

The routing and wavelength assignment with protection is an important problem in telecommunications. Given an optical network and incoming connection requests, a commonly studied variant of the problem aims to grant maximum number of…

Optimization and Control · Mathematics 2021-06-09 Oylum Şeker , Merve Bodur , Hamed Pouya

Efficient asynchronous Byzantine agreement (BA) protocols were mostly studied with private setups, e.g., pre-setup threshold cryptosystem. Challenges remain to reduce the large communication in the absence of such setups. Recently, Abraham…

Cryptography and Security · Computer Science 2022-04-28 Yingzi Gao , Yuan Lu , Zhenliang Lu , Qiang Tang , Jing Xu , Zhenfeng Zhang

Emerging communication networks are envisioned to support massive wireless connectivity of heterogeneous devices with sporadic traffic and diverse requirements in terms of latency, reliability, and bandwidth. Providing multiple access to an…

Information Theory · Computer Science 2023-04-19 Sajad Daei , Marios Kountouris

Atomic norm minimization is a convex optimization framework to recover point sources from a subset of their low-pass observations, or equivalently the underlying frequencies of a spectrally-sparse signal. When the amplitudes of the sources…

Information Theory · Computer Science 2021-02-24 Maxime Ferreira Da Costa , Yuejie Chi

A weakly constrained code is a collection of finite-length strings over a finite alphabet in which certain substrings or patterns occur according to some prescribed frequencies. Buzaglo and Siegel (ITW 2017) gave a construction of weakly…

Information Theory · Computer Science 2024-08-15 Prachi Mishra , Navin Kashyap

Unmanned Aerial Vehicles (UAVs), a.k.a. drones, are increasingly used for different tasks. With more drones in the sky, the risk of accidents rises, sparkling the need for conflict management solutions. Aircraft use a system called…

Systems and Control · Electrical Eng. & Systems 2020-07-08 Franco Minucci , Evgenii Vinogradov , Sofie Pollin

Assumption-based Argumentation (ABA) is a well-established form of structured argumentation. ABA frameworks with an underlying atomic language are widely studied, but their applicability is limited by a representational restriction to…

Artificial Intelligence · Computer Science 2026-04-14 Emanuele De Angelis , Fabio Fioravanti , Maria Chiara Meo , Alberto Pettorossi , Maurizio Proietti , Francesca Toni

Simulated annealing (SA) method has had significant recent success in designing distributed control algorithms for wireless networks. These SA based techniques formed the basis of new CSMA algorithms and gave rise to the development of…

Optimization and Control · Mathematics 2018-09-11 Jaewook Kwak , Ness B. Shroff

A new binary (bit-level) lossless compression catalyst method based on a modular arithmetic, called Binary Allocation via Modular Arithmetic (BAMA), has been introduced in this paper. In other words, BAMA is for storage and transmission of…

Information Theory · Computer Science 2014-08-18 Mario Mastriani

Wireless Body Sensor Network (WBSN) is a developing technology with constraints in energy consumption, coverage radius, communication reliability. Also, communications between nodes contain very sensitive personal information in which…

Cryptography and Security · Computer Science 2020-10-20 Behrooz Khadem , Amin Masoumi , M. S. Farash

Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-11-24 Rachid Guerraoui , Jovan Komatovic , Petr Kuznetsov , Yvonne-Anne Pignolet , Dragos-Adrian Seredinschi , Andrei Tonkikh
‹ Prev 1 4 5 6 7 8 10 Next ›