Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/8886
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKanchan, P.
dc.contributor.authorPushparaj, Shetty, D.
dc.date.accessioned2020-03-30T10:22:57Z-
dc.date.available2020-03-30T10:22:57Z-
dc.date.issued2019
dc.identifier.citationAdvances in Intelligent Systems and Computing, 2019, Vol.814, , pp.699-713en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/8886-
dc.description.abstractClustering is done in wireless sensor networks (WSN) to conserve the energy of sensor nodes in the network. The network lifetime of WSN can be defined as the duration for which the network remains operational. It is a critical design issue in WSN�s since once a node is deployed, it may not be feasible to replace or recharge the sensor nodes. In this paper, we proposed a quantum PSO algorithm for improving network lifetime called quantum PSO clustering algorithm to improve network lifetime(QPCINL). The QPCINL uses quantum bits. A quantum bit can exist in �0� state, �1� state or a linear superposition of �0� and �1� states, unlike the binary bit which can exist in only �0� state or �1� state. We define a factor called network lifetime factor(NLF) which allows us to compare various algorithms. We test our algorithm by giving different values to the number of sensor nodes and cluster heads, varying the base station position, etc. Then, we compare our results to existing algorithms and demonstrate the superiority of our algorithm. � Springer Nature Singapore Pte Ltd. 2019.en_US
dc.titleQuantum PSO algorithm for clustering in wireless sensor networks to improve network lifetimeen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.