Slot assignment algorithm
First Claim
1. A method for dynamically scheduling communications to a plurality of receivers over a TDMA channel that is partitioned into frames each consisting of slots, comprising the steps of:
- measuring a channel condition of each receiver;
dividing the receivers into receiver groups according their channel conditions;
partitioning the TDMA channel into a recurring sequence of slots;
dividing each sequence into a certain number of slot groups; and
allocating the slot groups to the receiver groups according to the receivers'"'"' channel conditions.
2 Assignments
0 Petitions
Accused Products
Abstract
The present invention provides scheduling algorithms that guarantee minimum data transport service for even ATs with poor channel conditions. Data-requesting ATs are divided into a number (Ng1) of AT groups according to their channel conditions. Also, a recurring sequence of time slots is defined on the TDMA channel and partitioned into a number (Ng2) of slot groups, where Ng2 is made larger than Ng1. Generally, slot assignment according to the present invention is a two-step process. First, in the sequence, the slot groups are allocated to the AT groups so that AT groups with better channel conditions will receive more slot groups while each AT group will receive at least one slot group. Second, in each AT group, the time slots allocated to an AT group are assigned to the individual ATs in the group. By assigning more slot groups to AT groups with better channel conditions, the algorithm will optimize the overall data throughput. By assigning at least one slot group to each AT groups, the algorithm will guarantee minimum service to ATs with poor channel conditions.
80 Citations
20 Claims
-
1. A method for dynamically scheduling communications to a plurality of receivers over a TDMA channel that is partitioned into frames each consisting of slots, comprising the steps of:
-
measuring a channel condition of each receiver;
dividing the receivers into receiver groups according their channel conditions;
partitioning the TDMA channel into a recurring sequence of slots;
dividing each sequence into a certain number of slot groups; and
allocating the slot groups to the receiver groups according to the receivers'"'"' channel conditions. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification