Abstract
In this paper, a new system entropy measure is used to optimize the routing algorithm in power consumption. We introduce the system entropy measure into the problem of industrial wireless sensor networks (iWSNs) routing and propose a high-performance routing algorithm guided by the system entropy measure (rSEM). Based on the cluster iWSNs architecture, the rSEM selects the cluster heads and cluster member nodes successively, according to the system entropy measure, and constructs the iWSNs with the minimum system entropy. The method of the cluster head selection is traversal, while the method of the cluster member selection is a greedy algorithm to reduce the complexity. The experiments show that the power consumption of the iWSNs generated by the rSEM is in the same order of magnitude as that of Dijkstra in both 2D and 3D scenarios. In addition, the delay of the rSEM is slightly higher than that of LEACH. Therefore, the rSEM is suitable for networks that are sensitive to both the delay and power consumption. The rSEM puts forward a new idea for the design of routing for the next-generation iWSNs, which improves the overall network performance according to the network topology, instead of relying on the power consumption or delay performance only.
Funder
National Natural Science Foundation of China
the open funding of the Key Laboratory of Universal Wireless Communications (BUPT), Ministry of Education, P.R.China
Subject
Electrical and Electronic Engineering,Biochemistry,Instrumentation,Atomic and Molecular Physics, and Optics,Analytical Chemistry
Reference15 articles.
1. 5G: A tutorial overview of standards trials challenges deployment and practice;Shafi;IEEE J. Ser. Areas Commun.,2017
2. A Survey on 5G Networks for the Internet of Things: Communication Technologies and Challenges;Akpakwu;IEEE Access,2018
3. Glorioso, R.M., Grueneich, G.R., and McElroy, D. (1970, January 7–9). Adaptive routing in a large communications network. Proceedings of the 1970 IEEE Symposium on Adaptive Processes (9th) Decision and Control, Austin, TX, USA.
4. A note on two problems in connexion with graphs;Dijkstra;Numer. Math.,1959
5. Alpert, C.J., Hu, T.C., Huang, J.H., and Kahng, A.B. (1993, January 3–6). A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing. Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, Chicago, IL, USA.