公开(公告)号：US20150373742A1

公开(公告)日：2015-12-24

申请号：US14308713

申请日：2014-06-19

Applicant: Macau University of Science and Technology

Inventor： Qinglin Zhao ,  Zhijie Ma

IPC: H04W74/08

CPC classification number: H04W74/0833 ,  H04W74/0816 ,  H04W74/0875 ,  H04W84/12

Abstract: A method for scheduling a random-access communication system having high-priority (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 translation: 提供了一种用于调度具有高优先级（HP）和低优先级（LP）节点的随机接入通信系统的方法，其中调度被配置为使得系统为HP节点提供绝对吞吐量保证，并且成比例 LP节点的吞吐量保证。 该方法基于从该单独节点的每时隙尝试速率获得分配给单个节点（即HP或LP节点）的争用窗口的长度。 具体地，每个单独节点的尝试速率由配置为使得所有单个节点的每时隙尝试速率的合成和是独立于各个节点的数量的固定值的算法来确定。 通过该调度方法，接近最大系统吞吐量。 该方法可以有利地用于无线局域网（WLAN）。

公开(公告)号：US20170339058A1

公开(公告)日：2017-11-23

申请号：US15160043

申请日：2016-05-20

Applicant: Macau University of Science and Technology

Inventor： Qinglin Zhao ,  Zhijie Ma

IPC: H04L12/801 ,  H04L12/911 ,  H04L12/26

CPC classification number: H04L47/10 ,  H04L43/0882 ,  H04L47/783 ,  H04W28/0205 ,  H04W74/0816

Abstract: A method for optimizing throughput of a network with stations adapted to transmit data to an access point includes the step of determining a respective required throughput for each station based on: respective time periods required for decreasing a count of a respective back-off counter associated with each of the stations, a transmission packet length of the respective station, and a probability of successful transmission for of the respective station. The respective required throughput so determined is a function of a respective transmission attempt rate for the station. The method further includes the step of determining the respective transmission attempt rate for each station for maximizing a sum of the respective required throughput such that a respective fixed throughput is provided for inelastic data flow in the network, a respective proportional throughput ratio is provided for elastic data flow in the network, and the throughput of the network is maximized.

公开(公告)号：US09942150B2

公开(公告)日：2018-04-10

申请号：US15160043

申请日：2016-05-20

Applicant: Macau University of Science and Technology

Inventor： Qinglin Zhao ,  Zhijie Ma

IPC: G08C15/00 ,  H04L12/801 ,  H04L12/911 ,  H04L12/26

CPC classification number: H04L47/10 ,  H04L43/0882 ,  H04L47/783 ,  H04W28/0205 ,  H04W74/0816

Abstract: A method for optimizing throughput of a network with stations adapted to transmit data to an access point includes the step of determining a respective required throughput for each station based on: respective time periods required for decreasing a count of a respective back-off counter associated with each of the stations, a transmission packet length of the respective station, and a probability of successful transmission for of the respective station. The respective required throughput so determined is a function of a respective transmission attempt rate for the station. The method further includes the step of determining the respective transmission attempt rate for each station for maximizing a sum of the respective required throughput such that a respective fixed throughput is provided for inelastic data flow in the network, a respective proportional throughput ratio is provided for elastic data flow in the network, and the throughput of the network is maximized.

公开(公告)号：US09307560B2

公开(公告)日：2016-04-05

申请号：US14308713

申请日：2014-06-19

Applicant: Macau University of Science and Technology

Inventor： Qinglin Zhao ,  Zhijie Ma

IPC: H04W74/08 ,  H04W84/12

CPC classification number: H04W74/0833 ,  H04W74/0816 ,  H04W74/0875 ,  H04W84/12

Abstract: A method for scheduling a random-access communication system having high-priority (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 translation: 提供了一种用于调度具有高优先级（HP）和低优先级（LP）节点的随机接入通信系统的方法，其中调度被配置为使得系统为HP节点提供绝对吞吐量保证，并且成比例 LP节点的吞吐量保证。 该方法基于从该单独节点的每时隙尝试速率获得分配给单个节点（即HP或LP节点）的争用窗口的长度。 具体地，每个单独节点的尝试速率由配置为使得所有单个节点的每时隙尝试速率的合成和是独立于各个节点的数量的固定值的算法来确定。 通过该调度方法，接近最大系统吞吐量。 该方法可以有利地用于无线局域网（WLAN）。