{"title":"On minimum-energy broadcasting in all-wireless networks","authors":"Fulu Li, I. Nikolaidis","doi":"10.1109/LCN.2001.990787","DOIUrl":null,"url":null,"abstract":"We study the construction of the source-initiated (one-to-all) wireless broadcast tree to minimize the total required power for a given source node, a group of intended destination nodes and a given propagation constant, ie, the power attenuation constant /spl lambda/. The minimum energy broadcasting (MEB) problem has received much attention recently due to the two main challenges of mobile communication: the limited bandwidth of wireless networks and the limited power supply of mobile units. In a limited-bandwidth environment, push-based techniques, ie, broadcast schemes, appear to be a very effective way to allow mobile units to share the broadcast data on air. In a limited-energy environment, energy- efficient communication architectures and techniques are essential. We first give an insight analysis on the MEB problem and prove the NP-hardness of this problem. We then present an efficient heuristic called iterative maximum-branch minimization (IMBM) to approximate the construction of the minimum-energy broadcast tree, which fully utilizes the wireless broadcast advantage and demonstrates better performance compared with the related approaches. Due to the power-efficient way of the construction of the broadcast tree, the lifetime of the networks can be maximized.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"134","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2001.990787","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 134
Abstract
We study the construction of the source-initiated (one-to-all) wireless broadcast tree to minimize the total required power for a given source node, a group of intended destination nodes and a given propagation constant, ie, the power attenuation constant /spl lambda/. The minimum energy broadcasting (MEB) problem has received much attention recently due to the two main challenges of mobile communication: the limited bandwidth of wireless networks and the limited power supply of mobile units. In a limited-bandwidth environment, push-based techniques, ie, broadcast schemes, appear to be a very effective way to allow mobile units to share the broadcast data on air. In a limited-energy environment, energy- efficient communication architectures and techniques are essential. We first give an insight analysis on the MEB problem and prove the NP-hardness of this problem. We then present an efficient heuristic called iterative maximum-branch minimization (IMBM) to approximate the construction of the minimum-energy broadcast tree, which fully utilizes the wireless broadcast advantage and demonstrates better performance compared with the related approaches. Due to the power-efficient way of the construction of the broadcast tree, the lifetime of the networks can be maximized.