SDN based optimal user association and resource allocation in heterogeneous cognitive networks

Seungil Moon, Tuan LeAnh, S. M. Ahsan Kazmi, Thant Zin Oo, C. Hong
{"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}
引用次数: 10

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
异构认知网络中基于SDN的最优用户关联与资源分配
连接的智能移动设备数量的增加推动了移动数据的指数增长。下一代网络必须满足更高容量的需求。具有多个基站层的异构认知网络是实现更高数据速率目标的一种很有前途的方法。用户关联问题是异构认知网络中存在的一个主要问题,因为所涉及的基站的传输能力存在差异。我们的目标是在干扰约束下实现最优的用户关联。我们将该问题转化为一个优化问题,并运用匹配理论提出了一种获得最优用户关联的算法。本文提出的最优用户关联匹配算法起到了SDN应用的作用。然后进行仿真,并将我们提出的算法与现有算法进行比较。仿真结果表明,本文提出的算法优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A procedure to achieve cost and performance optimization for recovery in cloud computing Design of a media stream relay engine on the Android OS Framework for multi-level application traffic identification Cloud service enabling architecture for multi-vendor environment Inter-vessel traffic service data exchange format protocol security enhancement of user authentication scheme in mobile VTS middleware platform
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1