{"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}
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.