Applying Quantum Search Algorithm to Select Energy-Efficient Cluster Heads in Wireless Sensor Networks
- Abstract
- Clustering is an effective topology control approach that evenly distributes loads across sensor nodes, enhances network scalability, and increases the lifetime in wireless sensor networks. In this paper, we propose a novel energy-efficient weighted cluster head (CH) selection approach that improves the overall performance of the network and increases energy efficiency. An optimization strategy is proposed that emphasizes adjusting the transmission range with the appropriate node density, which increases energy efficiency for intra- and inter-cluster communications to 86% and 97%, respectively. In addition, the implementation of a quantum search algorithm for choosing the CH is explained. Compared to the classical method such as EECS and HEED, the proposed quantum search algorithm has a quadratic speed-up advantage. The classical search algorithm requires N steps to find a specific element in an array of N elements, but instead of using a classical algorithm, Grover’s quantum search algorithm minimizes the complexity to O (√N). In this work, an energy-efficient cluster head selection approach is illustrated through a classical weighted clustering algorithm, and its implementation is also extended through a quantum weighted search algorithm which is demonstrated by the simulation results.
- Issued Date
- 2023
Kripanita Roy
Myung-Kyun Kim
- Type
- Article
- Keyword
- cluster head selection (CH); clustering; classical weighted clustering algorithm; quantum weighted search algorithm; time complexity; energy efficiency; intra- and inter-cluster communications
- DOI
- 10.3390/electronics12010063
- URI
- https://oak.ulsan.ac.kr/handle/2021.oak/17827
- Publisher
- ELECTRONICS
- Language
- 영어
- ISSN
- 2079-9292
- Citation Volume
- 12
- Citation Number
- 1
- Citation Start Page
- 1
- Citation End Page
- 23
-
Appears in Collections:
- Engineering > IT Convergence
- 공개 및 라이선스
-
- 파일 목록
-
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.