WO2014146444A1 - Ofdma竞争方法及接入点 - Google Patents

Ofdma竞争方法及接入点 Download PDF

Info

Publication number
WO2014146444A1
WO2014146444A1 PCT/CN2013/087597 CN2013087597W WO2014146444A1 WO 2014146444 A1 WO2014146444 A1 WO 2014146444A1 CN 2013087597 W CN2013087597 W CN 2013087597W WO 2014146444 A1 WO2014146444 A1 WO 2014146444A1
Authority
WO
WIPO (PCT)
Prior art keywords
competition
successfully
access point
sites
request
Prior art date
Application number
PCT/CN2013/087597
Other languages
English (en)
French (fr)
Inventor
李云波
伍天宇
张连波
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP18156408.9A priority Critical patent/EP3386262B1/en
Priority to EP13878925.0A priority patent/EP2978273B1/en
Publication of WO2014146444A1 publication Critical patent/WO2014146444A1/zh
Priority to US14/843,770 priority patent/US20150382380A1/en
Priority to US15/891,919 priority patent/US10959266B2/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
    • H04W74/0825—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA carrier sensing with collision detection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/30—Resource management for broadcast services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10—Small scale networks; Flat hierarchical networks
    • H04W84/12—WLAN [Wireless Local Area Networks]

