English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Multi-agent systems often communicate over low-power shared wireless networksin unlicensed spectrum, prone to denial-of-service attacks. We consider thefollowing scenario: multiple pairs of agents communicating strategically overshared communication networks in the presence of a jammer who may launch adenial-of-service. We cast this problem as a game between a coordinator whooptimizes the transmission and estimation policies jointly and a jammer whooptimizes its probability of performing an attack. We consider two cases:point-to-point channels and large-scale networks with a countably infinitenumber of sensor-receiver pairs. When the jammer proactively attacks thechannel, the game is nonconvex from the coordinator's perspective. However,despite the lack of convexity, we construct a saddle point equilibrium solutionfor any multi-variate Gaussian distribution for the observations. When thejammer is reactive, we obtain an algorithm based on sequential convexoptimization, which converges swiftly to first-order Nash-equilibria.Interestingly, blocking the channel is often optimal when the jammer isreactive, even when it is idle, to create ambiguity at the receiver.

Robust one-shot estimation over shared networks in the presence of denial-of-service attacks