Advertisement

Leader Election Algorithms for Multi-channel Wireless Networks

  • Tarun Bansal
  • Neeraj Mittal
  • S. Venkatesan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5258)

Abstract

We study the leader election problem in single-hop multi-channel wireless networks with single-antenna radio nodes. The objective is to elect leaders for all channels on which one or more nodes in the network can operate. We assume that nodes do not have collision detection capability. In this paper, we propose three algorithms for leader election: one deterministic and two randomized. The deterministic algorithm executes for at most 2N + M ⌈logM ⌉ time slots and guarantees leader election for all the channels, where M is the size of the universal channel set available to the nodes and N is the size of the label space used to assign unique labels to the nodes. The randomized algorithms guarantee that a leader is elected for all the channels with probability at least 1 − 1/f within \(O ( M \log^{2}(n_{\max}) + M\log^{2} (Mf) )\) and O(M log(n max ) log(Mf)) time slots, respectively, where n max is the maximum number of nodes operating on any channel in the network. To the best of our knowledge, this is the first work on leader election in single-antenna multi-channel radio networks.

Keywords

wireless networks cognitive radios multiple channels leader election 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I.F., Lee, W.Y., Vuran, M.C., Mohanty, S.: Next generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Computer Networks 50(13), 2127–2159 (2006)CrossRefzbMATHGoogle Scholar
  2. 2.
    Mitola, J.: Cognitive radio: An Integrated Agent Architecture for Software Defined Radio. PhD thesis, Royal Institute of Technology (2000)Google Scholar
  3. 3.
    Perkins, C.E., Belding-Royer, E.M.: Ad-hoc on-demand distance vector routing. In: Proceedings of the 2nd Workshop on Mobile Computing Systems and Applications (WMCSA), pp. 90–100. IEEE Computer Society, Los Alamitos (1999)CrossRefGoogle Scholar
  4. 4.
    DeCleene, B., Dondeti, L., Griffin, S., Hardjono, T., Kiwior, D., Kurose, J., Towsley, D., Vasudevan, S., Zhang, C.: Secure group communication for wireless networks. In: Proceedings of the IEEE Military Communications Conference (MILCOM), pp. 113–117 (2001)Google Scholar
  5. 5.
    Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS) (2000)Google Scholar
  6. 6.
    Mittal, N., Krishnamurthy, S., Chandrasekaran, R., Venkatesan, S.: A Fast Deterministic Algorithm for Neighbor Discovery in Multi-Channel Cognitive Radio Networks. Technical Report UTDCS-14-07, The University of Texas at Dallas (2007)Google Scholar
  7. 7.
    Krishnamurthy, S., Thoppian, M.R., Kuppa, S., Chandrasekaran, R., Mittal, N., Venkatesan, S., Prakash, R.: Time-efficient distributed layer-2 auto-configuration for cognitive radio networks. Computer Networks 52(4), 831–849 (2008)CrossRefzbMATHGoogle Scholar
  8. 8.
    Bansal, T., Mittal, N., Venkatesan, S.: Leader Election Algorithms for Multi-Channel Wireless Networks. Technical Report UTDCS-19-08, The University of Texas at Dallas (2008)Google Scholar
  9. 9.
    Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Weak communication in single-hop radio networks: Adjusting algorithms to industrial standards. Concurrency and Computation: Practice and Experience 15(11-12), 1117–1131 (2003)CrossRefzbMATHGoogle Scholar
  10. 10.
    Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Efficient algorithms for leader election in radio networks. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), pp. 51–57 (2002)Google Scholar
  11. 11.
    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
  12. 12.
    Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE Trans. Parallel Distrib. Syst. 13(5), 516–526 (2002)CrossRefGoogle Scholar
  13. 13.
    Bordim, J.L., Ito, Y., Nakano, K.: An energy efficient leader election protocol for radio network with a single transceiver. IEICE Transactions 89-A(5), 1355–1361 (2006)CrossRefGoogle Scholar
  14. 14.
    Nakano, K., Olariu, S.: A survey on leader election protocols for radio networks. In: Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), pp. 63–68. IEEE Computer Society, Los Alamitos (2002)Google Scholar
  15. 15.
    Metcalfe, R., Boggs, D.: Ethernet: Distributed packet switching for local computer networks. Commun. ACM 19(7), 395–404 (1976)CrossRefGoogle Scholar
  16. 16.
    Hayashi, T., Nakano, K., Olariu, S.: Randomized initialization protocols for packet radio networks. In: Proceedings of the 13th International Parallel and Processing Symposium (IPPS), pp. 544–548. IEEE Computer Society, Los Alamitos (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Tarun Bansal
    • 1
  • Neeraj Mittal
    • 1
  • S. Venkatesan
    • 1
  1. 1.Department of Computer ScienceThe University of Texas at DallasRichardsonUSA

Personalised recommendations