Advertisement

Leader Election Using Loneliness Detection

  • Mohsen Ghaffari
  • Nancy Lynch
  • Srikanth Sastry
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6950)

Abstract

We consider the problem of leader election (LE) in single-hop radio networks with synchronized time slots for transmitting and receiving messages. We assume that the actual number n of processes is unknown, while the size u of the ID space is known, but possibly much larger. We consider two types of collision detection: strong (SCD), whereby all processes detect collisions, and weak (WCD), whereby only non-transmitting processes detect collisions.

We introduce loneliness detection (LD) as a key subproblem for solving LE in WCD systems. LD informs all processes whether the system contains exactly one process or more than one. We show that LD captures the difference in power between SCD and WCD, by providing an implementation of SCD over WCD and LD. We present two algorithms that solve deterministic and probabilistic LD in WCD systems with time costs of \(\mathcal{O}(\log \frac{u}{n})\) and \(\mathcal{O}(\min( \log \frac{u}{n}, \frac{\log (1/\epsilon)}{n}))\), respectively, where ε is the error probability. We also provide matching lower bounds.

We present two algorithms that solve deterministic and probabilistic LE in SCD systems with time costs of \(\mathcal{O}(\log u)\) and \(\mathcal{O}(\min ( \log u, \log \log n + \log (\frac{1}{\epsilon})))\), respectively, where ε is the error probability. We provide matching lower bounds.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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), http://dx.doi.org/10.1007/11946441_26 CrossRefGoogle Scholar
  2. 2.
    Capetanakis, J.I.: Tree algorithms for packet broadcast channels. IEEE transactions on information theory 25(5), 505–515 (1979), http://dx.doi.org/10.1109/TIT.1979.1056093 MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks with unknown topology. Theoretical Computer Science 302, 337–364 (2003), http://dx.doi.org/10.1016/S0304-39750200851-4 MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Ghaffari, M., Lynch, N., Sastry, S.: Leader election using loneliness detection. Tech. Rep. MIT-CSAIL-TR-2011-xxx, CSAIL. MIT (2011)Google Scholar
  5. 5.
    Hayes, J.: An adaptive technique for local distribution. IEEE Transactions on Communication 26, 1178–1186 (1978), http://dx.doi.org/10.1109/TCOM.1978.1094204 CrossRefGoogle Scholar
  6. 6.
    Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18(1) (2005), http://dx.doi.org/10.1007/s00446-005-0216-7
  7. 7.
    Kowalski, D., Pelc, A.: Leader election in ad hoc radio networks: A keen ear helps. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 521–533. Springer, Heidelberg (2009), http://dx.doi.org/10.1007/978-3-642-02930-1_43 CrossRefGoogle Scholar
  8. 8.
    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), http://dx.doi.org/10.1007/3-540-40996-3_31 CrossRefGoogle Scholar
  9. 9.
    Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE transactions on parallel and distributed systems 13(5) (2002), http://dx.doi.org/10.1109/TPDS.2002.1003864
  10. 10.
    Schneider, J., Wattenhofer, R.: What is the use of collision detection (in wireless networks)? In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 133–147. Springer, Heidelberg (2010), http://dx.doi.org/10.1007/978-3-642-15763-9_14 CrossRefGoogle Scholar
  11. 11.
    Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM Journal of Computing 15, 468–477 (1986), http://dx.doi.org/10.1137/0215032 MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Mohsen Ghaffari
    • 1
  • Nancy Lynch
    • 1
  • Srikanth Sastry
    • 1
  1. 1.CSAIL, MITCambridgeUSA

Personalised recommendations