Related papers: Successive Local and Successive Global Omniscience
We study the problem of constructing a deterministic polynomial time algorithm that achieves omniscience, in a rate-optimal manner, among a set of users that are interested in a common file but each has only partial knowledge about it as…
We consider the problem of a social group of users trying to obtain a "universe" of files, first from a server and then via exchange amongst themselves. We consider the selfish file-exchange paradigm of give-and-take, whereby two users can…
We study how to spread $k$ tokens of information to every node on an $n$-node dynamic network, the edges of which are changing at each round. This basic {\em gossip problem} can be completed in $O(n + k)$ rounds in any static network, and…
The increasing number of satellite deployments, both in the low and geostationary Earth orbit exacerbates the already ongoing scarcity of wireless resources when targeting ubiquitous connectivity. For the aim of supporting a massive number…
Post-training language models (LMs) with reinforcement learning (RL) can enhance their complex reasoning capabilities without supervised fine-tuning, as demonstrated by DeepSeek-R1-Zero. However, effectively utilizing RL for LMs requires…
We consider the problem of Spectrum Sensing in Cognitive Radio Systems. We have developed a distributed algorithm that the Secondary users can run to sense the channel cooperatively. It is based on sequential detection algorithms which…
Immersive virtual reality (VR) applications impose stringent requirements on latency, energy efficiency, and computational resources, particularly in multi-user interactive scenarios. To address these challenges, we introduce the concept of…
Networked low Earth orbit (LEO) satellite constellations enabled by inter-satellite links offer a promising path toward ubiquitous broadband non-terrestrial services. However, fast orbital motion induces frequent scheduling updates and…
This paper proposes prediction-and-sensing based spectrum sharing, a new spectrum-sharing model for cognitive radio networks, with a time structure for each resource block divided into a spectrum prediction-and-sensing phase and a data…
Semantic and goal-oriented (SGO) communication is an emerging technology that only transmits significant information for a given task. Semantic communication encounters many challenges, such as computational complexity at end users,…
We study local aggregation and graph analysis in distributed environments using the message passing model. We provide a flexible framework, where each of the nodes in a set $S$--which is a subset of all nodes in the network--can perform a…
Clustering consists of grouping together samples giving their similar properties. The problem of modeling simultaneously groups of samples and features is known as Co-Clustering. This paper introduces ROCCO - a Robust Continuous…
This paper considers the collaborative graph exploration problem in GPS-denied environments, where a group of robots are required to cover a graph environment while maintaining reliable pose estimations in collaborative simultaneous…
In this work, we formulate and study a data dissemination problem, which can be viewed as a generalization of the index coding problem and of the data exchange problem to networks with an arbitrary topology. We define $r$-solvable networks,…
We investigate inter-satellite cooperative transmission in a multiple low-Earth orbit (LEO) satellite communication system to enhance spectral efficiency. Specifically, we design multiple-input multipleoutput (MIMO) precoding at LEO…
We study the problem of tracking multiple moving targets using a team of mobile robots. Each robot has a set of motion primitives to choose from in order to collectively maximize the number of targets tracked or the total quality of…
Communities are subsets of a network that are densely connected inside and share only few connections to the rest of the network. The aim of this research is the development and evaluation of an efficient algorithm for detection of…
We investigate opportunistic cooperation between unlicensed secondary users and legacy primary users in a cognitive radio network. Specifically, we consider a model of a cognitive network where a secondary user can cooperatively transmit…
Population protocols are a fundamental model in distributed computing, where many nodes with bounded memory and computational power have random pairwise interactions over time. This model has been studied in a rich body of literature aiming…
In this paper, a round-table group optimization (RTGO) algorithm is presented. RTGO is a simple metaheuristic framework using the insights of research on group creativity. In a cooperative group, the agents work in iterative sessions to…