二维无线网络协同广播的增益分析

Keyvan Gharouni Saffar, M. Khabbazian
{"title":"二维无线网络协同广播的增益分析","authors":"Keyvan Gharouni Saffar, M. Khabbazian","doi":"10.23919/SOFTCOM.2017.8115540","DOIUrl":null,"url":null,"abstract":"Energy accumulation is an approach to reducing the power consumption of broadcast. In conventional approaches, a node can decode the message if the received power from a single transmission is above a threshold. In contrast, in the cooperative approach based on energy accumulation, a node can decode the message if the sum of the received powers from any set of transmissions exceeds the threshold. An important question is how much energy can be saved in broadcast if energy accumulation is employed. Since employing energy accumulation adds extra design complexities, answering this question can help in deciding whether or not it should be implemented. Previously, it was shown that this saving is limited in linear wireless networks, irrespective of the network size, and the location of the nodes in the network. In this work, however, we show that this saving can increase with the network size in two-dimensional networks. Also, despite the fact that both problems of cooperative and non-cooperative broadcast with minimum energy are NP-hard, we establish a bound on the maximum saving that can be obtained.","PeriodicalId":189860,"journal":{"name":"2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Gain analysis of cooperative broadcast in two-dimensional wireless networks\",\"authors\":\"Keyvan Gharouni Saffar, M. Khabbazian\",\"doi\":\"10.23919/SOFTCOM.2017.8115540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Energy accumulation is an approach to reducing the power consumption of broadcast. In conventional approaches, a node can decode the message if the received power from a single transmission is above a threshold. In contrast, in the cooperative approach based on energy accumulation, a node can decode the message if the sum of the received powers from any set of transmissions exceeds the threshold. An important question is how much energy can be saved in broadcast if energy accumulation is employed. Since employing energy accumulation adds extra design complexities, answering this question can help in deciding whether or not it should be implemented. Previously, it was shown that this saving is limited in linear wireless networks, irrespective of the network size, and the location of the nodes in the network. In this work, however, we show that this saving can increase with the network size in two-dimensional networks. Also, despite the fact that both problems of cooperative and non-cooperative broadcast with minimum energy are NP-hard, we establish a bound on the maximum saving that can be obtained.\",\"PeriodicalId\":189860,\"journal\":{\"name\":\"2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/SOFTCOM.2017.8115540\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/SOFTCOM.2017.8115540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

能量积累是降低广播能耗的一种方法。在传统方法中,如果从单个传输接收的功率高于阈值,则节点可以解码消息。相反,在基于能量积累的合作方法中,如果从任何一组传输中接收到的功率总和超过阈值,则节点可以解码消息。一个重要的问题是,如果采用能量积累,在广播中可以节省多少能量。由于使用能量积累会增加额外的设计复杂性,因此回答这个问题有助于决定是否应该实现它。之前的研究表明,无论网络大小和网络中节点的位置如何,这种节省在线性无线网络中都是有限的。然而,在这项工作中,我们表明,在二维网络中,这种节省可以随着网络规模的增加而增加。此外,尽管最小能量的合作广播和非合作广播都是np困难问题,但我们建立了可以获得的最大节省的界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Gain analysis of cooperative broadcast in two-dimensional wireless networks
Energy accumulation is an approach to reducing the power consumption of broadcast. In conventional approaches, a node can decode the message if the received power from a single transmission is above a threshold. In contrast, in the cooperative approach based on energy accumulation, a node can decode the message if the sum of the received powers from any set of transmissions exceeds the threshold. An important question is how much energy can be saved in broadcast if energy accumulation is employed. Since employing energy accumulation adds extra design complexities, answering this question can help in deciding whether or not it should be implemented. Previously, it was shown that this saving is limited in linear wireless networks, irrespective of the network size, and the location of the nodes in the network. In this work, however, we show that this saving can increase with the network size in two-dimensional networks. Also, despite the fact that both problems of cooperative and non-cooperative broadcast with minimum energy are NP-hard, we establish a bound on the maximum saving that can be obtained.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信