Nothing Special   »   [go: up one dir, main page]

Skip to main content

Randomized Leader Election Protocols in Noisy Radio Networks with a Single Transceiver

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4330))

Abstract

In this work, we present leader election protocols for single-hop, single-channel noisy radio networks that do not have collision detection (CD) capabilities. In most leader election protocols presented so far, it is assumed that every station has the ability to transmit and monitor the channel at the same time, it requires every station to be equipped with two transceivers. This assumption, however, is unrealistic for most mobile stations due to constraints in cost, size, and energy dissipation. Our main contribution is to show that it is possible to elect a leader in an anonymous radio network where each station is equipped with a single transceiver. We first present a leader election protocol for the case the number n of stations is known beforehand. The protocol runs in O(logf) time slots with probability at least \(1-{1\over f}\) for any f> 1. We then present a leader election protocol for the case where n is not known beforehand but an upper bound u of n is known. This protocol runs in O(logflogu) time slots with probability at least \(1-{1\over f}\) for any f> 1. We also prove that these protocols are optimal. More precisely, we show that any leader election protocol elect a leader with probability at least \(1-{1\over f}\) must run in Ω(logf) time slots if n is known. Also, we proved that any leader election protocol elect a leader with probability at least \(1-{1\over f}\) must run in Ω(logflogu) time slots if an upper bound u of n is known.

Work supported in part by JSPS Grant-in-Aid for Scientific Research.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Baker, D.J.: Data/voice communication over a multihop, mobile, high frequency network. In: Proc. MILCOM 1997, Monterey, CA, pp. 339–343 (1997)

    Google Scholar 

  2. 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)

    Article  MATH  Google Scholar 

  3. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and Systems Sciences 45, 104–126 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bertzekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)

    Google Scholar 

  5. Black, U.: Mobile and Wireless Networks. Prentice-Hall, Upper Saddle River (1996)

    Google Scholar 

  6. Bordim, J.L., Ito, Y., Nakano, K.: An Energy Efficient Leader Election Protocol for Radio Network with a Single Transceiver. IEICE Trans. on Fundamentals E89-A(5), 1355–1361 (2006)

    Article  Google Scholar 

  7. Chlamtac, I., Petrioli, C., Redi, J.: Energy-conserving access protocols for IDNETs, Technical Report 96-006, Boston University (March 1996)

    Google Scholar 

  8. Chockalingam, A., Zorzi, M.: Energy efficiency of media access protocols for mobile data networks. IEEE Transactions on Communications COM-46, 1418–1421 (1998)

    Article  Google Scholar 

  9. Davies, B.H., Davies, T.R.: Applications of packet switching technology to combat net radio. Proceedings of the IEEE 75, 43–55 (1987)

    Article  Google Scholar 

  10. Duchamp, D., Feiner, S.K., Maguire, G.Q.: Software technology for wireless mobile computing. IEEE Network Magazine, 12–18 (November 1991)

    Google Scholar 

  11. Feher, K.: Wireless Digital Communications. Prentice-Hall, Upper Saddle River (1995)

    Google Scholar 

  12. Fifer, W.C., Bruno, F.J.: Low cost packet radio. Proceedings of the IEEE 75, 33–42 (1987)

    Article  Google Scholar 

  13. Garg, V.K., Wilkes, J.E.: Wireless and Personal Communication Systems. Prentice-Hall, Englewood Cliffs (1996)

    Google Scholar 

  14. Gerla, M., Tsai, T.-C.: Multicluster, mobile, multimedia radio network. Wireless Networks 1, 255–265 (1995)

    Article  Google Scholar 

  15. Harris, E.P., Warren, K.W.: Low power technologies: a system perspective. In: Proc. 3-rd International Workshop on Multimedia Communications, Princeton (1996)

    Google Scholar 

  16. Hayashi, T., Nakano, K., Olariu, S.: Randomized initialization protocols for Packet Radio Networks. In: Proc. 13th International Parallel Processing Symposium, pp. 544–548 (1999)

    Google Scholar 

  17. Lin, C.R., Gerla, M.: Adaptive clustering in mobile wireless networks. IEEE Journal on Selected Areas in Communications 16, 1265–1275 (1997)

    Article  Google Scholar 

  18. Mangione-Smith, W., Ghang, P.S.: A low power medium access control protocol for portable multimedia devices. In: Proc. Third International Workshop on Mobile Multimedia Communications, Princeton, NJ (September 1996)

    Google Scholar 

  19. Metcalfe, R.M., Boggs, D.R.: Ethernet: distributed packet switching for local computer networks. Communications of the ACM 19, 395–404 (1976)

    Article  Google Scholar 

  20. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  21. Nakano, K., Olariu, S.: Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks. In: Chwa, K.-Y., H. Ibarra, O. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 209–218. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  22. Nakano, K., Olariu, S.: Randomized Leader Election Protocols for Ad-hoc Networks. In: Proc. of 7th International Colloquium on Structural Information and Communication Complexity (Scirocco), pp. 253–267 (2000)

    Google Scholar 

  23. Nakano, K., Olariu, S.: Randomized Leader Election Protocols in Radio Networks with no Collision Detection. In: Proc. of International Symposium on Algorithms and Computation, pp. 362–373 (2000)

    Google Scholar 

  24. Toh, C.-K.: Ad Hoc Mobile Wireless Networks: Protocols and Systems. Prentice-Hall, Englewood Cliffs (2002)

    Google Scholar 

  25. Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM Journal on Computing 15, 468–477 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bordim, J.L., Ito, Y., Nakano, K. (2006). 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) Parallel and Distributed Processing and Applications. ISPA 2006. Lecture Notes in Computer Science, vol 4330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11946441_26

Download citation

  • DOI: https://doi.org/10.1007/11946441_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68067-3

  • Online ISBN: 978-3-540-68070-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics