In this paper we discuss size approximation protocols in a single hop radio network with an adversary that aims at changing the result of the protocol, controlling some stations in the network. As a first contribution we show that most of known size approximation procedures discussed in the literature can be attacked by the adversary with very limited resources (i.e significantly less than regular stations). This is an introduction for the main contribution of this paper - we present an efficient size approximation protocol immune against adversary able to control moderate number of stations. © 2012 Springer-Verlag.
CITATION STYLE
Klonowski, M., & Wolny, K. (2012). Immune size approximation algorithms in ad hoc radio network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7158 LNCS, pp. 33–48). https://doi.org/10.1007/978-3-642-28169-3_3
Mendeley helps you to discover research relevant for your work.