海报摘要:一种基于零和博弈的分布式路由方案,用于优化太阳能传感器网络中的能量

Ahmad H. Dehwah, H. Tembine, C. Claudel
{"title":"海报摘要:一种基于零和博弈的分布式路由方案,用于优化太阳能传感器网络中的能量","authors":"Ahmad H. Dehwah, H. Tembine, C. Claudel","doi":"10.5555/2602339.2602376","DOIUrl":null,"url":null,"abstract":"This poster is aimed at solving the problem of maximizing the energy margin of a solar-powered sensor network at a fixed time horizon, to maximize the network performance during an event to monitor. Using a game theoretic approach, the optimal routing maximizing the energy margin of the network at a given time under solar power forcing can be computed in a decentralized way and solved exactly through dynamic programming with a low overall complexity. We also show that this decentralized algorithm is simple enough to be implemented on practical sensor nodes. Such an algorithm would be very useful whenever the energy margin of a solar-powered sensor network has to be maximized at a specific time.","PeriodicalId":297218,"journal":{"name":"IPSN-14 Proceedings of the 13th International Symposium on Information Processing in Sensor Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Poster abstract: A decentralized routing scheme based on a zero-sum game to optimize energy in solar powered sensor networks\",\"authors\":\"Ahmad H. Dehwah, H. Tembine, C. Claudel\",\"doi\":\"10.5555/2602339.2602376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This poster is aimed at solving the problem of maximizing the energy margin of a solar-powered sensor network at a fixed time horizon, to maximize the network performance during an event to monitor. Using a game theoretic approach, the optimal routing maximizing the energy margin of the network at a given time under solar power forcing can be computed in a decentralized way and solved exactly through dynamic programming with a low overall complexity. We also show that this decentralized algorithm is simple enough to be implemented on practical sensor nodes. Such an algorithm would be very useful whenever the energy margin of a solar-powered sensor network has to be maximized at a specific time.\",\"PeriodicalId\":297218,\"journal\":{\"name\":\"IPSN-14 Proceedings of the 13th International Symposium on Information Processing in Sensor Networks\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IPSN-14 Proceedings of the 13th International Symposium on Information Processing in Sensor Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5555/2602339.2602376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IPSN-14 Proceedings of the 13th International Symposium on Information Processing in Sensor Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5555/2602339.2602376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

这张海报旨在解决在固定时间范围内最大化太阳能传感器网络的能量余量的问题,以最大化监测事件期间的网络性能。利用博弈论方法,可以分散计算给定时间内太阳能发电强迫下网络能量裕度最大的最优路径,并通过动态规划精确求解,整体复杂度较低。我们还表明,这种分散的算法足够简单,可以在实际的传感器节点上实现。这种算法在太阳能传感器网络的能量余量必须在特定时间最大化时非常有用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Poster abstract: A decentralized routing scheme based on a zero-sum game to optimize energy in solar powered sensor networks
This poster is aimed at solving the problem of maximizing the energy margin of a solar-powered sensor network at a fixed time horizon, to maximize the network performance during an event to monitor. Using a game theoretic approach, the optimal routing maximizing the energy margin of the network at a given time under solar power forcing can be computed in a decentralized way and solved exactly through dynamic programming with a low overall complexity. We also show that this decentralized algorithm is simple enough to be implemented on practical sensor nodes. Such an algorithm would be very useful whenever the energy margin of a solar-powered sensor network has to be maximized at a specific time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信