WiMAX MMR (802.16j)网络中的最优用户关联

P. Raghu, P. Chaporkar
{"title":"WiMAX MMR (802.16j)网络中的最优用户关联","authors":"P. Raghu, P. Chaporkar","doi":"10.1109/NCC.2012.6176781","DOIUrl":null,"url":null,"abstract":"IEEE 802.16j standard defines the WiMAX Mobile Multihop Relay (MMR) networks. Multihop relays are introduced to improve the network throughput and to extend the coverage area of the network. In MMR networks, the MR-BS (Multihop Relay Base Station) has to associate each User (MS) with an Access Station which can be either one of the RS or MR-BS itself. Intuitively, MR-BS can select an Access Station for MS based on Maximum SINR or Minimum Traffic or Minimum Number of Hops. However, such association schemes will lead to inefficient resource utilization. In this paper, we propose an association scheme that guarantees the required QoS and minimize the resources required to serve an MS. The proposed association scheme exploits the frame scheduling to decide on access station for an MS. By allocating minimum possible resources to a each user without violating the user service requirement, we can accommodate maximum number of users within the current frame. The frame scheduling considered for the analysis is Even-Odd scheduling which is recommended by the standard [1]. The simulation results show that the proposed algorithm will result in efficient resource utilization and have less user drop percentage compared with the other intuitive algorithms of choosing Access Station based on Maximum SINR or Minimum Number of Hops or Minimum Traffic.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal user association in WiMAX MMR (802.16j) metworks\",\"authors\":\"P. Raghu, P. Chaporkar\",\"doi\":\"10.1109/NCC.2012.6176781\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"IEEE 802.16j standard defines the WiMAX Mobile Multihop Relay (MMR) networks. Multihop relays are introduced to improve the network throughput and to extend the coverage area of the network. In MMR networks, the MR-BS (Multihop Relay Base Station) has to associate each User (MS) with an Access Station which can be either one of the RS or MR-BS itself. Intuitively, MR-BS can select an Access Station for MS based on Maximum SINR or Minimum Traffic or Minimum Number of Hops. However, such association schemes will lead to inefficient resource utilization. In this paper, we propose an association scheme that guarantees the required QoS and minimize the resources required to serve an MS. The proposed association scheme exploits the frame scheduling to decide on access station for an MS. By allocating minimum possible resources to a each user without violating the user service requirement, we can accommodate maximum number of users within the current frame. The frame scheduling considered for the analysis is Even-Odd scheduling which is recommended by the standard [1]. The simulation results show that the proposed algorithm will result in efficient resource utilization and have less user drop percentage compared with the other intuitive algorithms of choosing Access Station based on Maximum SINR or Minimum Number of Hops or Minimum Traffic.\",\"PeriodicalId\":178278,\"journal\":{\"name\":\"2012 National Conference on Communications (NCC)\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2012.6176781\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2012.6176781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

IEEE 802.16j标准定义了WiMAX移动多跳中继(MMR)网络。为了提高网络吞吐量和扩大网络覆盖范围,引入了多跳中继。在MMR网络中,多跳中继基站(MR-BS)必须将每个用户(MS)与一个接入站相关联,接入站可以是RS中的一个,也可以是MR-BS本身。直观地说,MR-BS可以根据最大SINR或最小流量或最小跳数来选择MS的接入站。然而,这种关联方案会导致资源利用效率低下。在本文中,我们提出了一种保证QoS要求和最小化服务服务资源的关联方案,该方案利用帧调度来决定服务的接入站,在不违反用户服务需求的情况下,为每个用户分配尽可能少的资源,从而在当前帧内容纳最大数量的用户。分析中考虑的帧调度是标准[1]推荐的偶数-奇数调度。仿真结果表明,与其他基于最大信噪比、最小跳数或最小流量的直观选择接入站算法相比,该算法能够有效地利用资源,减少用户掉话率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal user association in WiMAX MMR (802.16j) metworks
IEEE 802.16j standard defines the WiMAX Mobile Multihop Relay (MMR) networks. Multihop relays are introduced to improve the network throughput and to extend the coverage area of the network. In MMR networks, the MR-BS (Multihop Relay Base Station) has to associate each User (MS) with an Access Station which can be either one of the RS or MR-BS itself. Intuitively, MR-BS can select an Access Station for MS based on Maximum SINR or Minimum Traffic or Minimum Number of Hops. However, such association schemes will lead to inefficient resource utilization. In this paper, we propose an association scheme that guarantees the required QoS and minimize the resources required to serve an MS. The proposed association scheme exploits the frame scheduling to decide on access station for an MS. By allocating minimum possible resources to a each user without violating the user service requirement, we can accommodate maximum number of users within the current frame. The frame scheduling considered for the analysis is Even-Odd scheduling which is recommended by the standard [1]. The simulation results show that the proposed algorithm will result in efficient resource utilization and have less user drop percentage compared with the other intuitive algorithms of choosing Access Station based on Maximum SINR or Minimum Number of Hops or Minimum Traffic.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信