中继辅助蜂窝网络调度算法的性能分析

Yi Zhang, Zhangchao Ma, Jianhua Liu, Wenbo Wang
{"title":"中继辅助蜂窝网络调度算法的性能分析","authors":"Yi Zhang, Zhangchao Ma, Jianhua Liu, Wenbo Wang","doi":"10.1109/ICCCAS.2010.5582029","DOIUrl":null,"url":null,"abstract":"This paper focuses on multi-user scheduling in downlink relay-aided cellular network. Based on conventional scheduling rules (Round Robin (RR), Max Carrier-to-Interference ratio (Max C/I), and Proportional Fair (PF)), we propose backhaul and access scheduling algorithms under centralized and distributed mechanism, respectively. We evaluate and compare the network performance through system-level simulation. The results show that both centralized mechanism and distributed mechanism have pros and cons. Centralized mechanism performs better at the cost of more signalling and complexity.","PeriodicalId":199950,"journal":{"name":"2010 International Conference on Communications, Circuits and Systems (ICCCAS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Performance analysis of scheduling algorithms in the relay-aided cellular networks\",\"authors\":\"Yi Zhang, Zhangchao Ma, Jianhua Liu, Wenbo Wang\",\"doi\":\"10.1109/ICCCAS.2010.5582029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper focuses on multi-user scheduling in downlink relay-aided cellular network. Based on conventional scheduling rules (Round Robin (RR), Max Carrier-to-Interference ratio (Max C/I), and Proportional Fair (PF)), we propose backhaul and access scheduling algorithms under centralized and distributed mechanism, respectively. We evaluate and compare the network performance through system-level simulation. The results show that both centralized mechanism and distributed mechanism have pros and cons. Centralized mechanism performs better at the cost of more signalling and complexity.\",\"PeriodicalId\":199950,\"journal\":{\"name\":\"2010 International Conference on Communications, Circuits and Systems (ICCCAS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Communications, Circuits and Systems (ICCCAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCAS.2010.5582029\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Communications, Circuits and Systems (ICCCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCAS.2010.5582029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文主要研究下行中继辅助蜂窝网络中的多用户调度问题。基于传统的调度规则(轮循(RR)、最大载波干扰比(Max C/I)和比例公平(PF)),分别提出了集中式和分布式机制下的回程和接入调度算法。我们通过系统级仿真来评估和比较网络性能。结果表明,集中式机制和分布式机制各有优缺点,集中式机制性能较好,但代价是信令量和复杂度较高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance analysis of scheduling algorithms in the relay-aided cellular networks
This paper focuses on multi-user scheduling in downlink relay-aided cellular network. Based on conventional scheduling rules (Round Robin (RR), Max Carrier-to-Interference ratio (Max C/I), and Proportional Fair (PF)), we propose backhaul and access scheduling algorithms under centralized and distributed mechanism, respectively. We evaluate and compare the network performance through system-level simulation. The results show that both centralized mechanism and distributed mechanism have pros and cons. Centralized mechanism performs better at the cost of more signalling and complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信