Design of Trusted Security Routing in Wireless Sensor Networks Based on Quantum Ant Colony Algorithm
DOI:
https://doi.org/10.3991/ijoe.v13i07.7273Keywords:
wireless sensor network, quantum ant colony algorithm, safe and reliable, routing algorithmAbstract
To design an effective secure routing of trusted nodes in wireless sensor networks, quantum ant colony algorithm is applied to the design of large-scale wireless sensor network routing. The trustworthy network is used as the pheromone distribution strategy.Then, the pheromone is encoded by the quantum bit. The pheromone is updated by the quantum revolving door, and the energy consumption prediction is carried out to select the path. Finally, the trusted security routing algorithm of the wireless sensor network based on the global energy balance is realized. The quantum ant colony algorithm is superior to the traditional ant colony algorithm in algorithm convergence speed and global optimization. It can balance the energy consumption of the network node and can effectively resist the attacks such as Wormholes.It is very promising to apply the quantum ant colony algorithm to the routing algorithm of large scale wireless sensor networks.
Downloads
Published
How to Cite
Issue
Section
License
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.