Towards Fair Leader Election in Wireless Networks

  • Zbigniew Gołȩbiewski
  • Marek Klonowski
  • Michał Koza
  • Mirosław Kutyłowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5793)


In this paper we consider a leader election problem in ad-hoc single hop radio sensor network with an adversary. The aim of the adversary is to be chosen as a leader. In many scenarios it can be a staring point for performing other attacks and taking control over the whole network.

In our paper we show that in typical and well-known algorithms it is not possible to avoid this threat, i.e. the adversary can always use such strategy, that the node under its control becomes a leader with high probability. This attack is efficient even if the adversary controls very small number of nodes. Moreover, we show that it is not even possible in practice to detect such malicious behaviour.

Our second contribution is a new leader election algorithm that provides, to some extent, immunity against this types of attack. We consider several realistic network models and we design appropriate methods for each of them. We also show that in some scenarios it is not possible to prevent the adversary from becoming the leader.


Collision Detection Leader Election Multiple Identity Leader Candidate Sybil Attack 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bordim, J.L., Ito, Y., Nakano, K.: Randomized leader election protocols in noisy radio networks with a single transceiver. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol. 4330, pp. 246–256. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Chaudhuri, K., Mishra, N.: When random sampling preserves privacy. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 198–213. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.C.: Secure communication over radio channels. In: Bazzi, R.A., Patt-Shamir, B. (eds.) PODC, pp. 105–114. ACM, New York (2008)CrossRefGoogle Scholar
  4. 4.
    Gilbert, S., Guerraoui, R., Kowalski, D., Newport, C.: Interference-Resilient Information Exchange. In: IEEE InfoCom 2009 (2009)Google Scholar
  5. 5.
    Gilbert, S., Guerraoui, R., Newport, C.C.: Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 215–229. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Hayashi, T., Nakano, K., Olariu, S.: Randomized initialization protocols for packet radio networks. In: IPPS/SPDP, p. 544. IEEE Computer Society, Los Alamitos (1999)Google Scholar
  7. 7.
    Janson, S., Szpankowski, W.: Analysis of an asymmetric leader election algorithm. Electr. J. Comb. 4(1) (1997)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Kutyłowski, M., Rutkowski, W.: Secure initialization in single-hop radio networks. In: Castelluccia, C., Hartenstein, H., Paar, C., Westhoff, D. (eds.) ESAS 2004. LNCS, vol. 3313, pp. 31–41. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    MacKenzie, A., Wicker, S.B.: Stability of multipacket slotted aloha with selfish users and perfect information. In: INFOCOM (2003)Google Scholar
  12. 12.
    Metcalfe, R.M., Boggs, D.R.: Ethernet: distributed packet switching for local computer networks. Commun. ACM 19(7), 395–404 (1976)CrossRefGoogle Scholar
  13. 13.
    Nakano, K., Olariu, S.: Randomized o (log log n)-round leader election protocols in packet radio networks. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 209–218. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  14. 14.
    Nakano, K., Olariu, S.: Randomized leader election protocols in radio networks with no collision detection. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 362–373. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  15. 15.
    Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput. 15(2), 468–477 (1986)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Zbigniew Gołȩbiewski
    • 1
    • 2
  • Marek Klonowski
    • 1
  • Michał Koza
    • 1
  • Mirosław Kutyłowski
    • 1
  1. 1.Institute of Mathematics and Computer ScienceWrocław University of TechnologyPoland
  2. 2.Institute of Computer ScienceWrocław UniversityPoland

Personalised recommendations