METHOD FOR SCHEDULING A RANDOM-ACCESS COMMUNICATION SYSTEM WITH ABSOLUTE AND PROPORTIONAL THROUGHPUT GUARANTEES

摘要

#$%^&*AU2014100684A420140717.pdf#####ABSTRACT A method for scheduling a random-access communication system having highpriority (HP) and low-priority (LP) nodes is provided, where the scheduling is configured such that the system provides an absolute throughput guarantee for the HP nodes, and a proportional throughput guarantee for the LP nodes. The method is based on obtaining a length of a contention window assigned to an individual node, which is either a HP or a LP node, from a per-slot attempt rate of this individual node. In particular, the attempt rate of each individual node is determined by an algorithm configured such that a resultant sum of the per-slot attempt rates of all the individual nodes is a fixed value independent of the number of the individual nodes. By this scheduling method, the maximum system throughput is approached. The method can be advantageously used in a wireless local area network (WLAN). Abstract figure: FIG. 4. Page 18- I0 0 0 CL, C/, 0 LP C,,) I 0) Z 0 00 0)0 0) a) -a) 0 a) 00 ELao0 E 70 E 0 0 C:E(D ( c 0 m 0o cz 0 0- a