Freedom of Speech: Thwarting Jammers via a Probabilistic Approach

In this paper, we introduce a probabilistic protocol-Freedom of Speech (FoS)- that assures the delivery of the message to be broadcast (to n nodes) in 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 for a message to be broadcast. We show that FoS is comparable to the state of the art solution under a realistic scenario, while providing unique properties such as an optimal network reconfiguration and low overhead (just one seed per node) as for both computation and storage. Extensive simulations support our findings.