Formal analysis techniques for gossiping protocols

We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner. We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

We propose a framework to build formal developments for robot networks using the COQ proof assistant, to state and to prove formally various properties. We focus in this paper on impossibility proofs, as it is natural to take advantage of the COQ higher order calculus to reason about algorithms as abstract objects. We present in particular formal proofs of two impossibility results forconvergence of oblivious mobile robots if respectively more than one half and more than one third of the robots exhibit Byzantine failures, starting from the original theorems by Bouzid et al.. Thanks to our formalization, the corresponding COQ developments are quite compact. To our knowledge, these are the first certified (in the sense of formally proved) impossibility results for robot networks

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

We propose a framework to build formal developments for robot networks using the COQ proof assistant, to state and to prove formally various properties. We focus in this paper on impossibility proofs, as it is natural to take advantage of the COQ higher order calculus to reason about algorithms as abstract objects. We present in particular formal proofs of two impossibility results forconvergence of oblivious mobile robots if respectively more than one half and more than one third of the robots exhibit Byzantine failures, starting from the original theorems by Bouzid et al.. Thanks to our formalization, the corresponding COQ developments are quite compact. To our knowledge, these are the first certified (in the sense of formally proved) impossibility results for robot networks

From Sensing to Predictions and Database Technique: A Review of TV White Space Information Acquisition in Cognitive Radio Networks

Strategies to acquire white space information is the single most significant functionality in cognitive radio networks (CRNs) and as such, it has gone some evolution to enhance information accuracy. The evolution trends are spectrum sensing, prediction algorithm and recently, geo-location database technique. Previously, spectrum sensing was the main technique for detecting the presence/absence of a primary user (PU) signal in a given radio frequency (RF) spectrum. However, this expectation could not materialized as a result of numerous technical challenges ranging from hardware imperfections to RF signal impairments. To convey the evolutionary trends in the development of white space information, we present a survey of the contemporary advancements in PU detection with emphasis on the practical deployment of CRNs i.e. Television white space (TVWS) networks. It is found that geo-location database is the most reliable technique to acquire TVWS information although, it is financially driven. Finally, using financially driven database model, this study compared the data-rate and spectral efficiency of FCC and Ofcom TV channelization. It was discovered that Ofcom TV channelization outperforms FCC TV channelization as a result of having higher spectrum bandwidth. We proposed the adoption of an all-inclusive TVWS information acquisition model as the future research direction for TVWS information acquisition techniques

Open Platforms for Connected Vehicles

L'abstract è presente nell'allegato / the abstract is in the attachmen