{"title":"Faster radio broadcasting in planar graphs","authors":"F. Manne, S. Wang, Q. Xin","doi":"10.1109/WONS.2007.340467","DOIUrl":null,"url":null,"abstract":"We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network. We show that radio broadcasting can be completed in D+O(logn) time units in planar graphs of size n, diameter D, which improves the currently best known D+O(log3 n) time schedule proposed by Elkin and Kortsarz in (2005) [SODA'05], and 3D time schedule due to Gasieniec, Peleg and Xin in (2005) [PODC'05]","PeriodicalId":151450,"journal":{"name":"2007 Fourth Annual Conference on Wireless on Demand Network Systems and Services","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Fourth Annual Conference on Wireless on Demand Network Systems and Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WONS.2007.340467","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network. We show that radio broadcasting can be completed in D+O(logn) time units in planar graphs of size n, diameter D, which improves the currently best known D+O(log3 n) time schedule proposed by Elkin and Kortsarz in (2005) [SODA'05], and 3D time schedule due to Gasieniec, Peleg and Xin in (2005) [PODC'05]
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
