On the distribution and mean of received power in stochastic cellular network

Fengming Cao, A. Ganesh, S. Armour, M. Sooriyabandara
{"title":"On the distribution and mean of received power in stochastic cellular network","authors":"Fengming Cao, A. Ganesh, S. Armour, M. Sooriyabandara","doi":"10.1109/ALLERTON.2015.7447140","DOIUrl":null,"url":null,"abstract":"This paper exploits the distribution and mean of received power for cellular network with stochastic network modeling to study the difference between the two cell association criteria, i.e. the strongest received power based cell association and the closest distance based cell association. Consequently we derive the analytical expression of the distribution and the mean of the nth strongest received power and the received power from the nth nearest base station and the derivations have been confirmed by simulation results. From both the simulation results and analytical results, we can see that the distributions of received power with both association criteria vary with different path loss exponents a: there is a clear gap between the two when the exponent is small and the two are almost the same with larger exponent. Meanwhile, the analysis on the mean of the received power suggests that under a certain converged condition, i.e. n > α/2, the average of the received power from the nth closest BS is actually larger than the nth strongest one.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2015.7447140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper exploits the distribution and mean of received power for cellular network with stochastic network modeling to study the difference between the two cell association criteria, i.e. the strongest received power based cell association and the closest distance based cell association. Consequently we derive the analytical expression of the distribution and the mean of the nth strongest received power and the received power from the nth nearest base station and the derivations have been confirmed by simulation results. From both the simulation results and analytical results, we can see that the distributions of received power with both association criteria vary with different path loss exponents a: there is a clear gap between the two when the exponent is small and the two are almost the same with larger exponent. Meanwhile, the analysis on the mean of the received power suggests that under a certain converged condition, i.e. n > α/2, the average of the received power from the nth closest BS is actually larger than the nth strongest one.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
随机细胞网络中接收功率的分布和平均值
本文采用随机网络建模方法,利用蜂窝网络接收功率的分布和均值,研究基于最强接收功率的蜂窝连接和基于最近距离的蜂窝连接这两种蜂窝连接准则的差异。由此导出了第n个最强接收功率和第n个最近基站接收功率的分布和平均值的解析表达式,并通过仿真结果得到了验证。从仿真结果和分析结果可以看出,两种关联准则下的接收功率分布随路径损耗指数a的不同而不同,当路径损耗指数a较小时,两者之间存在明显的差距,当路径损耗指数a较大时,两者几乎相同。同时,对接收功率均值的分析表明,在一定的收敛条件下,即n > α/2,从第n个最近的BS接收功率的平均值实际上大于第n个最强的BS。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Robust temporal logic model predictive control Efficient replication of queued tasks for latency reduction in cloud systems Cut-set bound is loose for Gaussian relay networks Improving MIMO detection performance in presence of phase noise using norm difference criterion Utility fair RAT selection in multi-homed LTE/802.11 networks
×
引用
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