{"title":"时间复用算法:解决密集电力线网络可扩展性问题的一种新方法","authors":"S. Galli, Y. Masuda, Yoshio Urabe","doi":"10.1109/ISPLC.2009.4913412","DOIUrl":null,"url":null,"abstract":"The power line (PL) channel is a shared medium and channel capacity is shared among a set of users. As the number of network nodes (users) increases, each user experiences a reduction in the available throughput. Although the issue of throughput maximization in point-to-point PL links has been vastly addressed in the PL literature, very little has been done to this date on the problem of network throughout reduction as the number of PL network nodes increases. This paper address for the first time this issue and proposes algorithms that allow Time Reuse (TR), i.e. the capability of nodes to detect when it is possible to transmit simultaneously to other neighboring devices without causing harmful interference to each other. A TR algorithm is here presented and simulations results confirm its effectiveness in ensuring scalability as the number of network nodes in the network increase.","PeriodicalId":321296,"journal":{"name":"2009 IEEE International Symposium on Power Line Communications and Its Applications","volume":"152 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Time Reuse algorithms: A novel approach to solving the issue of scalability in dense power line networks\",\"authors\":\"S. Galli, Y. Masuda, Yoshio Urabe\",\"doi\":\"10.1109/ISPLC.2009.4913412\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The power line (PL) channel is a shared medium and channel capacity is shared among a set of users. As the number of network nodes (users) increases, each user experiences a reduction in the available throughput. Although the issue of throughput maximization in point-to-point PL links has been vastly addressed in the PL literature, very little has been done to this date on the problem of network throughout reduction as the number of PL network nodes increases. This paper address for the first time this issue and proposes algorithms that allow Time Reuse (TR), i.e. the capability of nodes to detect when it is possible to transmit simultaneously to other neighboring devices without causing harmful interference to each other. A TR algorithm is here presented and simulations results confirm its effectiveness in ensuring scalability as the number of network nodes in the network increase.\",\"PeriodicalId\":321296,\"journal\":{\"name\":\"2009 IEEE International Symposium on Power Line Communications and Its Applications\",\"volume\":\"152 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Power Line Communications and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPLC.2009.4913412\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Power Line Communications and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPLC.2009.4913412","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Time Reuse algorithms: A novel approach to solving the issue of scalability in dense power line networks
The power line (PL) channel is a shared medium and channel capacity is shared among a set of users. As the number of network nodes (users) increases, each user experiences a reduction in the available throughput. Although the issue of throughput maximization in point-to-point PL links has been vastly addressed in the PL literature, very little has been done to this date on the problem of network throughout reduction as the number of PL network nodes increases. This paper address for the first time this issue and proposes algorithms that allow Time Reuse (TR), i.e. the capability of nodes to detect when it is possible to transmit simultaneously to other neighboring devices without causing harmful interference to each other. A TR algorithm is here presented and simulations results confirm its effectiveness in ensuring scalability as the number of network nodes in the network increase.