Seungil Moon, Tuan LeAnh, S. M. Ahsan Kazmi, Thant Zin Oo, C. Hong
{"title":"异构认知网络中基于SDN的最优用户关联与资源分配","authors":"Seungil Moon, Tuan LeAnh, S. M. Ahsan Kazmi, Thant Zin Oo, C. Hong","doi":"10.1109/APNOMS.2015.7275397","DOIUrl":null,"url":null,"abstract":"The increase in the number of connected smart mobile devices has fueled the exponential growth in mobile data. The next-generation networks must meet the demand for higher capacity. Heterogeneous cognitive networks with multiple base station tiers are a promising approach to achieving the higher data rate target. The user association problem is a major issue in the heterogeneous cognitive networks because of the disparity in transmission powers of the base stations involved. Our objective is to achieve the optimal user association under interference constraints. We formulate the problem into an optimization problem and employ matching theory to propose an algorithm to obtain the optimal user association. The proposed matching algorithm for the optimal user association plays the role of SDN application. We then perform simulations and compare our proposed algorithm with existing ones. The simulations results depict that our proposed algorithm outperforms others.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"SDN based optimal user association and resource allocation in heterogeneous cognitive networks\",\"authors\":\"Seungil Moon, Tuan LeAnh, S. M. Ahsan Kazmi, Thant Zin Oo, C. Hong\",\"doi\":\"10.1109/APNOMS.2015.7275397\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The increase in the number of connected smart mobile devices has fueled the exponential growth in mobile data. The next-generation networks must meet the demand for higher capacity. Heterogeneous cognitive networks with multiple base station tiers are a promising approach to achieving the higher data rate target. The user association problem is a major issue in the heterogeneous cognitive networks because of the disparity in transmission powers of the base stations involved. Our objective is to achieve the optimal user association under interference constraints. We formulate the problem into an optimization problem and employ matching theory to propose an algorithm to obtain the optimal user association. The proposed matching algorithm for the optimal user association plays the role of SDN application. We then perform simulations and compare our proposed algorithm with existing ones. The simulations results depict that our proposed algorithm outperforms others.\",\"PeriodicalId\":269263,\"journal\":{\"name\":\"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APNOMS.2015.7275397\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APNOMS.2015.7275397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
SDN based optimal user association and resource allocation in heterogeneous cognitive networks
The increase in the number of connected smart mobile devices has fueled the exponential growth in mobile data. The next-generation networks must meet the demand for higher capacity. Heterogeneous cognitive networks with multiple base station tiers are a promising approach to achieving the higher data rate target. The user association problem is a major issue in the heterogeneous cognitive networks because of the disparity in transmission powers of the base stations involved. Our objective is to achieve the optimal user association under interference constraints. We formulate the problem into an optimization problem and employ matching theory to propose an algorithm to obtain the optimal user association. The proposed matching algorithm for the optimal user association plays the role of SDN application. We then perform simulations and compare our proposed algorithm with existing ones. The simulations results depict that our proposed algorithm outperforms others.