{"title":"Potential performance of PLC systems composed of several communication links","authors":"V. Balakirsky, A. H. Han Vinck","doi":"10.1109/ISPLC.2005.1430456","DOIUrl":null,"url":null,"abstract":"We consider data transmission over a bus system composed of several communication links. All users of the system simultaneously receive transmitted signals with different reliabilities depending on their distance from the sender. Two possible ways of organizing communication are analyzed. The first algorithm includes transmission in a few steps, where each step is devoted to a reliable delivery of the message from one intermediate user to another one. All other users exclude themselves from the system for this step. The second algorithm assumes that all users of the system are active all the time, and they receive side information from communication of intermediate users, which allows them to reduce uncertainty about the original message. Lower bounds on the time needed to deliver a message over the system that follow from the capacity arguments for both methods are given. These bounds are illustrated by numerical examples.","PeriodicalId":153251,"journal":{"name":"International Symposium on Power Line Communications and Its Applications, 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Power Line Communications and Its Applications, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPLC.2005.1430456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32
Abstract
We consider data transmission over a bus system composed of several communication links. All users of the system simultaneously receive transmitted signals with different reliabilities depending on their distance from the sender. Two possible ways of organizing communication are analyzed. The first algorithm includes transmission in a few steps, where each step is devoted to a reliable delivery of the message from one intermediate user to another one. All other users exclude themselves from the system for this step. The second algorithm assumes that all users of the system are active all the time, and they receive side information from communication of intermediate users, which allows them to reduce uncertainty about the original message. Lower bounds on the time needed to deliver a message over the system that follow from the capacity arguments for both methods are given. These bounds are illustrated by numerical examples.