A ROBUST MULTI-PRIORITY TOPOLOGY-INDEPENDENT TRANSMISSION SCHEDULE FOR PACKET RADIO NETWORKS

被引：8

作者：

BOZTAS, S

机构：

[1] Centre for Telecommunications and Information Engineering, Monash University, Clayton

来源：

INFORMATION PROCESSING LETTERS | 1995年 / 55卷 / 05期

关键词：

DESIGN OF ALGORITHMS; COMMUNICATION NETWORKS; MATHEMATICAL METHODS; PACKET RADIO NETWORKS;

D O I：

10.1016/0020-0190(95)00098-W

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Chlamtac and Farago have introduced a Transmission Scheduling (TS) algorithm called the (Proper Robust Scheduling) PRS algorithm, which will work for an arbitrary network topology with N stations and maximum degree D and produce a schedule of length L = o(N). They use polynomials over GF(q) to achieve this. A generalization of their algorithm, called Multi Level (ML-)PRS is introduced here which makes use of the subfield structure of GF(q) to support multiple classes of users, with different transmission characteristics.

引用

页码：291 / 295

页数：5