Energy Efficient Cellular Network User Clustering Using Linear Radius Algorithm.

H. B. Kassa, K. Kornegay, Ebrima N. Ceesay
{"title":"Energy Efficient Cellular Network User Clustering Using Linear Radius Algorithm.","authors":"H. B. Kassa, K. Kornegay, Ebrima N. Ceesay","doi":"10.1109/CISS.2019.8692919","DOIUrl":null,"url":null,"abstract":"This paper proposes an adaptive algorithm to maximize energy efficiency in cellular network considering a dynamic user clustering technique. First, a base station (BS) sleeping algorithm is designed, which minimizes the energy consumption to almost more than half. Then a Linear Radius User Clustering algorithm is modeled. Using feedback channel state information to the base station, the algorithm varies the mobile cell radius adaptively to minimize a total energy consumption of overall cellular network based on the threshold user density. The minimum distance where a Mobile Station can get a signal from the base station without a significant effect on human health can be located. Since the Base Station with modern scanner installed on its transmitter part can scan 390 times per second, the time scale to marginalize users from the coverage under threshold densities is in milliseconds. As a result, there is no significant effect on quality of services when the cell coverage is zoomed in/out periodically. Numerical results show that the proposed algorithm can considerably reduce energy consumption compared with the cases where a base station is always turned on with constant maximum transmit power.","PeriodicalId":123696,"journal":{"name":"2019 53rd Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 53rd Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2019.8692919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes an adaptive algorithm to maximize energy efficiency in cellular network considering a dynamic user clustering technique. First, a base station (BS) sleeping algorithm is designed, which minimizes the energy consumption to almost more than half. Then a Linear Radius User Clustering algorithm is modeled. Using feedback channel state information to the base station, the algorithm varies the mobile cell radius adaptively to minimize a total energy consumption of overall cellular network based on the threshold user density. The minimum distance where a Mobile Station can get a signal from the base station without a significant effect on human health can be located. Since the Base Station with modern scanner installed on its transmitter part can scan 390 times per second, the time scale to marginalize users from the coverage under threshold densities is in milliseconds. As a result, there is no significant effect on quality of services when the cell coverage is zoomed in/out periodically. Numerical results show that the proposed algorithm can considerably reduce energy consumption compared with the cases where a base station is always turned on with constant maximum transmit power.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于线性半径算法的高效蜂窝网络用户聚类。
本文提出了一种考虑动态用户聚类技术的蜂窝网络能量效率最大化的自适应算法。首先,设计了一种基站休眠算法,使能耗降至一半以上。然后建立了一种线性半径用户聚类算法。该算法利用反馈给基站的信道状态信息,根据阈值用户密度自适应地改变移动小区半径,使整个蜂窝网络的总能耗最小。可以确定移动站从基站获得信号而不会对人体健康产生重大影响的最小距离。由于在发射机部分安装了现代扫描仪的基站每秒可以扫描390次,因此在阈值密度下将用户从覆盖范围中边缘化的时间尺度以毫秒为单位。因此,当小区覆盖范围定期放大/缩小时,对服务质量没有显著影响。数值计算结果表明,与最大发射功率恒定的情况相比,该算法能显著降低能耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Prospect Theoretical Extension of a Communication Game Under Jamming Smoothed First-order Algorithms for Expectation-valued Constrained Problems Secure Key Generation for Distributed Inference in IoT Invited Presentation Exponential Error Bounds and Decoding Complexity for Block Codes Constructed by Unit Memory Trellis Codes of Branch Length Two Deep learning to detect catheter tips in vivo during photoacoustic-guided catheter interventions : Invited Presentation
×
引用
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