Short: Freedom of speech: Thwarting jammers via a probabilistic approach

Roberto Di Pietro, Gabriele Oligeri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations


In this paper, we introduce a lightweight, fully distributed, and probabilistic protocol-Freedom of Speech (FoS)-that assures the delivery of a message to be broadcast (to N nodes) notwithstanding the presence of a powerful jammer. FoS enjoys several features when compared to competing schemes: it requires each node to store just N symmetric pairwise keys; node joining and node eviction require just minimal intervention on the already operating nodes; and, it is highly efficient in terms of required computation and message exchange. We provide a thorough analysis on the number of communications required by FoS to broadcast a message. We show that FoS is comparable to the state of the art solution under a realistic scenario, while it enjoys unique properties such as an optimal network reconfiguration and low overhead as for both computation and storage Extensive simulations support our findings.
Original languageEnglish (US)
Title of host publicationProceedings of the 8th ACM Conference on Security and Privacy in Wireless and Mobile Networks, WiSec 2015
PublisherAssociation for Computing Machinery,
ISBN (Print)9781450336239
StatePublished - Jun 22 2015
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-20


Dive into the research topics of 'Short: Freedom of speech: Thwarting jammers via a probabilistic approach'. Together they form a unique fingerprint.

Cite this