Next Article in Journal
A Solar Panel-Integrated Modified Planner Inverted F Antenna for Low Earth Orbit Remote Sensing Nanosatellite Communication System
Next Article in Special Issue
A Collaborative Data Collection Scheme Based on Optimal Clustering for Wireless Sensor Networks
Previous Article in Journal
Physical-Model-Checking to Detect Switching-Related Attacks in Power Systems
Previous Article in Special Issue
QoS-Driven Adaptive Trust Service Coordination in the Industrial Internet of Things
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

GWS—A Collaborative Load-Balancing Algorithm for Internet-of-Things

1
Department of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China
2
Key Laboratory of Communication and Information Systems, Beijing Municipal Commission of Education, Beijing Jiaotong University, Beijing 100044, China
3
Department of Software Engineering, Beijing Jiaotong University, Beijing 100044, China
4
School of Information Engineering, China University of Geosciences at Beijing, Beijing 100083, China
*
Author to whom correspondence should be addressed.
Sensors 2018, 18(8), 2479; https://doi.org/10.3390/s18082479
Submission received: 29 June 2018 / Revised: 26 July 2018 / Accepted: 30 July 2018 / Published: 31 July 2018
(This article belongs to the Special Issue Sensor Networks for Collaborative and Secure Internet of Things)

Abstract

This paper firstly replaces the first-come-first-service (FCFS) mechanism with the time-sharing (TS) mechanism in fog computing nodes (FCNs). Then a collaborative load-balancing algorithm for the TS mechanism is proposed for FCNs. The algorithm is a variant of a work-stealing scheduling algorithm, and is based on the Nash bargaining solution (NBS) for a cooperative game between FCNs. Pareto optimality is achieved through the collaborative working of FCNs to improve the performance of every FCN. Lastly the simulation results demonstrate that the game-theory based work-stealing algorithm (GWS) outperforms the classical work-stealing algorithm (CWS).
Keywords: collaborative; Internet-of-Things; fog computing; Nash bargaining solution; Pareto optimality; scheduling; time-sharing collaborative; Internet-of-Things; fog computing; Nash bargaining solution; Pareto optimality; scheduling; time-sharing

Share and Cite

MDPI and ACS Style

Xiao, H.; Zhang, Z.; Zhou, Z. GWS—A Collaborative Load-Balancing Algorithm for Internet-of-Things. Sensors 2018, 18, 2479. https://doi.org/10.3390/s18082479

AMA Style

Xiao H, Zhang Z, Zhou Z. GWS—A Collaborative Load-Balancing Algorithm for Internet-of-Things. Sensors. 2018; 18(8):2479. https://doi.org/10.3390/s18082479

Chicago/Turabian Style

Xiao, Hongyu, Zhenjiang Zhang, and Zhangbing Zhou. 2018. "GWS—A Collaborative Load-Balancing Algorithm for Internet-of-Things" Sensors 18, no. 8: 2479. https://doi.org/10.3390/s18082479

APA Style

Xiao, H., Zhang, Z., & Zhou, Z. (2018). GWS—A Collaborative Load-Balancing Algorithm for Internet-of-Things. Sensors, 18(8), 2479. https://doi.org/10.3390/s18082479

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop