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.
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
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)
Mitola, J.: Cognitive radio: An Integrated Agent Architecture for Software Defined Radio. PhD thesis, Royal Institute of Technology (2000)
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)
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)
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)
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)
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)
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)
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)
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)
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)
Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE Trans. Parallel Distrib. Syst. 13(5), 516–526 (2002)
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)
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)
Metcalfe, R., Boggs, D.: Ethernet: Distributed packet switching for local computer networks. Commun. ACM 19(7), 395–404 (1976)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bansal, T., Mittal, N., Venkatesan, S. (2008). Leader Election Algorithms for Multi-channel Wireless Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, DZ. (eds) Wireless Algorithms, Systems, and Applications. WASA 2008. Lecture Notes in Computer Science, vol 5258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88582-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-88582-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88581-8
Online ISBN: 978-3-540-88582-5
eBook Packages: Computer ScienceComputer Science (R0)