分组无线网中的路由和调度

2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488) Pub Date : 2000-12-17 DOI:10.1109/ICPWC.2000.905832

M.M. Sekhar, K. Sivarajan

{"title":"分组无线网中的路由和调度","authors":"M.M. Sekhar, K. Sivarajan","doi":"10.1109/ICPWC.2000.905832","DOIUrl":null,"url":null,"abstract":"A new approach for channel assignment in packet radio networks is presented. To arrive at this: (1) we show the difficulty with the traditional graph coloring method for link scheduling; (2) an algorithm for generating maximal independent sets of links is presented; (3) the importance of combined routing and scheduling is shown and an LP problem is formulated for combined routing and scheduling.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Routing and scheduling in packet radio networks\",\"authors\":\"M.M. Sekhar, K. Sivarajan\",\"doi\":\"10.1109/ICPWC.2000.905832\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new approach for channel assignment in packet radio networks is presented. To arrive at this: (1) we show the difficulty with the traditional graph coloring method for link scheduling; (2) an algorithm for generating maximal independent sets of links is presented; (3) the importance of combined routing and scheduling is shown and an LP problem is formulated for combined routing and scheduling.\",\"PeriodicalId\":260472,\"journal\":{\"name\":\"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPWC.2000.905832\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPWC.2000.905832","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

提出了一种分组无线网络中信道分配的新方法。为此:(1)揭示了传统的图着色方法在链路调度问题上的难点;(2)提出了一种生成最大独立链路集的算法;(3)说明了组合布线与调度的重要性，并提出了组合布线与调度的LP问题。

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

查看原文本刊更多论文

Routing and scheduling in packet radio networks

A new approach for channel assignment in packet radio networks is presented. To arrive at this: (1) we show the difficulty with the traditional graph coloring method for link scheduling; (2) an algorithm for generating maximal independent sets of links is presented; (3) the importance of combined routing and scheduling is shown and an LP problem is formulated for combined routing and scheduling.

求助全文

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

来源期刊

2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)

自引率

0.00%

发文量