给定聚合树下的收敛调度问题:复杂性现状及一些特殊情况

A. Erzin, A. Pyatkin
{"title":"给定聚合树下的收敛调度问题:复杂性现状及一些特殊情况","authors":"A. Erzin, A. Pyatkin","doi":"10.1109/CSNDSP.2016.7574007","DOIUrl":null,"url":null,"abstract":"We consider the problem of conflict-free data aggregation in distributed wireless radio networks, that is known as a Convergecast Scheduling Problem. This problem is strongly NP-hard in general. However the complexity status of the problem remained open in the case when the aggregation tree was given. We have proved that in this case, the problem is also NP-hard. Additionally, we proposed several new approximate suboptimal solutions in the special cases of the problem on the grid graphs.","PeriodicalId":298711,"journal":{"name":"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)","volume":"6 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases\",\"authors\":\"A. Erzin, A. Pyatkin\",\"doi\":\"10.1109/CSNDSP.2016.7574007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of conflict-free data aggregation in distributed wireless radio networks, that is known as a Convergecast Scheduling Problem. This problem is strongly NP-hard in general. However the complexity status of the problem remained open in the case when the aggregation tree was given. We have proved that in this case, the problem is also NP-hard. Additionally, we proposed several new approximate suboptimal solutions in the special cases of the problem on the grid graphs.\",\"PeriodicalId\":298711,\"journal\":{\"name\":\"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)\",\"volume\":\"6 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSNDSP.2016.7574007\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNDSP.2016.7574007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

研究分布式无线网络中无冲突的数据聚合问题,即聚合调度问题。一般来说,这个问题是强np困难的。然而,在给定聚合树的情况下,问题的复杂性状态仍然是开放的。我们已经证明,在这种情况下,问题也是np困难的。此外,我们在网格图的特殊情况下提出了几个新的近似次优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases
We consider the problem of conflict-free data aggregation in distributed wireless radio networks, that is known as a Convergecast Scheduling Problem. This problem is strongly NP-hard in general. However the complexity status of the problem remained open in the case when the aggregation tree was given. We have proved that in this case, the problem is also NP-hard. Additionally, we proposed several new approximate suboptimal solutions in the special cases of the problem on the grid graphs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信