多跳网络中的新调度问题及其复杂性结果

The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04. Pub Date : 2004-07-25 DOI:10.1109/MWSCAS.2004.1354201

K. Watanabe, H. Tamura, M. Sengoku

{"title":"多跳网络中的新调度问题及其复杂性结果","authors":"K. Watanabe, H. Tamura, M. Sengoku","doi":"10.1109/MWSCAS.2004.1354201","DOIUrl":null,"url":null,"abstract":"The link scheduling problem and broadcast scheduling problem have been discussed as graph theory. These scheduling problems are channels/time-slots assignment problems in a multi-hop network. It is known that the scheduling problems are NP-hard. We propose new extended scheduling problems. These scheduling problems can be applied to CDMA system. We show that the extended scheduling problems are NP-hard.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New scheduling problems in a multi-hop network and their complexity results\",\"authors\":\"K. Watanabe, H. Tamura, M. Sengoku\",\"doi\":\"10.1109/MWSCAS.2004.1354201\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The link scheduling problem and broadcast scheduling problem have been discussed as graph theory. These scheduling problems are channels/time-slots assignment problems in a multi-hop network. It is known that the scheduling problems are NP-hard. We propose new extended scheduling problems. These scheduling problems can be applied to CDMA system. We show that the extended scheduling problems are NP-hard.\",\"PeriodicalId\":185817,\"journal\":{\"name\":\"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MWSCAS.2004.1354201\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.2004.1354201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

用图论的方法讨论了链路调度问题和广播调度问题。这些调度问题是多跳网络中的信道/时隙分配问题。众所周知，调度问题是np困难的。我们提出了新的扩展调度问题。这些调度问题可以应用于CDMA系统。我们证明了扩展调度问题是np困难的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

New scheduling problems in a multi-hop network and their complexity results

The link scheduling problem and broadcast scheduling problem have been discussed as graph theory. These scheduling problems are channels/time-slots assignment problems in a multi-hop network. It is known that the scheduling problems are NP-hard. We propose new extended scheduling problems. These scheduling problems can be applied to CDMA system. We show that the extended scheduling problems are NP-hard.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.

自引率

0.00%

发文量