{"title":"无线网络中联合路由调度算法","authors":"L. Tassiulas, A. Ephremides","doi":"10.23919/ACC.1989.4790482","DOIUrl":null,"url":null,"abstract":"The problem of evacuation in minimum time of a PRN is considered. We decompose the problem into a scheduling problem for one hop neighbor transmissions and a routing problem. We propose an iterative algorithm for the routing problem. Finally we view the routing problem as a sequence of maxflow problems.","PeriodicalId":383719,"journal":{"name":"1989 American Control Conference","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An Algorithm for Joint Routing and Scheduling in Radio Networks\",\"authors\":\"L. Tassiulas, A. Ephremides\",\"doi\":\"10.23919/ACC.1989.4790482\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of evacuation in minimum time of a PRN is considered. We decompose the problem into a scheduling problem for one hop neighbor transmissions and a routing problem. We propose an iterative algorithm for the routing problem. Finally we view the routing problem as a sequence of maxflow problems.\",\"PeriodicalId\":383719,\"journal\":{\"name\":\"1989 American Control Conference\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1989 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ACC.1989.4790482\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1989 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ACC.1989.4790482","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Algorithm for Joint Routing and Scheduling in Radio Networks
The problem of evacuation in minimum time of a PRN is considered. We decompose the problem into a scheduling problem for one hop neighbor transmissions and a routing problem. We propose an iterative algorithm for the routing problem. Finally we view the routing problem as a sequence of maxflow problems.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
