Papers for

wireless sensor network designers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Collision-free robot movement methods improve distance efficiency on grids and graphs

Collision-free Movement on Grids and Beyond

Abstract: We study collision-free movement problems on graphs, where the task is to coordinate a set of robots so that they reach a target formation satisfying a desired property while minimizing the total travel distance. This framework extends two classical models: (a) minimizing movement [Demaine et al., TALG '09, '14], which does not enforce collision avoidance, and (b) coordinated motion planning or multi-agent path finding [Eiben et al., SoCG '23, Deligkas et al., ICALP '24, among many others], where each robot is assigned an explicit target position. We focus on the setting where the target formation of the robots should be connected. We analyze the parameterized complexity of the problem with respect to the number of (main) robots and the total travel length on grid graphs and two natural generalizations thereof: planar graphs and unit disk graphs.

Fri 25 SeptMultiagent SystemsData Structures and Algorithms
The gist
This work looks at how to move multiple robots around on networks like grids without them crashing into each other, while trying to keep their total travel distance as short as possible. The authors focus on situations where robots need to end up connected in a group rather than assigned specific spots. They study how complex it is to find optimal movements under these rules on different kinds of networks like grid layouts, planar maps, and overlapping areas. Their analysis extends prior work that either ignored collisions or assigned fixed targets to each robot. This helps better understand the limits and possibilities of coordinating robot movements safely and efficiently.
Open → 2609.31099v1

New method reduces signal distortion in federated learning transmissions

AirGC-CD: Gaussian-Circulant Precoding for Exactly Debiasable PAPR Reduction in Over-the-Air Federated Learning

Abstract: Over-the-air federated learning lets edge devices transmit their local updates simultaneously, reducing the communication overhead. The resulting waveform, however, has a peak-to-average power ratio (PAPR) that grows with the model dimension, and keeping the amplifier in its linear range leaves two remedies: clipping the peaks or backing off the transmit power. Neither remedy is without cost: i) the clipping distortion appears at the receiver as a bias that cannot be removed, and ii) back-off keeps the signal intact but degrades the average signal-to-noise ratio (SNR). Independent of this trade-off, the transmission remains uncompressed, spending one channel use per model parameter, which keeps large-model training out of reach. To address these challenges, we propose AirGC-CD, an over-the-air scheme that precodes each local update with a partial Gaussian circulant matrix before clipping. In AirGC-CD, the precoder's output is exactly Gaussian regardless of the update's sparsity, so the clipping function is designed for a known distribution instead of inheriting it from the data. This enables the clipping to be inverted on average by a single scalar Bussgang gain in closed form, and we prove that the resulting aggregate is exactly unbiased, with clipping adding only variance. The clipping ratio is then the only free parameter left, trading the variance of the clipping against the SNR loss from back-off, and we derive its near-optimum in closed form. Since the precoder is linear, it also acts as a compressor, reducing the transmission from the model dimension d to the sketch dimension m at a cost of only O(dlog d) via two fast Fourier transforms, whereas a Gaussian sketch costs O(md). Experiments on five image datasets show that AirGC-CD outperforms baseline over-the-air FL schemes in most settings, particularly at low SNR, while using fewer channel uses per round.

Sat 19 SeptMachine Learning
The gist
Sending updates from many devices at once helps speed up learning but creates signals with big peaks that can cause problems. The authors came up with a way to change the messages so these peaks are more predictable and easier to fix without losing accuracy. Their method also compresses the data, so fewer transmissions are needed overall. Tests on different images show this approach works better than older ways, especially when signal quality is low.
Open → 2609.23084v1