Resource Scheduling Based on Improved Spectral Clustering Algorithm in Edge Computing

20Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the development of Internet of Things (IoT), the massive data generated by it forms big data, and the complexity of dealing with big data brings challenges to resource scheduling in edge computing. In order to solve the problem of resource scheduling and improve the satisfaction of users in edge computing environment, we propose a user-oriented improved spectral clustering scheduling algorithm (ISCM) in this paper. Based on the improved k-means algorithm, the ISCM algorithm solves the problem that the clustering result is sensitive to the initial value and realizes the reclustering, which makes the obtained clustering results more stable. Finally, the edge computing resource scheduling scheme is obtained based on the clustering results. The experimental results show that the resource scheduling scheme based on improved spectral clustering algorithm is superior to traditional spectral clustering algorithm in edge computing environment.

Cite

CITATION STYLE

APA

Li, G., Xu, S., Wu, J., & Ding, H. (2018). Resource Scheduling Based on Improved Spectral Clustering Algorithm in Edge Computing. Scientific Programming, 2018. https://doi.org/10.1155/2018/6860359

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free