{"title":"An interference-free multicast for mesh networks with directional antennas","authors":"Wen-Lin Yang, Cheng-Huang Tung","doi":"10.1109/ICUFN.2009.5174306","DOIUrl":null,"url":null,"abstract":"In this study, we consider an optimization problem concerning about how to build a multicast tree to deliver continuous multimedia streams to a large number of mesh clients on the wireless mesh networks simultaneously. In order to provide high-quality streams to users, we need to allocate non-overlapping channels to communication links to avoid interference. Since the number of non-overlapping channels is very limited, some links may not have channels allocated, and the resulting multicast tree may cover only a subset of subscribers. Since the more subscribers can be serviced, the more profits we can make. The goal of this research is then set to determine a multicast tree that can maximize the number of serviced subscribers. An algorithm named LCMR is proposed for the problem described above. The experimental results show that the partial multicast tree determined by our LCMR method outperforms the trees found by the previous published approaches.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 First International Conference on Ubiquitous and Future Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUFN.2009.5174306","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this study, we consider an optimization problem concerning about how to build a multicast tree to deliver continuous multimedia streams to a large number of mesh clients on the wireless mesh networks simultaneously. In order to provide high-quality streams to users, we need to allocate non-overlapping channels to communication links to avoid interference. Since the number of non-overlapping channels is very limited, some links may not have channels allocated, and the resulting multicast tree may cover only a subset of subscribers. Since the more subscribers can be serviced, the more profits we can make. The goal of this research is then set to determine a multicast tree that can maximize the number of serviced subscribers. An algorithm named LCMR is proposed for the problem described above. The experimental results show that the partial multicast tree determined by our LCMR method outperforms the trees found by the previous published approaches.