An Improved Fast Search and Find of Density Peaks-Based Fog Node Location of Fog Computing System

As the most notably emerging wave of Internet deployments, Internet of Things (IoTs) requires mobility support, location awareness and low latency. Fog Computing, also termed edge computing, is a promising solution for IoTs by extending the Cloud Computing paradigm to the edge of Internet. But how to locate fog nodes' sites and determine the scale of each fog node is a main challenge of Fog Computing systems, especially for time sensitive Fog Computing systems. In this paper, we try to deal with this problem by proposing an improved Fast Search and Find of Density Peaks-based fog node location strategy to locate the fog nodes' sites and determine the resources for each located fog node. To this end, we firstly formulate the fog node location of Fog Computing systems as a clustering problem with multi-constraints. Then we propose an improved Fast Search and Find of Density Peaks-based fog node location algorithm, which introduces the time sensitive feature of IoT applications and improves the Fast Search and Find of Density Peaks clustering algorithm to make this clustering algorithm more robustness and adaptability. The experiment results show that our fog node location strategy not also can avoid the NP-hard problem of the traditional server placement strategies, but also has low time complexity.

[1]  Baochun Li,et al.  A General and Practical Datacenter Selection Framework for Cloud Services , 2012, 2012 IEEE Fifth International Conference on Cloud Computing.

[2]  Ying Zhang,et al.  NetClust: A Framework for Scalable and Pareto-Optimal Media Server Placement , 2013, IEEE Transactions on Multimedia.

[3]  Shuai Jiang,et al.  A Simple and Fast Algorithm for Global K-means Clustering , 2010, 2010 Second International Workshop on Education Technology and Computer Science.

[4]  Raja Lavanya,et al.  Fog Computing and Its Role in the Internet of Things , 2019, Advances in Computer and Electrical Engineering.

[5]  Ron Shamir,et al.  A clustering algorithm based on graph connectivity , 2000, Inf. Process. Lett..

[6]  S. C. Johnson Hierarchical clustering schemes , 1967, Psychometrika.

[7]  Ren-long Zhang,et al.  A novel fuzzy hybrid quantum artificial immune clustering algorithm based on cloud model , 2014, Eng. Appl. Artif. Intell..

[8]  Artemis Moroni,et al.  Vision and Challenges for Realising the Internet of Things , 2010 .

[9]  Jörg Sander Density-Based Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[10]  Sean Hughes,et al.  Clustering by Fast Search and Find of Density Peaks , 2016 .

[11]  Farahnaz Sadoughi,et al.  Ranked k-medoids: A fast and accurate rank-based partitioning algorithm for clustering large datasets , 2013, Knowl. Based Syst..

[12]  P. Barone Kernel density estimation via diffusion and the complex exponentials approximation problem , 2012, 1206.0963.

[13]  Athman Bouguettaya,et al.  Efficient agglomerative hierarchical clustering , 2015, Expert Syst. Appl..

[14]  Ivan Stojmenovic,et al.  The Fog computing paradigm: Scenarios and security issues , 2014, 2014 Federated Conference on Computer Science and Information Systems.

[15]  Qun Li,et al.  A Survey of Fog Computing: Concepts, Applications and Issues , 2015, Mobidata@MobiHoc.

[16]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[17]  Bin Jiang,et al.  Clustering Uncertain Data Based on Probability Distribution Similarity , 2013, IEEE Transactions on Knowledge and Data Engineering.

[18]  Sudipto Guha,et al.  Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[19]  Tao Zhang,et al.  Fog Computing , 2017, IEEE Internet Comput..