Definitions

  • the present invention relates to the field of computer and communication technologies, and in particular, to an OFDMA competition method and an access point.
  • CSMA/CA Carrier sense multiple access with collision avoidance
  • OFDMA Orthogonal Frequency Division Multiple Access
  • OFDMA competition Although there are multiple competing channels, due to system efficiency considerations, the number of competing channels is usually smaller than the number of stations. Since the communication bandwidth is fixed, the more subchannels, the narrower the bandwidth of a single subchannel, resulting in a longer transmission time for transmitting a contention request frame at each competition.
  • the number of subchannels is greater than the number of stations that need to be contender, it is also wasted due to the idle subchannels. Therefore, it is common to divide the entire channel into multiple subchannels, and all stations share all subchannels by competing.
  • the number of successful sites per competition is a very important factor for an OFDMA system. On the one hand, the more the number of successful sites, the shorter the competition process, and the smaller the system's cost of competition. On the other hand, the more the number of successful sites is competing, the greater the gain can be selected at the obtained frequency.
  • the size of the competition window is chosen to reduce the probability of collisions.
  • the OFDMA competition is different.
  • the probability of collision should be reduced.
  • OFDMA competition and CSMA/CA competition are different in the design of the competition window.
  • a larger competition window may be required, which will seriously affect the efficiency of OFDMA competition.
  • FIG. 1 is a timing diagram of a conventional OFDMA competition method. The entire process of competing and transmitting data includes the following steps:
  • Step 1 Multiple stations send a content frame RTS (request to send) on multiple subchannels;
  • Step 2 Access (Access Point, access point) sends G-CTS (group CTS, group CTS, CTS is a reply to RTS frame) to all successful sites.
  • G-CTS group CTS, group CTS, CTS is a reply to RTS frame
  • the AP will be in the G-CTS frame. Striving for a successful site for resource allocation;
  • Step 3 The successful station transmits data on the allocated frequency and time resources.
  • Step 4 The AP returns the confirmation frame to the station G-BA (group BA group BA, BA is the block response).
  • the above competition method has only one round of competition opportunities. Due to the inappropriate setting of the competition window, or the collision and other factors lead to the number of successful sites, there is no effective mechanism to further increase the number of successful sites, resulting in the system. The throughput is reduced.
  • an OFDMA competition method which includes:
  • the access point receives the contention request frame sent by the station on the subchannel
  • Trigger the site to enter the next channel competition period including:
  • the access point sends the first request response frame in a broadcast format to successfully authenticate the successful site in the current channel competition period, and triggers the station to enter the next channel competition period;
  • the OFDMA competition method is characterized in that:
  • Step Determining whether the number of channel competition periods reaches a predetermined period threshold, and if so, directly executing the access point to send the second request response frame in a broadcast format to successfully confirm the successful competition in the current channel competition period. Step; otherwise Performing a determination of whether the sum of the number of successful sites in the current channel competition period and the number of successful sites in the historical competition is less than a predetermined threshold.
  • the method further includes:
  • the monitoring channel competition time reaches a predetermined time threshold. If yes, the access point transmits the contention end frame in a broadcast format to notify the station that the channel competition ends.
  • the access point when the access point sends the first request response frame in a broadcast format, the first request response frame further performs resources on a site that successfully competes in the current channel competition period. Assignment
  • the second request response frame When the access point sends the second request response frame in a broadcast format, the second request response frame further allocates resources to the station that successfully competes in the last channel competition period.
  • the second request response frame is also a site that successfully competes in the last channel competition period and Historically successful sites for resource allocation.
  • the access point sends the second request response frame in a broadcast format, to successfully compete for the successful competition in the last channel competition period, and then includes :
  • the access point performs an acknowledgement response after the successful completion of the data transmission at the successful site.
  • Trigger the site to enter the next channel competition period including:
  • the access point waits for the first predetermined time to not reply to trigger the station to enter the next channel competition period
  • the access point repeating the step of the access point receiving the contention request frame sent by the station on the subchannel and determining whether the sum of the number of successfully contested stations in the current channel competition period and the number of historically successful stations is less than a predetermined threshold.
  • the number of sites until the success of the competition is greater than or equal to the predetermined threshold, including: repeatedly performing the contention request frame sent by the access point on the subchannel receiving station and determining the number of successful sites in the current channel competition period. Whether the sum of the number of successful sites with history is small In the step of the predetermined threshold, until the number of successful sites is greater than or equal to the predetermined threshold; otherwise, the access point waits for the second predetermined time and then sends the third request response frame in a broadcast format to succeed for all the competitions. The site is successfully confirmed by the competition;
  • the length of the first predetermined time is greater than the length of the second predetermined time.
  • the determining whether the sum of the number of successful sites in the current channel competition period and the number of sites successfully competing for history is less than a predetermined threshold includes: determining channel competition Whether the number of cycles reaches a predetermined period threshold, and if yes, directly performing the step of transmitting, by the access point, a third request response frame in a broadcast format after waiting for a second predetermined time to perform a successful confirmation of the competition for all successfully successful sites; Otherwise,
  • the execution determines whether the sum of the number of successful sites in the current channel competition period and the number of successful sites in the historical competition is less than a predetermined threshold.
  • the method further includes:
  • monitoring channel competition time reaches a predetermined time threshold, and if yes, directly executing the access point to wait for the second predetermined time, and then sending the third request response frame in a broadcast format to successfully confirm the competition for all successful sites.
  • the third request response frame is also performed on all the sites that successfully compete. Resource allocation.
  • the access point waits for the second predetermined time, and then sends the third request response frame in a broadcast format to successfully confirm the competition for all the successfully successful sites, and then Includes:
  • the access point performs an acknowledgement response after the successful completion of the data transmission at the successful site.
  • an access point where the access point includes:
  • a request receiving unit configured to receive a contention request frame sent by the station on the subchannel
  • the request processing unit is configured to determine whether the sum of the number of successful sites in the current channel competition period and the number of successful historical sites is less than a predetermined threshold, and if so, trigger the site to enter the next letter.
  • the request processing unit includes:
  • a first threshold determining module configured to determine, after channel competition, whether a sum of a number of successful sites in the current channel competition period and a number of sites in which the historical competition succeeds is less than a predetermined threshold, and if yes, send to the first response module a first notification message; otherwise, sending a second notification message to the second response module; the first response module, configured to send the first request response frame in a broadcast format according to the first notification message, to compete for a current channel The site that competes for success successfully confirms the competition and triggers the site to enter the next channel competition period;
  • the second response module is configured to send, according to the second notification message, the second request response frame in a broadcast format, to perform successful competition confirmation on the successfully successful site in the last channel competition period.
  • the request processing unit further includes:
  • a first number determining module configured to determine whether the number of channel competition periods reaches a predetermined period threshold, and if yes, send a second notification message to the second response module; otherwise, send the first to the first threshold determining module Threshold judgment message.
  • the request processing unit further includes:
  • the first time monitoring module is configured to monitor whether the channel competition time reaches a predetermined time threshold, and if yes, send the contention end frame in a broadcast format to notify the station that the channel competition ends.
  • the first response module is further configured to perform resource allocation by using the first request response frame for a station that successfully competes in a current channel competition period;
  • the second response module is further configured to perform resource allocation on the station that successfully competes in the last channel competition period by using the second request response frame.
  • the second response module is further configured to perform, by using the second request response frame, a site that successfully competes in a last channel competition period and a site that successfully competes in history Resource allocation.
  • the access point further includes:
  • the acknowledgment response module is configured to perform an acknowledgment response after the data is successfully transmitted at the successful site.
  • the request processing unit includes: a second threshold determining module, configured to determine a sum of a number of successful sites in the current channel competition period and a number of successful historical sites Whether it is less than a predetermined threshold, if yes, the access point waits for the first predetermined time to not reply to trigger the station to enter the next channel competition period; otherwise, sends a third notification message to the third response module;
  • the third response module is configured to send, according to the third notification message, a third request response frame in a broadcast format after waiting for a second predetermined time, to successfully compete for success for all successful sites;
  • the length of time is greater than the length of the second predetermined time.
  • the request processing unit further includes:
  • the second number determining module is configured to determine whether the number of channel competition periods reaches a predetermined period threshold, and if yes, send a third notification message to the third response module; otherwise, send a second threshold determination message to the second threshold determining module.
  • the request processing unit further includes:
  • the second time monitoring module is configured to monitor whether the channel competition time reaches a predetermined time threshold, and if yes, send a third notification message to the third response module.
  • the third response module is further configured to perform resource allocation on all successfully successful sites by using the third request response frame.
  • the OFDMA competition method and the access point according to the present invention can continue to initiate competition when the number of successfully successful sites is less than a certain threshold, so as to increase the number of successful sites, thereby improving
  • the throughput of the OFDMA system at the same time, the OFDMA competition method is compatible with the existing mechanism, and when the site that successfully competes for the first time reaches the threshold, it does not bring additional overhead, and is easy to integrate with the existing OFDMA system, which is convenient Promote the application.
  • 1 is a timing diagram of a conventional OFDMA competition method
  • FIG. 3 is a timing diagram of an OFDMA competition method according to an embodiment of the present invention.
  • FIG. 4 is a timing diagram of an OFDMA competition method according to another embodiment of the present invention.
  • FIG. 5a is a schematic structural diagram of a module of an access point for implementing OFDMA competition according to the present invention.
  • FIG. 5 is a block diagram of another module structure of an access point for implementing an OFDMA competition according to the present invention
  • FIG. 6 is a schematic structural diagram of a module of a request processing unit according to an embodiment of the present invention
  • FIG. 7 is a schematic diagram of an embodiment of the present invention. Schematic diagram of a module structure of a preferred scheme of a request processing unit;
  • FIG. 8 is a block diagram showing another structure of an access point for implementing an OFDMA competition according to the present invention
  • FIG. 9 is a block diagram showing the structure of a request processing unit according to another embodiment of the present invention
  • FIG. 10 is another embodiment of the present invention.
  • FIG. 11 is a schematic structural diagram of hardware of an access point device of the present invention.
  • FIG. 12 is a block diagram showing the hardware structure of the site device of the present invention. detailed description
  • the invention is applicable to an OFDMA multi-subchannel competition system.
  • the number of successful initial competition sites does not reach a certain threshold, multiple rounds of competition can be initiated in succession to increase the success of the competition.
  • the number of points which in turn increases the throughput of the system.
  • FIG. 2 is a flowchart of an OFDMA competition method according to an embodiment of the present invention. As shown in FIG. 2, the method includes the following steps:
  • the access point receives the contention request frame sent by the station on the subchannel.
  • 230 determining whether the sum of the number of successful sites in the current channel competition period and the number of sites successfully competing for history is less than a predetermined threshold, and if so, triggering the station to enter the next channel competition period, repeating steps 220 and 230, The number of stations until the success of the competition is greater than or equal to the predetermined threshold.
  • the contention request frame uses an RTS frame.
  • step 220 may further include the following steps:
  • the site is triggered for channel competition.
  • a trigger mechanism is required before a station has data to send and send a contention request frame.
  • the trigger mechanism itself is not the protection focus of this patent. It can be that the channel idles for a certain period of time, the port is idle, the channel idle time is DIFS (distributed (coordination function) interframe space, or the distributed coordination interframe space), or, A competitive triggering frame sent by the access point, for example, R-Poll.
  • DIFS distributed (coordination function) interframe space
  • the distributed coordination interframe space or the distributed coordination interframe space
  • a competitive triggering frame sent by the access point for example, R-Poll.
  • the foregoing step 230 specifically includes:
  • the access point determines whether the sum of the number of successful sites in the current channel competition period and the number of sites successfully competing for history is less than a predetermined threshold. If yes, the access point sends the first request in a broadcast format. The response frame is used to successfully confirm the competition for the successful competition in the current channel competition period, and triggers the station to enter the next channel competition period, and repeats steps 220 and 231 until the number of successful sites is greater than Equal to the predetermined threshold; otherwise, the access point sends the second request response frame in a broadcast format to successfully compete for the successful successful site in the last channel competition period, and ends the process. Referring to FIG.
  • the station STA1 first performs rollback, and the backoff time is T1. If the channel is still idle after the backoff is over, Then, one subchannel can be selected to send the contention request frame RTS to the access point AP.
  • the AP will receive on all subchannels and determine the number of successful sites. If the number of successfully successful sites is less than a certain predetermined threshold, the AP will send the first request response frame G-CTS', G-CTS in a broadcast format, on the one hand, successful competition confirmation for the successful site, and another On the one hand, it will also trigger the site to enter the next channel competition period. Assuming a predetermined threshold of 3, the site that succeeds in the first channel competition period is only STA1, and the next channel competition period will be performed.
  • a station that has no successful contention in the previous channel competition period may repeat the contention request process, that is, first perform a rollback, and if the channel is still idle after the end of the rollback, select a subchannel to transmit the RTS frame.
  • the AP After receiving the RTS frame of the new channel competition period, the AP will determine whether the total number of successful stations has reached the threshold. If it is still less than the threshold, it can reply to the G-CTS and frame again. This time the G-CTS' frame will successfully confirm the competition for the site that just succeeded, and trigger the site to enter the next channel competition period.
  • the stations STA2 and STA4 first perform rollback, and the backoff time is T2. If the channel is still idle after the backoff is completed, a subchannel may be selected to send the contention request frame RTS to the access point AP.
  • the AP will receive on all the subchannels, and determine whether the sum of the successfully successful sites and the number of historically successful sites in the current channel competition period is less than the predetermined threshold, and the judgment result shows the current channel competition period.
  • the sum of the number of successfully successful sites and the historically successful sites is 3, and greater than or equal to the predetermined threshold 3, the AP transmits the second request response frame G-CTS in a broadcast format to compete for the last channel. Sites that compete for success during the cycle are successfully confirmed.
  • the AP may continuously repeat steps 220 and 231 until the number of successful sites reaches a predetermined threshold, but Considering the delay and other factors, the upper limit of the number of competition cycles can be set. When the number of consecutively initiated competitions reaches the upper limit, even if the number of successful sites fails to reach The next channel competition period will no longer be initiated until the predetermined threshold.
  • the method further includes the steps of:
  • the execution determines whether the sum of the number of successful sites in the current channel competition period and the number of successful sites in the historical competition is less than a predetermined threshold.
  • the method further includes:
  • the monitoring channel competition time reaches a predetermined time threshold. If yes, the access point transmits the contention end frame in a broadcast format to notify the station that the channel competition ends.
  • the starting point of the monitoring channel competition time may be the time when the station is triggered to perform channel competition, or the time when the access point starts to receive the competition request frame.
  • the contention end frame is sent to all stations in a broadcast form. If the station successfully competing in the last channel competition period has not received the second request response frame, it is first completed after receiving the contention end frame. The competition is successfully confirmed, and then the data transmission can be performed; if the station successfully competing in the last channel competition period has received the second request response frame, then when it receives the contention end frame, the data can be directly processed. send.
  • the access point When the access point sends the first request response frame in a broadcast format, the first request response frame further allocates resources to a station that successfully competes in the current channel competition period;
  • the second request response frame When the access point sends the second request response frame in a broadcast format, the second request response frame further allocates resources to the station that successfully competes in the last channel competition period.
  • the second request response frame When the access point sends the second request response frame in a broadcast format, the second request response frame further allocates resources to a site that successfully competes in the last channel competition period and a site that has historically succeeded. In addition, when all the stations that have successfully competed receive the G-CTS frame, the data is transmitted according to the allocated frequency and/or time resource.
  • the AP sends the G-BA to confirm the response to all successful sites.
  • the foregoing step 230 specifically includes:
  • the access point determines whether the sum of the number of successful sites in the current channel competition period and the number of successful historical sites is less than a predetermined threshold. If yes, the access point waits for the first predetermined time. Responding to trigger the station to enter the next channel competition period, repeating steps 220 and 231' until the number of successful sites is greater than or equal to the predetermined threshold; otherwise, the access point waits for the second predetermined time.
  • the broadcast format sends a third request response frame to successfully confirm the competition for all successful sites, and ends the process.
  • the length of the first predetermined time is greater than the length of the second predetermined time.
  • the contention triggering mechanism in this embodiment may also be that the channel idles for a certain period of time or receives a contention trigger frame sent by the AP.
  • the trigger mechanism is that the channel idles for a certain period of time, the t0 shown in the figure is no longer needed; when the trigger mechanism is to receive an R-Poll frame, t0 is the interval from the reception of the R-Poll frame to the start of the backoff. , can be SIFS.
  • the AP receives on all subchannels and determines the number of successful sites.
  • the number of sites that succeed in the first channel competition period is 2, which is less than a predetermined threshold of 3, and the AP temporarily does not reply. If the third request response frame sent by the AP is not received after the first predetermined time t1 of the RTS frame in the first channel competition period is completed (the third request response frame may also adopt G-CTS),
  • the request process can be repeatedly sent, that is, the rollback is performed first, if the rollback ends After the back channel is still idle, a subchannel is selected to transmit the RTS frame.
  • the AP After receiving the RTS frame in the new channel competition period, the AP determines whether the sum of the number of successful stations in the current channel competition period and the number of successful historical stations is greater than or equal to a predetermined threshold, if still less than the threshold. The above process can be repeated to allow the site to continue to roll back and initiate a competition.
  • the station STA3 competes successfully, so the sum of the number of successful sites in the current channel competition period and the number of successful historical sites is equal to 3
  • the AP waits for the second predetermined time t2 to send a third request response frame in a broadcast format to successfully compete for the successful successful sites, and ends the process.
  • the AP may continually repeat steps 220 and 231 above until the number of successful sites reaches a predetermined threshold, but Considering the delay and other factors, an upper limit of the number of competition periods can be set. After the number of consecutively initiated competitions reaches the upper limit, even if the number of successfully successful stations does not reach the threshold, no new channel competition period will be initiated. Competition.
  • the method further includes:
  • Determining whether the number of channel competition periods reaches a predetermined period threshold If yes, directly performing the access point to wait for a second predetermined time, and then sending the third request response frame in a broadcast format to successfully compete for all successful sites. The step of acknowledgment; otherwise, it is performed to determine whether the sum of the number of successful sites in the current channel competition period and the number of sites in which the historical competition succeeds is less than a predetermined threshold.
  • the method further includes: monitoring whether the channel competition time reaches a predetermined time threshold, and if yes, directly executing the access point to wait for the second predetermined time, and then sending the third request in a broadcast format.
  • the response frame is a step to successfully confirm the competition for all successful sites. In this implementation manner, since all the successfully succeeded sites complete the competition success confirmation after receiving the third request response frame, after the channel competition time is reached, the third request response frame can directly pass all the competitions. Successful sites compete for success, without the need to send a competitive end frame.
  • the AP will compete on the last channel.
  • the G-CTS frame is transmitted at t2 time after the RTS frame in the period is transmitted.
  • the third request response frame G-CTS frame will be successfully authenticated for all successful sites.
  • the third request response frame G-CTS also allocates frequency and/or time resources to all stations that have successfully competed.
  • the length of time t2 required in this method must be less than the length of time t1.
  • the data is transmitted according to the allocated frequency and/or time resource.
  • FIG. 5a is a schematic structural diagram of a module of an access point according to the present invention. As shown in FIG. 5a, the access point includes:
  • the request receiving unit 520 is configured to receive the contention request frame sent by the station on the subchannel; the request processing unit 530 is configured to determine the sum of the number of successful sites in the current channel competition period and the number of historically successful sites. Whether it is less than a predetermined threshold, and if so, triggers the station to enter the next channel competition period.
  • the access point further includes:
  • the competition trigger unit 510 is configured to cause the station to be triggered for channel competition.
  • the request processing unit 530 includes: a first threshold determining module 531, configured to determine, after channel competition, the number of sites and historical successes in the current channel competition period. Whether the sum of the number of successful sites is less than a predetermined threshold, if yes, sending a first notification message to the first response module; otherwise, sending a second notification message to the second response module; the first response module 532, configured to First notification message, send the first request in broadcast format Finding a response frame to successfully confirm the competition for the successful competition in the current channel competition period, and triggering the station to enter the next channel competition period;
  • the second response module 533 is configured to send, according to the second notification message, the second request response frame in a broadcast format to perform successful competition confirmation for the successfully successful site in the last channel competition period.
  • the request processing unit 530 further includes: a first number determining module 534, configured to determine whether the number of channel competition periods reaches a predetermined period threshold, and if so, The second response module 533 sends a second notification message; otherwise, sends a first threshold determination message to the first threshold determination module 531.
  • the first threshold determining module 531 determines, according to the first threshold, whether the sum of the number of successful sites in the current channel competition period and the number of successful sites in the current channel competition period is less than a predetermined threshold after the channel is determined to be competitive. If yes, the first notification message is sent to the first response module 532; otherwise, the second notification message is sent to the second response module 533.
  • the request processing unit 530 further includes: a first time monitoring module, configured to monitor whether a channel competition time reaches a predetermined time threshold, and if yes, send a contention end frame in a broadcast format. , to inform the site that the channel competition is over.
  • the first response module 532 is further configured to perform resource allocation on the station that successfully competes in the current channel competition period by using the first request response frame;
  • the second response module 533 is further configured to use the second request response frame. Resource allocation for sites that compete for success in the last channel competition period.
  • the second response module is further configured to allocate resources to the successfully successful site and the historically successful site in the last channel competition period by using the second request response frame.
  • the access point may further include:
  • the acknowledgment response module 540 is configured to perform an acknowledgment response after the data is successfully transmitted at the site where the contention is successful.
  • the request processing unit 530 includes:
  • the second threshold judging module 53 ⁇ is configured to determine the number of stations that successfully compete in the current channel competition period. Whether the sum of the number of stations that successfully compete with the history is less than a predetermined threshold, and if so, the access point waits for the first predetermined time without replying to trigger the station to enter the next channel competition period; otherwise, to the third response module 533 Sending a third notification message;
  • the third response module 533 is configured to send, according to the third notification message, a third request response frame in a broadcast format after waiting for a second predetermined time, to successfully confirm the competition for all successful sites;
  • the length of a predetermined time is greater than the length of the second predetermined time.
  • a preferred solution of the present embodiment is that the request processing unit 530 further includes: a second number determining module 534, configured to determine whether the number of channel competition periods reaches a predetermined period threshold, and if so, to the third The response module 533 sends a third notification message; otherwise, sends a second threshold determination message to the second threshold determination module 531.
  • a second number determining module 534 configured to determine whether the number of channel competition periods reaches a predetermined period threshold, and if so, to the third The response module 533 sends a third notification message; otherwise, sends a second threshold determination message to the second threshold determination module 531.
  • the second threshold determining module 53 ⁇ determines whether the sum of the number of successful sites in the current channel competition period and the number of successful sites in the current channel competition period is less than a predetermined threshold according to the second threshold determination message, and if so, The access point waits for the first predetermined time without replying to trigger the station to enter the next channel competition period; otherwise, sends a third notification message to the third response module 533.
  • the request processing unit 530 further includes: a second time monitoring module, configured to monitor whether a channel competition time reaches a predetermined time threshold, and if yes, send a third notification to the third response module. Message.
  • the resource allocation is performed on the site that is successful in the present embodiment.
  • the third response module 533 is further configured to perform resource allocation on all successfully successful sites by using the third request response frame.
  • 11 illustrates an embodiment of an access point device. As shown in FIG. 11, the access point device 1100 is similar in structure to an existing computer, and can interact with an external device, such as a site, through the network interface 1110.
  • the contention triggering, the contention request frame of the receiving station, and the reply request response frame are implemented; the interactive function can also be implemented through the input interface 1120 and the output interface 1130. At the same time, it processes the contention request of each site through the processor 1140, and controls the network interface 1110, or the input interface 1120 and the output interface 1130 perform data interaction with each site. In addition, the network interface 1110.
  • the input interface 1120, the output interface 1130, and the processor 1140 communicate via a bus.
  • 12 illustrates an embodiment of a site device, in which the site device 1200 includes an antenna 1210, a transmit circuit 1220, a receive circuit 1230, a power controller 1240, a processing unit 1250, and a memory 1260.
  • Processing unit 1250 controls the operation of site device 1200, which may also be referred to as a CPU.
  • Memory 1260 can include read only memory and random access memory and provides instructions and data to processing unit 1250. A portion of the memory 1260 may also include non-volatile line random access memory (NVRAM).
  • the site device 1200 can embed or itself be a wireless communication device such as a mobile phone, and can also include a carrier that houses the transmitting circuitry 1220 and the receiving circuitry 1230 to allow data between the site device 1200 and the remote location. Transmit and receive. Transmitting circuit 1220 and receiving circuit 1230 can be coupled to antenna 1210.
  • the various components of the site device 1200 are coupled together by a bus system 1270, which in addition to the data bus includes a power bus, a control bus, and a status signal bus. However, for the sake of clarity, various buses are labeled as bus system 1270 in the figure.
  • the site device 1200 can also include a power controller 1240.
  • Processing unit 1250 can be a microprocessor or can be any conventional processor, decoder, or the like.
  • the software modules can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like. The storage medium is located in the memory 1260, and the processing unit 1250 reads the information in the memory 1260 and performs the steps of the above method in conjunction with its hardware.
  • the OFDMA competition method and the access point according to the embodiment of the present invention can continue to initiate competition when the number of successfully successful sites is less than a certain threshold, so as to increase the number of successful sites, thereby improving the throughput of the OFDMA system.
  • the OFDMA competition method is compatible with existing mechanisms, When the site that successfully competes for the first time reaches the threshold, it does not bring extra overhead, and it is easy to
  • the OFDMA system is combined to facilitate the application.
  • aspects of the invention, or aspects of various aspects may be embodied as a system, method, or computer program product.
  • aspects of the invention, or possible implementations of various aspects may be in the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, etc.), or a combination of software and hardware aspects, They are collectively referred to herein as "circuits," “modules,” or “systems.”
  • aspects of the invention, or possible implementations of various aspects may take the form of a computer program product, which is a computer readable program code stored on a computer readable medium.
  • the computer readable medium can be a computer readable signal medium or a computer readable storage medium.
  • the computer readable storage medium includes, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any suitable combination of the foregoing, such as random access memory (RAM), read only memory (ROM), Erase programmable read-only memory (EPROM or flash memory), optical fiber, portable read-only memory (CD-ROM).
  • the processor in the computer reads the computer readable program code stored in the computer readable medium, such that the processor can perform the functional actions specified in each step or combination of steps in the flowchart; A device that functions as specified in each block, or combination of blocks.
  • the computer readable program code can execute entirely on the user's computer, partly on the user's computer, as a separate software package, partly on the user's computer and partly on the remote computer, or entirely on the remote computer or device.
  • the functions noted in the various steps of the flowchart, or in the blocks of the block diagrams may not occur in the order noted.
  • two steps, or two blocks shown in succession may be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending on the functionality involved.
  • the spirit and scope of the Ming Thus, it is intended that the present invention cover the modifications and variations of the inventions

