JOINTLY OPTIMAL ROUTING AND SCHEDULING IN PACKET RADIO NETWORKS

被引:64
作者
TASSIULAS, L [1 ]
EPHREMIDES, A [1 ]
机构
[1] UNIV MARYLAND,DEPT ELECT ENGN,COLLEGE PK,MD 20742
关键词
RADIO NETWORKS; SCHEDULING; ROUTING; THROUGHPUT; MULTIPLE ACCESS; DELAY; PROTOCOL; NETWORK TOPOLOGY;
D O I
10.1109/18.108264
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A multihop packet radio network is considered with a single traffic class and given end-to-end transmission requirements. A transmission schedule specifies at each time instant the set of links which are allowed to transmit. The purpose of a schedule is to prevent interference among transmissions from neighboring links. Given amounts of information are residing initially at a subset of the network nodes and must be delivered to a prespecified set of destination nodes. The transmission schedule that evacuates the network in minimum time is specified. The decomposition of the problem into a pure routing and a pure scheduling problem is crucial for the characterization of the optimal transmission schedule.
引用
收藏
页码:165 / 168
页数:4
相关论文
共 7 条
[1]  
BAKER DJ, 1982, JUN IEEE INT C COMM
[2]  
CIDON J, 1989, IEEE T COMPUT, V38
[3]  
HAJEK B, 1989, IEEE T INFORM THEORY, V34, P910
[4]  
HAJEK B, 1984, 1984 P C INF SCI SYS, P498
[5]  
KLEINROCK L, QUEUEING SYSTEMS, V2
[6]  
POST MJ, SCHEDULING MULTIHOP
[7]  
TASSIULAS L, 1989, THESIS U MARYLAND CO