Open Access

ARTICLE

A Sustainable WSN System with Heuristic Schemes in IIoT

by Wenjun Li¹, Siyang Zhang¹, Guangwei Wu², Aldosary Saad³, Amr Tolba^3,4, Gwang-jun Kim^5,*

1 School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, 410114, China
2 College of Computer and Information Engineering, Central South University of Forestry and Technology, Changsha, 410114, China
3 Computer Science Department, Community College, King Saud University, Riyadh, 11437, Saudi Arabia
4 Mathematics and Computer Science Department, Faculty of Science, Menoufia University, Egypt
5 Department of Computer Engineering, Chonnam National University, Gwangju, 61186, Korea

* Corresponding Author: Gwang-jun Kim. Email:

Computers, Materials & Continua 2022, 72(3), 4215-4231. https://doi.org/10.32604/cmc.2022.024204

Received 08 October 2021; Accepted 20 December 2021; Issue published 21 April 2022

Abstract

Recently, the development of Industrial Internet of Things has taken the advantage of 5G network to be more powerful and more intelligent. However, 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 propose a sustainable wireless sensor networks system, which avoids the problems brought by 5G network system to some extent. In this system, deploying relays and selecting routing are for the sake of communication and charging. The main aim is to minimize the total energy-cost of communication under the precondition, where each terminal with low-power should be charged by at least one relay. Furthermore, from the perspective of graph theory, we extract a combinatorial optimization problem from this system. After that, as to four different cases, there are corresponding different versions of the problem. We give the proofs of computational complexity for these problems, and two heuristic algorithms for one of them are proposed. Finally, the extensive experiments compare and demonstrate the performances of these two algorithms.

---

Keywords

---