无线传感器网络中联合功率分配与传输时间选择

Christos N. Efrem, A. Panagopoulos
{"title":"无线传感器网络中联合功率分配与传输时间选择","authors":"Christos N. Efrem, A. Panagopoulos","doi":"10.1109/GIIS.2018.8635725","DOIUrl":null,"url":null,"abstract":"Energy-aware resource allocation plays an important role in battery-limited wireless sensor networks (WSNs), as it improves network performance, in terms of energy savings, and prolongs network lifetime as well. In this paper, we study a duty-cycled WSN where the sensor nodes transmit their data simultaneously to a central access point and then return to sleep mode (this process is repeated in each time period). In particular, we propose a joint power allocation and transmission time selection algorithm in order to minimize the maximum energy consumption of the sensor nodes, under power and time constraints as well as quality-of-service (QoS) requirements. In the problem formulation, we also take into account the circuit energy consumption of each sensor node. Moreover, the proposed algorithm, which is based on a successive convex approximation method, converges very quickly and achieves a Karush-Kuhn-Tucker (KKT) solution for the problem. Finally, numerical results reveal that the proposed technique provides significant performance gain when compared to a baseline scheme.","PeriodicalId":318525,"journal":{"name":"2018 Global Information Infrastructure and Networking Symposium (GIIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Joint Power Allocation and Transmission Time Selection in Duty-cycled Wireless Sensor Networks\",\"authors\":\"Christos N. Efrem, A. Panagopoulos\",\"doi\":\"10.1109/GIIS.2018.8635725\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Energy-aware resource allocation plays an important role in battery-limited wireless sensor networks (WSNs), as it improves network performance, in terms of energy savings, and prolongs network lifetime as well. In this paper, we study a duty-cycled WSN where the sensor nodes transmit their data simultaneously to a central access point and then return to sleep mode (this process is repeated in each time period). In particular, we propose a joint power allocation and transmission time selection algorithm in order to minimize the maximum energy consumption of the sensor nodes, under power and time constraints as well as quality-of-service (QoS) requirements. In the problem formulation, we also take into account the circuit energy consumption of each sensor node. Moreover, the proposed algorithm, which is based on a successive convex approximation method, converges very quickly and achieves a Karush-Kuhn-Tucker (KKT) solution for the problem. Finally, numerical results reveal that the proposed technique provides significant performance gain when compared to a baseline scheme.\",\"PeriodicalId\":318525,\"journal\":{\"name\":\"2018 Global Information Infrastructure and Networking Symposium (GIIS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Global Information Infrastructure and Networking Symposium (GIIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GIIS.2018.8635725\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Global Information Infrastructure and Networking Symposium (GIIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GIIS.2018.8635725","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在电池有限的无线传感器网络(WSNs)中,能量感知的资源分配具有重要的作用,因为它可以提高网络性能、节约能源并延长网络寿命。在本文中,我们研究了一个占空比WSN,其中传感器节点将其数据同时传输到中心接入点,然后返回到睡眠模式(该过程在每个时间段重复)。特别是,我们提出了一种联合功率分配和传输时间选择算法,以便在功率和时间约束以及服务质量(QoS)要求下最小化传感器节点的最大能量消耗。在问题的表述中,我们还考虑了每个传感器节点的电路能耗。此外,该算法基于连续凸逼近方法,收敛速度非常快,并实现了问题的Karush-Kuhn-Tucker (KKT)解。最后,数值结果表明,与基线方案相比,该技术提供了显着的性能增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint Power Allocation and Transmission Time Selection in Duty-cycled Wireless Sensor Networks
Energy-aware resource allocation plays an important role in battery-limited wireless sensor networks (WSNs), as it improves network performance, in terms of energy savings, and prolongs network lifetime as well. In this paper, we study a duty-cycled WSN where the sensor nodes transmit their data simultaneously to a central access point and then return to sleep mode (this process is repeated in each time period). In particular, we propose a joint power allocation and transmission time selection algorithm in order to minimize the maximum energy consumption of the sensor nodes, under power and time constraints as well as quality-of-service (QoS) requirements. In the problem formulation, we also take into account the circuit energy consumption of each sensor node. Moreover, the proposed algorithm, which is based on a successive convex approximation method, converges very quickly and achieves a Karush-Kuhn-Tucker (KKT) solution for the problem. Finally, numerical results reveal that the proposed technique provides significant performance gain when compared to a baseline scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信