{"title":"Preference-based and Homogeneous Coalition Formation in Fog Computing","authors":"M. Sharaf, T. El-Ghazawi","doi":"10.1109/CSCN.2019.8931361","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a Markov Chain Monte Carlo (MCMC) algorithm to handle fog nodes coalition formation problem. The need to construct coalitions emanates from the fact that some nodes could not be able to handle the required computation on its own due to their limited computational capabilities. Also, we introduce a set of constraints on the formed coalitions. Specifically, nodes could have preferences with whom to coalesce. Even more the formed coalitions have to be of semi-equal computational powers.","PeriodicalId":102095,"journal":{"name":"2019 IEEE Conference on Standards for Communications and Networking (CSCN)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Conference on Standards for Communications and Networking (CSCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCN.2019.8931361","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, we propose a Markov Chain Monte Carlo (MCMC) algorithm to handle fog nodes coalition formation problem. The need to construct coalitions emanates from the fact that some nodes could not be able to handle the required computation on its own due to their limited computational capabilities. Also, we introduce a set of constraints on the formed coalitions. Specifically, nodes could have preferences with whom to coalesce. Even more the formed coalitions have to be of semi-equal computational powers.