{"title":"重载无线MIMO交换中高效信息交换的访问节点选择调度构建","authors":"Arata Takahashi, O. Takyu, H. Fujiwara","doi":"10.1109/ICTC49870.2020.9289587","DOIUrl":null,"url":null,"abstract":"Communication using a repeater such as Wireless MIMO Switching is attracting attention because it enables efficient communication and the network can be easily deployed. In this paper, we propose the overloaded wireless mimo switching for adding one more node accessing to the relay. As a result, the high efficiency of information exchanging is achieved. When the number of accessing nodes is larger than the number of antennas of relay, the selection of nodes accessing to the node is required, where it is the selection-scheduling. In this paper, the selection-scheduling is constructed by linear programming. Some constraints of the overloaded mimo switching are given by mathematical models. From the computer simulation, the constructed selection-scheduling using a solver of linear programming is as good performance as the optimal one.","PeriodicalId":282243,"journal":{"name":"2020 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Construction of Selection-Scheduling of Accessing Node for High Efficiency Information Exchanging in Overloaded Wireless MIMO Switching\",\"authors\":\"Arata Takahashi, O. Takyu, H. Fujiwara\",\"doi\":\"10.1109/ICTC49870.2020.9289587\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Communication using a repeater such as Wireless MIMO Switching is attracting attention because it enables efficient communication and the network can be easily deployed. In this paper, we propose the overloaded wireless mimo switching for adding one more node accessing to the relay. As a result, the high efficiency of information exchanging is achieved. When the number of accessing nodes is larger than the number of antennas of relay, the selection of nodes accessing to the node is required, where it is the selection-scheduling. In this paper, the selection-scheduling is constructed by linear programming. Some constraints of the overloaded mimo switching are given by mathematical models. From the computer simulation, the constructed selection-scheduling using a solver of linear programming is as good performance as the optimal one.\",\"PeriodicalId\":282243,\"journal\":{\"name\":\"2020 International Conference on Information and Communication Technology Convergence (ICTC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Information and Communication Technology Convergence (ICTC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTC49870.2020.9289587\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Information and Communication Technology Convergence (ICTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTC49870.2020.9289587","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Construction of Selection-Scheduling of Accessing Node for High Efficiency Information Exchanging in Overloaded Wireless MIMO Switching
Communication using a repeater such as Wireless MIMO Switching is attracting attention because it enables efficient communication and the network can be easily deployed. In this paper, we propose the overloaded wireless mimo switching for adding one more node accessing to the relay. As a result, the high efficiency of information exchanging is achieved. When the number of accessing nodes is larger than the number of antennas of relay, the selection of nodes accessing to the node is required, where it is the selection-scheduling. In this paper, the selection-scheduling is constructed by linear programming. Some constraints of the overloaded mimo switching are given by mathematical models. From the computer simulation, the constructed selection-scheduling using a solver of linear programming is as good performance as the optimal one.