Vol.62, No.3, 2020, pp.1351-1364, doi:10.32604/cmc.2020.07334
OPEN ACCESS
RESEARCH ARTICLE
Service Scheduling Based on Edge Computing for Power Distribution IoT
  • Zhu Liu1, 2, *, Xuesong Qiu1, Shuai Zhang2, Siyang Deng2, Guangyi Liu3, *
1 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China.
2 State Grid Information & Telecommunication Group Co., Ltd., Beijing, 102211, China.
3 Global Energy Interconnection Research Institute North America, San Jose, CA, 95134, USA.
*Corresponding Authors: Zhu Liu. Email: liuzhu_558@139.com;
   Guangyi Liu. Email: guangyi.liu@geirina.net.
Abstract
With the growing amounts of multi-micro grids, electric vehicles, smart home, smart cities connected to the Power Distribution Internet of Things (PD-IoT) system, greater computing resource and communication bandwidth are required for power distribution. It probably leads to extreme service delay and data congestion when a large number of data and business occur in emergence. This paper presents a service scheduling method based on edge computing to balance the business load of PD-IoT. The architecture, components and functional requirements of the PD-IoT with edge computing platform are proposed. Then, the structure of the service scheduling system is presented. Further, a novel load balancing strategy and ant colony algorithm are investigated in the service scheduling method. The validity of the method is evaluated by simulation tests. Results indicate that the mean load balancing ratio is reduced by 99.16% and the optimized offloading links can be acquired within 1.8 iterations. Computing load of the nodes in edge computing platform can be effectively balanced through the service scheduling.
Keywords
PD-IoT, edge computing, service scheduling, load balancing strategy, ant colony algorithm.
Cite This Article
Liu, Z., Qiu, X., Zhang, S., Deng, S., Liu, G. (2020). Service Scheduling Based on Edge Computing for Power Distribution IoT. CMC-Computers, Materials & Continua, 62(3), 1351–1364.