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

Roberto Di Pietro; Gabriele Oligeri

doi:10.1145/2766498.2766515

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

Roberto Di Pietro, Gabriele Oligeri

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

11 Scopus citations

Abstract

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 language	English (US)
Title of host publication	Proceedings of the 8th ACM Conference on Security and Privacy in Wireless and Mobile Networks, WiSec 2015
Publisher	Association for Computing Machinery, [email protected]
ISBN (Print)	9781450336239
DOIs	https://doi.org/10.1145/2766498.2766515
State	Published - Jun 22 2015
Externally published	Yes

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1145/2766498.2766515

Cite this

@inproceedings{a502ee959ada45d9a5ef03238409686b,

title = "Short: Freedom of speech: Thwarting jammers via a probabilistic approach",

abstract = "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.",

author = "{Di Pietro}, Roberto and Gabriele Oligeri",

note = "Generated from Scopus record by KAUST IRTS on 2023-09-20",

year = "2015",

month = jun,

day = "22",

doi = "10.1145/2766498.2766515",

language = "English (US)",

isbn = "9781450336239",

booktitle = "Proceedings of the 8th ACM Conference on Security and Privacy in Wireless and Mobile Networks, WiSec 2015",

publisher = "Association for Computing Machinery, [email protected]",

}

Short: Freedom of speech: Thwarting jammers via a probabilistic approach. / Di Pietro, Roberto; Oligeri, Gabriele.
Proceedings of the 8th ACM Conference on Security and Privacy in Wireless and Mobile Networks, WiSec 2015. Association for Computing Machinery, [email protected], 2015.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Di Pietro, Roberto

AU - Oligeri, Gabriele

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

PY - 2015/6/22

Y1 - 2015/6/22

N2 - 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.

AB - 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.

UR - https://dl.acm.org/doi/10.1145/2766498.2766515

UR - http://www.scopus.com/inward/record.url?scp=84962034553&partnerID=8YFLogxK

U2 - 10.1145/2766498.2766515

DO - 10.1145/2766498.2766515

M3 - Conference contribution

SN - 9781450336239

BT - Proceedings of the 8th ACM Conference on Security and Privacy in Wireless and Mobile Networks, WiSec 2015

PB - Association for Computing Machinery, [email protected]

ER -

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

Abstract

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this