Abstract

本发明公开了一种OFDMA竞争方法及接入点，涉及计算机通信领域。所述OFDMA竞争方法包括：接入点在子信道上接收站点发送的竞争请求帧，判断当前信道竞争周期内竞争成功的站点数量与历史竞争成功的站点数量之和是否小于预定阈值，如果是，触发站点进入下一个信道竞争周期，重复执行所述接入点在子信道上接收站点发送的竞争请求帧和判断当前信道竞争周期内竞争成功的站点数量与历史竞争成功的站点数量之和是否小于预定阈值的步骤，直至竞争成功的站点数量大于等于预定阈值。所述OFDMA竞争方法及接入点，当初次竞争成功的站点数目小于一定阈值的时候可以继续发起竞争，以增加竞争成功的站点数目，进而提高OFDMA系统的吞吐量。

Description

说 明 书
OFDMA竟争方法及接入点 技术领域
本发明涉及计算机及通信技术领域，尤其涉及一种 OFDMA竟争方法及接 入点。
背景技术
在 WLAN ( Wireless local access network, 无线局域网） 中， 采用的是 CSMA/CA ( Carrier sense multiple access with collision avoidance , 带碰撞避免的 载波侦听多址接入） 的竟争机制。 这种竟争机制中发起竟争的时间由 STA
( Station, 站点）根据自己所监听到的信道状态来决定。 由于这是一种完全分 布式的竟争机制， 不需要一个中心控制器，非常适合在非授权频段，例如， ISM
( Industrial Scientific Medical) , TVWS 等频段， 进行站点竟争。 而且在 CSMA/CA中， 竟争窗口会随着碰撞的次数的增加而增大， 因此可以适应不同 站点数目的各种场景。
但是， 随着 BSS ( Basic service set , 基本集） 中 STA数目的增大， 由于 碰撞和回退会带来系统效率的降低。 OFDMA ( orthogonal frequency division multiplexing access ,正交频分多址接入）竟争是一个潜在的解决方案。 OFDMA 竟争将整个信道分成若干个子信道， 多个站点可以同时在不同的子信道上发起 竟争。 这样既可以缩短多站点竟争的时间， 也可以减少碰撞产生的概率。 OFDMA竟争虽然有多个竟争信道， 但是出于系统效率的考虑， 通常情况下竟 争信道的数目小于站点的数目。 因为通信带宽是固定的， 子信道越多， 单个子 信道的带宽就越窄， 导致每一次竟争的时候发送竟争请求帧的发送时间加长。 而且当子信道的数目大于需要竟争的站点的数目的时候还会由于子信道空闲 而造成浪费。 所以通常情况下是将整个信道划分成多个子信道， 所有的站点通 过竟争共用所有的子信道。 每次竟争成功的站点数目是对一个 OFDMA 系统非常重要的因素。 一方 面， 竟争成功站点的数目越多， 意味该竟争过程越短， 系统在竟争上的开销就 越小。另一方面，竟争成功站点的数目越多，可以在获得的频率选择增益越大。
单信道 CSMA/CA竟争机制中， 竟争窗口大小的选择是为了减小碰撞产生 的概率。 而 OFDMA竟争中则有所不同， 对于单个子信道来说应该减小碰撞概 率， 而在此前提下对于不同子信道来说， 同一个竟争时间发起竟争的站点越多 越好。 因此， OFDMA竟争和 CSMA/CA竟争在竟争窗口的设计上的需求是不 同的。 特别是需要两种竟争机制的站点共存的系统中， 为了保证 CSMA/CA站 点的竟争优先级不被降低可能需要采用较大的竟争窗口， 这将严重影响 OFDMA竟争的效率。
图 1是一种现有的 OFDMA竟争方法的时序示意图，整个竟争和发送数据 的过程包括以下步骤：
第一步： 多个站点在多个子信道上发送竟争帧 RTS ( request to send , 发 送请求 )；
第二步： ΑΡ ( Access Point, 接入点）对所有竟争成功的站点发送 G-CTS ( group CTS , 组 CTS , CTS是对 RTS帧的回复）， 在 G-CTS帧中 AP将为竟 争成功的站点进行资源分配；
第三步： 竟争成功的站点在被分配的频率和时间资源上进行数据发送； 第四步： AP给站点回复确认帧 G-BA ( group BA组 BA, BA是块应答）。 上述竟争方法只有一轮竟争机会， 由于竟争窗口设置不合适， 或者碰撞等 因素导致竟争成功的站点数目过少的情况下， 没有有效机制进一步增加竟争成 功站点的数目， 导致系统吞吐量降低。
发明内容
本发明实施例提供 OFDMA竟争方法及接入点， 以解决现有技术中竟争成 功站点的数目少， 导致系统吞吐量降低的问题。 为了解决上述技术问题， 本发明实施例公开了如下技术方案: 第一方面， 提供一种 OFDMA竟争方法， 其包括：
接入点在子信道上接收站点发送的竟争请求帧；
判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数 量之和是否小于预定阈值， 如果是， 触发站点进入下一个信道竟争周期， 重复 执行所述接入点在子信道上接收站点发送的竟争请求帧和判断当前信道竟争 周期内竟争成功的站点数量与历史竟争成功的站点数量之和是否小于预定阈 值的步骤， 直至竟争成功的站点数量大于等于所述预定阈值。
在第一方面的第一种可行方式中，
触发站点进入下一个信道竟争周期， 包括：
所述接入点以广播格式发送第一请求应答帧， 以对当前信道竟争周期内竟 争成功的站点进行竟争成功确认， 并触发站点进入下一个信道竟争周期；
则重复执行所述接入点在子信道上接收站点发送的竟争请求帧的步骤和 判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数量之 和是否小于预定阈值，直至竟争成功的站点数量大于等于所述预定阈值， 包括: 重复执行所述接入点在子信道上接收站点发送的竟争请求帧和判断当前 信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数量之和是否小 于预定阈值的步骤， 直至竟争成功的站点数量大于等于所述预定阈值； 否则， 所述接入点以广播格式发送第二请求应答帧， 以对最后一个信道竟争周期内竟 争成功的站点进行竟争成功确认， 结束流程。 在第一方面的第二种可行方式中， 所述 OFDMA竟争方法， 其特征在于， 还包括：
判断信道竟争周期数是否达到预定周期阈值， 如果是， 直接执行所述接入 点以广播格式发送第二请求应答帧， 以对当前信道竟争周期内竟争成功的站点 进行竟争成功确认的步骤； 否则， 执行判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站 点数量之和是否小于预定阈值。
在第一方面的第三种可行方式中， 所述方法还包括：
监控信道竟争时间是否达到预定时间阈值， 如果是， 所述接入点以广播格 式发送竟争结束帧， 以通知站点信道竟争结束。
在第一方面的第四种可行方式中， 所述接入点以广播格式发送第一请求应 答帧时， 所述第一请求应答帧还对当前信道竟争周期内竟争成功的站点进行资 源分配；
所述接入点以广播格式发送第二请求应答帧时， 所述第二请求应答帧还对 最后一个信道竟争周期内竟争成功的站点进行资源分配。
在第一方面的第五种可行方式中， 所述接入点以广播格式发送第二请求应 答帧时， 所述第二请求应答帧还对最后一个信道竟争周期内竟争成功的站点以 及历史竟争成功的站点进行资源分配。
在第一方面的第六种可行方式中， 所述接入点以广播格式发送第二请求应 答帧， 以对最后一个信道竟争周期内竟争成功的站点进行竟争成功确认， 之后 还包括：
所述接入点在竟争成功的站点完成数据发送后进行确认应答。
在第一方面的第七种可行方式中，
触发站点进入下一个信道竟争周期， 包括：
所述接入点等待第一预定时间不作回复以触发站点进入下一个信道竟争 周期；
则重复执行所述接入点在子信道上接收站点发送的竟争请求帧的步骤和 判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数量之 和是否小于预定阈值，直至竟争成功的站点数量大于等于所述预定阈值， 包括: 重复执行所述接入点在子信道上接收站点发送的竟争请求帧和判断当前 信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数量之和是否小 于预定阈值的步骤， 直至竟争成功的站点数量大于等于所述预定阈值； 否则， 所述接入点等待第二预定时间后以广播格式发送第三请求应答帧， 以对所有竟 争成功的站点进行竟争成功确认；
其中,第一预定时间的长度大于第二预定时间的长度。
在第一方面的第八种可行方式中， 所述判断当前信道竟争周期内竟争成功 的站点数量与历史竟争成功的站点数量之和是否小于预定阈值， 之前还包括： 判断信道竟争周期数是否达到预定周期阈值， 如果是， 直接执行所述接入 点等待第二预定时间后以广播格式发送第三请求应答帧， 以对所有竟争成功的 站点进行竟争成功确认的步骤； 否则，
执行判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站 点数量之和是否小于预定阈值。
在第一方面的第九种可行方式中， 所述方法还包括：
监控信道竟争时间是否达到预定时间阈值， 如果是， 直接执行所述接入点 等待第二预定时间后以广播格式发送第三请求应答帧， 以对所有竟争成功的站 点进行竟争成功确认的步骤。
在第一方面的第十种可行方式中， 所述接入点等待第二预定时间后以广播 格式发送第三请求应答帧时， 所述第三请求应答帧还对所有竟争成功的站点进 行资源分配。
在第一方面的第十一种可行方式中， 所述接入点等待第二预定时间后以广 播格式发送第三请求应答帧， 以对所有竟争成功的站点进行竟争成功确认， 之 后还包括：
所述接入点在竟争成功的站点完成数据发送后进行确认应答。
第二方面， 提供一种接入点， 所述接入点包括：
请求接收单元， 用于在子信道上接收站点发送的竟争请求帧；
请求处理单元， 用于判断当前信道竟争周期内竟争成功的站点数量与历史 竟争成功的站点数量之和是否小于预定阈值， 如果是， 触发站点进入下一个信 道竟争周期， 直至竟争成功的站点数量大于等于所述预定阈值。
在第二方面的第一种可行方式中， 所述请求处理单元包括：
第一阈值判断模块， 用于在信道竟争后判断当前信道竟争周期内竟争成功 的站点数量与历史竟争成功的站点数量之和是否小于预定阈值， 如果是， 向第 一应答模块发送第一通知消息； 否则， 向第二应答模块发送第二通知消息； 所述第一应答模块， 用于根据第一通知消息， 以广播格式发送第一请求应 答帧， 以对当前信道竟争周期内竟争成功的站点进行竟争成功确认， 并触发站 点进入下一个信道竟争周期；
所述第二应答模块， 用于根据第二通知消息， 以广播格式发送第二请求应 答帧， 以对最后一个信道竟争周期内竟争成功的站点进行竟争成功确认。
在第二方面的第二种可行方式中， 所述请求处理单元还包括：
第一次数判断模块， 用于判断信道竟争周期数是否达到预定周期阈值， 如 果是， 向所述第二应答模块发送第二通知消息； 否则， 向所述第一阈值判断模 块发送第一阈值判断消息。
在第二方面的第三种可行方式中， 所述请求处理单元还包括：
第一时间监控模块， 用于监控信道竟争时间是否达到预定时间阈值， 如果 是， 以广播格式发送竟争结束帧， 以通知站点信道竟争结束。
在第二方面的第四种可行方式中， 所述第一应答模块还用于通过所述第一 请求应答帧对当前信道竟争周期内竟争成功的站点进行资源分配；
所述第二应答模块还用于通过所述第二请求应答帧对最后一个信道竟争 周期内竟争成功的站点进行资源分配。
在第二方面的第五种可行方式中， 所述第二应答模块还用于通过所述第二 请求应答帧对最后一个信道竟争周期内竟争成功的站点以及历史竟争成功的 站点进行资源分配。
在第二方面的第六种可行方式中， 所述接入点还包括：
确认应答模块， 用于在竟争成功的站点完成数据发送后进行确认应答。 在第二方面的第七种可行方式中， 所述请求处理单元包括： 第二阈值判断模块，用于判断当前信道竟争周期内竟争成功的站点数量与 历史竟争成功的站点数量之和是否小于预定阈值， 如果是， 所述接入点等待第 一预定时间不作回复以触发站点进入下一个信道竟争周期； 否则， 向第三应答 模块发送第三通知消息；
所述第三应答模块， 用于根据所述第三通知消息， 等待第二预定时间后以 广播格式发送第三请求应答帧， 以对所有竟争成功的站点进行竟争成功确认； 第一预定时间的长度大于第二预定时间的长度。
在第二方面的第八种可行方式中， 所述请求处理单元还包括：
第二次数判断模块， 用于判断信道竟争周期数是否达到预定周期阈值， 如 果是， 向第三应答模块发送第三通知消息； 否则， 向第二阈值判断模块发送第 二阈值判断消息。
在第二方面的第九种可行方式中， 所述请求处理单元还包括：
第二时间监控模块， 用于监控信道竟争时间是否达到预定时间阈值， 如果 是， 向第三应答模块发送第三通知消息。
在第二方面的第十种可行方式中， 所述第三应答模块， 还用于通过所述第 三请求应答帧对所有竟争成功的站点进行资源分配。 本发明所述 OFDMA竟争方法及接入点， 当初次竟争成功的站点数目小于 一定阈值的时候可以继续发起竟争， 以增加竟争成功的站点数目， 进而提高
OFDMA系统的吞吐量； 同时， 所述 OFDMA竟争方法与现有机制兼容， 当初 次竟争成功的站点达到阈值的时候， 并不会带来额外的开销， 易于与现有 OFDMA系统结合， 便于推广应用。
附图说明
为了更清楚地说明本发明实施例或现有技术中的技术方案， 下面将对实施 例或现有技术描述中所需要使用的附图作一简单地介绍， 显而易见地， 下面描 述中的附图是本发明的一些实施例， 对于本领域普通技术人员来讲， 在不付出 创造性劳动的前提下， 还可以根据这些附图获得其他的附图。
图 1是一种现有的 OFDMA竟争方法的时序图；
图 2是本发明所述 OFDMA竟争方法的流程图；
图 3是本发明一种实施例所述 OFDMA竟争方法的时序图；
图 4是本发明另一种实施例所述 OFDMA竟争方法的时序图；
图 5a是本发明实现 OFDMA竟争的接入点的模块结构示意图；
图 5b是本发明实现 OFDMA竟争的接入点的另一模块结构示意图； 图 6是本发明一种实施例所述请求处理单元的模块结构示意图； 图 7是本发明一种实施例所述请求处理单元的优选方案的模块结构示意 图；
图 8是本发明另一种实现 OFDMA竟争的接入点的模块结构示意图； 图 9是本发明另一种实施例所述请求处理单元的模块结构示意图； 图 10是本发明另一种实施例所述请求处理单元的优选方案的模块结构示 意图；
图 11是本发明的接入点设备的硬件结构示意图；
图 12是本发明的站点设备的硬件结构示意图。 具体实施方式
为使本发明实施例的目的、 技术方案和优点更加清楚， 下面将结合本发明 实施例中的附图， 对本发明实施例中的技术方案进行清楚地描述， 显然， 所描 述的实施例是本发明一部分实施例， 而不是全部的实施例。 基于本发明中的实 施例， 本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实 施例， 都属于本发明保护的范围。
本发明适用于 OFDMA多子信道竟争系统。 当初次竟争成功的站点数目没 有达到一定阈值的时候， 可以再连续发起多轮的竟争， 用以增加竟争成功的站 点数目， 进而增大系统的吞吐量。
下面结合附图和实施例， 对本发明的具体实施方式作进一步详细描述。 以 下实施例用于说明本发明， 但不用来限制本发明的范围。
图 2是本发明实施例所述 OFDMA竟争方法的流程图， 如图 2所示， 所述 方法包括步骤：
220: 接入点在子信道上接收站点发送的竟争请求帧。
230: 判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站 点数量之和是否小于预定阈值， 如果是， 触发站点进入下一个信道竟争周期， 重复执行步骤 220和 230, 直至竟争成功的站点数量大于等于所述预定阈值。
本实施例中， 所述竟争请求帧采用 RTS帧。
另外， 所述步骤 220之前还可以包括步骤：
210: 站点被触发进行信道竟争。
当一个站点有数据需要发送而发送竟争请求帧之前， 需要一定的触发机 制。 关于触发机制本身不是本专利的保护重点， 它可以是信道空闲达到一定的 时长,例 口,信道空闲时长为 DIFS ( distributed (coordination function) interframe space , 分布式协调帧间间隔）， 或者， 接收到接入点发送的一个竟争触发帧， 例如， R-Poll„ 本发明一种优选的实施方式中， 上述步骤 230具体包括：
231： 所述接入点判断当前信道竟争周期内竟争成功的站点数量与历史竟 争成功的站点数量之和是否小于预定阈值， 如果是， 所述接入点以广播格式发 送第一请求应答帧， 以对当前信道竟争周期内竟争成功的站点进行竟争成功确 认， 并触发站点进入下一个信道竟争周期， 重复执行所述步骤 220和 231 , 直 至竟争成功的站点数量大于等于所述预定阈值； 否则， 所述接入点以广播格式 发送第二请求应答帧， 以对最后一个信道竟争周期内竟争成功的站点进行竟争 成功确认， 结束流程。 参见图 3 , 在信道空闲 （即 CH idle )或收到竟争触发帧 （即 R-Poll帧） 后， 站点 STA1首先进行回退， 回退时间为 T1 , 当回退结束后如果信道依然空 闲则可以选择一个子信道向接入点 AP发送竟争请求帧 RTS。 AP会在所有的 子信道上进行接收， 并判断竟争成功的站点的数目。 如果竟争成功的站点数目 小于某一个预定阈值的时候， AP将以广播格式发送第一请求应答帧 G-CTS' , G-CTS，一方面对竟争成功的站点进行竟争成功确认，另一方面还会触发站点进 入下一个信道竟争周期。 假设预定阈值为 3 , 第一个信道竟争周期内竟争成功 的站点仅为 STA1 , 则将进行下一个信道竟争周期。
上一个信道竟争周期内没有竟争成功的站点可以重复竟争发送请求过程， 即首先进行回退，如果回退结束之后信道依然空闲则选择一个子信道发送 RTS 帧。 AP接收到新一个信道竟争周期的 RTS帧之后， 将判断竟争成功的总站点 数目是否达到阈值， 如果依然小于阈值则可以再一次回复 G-CTS，帧。 这一次 的 G-CTS'帧将对刚刚竟争成功的站点进行竟争成功确认， 并触发站点进入下 一个信道竟争周期。
参见图 3 , 站点 STA2和 STA4首先进行回退， 回退时间为 T2, 当回退结 束后如果信道依然空闲则可以选择一个子信道向接入点 AP 发送竟争请求帧 RTS。 AP会在所有的子信道上进行接收，并判断当前信道竟争周期内竟争成功 的站点与历史竟争成功的站点的数目之和是否小于所述预定阈值， 判断结果显 示当前信道竟争周期内竟争成功的站点与历史竟争成功的站点的数目之和为 3 , 大于等于所述预定阈值 3 , 则 AP以广播格式发送第二请求应答帧 G-CTS , 以对最后一个信道竟争周期内竟争成功的站点进行竟争成功确认。 如果当前信道竟争周期内竟争成功的站点与历史竟争成功的站点的数目 之和小于预定阈值， 则 AP可以不断地重复以上步骤 220和 231直到竟争成功 的站点数目达到预定阈值，但是考虑到时延等因素可以设置一个竟争周期数的 上限， 当连续发起竟争的周期数到达上限之后即使竟争成功的站点数目没有达 到预定阈值也将不再发起下一个信道竟争周期。
本发明一种优选的实施方式中， 还包括步骤：
判断信道竟争周期数是否达到预定周期阈值， 如果是， 直接执行所述接入 点以广播格式发送第二请求应答帧， 以对当前信道竟争周期内竟争成功的站点 进行竟争成功确认的步骤； 否则，
执行判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站 点数量之和是否小于预定阈值。
另外， 还可以通过监控信道竟争时间避免出现无限竟争的情况， 优选地， 所述方法还包括：
监控信道竟争时间是否达到预定时间阈值， 如果是， 所述接入点以广播格 式发送竟争结束帧， 以通知站点信道竟争结束。
其中， 监控信道竟争时间的起始点可以是站点被触发进行信道竟争的时 间， 也可以是接入点开始接收竟争请求帧的时间。 所述竟争结束帧以广播形式 发送给所有站点， 如果最后一个信道竟争周期内竟争成功的站点尚未接收到第 二请求应答帧， 则当其接收到所述竟争结束帧后首先完成竟争成功确认， 然后 可以进行数据发送； 如果最后一个信道竟争周期内竟争成功的站点已经接收到 第二请求应答帧， 则当其接收到所述竟争结束帧后， 直接可以进行数据发送。
本实施方式中对竟争成功的站点进行资源（时间和 /或频率）分配有两种方 式：
所述接入点以广播格式发送第一请求应答帧时， 所述第一请求应答帧还对 当前信道竟争周期内竟争成功的站点进行资源分配；
所述接入点以广播格式发送第二请求应答帧时， 所述第二请求应答帧还对 最后一个信道竟争周期内竟争成功的站点进行资源分配。 或者，
所述接入点以广播格式发送第二请求应答帧时， 所述第二请求应答帧还对 最后一个信道竟争周期内竟争成功的站点以及历史竟争成功的站点进行资源 分配。 另外， 当所有竟争成功的站点接收到 G-CTS 帧后， 则根据被分配的频率 和 /或时间资源进行数据的发送。
当所有竟争成功的站点发送数据结束之后 AP发送 G-BA对所有竟争成功 的站点进行确认应答。 本发明另一种优选实施方式中， 上述步骤 230具体包括：
231': 所述接入点判断当前信道竟争周期内竟争成功的站点数量与历史竟 争成功的站点数量之和是否小于预定阈值， 如果是， 所述接入点等待第一预定 时间不作回复以触发站点进入下一个信道竟争周期， 重复执行所述步骤 220和 231' , 直至竟争成功的站点数量大于等于所述预定阈值； 否则， 所述接入点等 待第二预定时间后以广播格式发送第三请求应答帧， 以对所有竟争成功的站点 进行竟争成功确认， 结束流程。
第一预定时间的长度大于第二预定时间的长度。
参见图 4, 本实施方式中竟争触发机制也可以是信道空闲达到一定的时长 或者接收到 AP发送的一个竟争触发帧。 当触发机制是信道空闲达到一定时长 的时候， 则不再需要图中所示的 t0; 当触发机制为接收一个 R-Poll帧的话， t0 为从接收 R-Poll帧到开始回退的间隔时间， 可以为 SIFS。
图 4中，在第一个信道竟争周期内， 多个 STA满足竟争触发条件而进入竟 争阶段之后， 首先需要进行回退， 假设 STA1和 STA4回退时间为 T3 , 在所有 竟争站点中回退时间最短， 回退结束后信道依然空闲则分别选择一个子信道发 送请求帧 RTS。
AP 在所有的子信道上进行接收， 并判断竟争成功的站点的数目。 第一个 信道竟争周期内竟争成功的站点数目为 2, 小于某预定阈值 3 , AP暂时不作回 复。 站点在第一个信道竟争周期内的 RTS帧发送完毕的第一预定时间 tl后如 果没有收到 AP 发送的第三请求应答帧 （该第三请求应答帧也可以采用 G-CTS ), 则可以重复竟争发送请求过程， 即首先进行回退， 如果回退结束之 后信道依然空闲则选择一个子信道发送 RTS帧。 AP接收到新一个信道竟争周 期内的 RTS帧之后，将判断当前信道竟争周期内竟争成功的站点数量与历史竟 争成功的站点数量之和是否大于等于预定阈值， 如果依然小于阈值则可以重复 上述过程， 让站点继续回退并发起竟争。 图 4中， 在第二个信道竟争周期的信 道竟争中， 站点 STA3竟争成功， 因此当前信道竟争周期内竟争成功的站点数 量与历史竟争成功的站点数量之和为 3等于预定阈值， 则 AP等待第二预定时 间 t2后以广播格式发送第三请求应答帧，以对所有竟争成功的站点进行竟争成 功确认， 结束流程。
如果当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数 量之和小于预定阈值， AP可以不断地重复以上步骤 220和 231，直到竟争成功 的站点数目达到预定阈值，但是考虑到时延等因素可以设置一个竟争周期数的 上限， 当连续发起竟争的周期数到达上限之后即使竟争成功的站点数目没有达 到阈值也将不再发起新一个信道竟争周期内的竟争。
本发明一种优选实施方式中， 所述方法还包括：
判断信道竟争周期数是否达到预定周期阈值， 如果是， 直接执行所述接入 点等待第二预定时间后以广播格式发送第三请求应答帧， 以对所有竟争成功的 站点进行竟争成功确认的步骤； 否则， 执行判断当前信道竟争周期内竟争成功 的站点数量与历史竟争成功的站点数量之和是否小于预定阈值。
本发明另一种优选实施方式中， 所述方法还包括： 监控信道竟争时间是否 达到预定时间阈值， 如果是， 直接执行所述接入点等待第二预定时间后以广播 格式发送第三请求应答帧， 以对所有竟争成功的站点进行竟争成功确认的步 骤。 本实施方式中， 由于所有竟争成功的站点都在接收到第三请求应答帧后完 成竟争成功确认， 因此， 当达到信道竟争时间后， 可以直接通过第三请求应答 帧对所有竟争成功的站点进行竟争成功确认， 而无需额外发送竟争结束帧。
当所有竟争成功的站点数目达到预定阈值或者连续竟争周期数达到预定 周期阈值或者信道竟争时间达到预定时间阈值后， AP将在最后一个信道竟争 周期内的 RTS帧发送完之后的 t2时间发送 G-CTS帧。第三请求应答帧 G-CTS 帧将对所有竟争成功的站点进行竟争成功确认。 同时， 第三请求应答帧 G-CTS 还对所有竟争成功的站点进行频率和 /或时间资源的分配。
由于是否可以发起新的一个信道竟争周期的竟争是由 AP决定的， 在本方 法中要求 t2的时间长度必须小于 tl的时间长度。在实现的时候可以取 tl为 PIFS ( oint (coordination function) interframe space , 点十办调†贞间间隔)或者 DIFS , 而 t2为 SIFS ( short interframe space , 短帧间间隔）。
当所有竟争成功的站点接收到 G-CTS帧后， 则根据被分配的频率和 /或时 间资源进行数据的发送。
当所有竟争成功的站点发送数据结束之后 ΑΡ发送 G-BA对所有竟争成功 的站点进行确认应答。 图 5a是本发明的接入点的模块结构示意图， 如图 5a所示， 所述接入点包 括：
请求接收单元 520, 用于在子信道上接收站点发送的竟争请求帧； 请求处理单元 530, 用于判断当前信道竟争周期内竟争成功的站点数量与 历史竟争成功的站点数量之和是否小于预定阈值， 如果是， 触发站点进入下一 个信道竟争周期。
参见图 5b, 所述接入点还包括：
竟争触发单元 510, 用于令站点被触发进行信道竟争。 参见图 6, 本发明一种实施方式中， 所述请求处理单元 530包括： 第一阈值判断模块 531 , 用于在信道竟争后判断当前信道竟争周期内竟争 成功的站点数量与历史竟争成功的站点数量之和是否小于预定阈值， 如果是， 向第一应答模块发送第一通知消息；否则，向第二应答模块发送第二通知消息； 所述第一应答模块 532, 用于根据第一通知消息， 以广播格式发送第一请 求应答帧， 以对当前信道竟争周期内竟争成功的站点进行竟争成功确认， 并触 发站点进入下一个信道竟争周期；
所述第二应答模块 533 , 用于根据第二通知消息， 以广播格式发送第二请 求应答帧， 以对最后一个信道竟争周期内竟争成功的站点进行竟争成功确认。
参见图 7,本实施方式中一种优选方案为，所述请求处理单元 530还包括： 第一次数判断模块 534,用于判断信道竟争周期数是否达到预定周期阈值， 如果是， 向所述第二应答模块 533发送第二通知消息； 否则， 向所述第一阈值 判断模块 531发送第一阈值判断消息。 所述第一阈值判断模块 531将根据所述 第一阈值判断消息在信道竟争后判断当前信道竟争周期内竟争成功的站点数 量与历史竟争成功的站点数量之和是否小于预定阈值， 如果是， 向第一应答模 块 532发送第一通知消息； 否则， 向第二应答模块 533发送第二通知消息。
本实施方式中另一种优选方案为， 所述请求处理单元 530还包括： 第一时 间监控模块， 用于监控信道竟争时间是否达到预定时间阈值， 如果是， 以广播 格式发送竟争结束帧， 以通知站点信道竟争结束。 所述第一应答模块 532还用于通过所述第一请求应答帧对当前信道竟争周 期内竟争成功的站点进行资源分配； 所述第二应答模块 533还用于通过第二请 求应答帧对最后一个信道竟争周期内竟争成功的站点进行资源分配。 或者， 所述第二应答模块还用于通过第二请求应答帧对最后一个信道竟争周期 内竟争成功的站点以及历史竟争成功的站点进行资源分配。
另外， 参见图 8 , 所述接入点还可以包括：
确认应答模块 540,用于在竟争成功的站点完成数据发送后进行确认应答。 参见图 9, 本发明另一种实施方式与上述实施方式基本相同， 不同之处在 于， 所述请求处理单元 530包括：
第二阈值判断模块 53 Γ ,用于判断当前信道竟争周期内竟争成功的站点数 量与历史竟争成功的站点数量之和是否小于预定阈值， 如果是， 所述接入点等 待第一预定时间不作回复以触发站点进入下一个信道竟争周期； 否则， 向第三 应答模块 533，发送第三通知消息；
所述第三应答模块 533，， 用于根据所述第三通知消息， 等待第二预定时间 后以广播格式发送第三请求应答帧， 以对所有竟争成功的站点进行竟争成功确 认； 第一预定时间的长度大于第二预定时间的长度。
参见图 10, 本实施方式一种优选方案为， 所述请求处理单元 530还包括： 第二次数判断模块 534，， 用于判断信道竟争周期数是否达到预定周期阈 值， 如果是， 向第三应答模块 533，发送第三通知消息； 否则， 向第二阈值判断 模块 531，发送第二阈值判断消息。 所述第二阈值判断模块 53 Γ , 将根据第二阈 值判断消息判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的 站点数量之和是否小于预定阈值， 如果是， 所述接入点等待第一预定时间不作 回复以触发站点进入下一个信道竟争周期； 否则， 向第三应答模块 533，发送第 三通知消息。
本实施方式另一种优选方案为， 所述请求处理单元 530还包括： 第二时间 监控模块， 用于监控信道竟争时间是否达到预定时间阈值， 如果是， 向第三应 答模块发送第三通知消息。 对于竟争成功的站点进行资源分配本实施方式中， 所述第三应答模块 533，，还用于通过所述第三请求应答帧对所有竟争成功的站 点进行资源分配。 图 11示出了一种接入点设备的实施例，如图 11所示，所述接入点设备 1100 与现有计算机结构类似， 其可以通过网络接口 1110与外部设备， 如站点， 交 互以实现竟争触发、 接收站点的竟争请求帧， 以及回复请求应答帧等； 其也可 以通过输入接口 1120和输出接口 1130实现上述交互功能。 同时， 其通过处理 器 1140实现对各站点的竟争请求的处理， 并控制所述网络接口 1110, 或者， 输入接口 1120和输出接口 1130与各站点进行数据交互。 另夕卜， 所述网络接口 1110、 输入接口 1120、 输出接口 1130和处理器 1140之间通过总线进行通信。 图 12示出了一种站点设备的实施例， 在该实施例中， 站点设备 1200包括 天线 1210、 发射电路 1220、 接收电路 1230、 功率控制器 1240、 处理单元 1250 和存储器 1260。 处理单元 1250控制站点设备 1200的操作， 处理单元 1250还 可以称为 CPU。 存储器 1260可以包括只读存储器和随机存取存储器， 并向处 理单元 1250提供指令和数据。存储器 1260的一部分还可以包括非易失行随机 存取存储器（NVRAM )。 具体的应用中， 站点设备 1200可以嵌入或者本身可 以就是例如移动电话之类的无线通信设备， 还可以包括容纳发射电路 1220和 接收电路 1230的载体， 以允许站点设备 1200和远程位置之间进行数据发射和 接收。 发射电路 1220和接收电路 1230可以耦合到天线 1210。 站点设备 1200 的各个组件通过总线系统 1270耦合在一起， 其中， 总线系统 1270除包括数据 总线之外，还包括电源总线、控制总线和状态信号总线。但是为了清楚明起见， 在图中将各种总线都标为总线系统 1270。 站点设备 1200还可以还包括功率控 制器 1240。 逻辑框图。 处理单元 1250可以是微处理器或者也可以是任何常规的处理器， 解码器等。 软件模块可以位于随机存储器， 闪存、 只读存储器， 可编程只读存 储器或者电可擦写可编程存储器、 寄存器等本领域成熟的存储介质中。 该存储 介质位于存储器 1260,处理单元 1250读取存储器 1260中的信息， 结合其硬件 完成上述方法的步骤。
本发明实施例所述 OFDMA竟争方法及接入点， 当初次竟争成功的站点数 目小于一定阈值的时候可以继续发起竟争， 以增加竟争成功的站点数目， 进而 提高 OFDMA系统的吞吐量； 同时， 所述 OFDMA竟争方法与现有机制兼容， 当初次竟争成功的站点达到阈值的时候， 并不会带来额外的开销， 易于与现有
OFDMA系统结合， 便于推广应用。
本领域普通技术人员将会理解， 本发明的各个方面、 或各个方面的可能实 现方式可以被具体实施为系统、 方法或者计算机程序产品。 因此， 本发明的各 方面、 或各个方面的可能实现方式可以采用完全硬件实施例、 完全软件实施例 (包括固件、 驻留软件等等)， 或者组合软件和硬件方面的实施例的形式， 在这 里都统称为"电路"、 "模块 "或者 "系统"。 此外， 本发明的各方面、 或各个方面 的可能实现方式可以采用计算机程序产品的形式，计算机程序产品是指存储在 计算机可读介质中的计算机可读程序代码。
计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质。计 算机可读存储介质包含但不限于电子、磁性、 光学、 电磁、 红外或半导体系统、 设备或者装置， 或者前述的任意适当组合， 如随机存取存储器 （RAM)、 只读 存储器 （ROM)、 可擦除可编程只读存储器（EPROM或者快闪存储器）、 光纤、 便携式只读存储器 (CD-ROM)。
计算机中的处理器读取存储在计算机可读介质中的计算机可读程序代码， 使得处理器能够执行在流程图中每个步骤、 或各步骤的组合中规定的功能动 作； 生成实施在框图的每一块、 或各块的组合中规定的功能动作的装置。
计算机可读程序代码可以完全在用户的计算机上执行、部分在用户的计算 机上执行、 作为单独的软件包、 部分在用户的计算机上并且部分在远程计算机 上， 或者完全在远程计算机或者器上执行。 也应该注意， 在某些替代实施方案 中， 在流程图中各步骤、 或框图中各块所注明的功能可能不按图中注明的顺序 发生。 例如， 依赖于所涉及的功能， 接连示出的两个步骤、 或两个块实际上可 能被大致同时执行， 或者这些块有时候可能被以相反顺序执行。 明的精神和范围。 这样， 倘若本发明的这些修改和变型属于本发明权利要求及 其等同技术的范围之内， 则本发明也意图包含这些改动和变型在内。

Claims

权 利 要 求 书
1、 一种正交频分多址接入 OFDMA竟争方法， 其特征在于， 包括： 接入点在子信道上接收站点发送的竟争请求帧；
判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数 量之和是否小于预定阈值，
如果是， 触发站点进入下一个信道竟争周期， 重复执行所述接入点在子信 道上接收站点发送的竟争请求帧和判断当前信道竟争周期内竟争成功的站点 数量与历史竟争成功的站点数量之和是否小于预定阈值的步骤， 直至竟争成功 的站点数量大于等于所述预定阈值。
2、 如权利要求 1所述 OFDMA竟争方法， 其特征在于， 触发站点进入下 一个信道竟争周期， 包括：
所述接入点以广播格式发送第一请求应答帧， 以对当前信道竟争周期内竟 争成功的站点进行竟争成功确认， 并触发站点进入下一个信道竟争周期；
则重复执行所述接入点在子信道上接收站点发送的竟争请求帧的步骤和 判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数量之 和是否小于预定阈值，直至竟争成功的站点数量大于等于所述预定阈值， 包括: 重复执行所述接入点在子信道上接收站点发送的竟争请求帧和判断当前 信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数量之和是否小 于预定阈值的步骤， 直至竟争成功的站点数量大于等于所述预定阈值； 否则， 所述接入点以广播格式发送第二请求应答帧， 以对最后一个信道竟争周期内竟 争成功的站点进行竟争成功确认， 结束流程。
3、 如权利要求 2所述 OFDMA竟争方法， 其特征在于， 还包括： 判断信道竟争周期数是否达到预定周期阈值， 如果是， 执行所述接入点以 广播格式发送第二请求应答帧， 以对当前信道竟争周期内竟争成功的站点进行 竟争成功确认的步骤； 否则，
执行判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站 点数量之和是否小于预定阈值。
4、 如权利要求 2所述 OFDMA竟争方法， 其特征在于， 所述方法还包括： 监控信道竟争时间是否达到预定时间阈值， 如果是， 所述接入点以广播格 式发送竟争结束帧， 以通知站点信道竟争结束。
5、 如权利要求 2所述 OFDMA竟争方法， 其特征在于，
所述接入点以广播格式发送第一请求应答帧时， 所述第一请求应答帧还对 本个信道竟争周期内竟争成功的站点进行资源分配；
所述接入点以广播格式发送第二请求应答帧时， 所述第二请求应答帧还对 最后一个信道竟争周期内竟争成功的站点进行资源分配。
6、 如权利要求 2所述 OFDMA竟争方法， 其特征在于，
所述接入点以广播格式发送第二请求应答帧时， 所述第二请求应答帧还对 最后一个信道竟争周期内竟争成功的站点以及历史竟争成功的站点进行资源 分配。
7、 如权利要求 2所述 OFDMA竟争方法， 其特征在于， 所述接入点以广 播格式发送第二请求应答帧， 以对最后一个信道竟争周期内竟争成功的站点进 行竟争成功确认， 之后还包括：
所述接入点在竟争成功的站点完成数据发送后进行确认应答。
8、 如权利要求 1所述 OFDMA竟争方法， 其特征在于， 触发站点进入下 一个信道竟争周期， 包括：
所述接入点等待第一预定时间不作回复以触发站点进入下一个信道竟争 周期；
则重复执行所述接入点在子信道上接收站点发送的竟争请求帧的步骤和 判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数量之 和是否小于预定阈值，直至竟争成功的站点数量大于等于所述预定阈值， 包括: 重复执行所述接入点在子信道上接收站点发送的竟争请求帧和判断当前 信道竟争周期内竟争成功的站点数量与历史竟争成功的站点数量之和是否小 于预定阈值的步骤， 直至竟争成功的站点数量大于等于所述预定阈值； 否则， 所述接入点等待第二预定时间后以广播格式发送第三请求应答帧， 以对所有竟 争成功的站点进行竟争成功确认；
其中,第一预定时间的长度大于第二预定时间的长度。
9、 如权利要求 8所述 OFDMA竟争方法， 其特征在于， 所述判断当前信 道竟争周期内竟争成功的站点数量与历史竟争成功的站点数量之和是否小于 预定阈值， 之前还包括：
判断信道竟争周期数是否达到预定周期阈值， 如果是， 直接执行所述接入 点等待第二预定时间后以广播格式发送第三请求应答帧， 以对所有竟争成功的 站点进行竟争成功确认的步骤； 否则，
执行判断当前信道竟争周期内竟争成功的站点数量与历史竟争成功的站 点数量之和是否小于预定阈值。
10、如权利要求 8所述 OFDMA竟争方法，其特征在于，所述方法还包括： 监控信道竟争时间是否达到预定时间阈值， 如果是， 直接执行所述接入点 等待第二预定时间后以广播格式发送第三请求应答帧， 以对所有竟争成功的站 点进行竟争成功确认的步骤。
11、 如权利要求 8所述 OFDMA竟争方法， 其特征在于， 所述接入点等待 第二预定时间后以广播格式发送第三请求应答帧时， 所述第三请求应答帧还对 所有竟争成功的站点进行资源分配。
12、 如权利要求 8所述 OFDMA竟争方法， 其特征在于， 所述接入点等待 第二预定时间后以广播格式发送第三请求应答帧， 以对所有竟争成功的站点进 行竟争成功确认， 之后还包括：
所述接入点在竟争成功的站点完成数据发送后进行确认应答。
13、 一种接入点， 其特征在于， 所述接入点包括：
请求接收单元， 用于在子信道上接收站点发送的竟争请求帧； 请求处理单元， 用于判断当前信道竟争周期内竟争成功的站点数量与历史 竟争成功的站点数量之和是否小于预定阈值， 如果是， 触发站点进入下一个信 道竟争周期， 直至竟争成功的站点数量大于等于所述预定阈值。
14、 如权利要求 13所述的接入点， 其特征在于， 所述请求处理单元包括： 第一阈值判断模块， 适于在信道竟争后判断当前信道竟争周期内竟争成功 的站点数量与历史竟争成功的站点数量之和是否小于预定阈值， 如果是， 向第 一应答模块发送第一通知消息； 否则， 向第二应答模块发送第二通知消息； 所述第一应答模块， 适于根据第一通知消息， 以广播格式发送第一请求应 答帧， 以对当前信道竟争周期内竟争成功的站点进行竟争成功确认， 并触发站 点进入下一个信道竟争周期；
所述第二应答模块， 适于根据第二通知消息， 以广播格式发送第二请求应 答帧， 以对最后一个信道竟争周期内竟争成功的站点进行竟争成功确认。
15、 如权利要求 14所述的接入点， 其特征在于， 所述请求处理单元还包 括：
第一次数判断模块， 用于判断信道竟争周期数是否达到预定周期阈值， 如 果是， 向所述第二应答模块发送第二通知消息； 否则， 向所述第一阈值判断模 块发送第一阈值判断消息。
16、 如权利要求 14所述的接入点， 其特征在于， 所述请求处理单元还包 括：
第一时间监控模块， 用于监控信道竟争时间是否达到预定时间阈值， 如果 是， 以广播格式发送竟争结束帧， 以通知站点信道竟争结束。
17、 如权利要求 14所述的接入点， 其特征在于，
所述第一应答模块还用于通过所述第一请求应答帧对当前信道竟争周期 内竟争成功的站点进行资源分配；
所述第二应答模块还用于通过所述第二请求应答帧对最后一个信道竟争 周期内竟争成功的站点进行资源分配。
18、 如权利要求 14所述的接入点， 其特征在于， 所述第二应答模块还适 于通过所述第二请求应答帧对最后一个信道竟争周期内竟争成功的站点以及 历史竟争成功的站点进行资源分配。
19、 如权利要求 13所述的接入点， 其特征在于， 所述接入点还包括： 确认应答模块， 用于在竟争成功的站点完成数据发送后进行确认应答。
20、 如权利要求 13所述的接入点， 其特征在于， 所述请求处理单元包括： 第二阈值判断模块，用于判断当前信道竟争周期内竟争成功的站点数量与 历史竟争成功的站点数量之和是否小于预定阈值， 如果是， 所述接入点等待第 一预定时间不作回复以触发站点进入下一个信道竟争周期； 否则， 向第三应答 模块发送第三通知消息；
所述第三应答模块， 用于根据所述第三通知消息， 等待第二预定时间后以 广播格式发送第三请求应答帧， 以对所有竟争成功的站点进行竟争成功确认； 第一预定时间的长度大于第二预定时间的长度。
21、 如权利要求 20所述的接入点， 其特征在于， 所述请求处理单元还包 括：
第二次数判断模块， 用于判断信道竟争周期数是否达到预定周期阈值， 如 果是， 向第三应答模块发送第三通知消息； 否则， 向第二阈值判断模块发送第 二阈值判断消息。
22、 如权利要求 20所述的接入点， 其特征在于， 所述请求处理单元还包 括：
第二时间监控模块， 用于监控信道竟争时间是否达到预定时间阈值， 如果 是， 向第三应答模块发送第三通知消息。
23、 如权利要求 20所述的接入点， 其特征在于， 所述第三应答模块， 还 用于通过所述第三请求应答帧对所有竟争成功的站点进行资源分配。
PCT/CN2013/087597 2013-03-22 2013-11-21 Ofdma竞争方法及接入点 WO2014146444A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP18156408.9A EP3386262B1 (en) 2013-03-22 2013-11-21 Ofdma contention method and access point
EP13878925.0A EP2978273B1 (en) 2013-03-22 2013-11-21 Ofdma contention method and access point
US14/843,770 US20150382380A1 (en) 2013-03-22 2015-09-02 Ofdma contention method and access point
US15/891,919 US10959266B2 (en) 2013-03-22 2018-02-08 OFDMA contention method and access point

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201310094952.X 2013-03-22
CN201310094952.XA CN104066145B (zh) 2013-03-22 2013-03-22 Ofdma竞争方法及接入点

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US14/843,770 Continuation US20150382380A1 (en) 2013-03-22 2015-09-02 Ofdma contention method and access point

Publications (1)

Publication Number Publication Date
WO2014146444A1 true WO2014146444A1 (zh) 2014-09-25

Family

ID=51553625

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/087597 WO2014146444A1 (zh) 2013-03-22 2013-11-21 Ofdma竞争方法及接入点

Country Status (5)

Country Link
US (2) US20150382380A1 (zh)
EP (3) EP3386262B1 (zh)
CN (2) CN107580333B (zh)
ES (1) ES2917378T3 (zh)
WO (1) WO2014146444A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20180002850A (ko) * 2015-05-27 2018-01-08 후아웨이 테크놀러지 컴퍼니 리미티드 채널 액세스 방법 및 장치

Families Citing this family (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3162152A4 (en) 2014-06-27 2018-03-07 Techflux Ltd. Method and device for transmitting data
WO2016009278A2 (en) 2014-06-27 2016-01-21 Techflux, Ltd. Method and device for transmitting data
CN105634666B (zh) 2014-11-05 2019-08-16 电信科学技术研究院 一种在非授权频段上的数据传输方法及装置
US9326157B1 (en) * 2014-11-06 2016-04-26 Intel IP Corporation Subframe aligned listen-before-talk for cellular in unlicensed band
CN107211453B (zh) * 2015-02-17 2020-01-31 华为技术有限公司 一种信道接入方法及信道接入装置
WO2016172942A1 (zh) * 2015-04-30 2016-11-03 华为技术有限公司 确定初始竞争窗口参数的方法、站点和接入点
JP6568584B2 (ja) 2015-05-07 2019-08-28 株式会社東芝 無線通信装置、無線通信端末および無線通信方法
JP6581652B2 (ja) 2015-05-07 2019-09-25 株式会社東芝 無線通信装置、無線通信端末および無線通信方法
WO2017004796A1 (zh) * 2015-07-07 2017-01-12 华为技术有限公司 一种随机接入方法、系统及终端设备
CN111030793B (zh) * 2015-09-02 2023-12-08 华为技术有限公司 一种无线局域网中触发帧传输的方法和装置
CN106686663B (zh) * 2015-11-05 2020-04-14 华为技术有限公司 上行传输的方法及装置
CN106817775B (zh) * 2015-11-27 2019-09-20 华为技术有限公司 分布式ofdma随机接入方法、ap及sta
US10820356B2 (en) * 2015-12-11 2020-10-27 Huawei Technologies Co., Ltd. Method and system for contention-based channel allocation
CN108702699B (zh) * 2015-12-18 2021-03-26 瑞典爱立信有限公司 无线局域网中的接入点、站点和其中用于接入点选择的方法
CN106937357B (zh) * 2015-12-31 2020-09-18 华为技术有限公司 一种多用户接入的方法及装置
GB2552497B (en) * 2016-07-25 2020-12-02 Canon Kk Transmission method for trigger frame by a 802.11ax access-point
CN106559900B (zh) * 2016-10-31 2019-08-13 西北工业大学 一种基于非对称带宽的多信道多址接入方法
CN108282904B (zh) * 2017-01-06 2020-10-30 展讯通信（上海）有限公司 用于蜂窝网通信系统的免调度资源使用方法及装置
CN107949059A (zh) * 2017-11-21 2018-04-20 重庆邮电大学 信道分配方法及网络系统
WO2020014897A1 (en) * 2018-07-18 2020-01-23 Nokia Shanghai Bell Co., Ltd. Resource indication in contention based transmission
RU2689125C1 (ru) * 2018-10-02 2019-05-24 Хуавей Текнолоджиз Ко., Лтд. Способ и устройство доступа к каналу
CN109587712B (zh) * 2018-11-23 2021-12-14 南京极域信息科技有限公司 一种WiFi-Display性能优化系统
US11109408B2 (en) 2019-08-16 2021-08-31 Techflux, Inc. Method and device for uplink transmission

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1941666A (zh) * 2005-09-30 2007-04-04 华为技术有限公司 基于中转站实现带宽分配和调度管理的方法和系统
CN102113401A (zh) * 2008-06-23 2011-06-29 诺基亚公司 用于使用软专用前导执行随机接入过程的方法和装置
CN102714872A (zh) * 2010-01-11 2012-10-03 高通股份有限公司 用于无线通信系统中的基于竞争的上行链路接入的方法和装置

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8576872B2 (en) * 2005-10-19 2013-11-05 Qualcomm Incorporated Multi-hop wireless mesh network medium access control protocol
US8086239B2 (en) * 2006-04-14 2011-12-27 Elmaleh David R Infrastructure for wireless telecommunication networks
CN101098296B (zh) * 2006-06-30 2010-05-26 西门子（中国）有限公司 控制无线信道访问竞争的方法及装置
US8849297B2 (en) * 2006-07-14 2014-09-30 Qualcomm Incorporated Call establishment and maintenance in a wireless network
CN101155405A (zh) * 2006-09-29 2008-04-02 北京三星通信技术研究有限公司 随机接入过程中解决碰撞的设备和方法
CN100466492C (zh) * 2007-02-08 2009-03-04 北京航空航天大学 自适应多址接入方法
KR101423033B1 (ko) * 2008-02-01 2014-07-28 재단법인서울대학교산학협력재단 무선통신시스템에서 데이터 전송 장치 및 방법
US20090203320A1 (en) * 2008-02-07 2009-08-13 Qualcomm Incorporated Asynchronous interference management based on timeslot overlap
US8503283B2 (en) * 2008-06-12 2013-08-06 Nokia Corporation Channel access protocol for wireless communication
KR101527974B1 (ko) * 2009-04-30 2015-06-15 엘지전자 주식회사 무선통신 시스템에서 상향링크 접속 제어방법
EP2465321B1 (en) * 2009-08-12 2020-04-22 InterDigital Patent Holdings, Inc. Method and apparatus for contention-based uplink data transmission
CN101764679B (zh) * 2009-12-16 2013-08-07 北京航空航天大学 分布式协作多址接入方法和系统
US9025544B2 (en) * 2010-02-10 2015-05-05 Lg Electronics Inc. Channel access method and apparatus in wireless local area network system
US9445432B2 (en) * 2010-06-25 2016-09-13 Microsoft Technology Licensing, Llc Fine-grained channel access in wireless networks
CN102387592B (zh) * 2010-09-02 2015-10-21 中兴通讯股份有限公司 一种资源竞争方法和站点
US9351315B2 (en) * 2011-03-25 2016-05-24 Beijing Nufront Mobile Multimedia Technology Co. Ltd. Resource scheduling method and device
US8917705B2 (en) * 2011-09-29 2014-12-23 Qualcomm Incorporated Collision reduction mechanisms for wireless communication networks

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1941666A (zh) * 2005-09-30 2007-04-04 华为技术有限公司 基于中转站实现带宽分配和调度管理的方法和系统
CN102113401A (zh) * 2008-06-23 2011-06-29 诺基亚公司 用于使用软专用前导执行随机接入过程的方法和装置
CN102714872A (zh) * 2010-01-11 2012-10-03 高通股份有限公司 用于无线通信系统中的基于竞争的上行链路接入的方法和装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2978273A4 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20180002850A (ko) * 2015-05-27 2018-01-08 후아웨이 테크놀러지 컴퍼니 리미티드 채널 액세스 방법 및 장치
EP3294036A4 (en) * 2015-05-27 2018-04-18 Huawei Technologies Co., Ltd. Channel access method and device
US10536988B2 (en) 2015-05-27 2020-01-14 Huawei Technologies Co., Ltd. Channel access method and apparatus
EP3790349A1 (en) * 2015-05-27 2021-03-10 Huawei Technologies Co., Ltd. Channel access method and apparatus
KR102231453B1 (ko) 2015-05-27 2021-03-23 후아웨이 테크놀러지 컴퍼니 리미티드 채널 액세스 방법 및 장치
US11523466B2 (en) 2015-05-27 2022-12-06 Huawei Technologies Co., Ltd. Channel access method and apparatus
US11700668B2 (en) 2015-05-27 2023-07-11 Huawei Technologies Co., Ltd. Channel access method and apparatus

Also Published As

Publication number Publication date
US10959266B2 (en) 2021-03-23
CN104066145A (zh) 2014-09-24
CN104066145B (zh) 2017-08-29
EP2978273B1 (en) 2017-05-03
EP3217757A1 (en) 2017-09-13
CN107580333B (zh) 2022-04-05
CN107580333A (zh) 2018-01-12
EP2978273A1 (en) 2016-01-27
ES2917378T3 (es) 2022-07-08
US20150382380A1 (en) 2015-12-31
US20180167977A1 (en) 2018-06-14
EP3386262B1 (en) 2022-04-13
EP3386262A1 (en) 2018-10-10
EP2978273A4 (en) 2016-04-06

Similar Documents

Publication Publication Date Title
WO2014146444A1 (zh) Ofdma竞争方法及接入点
US10477584B2 (en) Method and device for channel detection configuration of listen-before-talk mechanism on unlicensed spectrum
KR101236346B1 (ko) 무선 통신 시스템들에서 채널 예약을 위한 장치 및 방법
US9935785B2 (en) System and method for full-duplex media access control using Request-to-Send signaling
KR20180098613A (ko) 액세스 방법 및 장치
WO2016119302A1 (zh) 信道检测方法、信道检测系统、基站和终端
US11240166B2 (en) Wireless communication method for multi-user transmission scheduling, and wireless communication terminal using same
CN105101446A (zh) 一种用于非授权频段的冲突避免方法及装置
JP2011528218A (ja) 保留アップリンクｓｄｍａ送信機会の割り振りを可能にする別個のコンテンションウィンドウを提供するシステム及び方法
JP7271700B2 (ja) 通信方法、装置、及びコンピュータプログラム
WO2014166379A1 (zh) 一种资源预约方法及装置
WO2014206102A1 (zh) 介质接入的方法、服务接入点、站点和系统
WO2014187087A1 (zh) 一种信道竞争方法及设备
WO2015021772A1 (zh) 一种信道接入的方法、装置和系统
CN109905919B (zh) 多无线射频系统的数据传输方法及装置、存储介质、终端
CN106165521B (zh) 多信道接入方法与装置
WO2020063683A1 (zh) 一种发送、接收随机接入前导的方法及通信装置
CN106688301B (zh) 一种多信道的接入方法和装置
WO2021259212A1 (zh) 在无线局域网中转发数据的方法和设备
US10833837B2 (en) Electronic apparatus and wireless communication method
WO2023197782A1 (zh) 信道接入方法、装置、设备及存储介质
WO2017050143A1 (zh) 一种基于ofdma的数据传输方法及相关设备
WO2023165468A1 (zh) 一种资源确定方法及装置
CN117793938A (zh) 一种数据传输方法和装置
WO2015066846A1 (zh) 一种数据通信的方法、站点及系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13878925

Country of ref document: EP

Kind code of ref document: A1

REEP Request for entry into the european phase

Ref document number: 2013878925

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2013878925

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE