Method and system for contention queuing using a queue-based MAC protocol

Patent metadata

Field	Value
Publication number	US-9961702-B2
Application number	US-201514828159-A
Country	US
Kind code	B2
Filing date	Aug 17, 2015
Priority date	Jul 15, 2015
Publication date	May 1, 2018
Grant date	May 1, 2018

Abstract

A MAC protocol, useful for wireless local area networks (WLANs), is provided for improving throughput efficiency. The protocol includes three concurrent processes, and the channel is divided into a contention subchannel and a transmission subchannel. In the contention process, all nodes use the standard RTS/CTS mechanism operated on the contention channel to contend for a right of transmission. When one node gains the right, all the nodes store the contention result into their respective contention queue (CQ) buffers. In the transmission process, the nodes sequentially transmit their data over the transmission channel according to the order of the nodes stored in the CQ buffers. When one node finishes data transmission, the CQ buffers are updated. The contention process and the transmission process are connected by the queuing process, where each node dynamically updates its own CQ buffer according to the contention result and each instance of data transmission.

First claim

What is claimed is:

1. A method for enabling a plurality of nodes to communicate with an access point (AP) over a multiple-access channel, the channel including a contention subchannel and a transmission subchannel both of which are separate from each other, each of the nodes having a node identity (ID) for identification, each of the AP and the nodes having an individual contention queue (CQ) buffer for storing a waiting queue of the node IDs of the nodes each already granted with a right of data transmission by the AP, the method comprising:
when a first node being one of the nodes has data to be sent to the AP, contending, by the first node, for the right of data transmission until the AP grants the right of data transmission to the first node, wherein the first node contends for the right by communicating with the AP on the contention subchannel;
when the AP grants the right to the first node, enqueuing, by each of the AP and the nodes, the CQ buffer thereof with the node ID of the first node; and
when the CQ buffers of all the nodes and the AP are not empty and are synchronized so that the waiting queues stored in the nodes and the AP are the same, transmitting, by one or more second nodes having the node IDs thereof in the waiting queue of any of the CQ buffers, the data of the one or more second nodes to the AP in a sequential manner of one second node by another second node such that the order of the one or more second nodes in data transmission follows the order of the node IDs in the waiting queue, wherein the transmitting of the data of the one or more second nodes to the AP comprises:
when the node ID of the first node in the waiting queue of the first node's CQ buffer has a position such that the first node is permitted to send out the data thereof to the AP, transmitting, by the first node, the data of the first node to the AP over the transmission subchannel; and
when data transmission from the first node to the AP completes, dequeuing, by each of the AP and the nodes, from the CQ buffer thereof the node ID of the first node.

2. The method of claim 1 , wherein the contending for the right of data transmission by the first node comprises:
sending a request to send (RTS) to the AP over the contention subchannel; and
repeating the sending of the RTS to the AP until the AP transmits a clear to send (CTS) on the contention subchannel to declare that the AP grants the right of data transmission to the first node.

3. The method of claim 2 , wherein the contending for the right of data transmission by the first node further comprises:
before performing the sending of the RTS, sensing the contention subchannel to determine whether the contention subchannel has been idle for a pre-determined value of distributed-coordination-function inter-frame space (DIFS) so as to determine whether or not to immediately send out the RTS over the contention subchannel;
responsive to determining that the contention subchannel has not been idle for the DIFS, re-performing the sensing of the contention subchannel after a backoff duration determined according to a binary exponential backoff (BEB) algorithm; and
performing the sending of the RTS in response to determining that the contention subchannel has been idle for the DIFS.

4. The method of claim 1 , further comprising:
when data transmission from the first node to the AP completes, broadcasting, by the AP, an ACK to all the nodes so as to inform each of the nodes to perform the dequeuing of the node ID of the first node from the CQ buffer thereof.

5. The method of claim 1 , further comprising:
when the AP detects that the CQ buffers of all the nodes and the AP are not synchronized, broadcasting, by the AP, the CQ buffer of the AP to the nodes so as to resynchronize the CQ buffers of all the nodes with the CQ buffer of the AP.

6. The method of claim 1 , wherein the waiting queue of each of the CQ buffers is a first-in first-out queue.

7. The method of claim 1 , wherein:
the channel is an orthogonal frequency division multiplexing (OFDM) channel having a plurality of subcarrier channels;
the contention subchannel consists of a first number of the subcarrier channels;
the transmission subchannel consists of a second number of the subcarrier channels; and
the subcarrier channels of the contention subchannel do not overlap with the subcarrier channels of the transmission subchannel.

8. The method of claim 7 , wherein the second number is greater than the first number.

9. A wireless local area network (WLAN) system comprising:
an access point (AP); and
a plurality of nodes each communicable with the AP over a multiple-access channel, each of the nodes having a node identity (ID) for identification;

wherein:
the channel includes a contention subchannel and a transmission subchannel both of which are separate from each other;
each of the AP and the nodes comprises an individual contention queue (CQ) buffer for storing a waiting queue of the node IDs of the nodes each already granted with a right of data transmission by the AP;
each of the nodes is configured such that when a first node being one of the nodes has data to be sent to the AP, the first node contends for the right of data transmission until the AP grants the right of data transmission to the first node, wherein the first node contends for the right by communicating with the AP on the contention subchannel;
each of the AP and the nodes is further configured such that when the AP grants the right to the first node, each of the AP and the nodes enqueues the CQ buffer thereof with the node ID of the first node; and
each of the AP and the nodes is further configured such that when the CQ buffers of all the nodes and the AP are not empty and are synchronized so that the waiting queues stored in the nodes and the AP are the same, one or more second nodes having the node IDs thereof in the waiting queue of any of the CQ buffers transmit the data of the one or more second nodes to the AP in a sequential manner of one second node by another second node such that the order of the one or more second nodes in data transmission follows the order of the node IDs in the waiting queue, wherein in transmitting the data of the one or more second nodes to the AP:
when the node ID of the first node in the waiting queue of the first node's CQ buffer has a position such that the first node is permitted to send out the data thereof to the AP, the first node transmits the data thereof to the AP over the transmission subchannel, and
when data transmission from the first node to the AP completes, each of the AP and the nodes dequeues from the CQ buffer thereof the node ID of the first node.

10. The WLAN system of claim 9 , wherein each of the AP and the nodes has at least two antennas such that one antenna is used for communication over the contention subchannel and another one is for communication over the transmission subchannel.

11. The WLAN system of claim 9 , wherein the first node contends for the right of data transmission by executing a process comprising:
sending a request to send (RTS) to the AP over the contention subchannel; and
repeating the sending of the RTS to the AP until the AP transmits a clear to send (CTS) on the contention subchannel to declare that the AP grants the right of data transmission to the first node.

12. The WLAN system of claim 11 , wherein the process further comprises:
before performing the sending of the RTS, sensing the contention subchannel to determine whether the contention subchannel has been idle for a pre-determined value of distributed-coordination-function inter-frame space (DIFS) so as to determine whether or not to imm

Assignees

• Univ Macau Sci & Tech

Inventors

• Zhao Qinglin
• Xu Fangxin
• Zeng Yu
• Yang Jie

Classifications

• H04W74/0866 Primary

  using a dedicated channel for access · CPC title

• H04W74/08

  Non-scheduled access, e.g. ALOHA (hybrid access H04W74/02) · CPC title

• H04W74/0816

  with collision avoidance · CPC title

• H04W74/02

  Hybrid access · CPC title

• H04W74/008

  Electricity · mapped topic