On minimum-energy broadcasting in all-wireless networks

Fulu Li, I. Nikolaidis
{"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.
全无线网络中的最小能耗广播
我们研究了源发起(一对所有)无线广播树的构造,以最小化给定源节点、一组预期目标节点和给定传播常数(即功率衰减常数/spl lambda/)所需的总功率。由于移动通信面临无线网络带宽有限和移动设备供电有限这两大挑战,最小能量广播(MEB)问题近年来备受关注。在有限带宽的环境中,基于推送的技术,即广播方案,似乎是一种非常有效的方式,允许移动设备在空中共享广播数据。在能源有限的环境中,节能的通信架构和技术是必不可少的。我们首先对MEB问题进行了深入分析,并证明了该问题的np -硬度。然后,我们提出了一种称为迭代最大分支最小化(IMBM)的有效启发式方法来近似构造最小能量广播树,该方法充分利用了无线广播的优势,并且与相关方法相比具有更好的性能。由于广播树的构造方式节能,可以使网络的生存时间最大化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信