Topology-transparent time division multiple access broadcast scheduling in multihop packet radio-networks

被引:37
作者
Cai, ZJ [1 ]
Lu, M [1 ]
Georghiades, CN [1 ]
机构
[1] Texas A&M Univ, Dept Elect Engn, College Stn, TX 77843 USA
关键词
Latin square design (LSD); modified Galois field design (MGD); multichannel Galois field design (MCGD); packet radio networks; time division multiple access (TDMA);
D O I
10.1109/TVT.2002.807634
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Many topology-dependent transmission scheduling algorithms have been proposed to minimize the time-division multiple-access frame length in multihop packet radio networks (MPRNs), in which changes of the topology inevitably require recomputation of the schedules. The need for constant adaptation of schedules-to-mobile topology entails significant problems, especially in the highly dynamic mobile environments. Hence, topology-transparent scheduling algorithms have been proposed, which utilize Galois field theory and Latin squares theory. In this paper, we discuss the topology-transparent broadcast scheduling design for MPRNs. For single-channel networks, we propose the modified Galois field design (MGD) and the Latin square design (LSD) for topology-transparent broadcast scheduling. The MGD obtains much smaller minimum frame length (MFL) than the existing scheme while the LSD can even achieve possible performance gain when compared with the MGD, under. certain conditions. Moreover, the inner relationship between scheduling designs based on different theories is revealed and proved, which provides valuable insight. For the topology-transparent broadcast scheduling in multichannel networks, in which little research has been done, the proposed multichannel Galois field design (MCGD) can reduce the MFL approximately M times, as compared with the MGD when M channels are available. Numerical results show that the proposed algorithms outperform existing algorithms in achieving a smaller MFL.
引用
收藏
页码:970 / 984
页数:15
相关论文
共 15 条
[1]  
[Anonymous], 1974, LATIN SQUARES THEIR
[2]  
[Anonymous], P 8 ANN JOINT C IEEE
[3]   THE ARCHITECTURAL ORGANIZATION OF A MOBILE RADIO NETWORK VIA A DISTRIBUTED ALGORITHM [J].
BAKER, DJ ;
EPHREMIDES, A .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (11) :1694-1701
[4]   MAKING TRANSMISSION SCHEDULES IMMUNE TO TOPOLOGY CHANGES IN MULTIHOP PACKET RADIO NETWORKS [J].
CHLAMTAC, I ;
FARAGO, A .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1994, 2 (01) :23-29
[5]  
CHOU AM, 1992, P IEEE INFOCOM 92, P710
[6]   SCHEDULING BROADCASTS IN MULTIHOP RADIO NETWORKS [J].
EPHREMIDES, A ;
TRUONG, TV .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1990, 38 (04) :456-460
[7]   LINK SCHEDULING IN POLYNOMIAL-TIME [J].
HAJEK, B ;
SASAKI, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :910-917
[8]   TRANSMISSION RANGE CONTROL IN MULTIHOP PACKET RADIO NETWORKS [J].
HOU, TC ;
LI, VOK .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1986, 34 (01) :38-44
[9]  
Hu L., 1991, P IEEE INFOCOM 91, P1084
[10]  
HUNG K, 1992, P IEEE GLOBECOM 92, P6