{"title":"一种新的信道共享协议增强室内无线通信系统的容量","authors":"A. Prasad, K. Seki","doi":"10.1109/ICPWC.1997.655500","DOIUrl":null,"url":null,"abstract":"This paper presents and analyses the performance of a novel channel sharing protocol. The protocol uses the p-persistence algorithm to access the channel and a token for fair channel sharing. Token passing is controlled by a base station (BS). A user, PS, can join a channel if the channel is idle. Channel idle information is given by an idle token from the BS. Numerical results of the protocol are given in terms of load, G and throughput, S. Numerical results are also compared with that of carrier sense multiple access protocol with collision avoidance (CSMA/CA). Results show that the proposed scheme outperforms CSMA/CA when the number of channels are three or more.","PeriodicalId":166667,"journal":{"name":"1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Capacity enhancement of indoor wireless communication system with a novel channel sharing protocol\",\"authors\":\"A. Prasad, K. Seki\",\"doi\":\"10.1109/ICPWC.1997.655500\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents and analyses the performance of a novel channel sharing protocol. The protocol uses the p-persistence algorithm to access the channel and a token for fair channel sharing. Token passing is controlled by a base station (BS). A user, PS, can join a channel if the channel is idle. Channel idle information is given by an idle token from the BS. Numerical results of the protocol are given in terms of load, G and throughput, S. Numerical results are also compared with that of carrier sense multiple access protocol with collision avoidance (CSMA/CA). Results show that the proposed scheme outperforms CSMA/CA when the number of channels are three or more.\",\"PeriodicalId\":166667,\"journal\":{\"name\":\"1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPWC.1997.655500\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPWC.1997.655500","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Capacity enhancement of indoor wireless communication system with a novel channel sharing protocol
This paper presents and analyses the performance of a novel channel sharing protocol. The protocol uses the p-persistence algorithm to access the channel and a token for fair channel sharing. Token passing is controlled by a base station (BS). A user, PS, can join a channel if the channel is idle. Channel idle information is given by an idle token from the BS. Numerical results of the protocol are given in terms of load, G and throughput, S. Numerical results are also compared with that of carrier sense multiple access protocol with collision avoidance (CSMA/CA). Results show that the proposed scheme outperforms CSMA/CA when the number of channels are three or more.