A Sustainable WSN System with Heuristic Schemes in IIoT

作     者：Wenjun Li Siyang Zhang Guangwei Wu Aldosary Saad Amr Tolba Gwang-jun Kim 

作者机构：School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha410114China College of Computer and Information EngineeringCentral South University of Forestry and TechnologyChangsha410114China Computer Science DepartmentCommunity CollegeKing Saud UniversityRiyadh11437Saudi Arabia Mathematics and Computer Science DepartmentFaculty of ScienceMenoufia UniversityEgypt Department of Computer EngineeringChonnam National UniversityGwangju61186Korea 

出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)

年 卷 期：2022年第72卷第9期

页      面：4215-4231页

核心收录：

学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

基　　金：The authors would like to extend their gratitude to King Saud University(Riyadh,Saudi Arabia)for funding this research through Researchers Supporting Project number(RSP-2021/260) And this work was supported by the Natural Science Foundation of Hunan Province,China(Grant No.2020JJ4949) the Postgraduate Scientific Research Innovation Project of Hunan Province(Grant No.CX20200883) 

主　　题：Industrial Internet of Things sustainable wireless sensor network system combinatorial optimization problem heuristic algorithms 

摘      要：Recently, the development of Industrial Internet of Things hastaken the advantage of 5G network to be more powerful and more ***, the upgrading of 5G network will cause a variety of issues increase,one of them is the increased cost of coverage. In this paper, we proposea sustainable wireless sensor networks system, which avoids the problemsbrought by 5G network system to some extent. In this system, deployingrelays and selecting routing are for the sake of communication and *** main aim is to minimize the total energy-cost of communication underthe precondition, where each terminal with low-power should be charged byat least one relay. Furthermore, from the perspective of graph theory, weextract a combinatorial optimization problem from this system. After that,as to four different cases, there are corresponding different versions of theproblem. We give the proofs of computational complexity for these problems,and two heuristic algorithms for one of them are proposed. Finally, theextensive experiments compare and demonstrate the performances of thesetwo algorithms.