{"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}
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.