A spanning tree construction algorithm for industrial wireless sensor networks based on quantum artificial bee colony

EURASIP Journal on Wireless Communications and Networking

Yang Zhao¹  Yuanzhen Li¹  Yingyu Zhang¹ 

[1] School of Computer Science, Liaocheng University;

关键词: Industrial wireless sensor network;    Minimum spanning tree;    Artificial bee colony;    Quantum computing;   

DOI  :  10.1186/s13638-019-1496-z

来源: DOAJ

【 摘 要 】

Abstract In industrial Internet, many intelligent applications are implemented based on data collection and distribution. Data collection and data distribution in the wireless sensor networks are very important, where the node topology can be described by the spanning tree for obtaining an efficient transmission. Classical algorithms in graph theory such as the Kruskal algorithm or Prim algorithm can only find the minimum spanning tree (MST) in industrial wireless sensor networks. Swarm intelligence algorithm can obtain multiple solutions in one calculation. Multiple solutions are very helpful for improving the reliability of industrial wireless sensor networks. In this paper, we combine quantum computing with artificial bee colony and design a spanning tree construction algorithm for industrial wireless sensor networks. Quantum computations are introduced into the onlooker bees search. Food source replacement strategy is improved. Finally, the algorithm is simulated and evaluated. The results show that the new proposed algorithm can obtain more alternative solutions and has a better performance in search efficiency.

【 授权许可】

Unknown