An efficient broadcast scheduling algorithm for TDMA ad-hoc networks

被引:54
作者
Yeo, J
Lee, H
Kim, S
机构
[1] Korea Adv Inst Sci & Technol, Dept Ind Engn, Yusong Gu, Taejon 305701, South Korea
[2] ETRI, Wireless Ind Res Team, Yusong Gu, Taejon 305350, South Korea
[3] ETRI, Radio & Broadcasting Technol Lab, Yusong Gu, Taejon 305350, South Korea
关键词
TDMA ad-hoc network; broadcast scheduling; vertex coloring;
D O I
10.1016/S0305-0548(01)00057-0
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, we propose an efficient algorithm to find a collision-free time slot schedule in a time division multiple access frame. In order to minimize the system delay, the optimal schedule must be defined as the one that has the minimum frame length and provides the maximum slot utilization. The proposed algorithm is based on the sequential vertex coloring algorithm. Numerical examples and comparisons with the algorithm in previous research have shown that the proposed algorithm can find near-optimal solutions in respect of the system delay.
引用
收藏
页码:1793 / 1806
页数:14
相关论文
共 18 条
[1]  
ARIKAN E, 1984, IEEE T INFORMATION T, V30
[2]  
BAKER D, 1984, IEEE J SELECTED AREA, V2
[3]  
Baker D., 1981, IEEE T COMMUNICATION, V29
[4]  
BRELAZ D, 1979, COMMUNICATIONS ACM, V22
[5]  
Christofides N, 1975, GRAPH THEORY ALGORIT
[6]  
CIDON I, 1989, IEEE T COMPUTERS, V38
[7]  
EPHREMIDES A, 1990, IEEE T COMMUNICATION, V38
[8]  
EVEN S, 1984, NETWORKS, V14
[9]  
FUNABIKI N, 1993, IEEE T COMMUNICATION, V41
[10]  
Hertz J., 1991, Introduction to the Theory of Neural Computation