Time Reuse algorithms: A novel approach to solving the issue of scalability in dense power line networks

S. Galli, Y. Masuda, Yoshio Urabe
{"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}
引用次数: 8

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
时间复用算法:解决密集电力线网络可扩展性问题的一种新方法
电力线(PL)信道是一种共享介质,信道容量在一组用户之间共享。随着网络节点(用户)数量的增加,每个用户的可用吞吐量都会减少。虽然点对点PL链路的吞吐量最大化问题已经在PL文献中得到了广泛的解决,但到目前为止,随着PL网络节点数量的增加,网络吞吐量减少的问题已经做得很少。本文首次解决了这个问题,并提出了允许时间重用(TR)的算法,即节点检测何时可能同时传输到其他相邻设备而不会对彼此造成有害干扰的能力。本文提出了一种TR算法,仿真结果证实了该算法在保证网络节点数量增加时的可扩展性方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Optimal time slot design in an OFDM-TDMA system over power-line time-variant channels Hidden terminal of Korea Standard PLC protocol in access network Phase based SNR estimation in OFDM over the medium voltage network Experimental verification of common-mode current generation in home electrical wiring in the Powerline Communications Band On the design of filter bank systems in Power Line Channels Based on Achievable Rate
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1