Abstract
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.
This paper was supported by funds for science in years 2008-2011 from Polish Ministry of Science and Higher Education, grant No. N N206 257335. Later, it has been also supported by Foundation for Polish Science within the MISTRZ Programme.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Yehuda, R., Goldreich, O., Itai, A.: Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. Distributed Computing 5, 67–71 (1991)
Bordim, J.L., Cui, J.T., Ishii, N., Nakano, K.: Doubly-logarithmic energy-efficient initialization protocols for single-hop radio networks. In: IPDPS. IEEE Computer Society (2002)
Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493–507 (1952)
Dahmen, E., Krauß, C.: Short Hash-Based Signatures for Wireless Sensor Networks. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 463–476. Springer, Heidelberg (2009)
Flajolet, P., Sedgewick, R.: Mellin transforms and asymptotics: Finite differences and rice’s integrals. Theoretical Computer Science 144, 101–124 (1995)
Greenberg, A.G., Flajolet, P., Ladner, R.E.: Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. J. ACM 34(2), 289–325 (1987)
Hofri, M.: A feedback-less distributed broadcast algorithm for multihop radio networks with time-varying structure. In: Iazeolla, G., Courtois, P.-J., Boxma, O.J. (eds.) Computer Performance and Reliability, pp. 353–368. North-Holland (1987)
Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Efficient algorithms for leader election in radio networks. In: PODC, pp. 51–57 (2002)
Jurdziński, T., Kutyłowski, M., Zatopianski, J.: Energy-Efficient Size Approximation of Radio Networks with No Collision Detection. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 279–289. Springer, Heidelberg (2002)
Kabarowski, J., Kutyłowski, M., Rutkowski, W.: Adversary Immune Size Approximation of Single-Hop Radio Networks. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 148–158. Springer, Heidelberg (2006)
Kutyłowski, J., Zagórski, F.: Reliable Broadcasting Without Collision Detection. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 389–398. Springer, Heidelberg (2006)
Kutyłowski, M., Rutkowski, W.: Adversary Immune Leader Election in ad hoc Radio Networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 397–408. Springer, Heidelberg (2003)
Merkle, R.C.: A Digital Signature Based on a Conventional Encryption Function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369–378. Springer, Heidelberg (1988)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)
Szpankowski, W., Rego, V.: Yet another application of a binomial recurrence. order statistics 43, 401–410 (1990)
Weisstein, E.W.: Weisstein, eric w. ”exponential integral.” from mathworld–a wolfram web resource, http://mathworld.wolfram.com/exponentialintegral.html
Weisstein, E.W.: Weisstein, eric w. ”shi.” from mathworld–a wolfram web resource, http://mathworld.wolfram.com/shi.html
Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput. 15(2), 468–477 (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klonowski, M., Wolny, K. (2012). Immune Size Approximation Algorithms in Ad Hoc Radio Network. In: Picco, G.P., Heinzelman, W. (eds) Wireless Sensor Networks. EWSN 2012. Lecture Notes in Computer Science, vol 7158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28169-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-28169-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28168-6
Online ISBN: 978-3-642-28169-3
eBook Packages: Computer ScienceComputer Science (R0)