WO2018130144A1 - 一种信道竞争方法及wur站点 - Google Patents

一种信道竞争方法及wur站点 Download PDF

Info

Publication number
WO2018130144A1
WO2018130144A1 PCT/CN2018/071931 CN2018071931W WO2018130144A1 WO 2018130144 A1 WO2018130144 A1 WO 2018130144A1 CN 2018071931 W CN2018071931 W CN 2018071931W WO 2018130144 A1 WO2018130144 A1 WO 2018130144A1
Authority
WO
WIPO (PCT)
Prior art keywords
channel
wur
station
packet
interframe space
Prior art date
Application number
PCT/CN2018/071931
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 EP18739070.3A priority Critical patent/EP3562219B1/en
Publication of WO2018130144A1 publication Critical patent/WO2018130144A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0209—Power saving arrangements in terminal devices
    • H04W52/0225—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present application relates to the field of communications technologies, and in particular, to a channel competition method and a WUR site.
  • the site is usually powered by a battery, which has very high requirements for low energy consumption; the sleep mechanism can greatly reduce the energy consumption, and the longer the sleep cycle, the better the energy saving effect.
  • an excessively long sleep cycle leads to an increase in transmission delay.
  • a WUR Wike-up Radio Wakeup Radio
  • the AP or the STA wakes up the data receiving station in the sleep state by sending a WUP (Wake-up Packet Wakeup Packet) to the data receiving station.
  • WUP Wike-up Packet Wakeup Packet
  • the WUR WLAN network is introduced.
  • the setting rules of the channel competition waiting time of various types of stations make the unfairness of various stations in the channel competition, which seriously affects the effectiveness of the entire WLAN system.
  • the present invention relates to a channel contention method and a WUR site to solve the unfair problem of a station in channel competition.
  • the application provides a channel contention method, the method comprising:
  • Channel contention is performed after the end of the WUP wake-up packet transmission and waiting for the same time as the channel competition waiting time of the legacy station.
  • a DCF channel access mechanism is adopted in the method, and a channel contention waiting time of the legacy station is an extended interframe space EIFS.
  • the method adopts a single packet transmission mechanism in EDCA channel access, and the channel contention waiting time of the legacy station is EIFS-DIFS+AIFS, where EIFS is an extended interframe space and DIFS is a distributed interframe space. , AIFS is the arbitration interframe space.
  • the method adopts a TXOP transmission mechanism in EDCA channel access, and the method further includes: determining that the WUP wake-up packet is the last data packet in the TXOP transmission and RIT ⁇ EIFS-DIFS, the traditional site
  • the channel contention waiting time is EIFS-DIFS+AIFS, where EIFS is the extended interframe space, DIFS is the distributed interframe space, and AIFS is the arbitration interframe space.
  • the present application provides a channel contention method, where the method includes:
  • the WUR site sends a WUP wakeup packet
  • the WUR station waits for channel contention waiting time of the corresponding channel for channel contention.
  • a DCF channel access mechanism is adopted in the method, and a channel contention waiting time of the corresponding channel is a distributed interframe space DIFS.
  • a single packet transmission mechanism in EDCA channel access is adopted, and a channel contention waiting time of the corresponding channel is an arbitration interframe space AIFS.
  • the method adopts a TXOP transmission mechanism in EDCA channel access, and the method further includes: determining that the WUP wake-up packet is the last data packet in a TXOP transmission and RIT ⁇ EIFS-DIFS, the corresponding channel
  • the channel contention waiting time is the arbitration interframe space AIFS, where EIFS is the extended interframe space, DIFS is the distributed interframe space, and AIFS is the arbitration interframe space.
  • the method further includes: the WUR station waiting for the short frame interval SIFS.
  • the legacy data frame is one of a CF-END frame, a CTS-to-self frame with a Duration value of 0, and an ACK frame with a Duration value of 0.
  • the application provides a WUR site, and the WUR site includes:
  • a WUP wake-up packet sending unit configured to send a WUP wake-up packet
  • the channel contention waiting unit is configured to perform channel contention after the end of the WUP wake-up packet transmission and wait for the same time as the channel competition waiting time of the legacy station.
  • the WUR station adopts a DCF channel access mechanism, and the channel contention waiting time of the legacy station is an extended interframe space EIFS.
  • the WUR site adopts a single packet transmission mechanism in EDCA channel access, and the channel contention waiting time of the legacy site is EIFS-DIFS+AIFS, where EIFS is an extended interframe space, and DIFS is a distributed interframe space. , AIFS is the arbitration interframe space.
  • the WUR station adopts a TXOP transmission mechanism in EDCA channel access, and the WUR station further includes: a determining unit, configured to determine that the WUP wake-up packet is the last data packet in the TXOP transmission and the RIT ⁇ EIFS-DIFS ;
  • the channel contention waiting time of the traditional station is EIFS-DIFS+AIFS, where EIFS is an extended interframe space, DIFS is a distributed interframe space, and AIFS is an arbitration interframe space.
  • the application provides a WUR site, and the WUR site includes:
  • a WUP wake-up packet sending unit configured to send a WUP wake-up packet
  • a data frame generation sending unit configured to generate and send a legacy data frame
  • the channel competition waiting unit is configured to wait for the channel contention waiting time of the corresponding channel to perform channel competition from the end of the transmission of the legacy data frame.
  • the WUR station adopts a DCF channel access mechanism, and the channel contention waiting time of the corresponding channel is a distributed interframe space DIFS.
  • the WUR station adopts a single packet transmission mechanism in EDCA channel access, and the channel contention waiting time of the corresponding channel is an arbitration interframe space AIFS.
  • the WUR station adopts a TXOP transmission mechanism in EDCA channel access, and the WUR station further includes: a determining unit, configured to determine that the WUP wake-up packet is the last data packet in the TXOP transmission and the RIT ⁇ EIFS-DIFS ;
  • AIFS arbitration interframe space
  • DIFS extended interframe space
  • AIFS arbitration interframe space
  • the WUR station further includes: a data frame generation and sending waiting unit, configured to wait for a short frame interval SIFS after the sending the WUP wake-up packet, and generate and send a legacy data frame.
  • a data frame generation and sending waiting unit configured to wait for a short frame interval SIFS after the sending the WUP wake-up packet, and generate and send a legacy data frame.
  • the legacy data frame is one of a CF-END frame, a CTS-to-self frame with a Duration value of 0, and an ACK frame with a Duration value of 0.
  • the WUR station after transmitting the WUP wake-up packet, the WUR station waits for the channel competition for the same time as the channel competition waiting time of the traditional site, so that the WUR site and the traditional site simultaneously perform channel competition, eliminating the WUR site and the tradition.
  • the site has time unfairness in channel competition and improves the effectiveness of the entire WLAN system.
  • FIG. 3 is a flow chart of a channel competition method of the present application.
  • FIG. 4 is a schematic diagram of unfair competition between a WUR site and a legacy site channel in DCF channel access;
  • FIG. 5 is a schematic diagram of a WUR station competing for fairness between a WUR station and a legacy station channel by changing a channel competition waiting time in a DCF channel access;
  • FIG. 6 is a schematic diagram of unfair competition between a WUR site and a legacy site channel in a single packet transmission in an EDCA channel access;
  • FIG. 7 is a schematic diagram of a WUR station competing for fairness between a WUR station and a legacy station channel by changing a channel competition waiting time when a single packet transmission is performed in an EDCA channel access;
  • FIG. 8 is a schematic diagram of a fairness of a WUR site competing with a legacy site channel when a WUP wakeup packet is not the last packet in the TXOP in a TXOP transmission in an EDCA channel access;
  • FIG. 9 is a schematic diagram of a fairness of a WUR station competing with a legacy station channel when a WUP wake-up packet is the last packet in the TXOP and RIT ⁇ EIFS-DIFS in the TXOP transmission in the EDCA channel access;
  • FIG. 10 is a schematic diagram of an unfair competition between a WUR site and a legacy site channel in a TXOP transmission in an EDCA channel access, where the WUP wakeup packet is the last packet in the TXOP and RIT ⁇ EIFS-DIFS;
  • FIG. 11 is a schematic diagram of a TXOP transmission in an EDCA channel access, in which a WUP wake-up packet is the last packet in the TXOP and RIT ⁇ EIFS-DIFS, the WUR station changes the channel competition waiting time to make the WUR station compete with the legacy site channel fairly;
  • FIG. 13 is a schematic diagram of a fairness of a WUR site and a traditional site channel in a data frame manner in a DCF channel access;
  • FIG. 14 is a schematic diagram of the fairness of the WUR site competing with the traditional site channel in the single frame transmission in the EDCA channel access by using the data frame mode;
  • 15 is a schematic diagram of a TXOP transmission in an EDCA channel access, in which a WUP wake-up packet is the last packet in the TXOP and RIT ⁇ EIFS-DIFS, the WUR station competes with the legacy site channel through a data frame manner;
  • 16 is a schematic structural diagram of a WUR site using a DCF channel access mechanism or a single packet transmission in an EDCA channel access mechanism;
  • 17 is a schematic structural diagram of a WUR station using a TXOP transmission in an EDCA channel access mechanism
  • 18 is another schematic structural diagram of a WUR site using a DCF channel access mechanism or a single packet transmission in an EDCA channel access mechanism;
  • FIG. 19 is another schematic structural diagram of a WUR station using TXOP transmission in an EDCA channel access mechanism.
  • An application scenario of the present application is as shown in FIG. 1.
  • An AP1 (WUR Tx AP) having a WUR wakeup function sends a WUP wakeup packet to a STA1 (WUR Rx STA) having a WUR receiving function.
  • STA1 WUR Rx STA
  • STA1 WUR Rx STA
  • WUR Rx STA with WUR off one type is MAP2 (MAP with WUR off) with WUR receiving function off, one type is AP3 (WUR Tx AP) with WUR wake-up function in other cells, and the other type is WUR in other cells.
  • Wake-up STA4 (WUR Tx STA).
  • FIG. 2 Another application scenario of the present application is as shown in FIG. 2: a WUR wake-up function STA1 (WUR Tx STA) sends a WUP wake-up packet to the MAP1 having the WUR receiving function.
  • STA1 WUR Tx STA
  • MAP1 MAP1 having the WUR receiving function.
  • STA2 AP2, STA3, MAP2, AP3 and STA4 as described above.
  • an AP with WUR wake-up function and a STA with WUR wake-up function are collectively referred to as WUR Tx; a STA with WUR receiving function and a MAP with WUR receiving function are collectively referred to as WUR Rx; STAs without WUR function, An AP with WUR function, a STA with WUR receiving function, a MAP with WUR receiving function, an AP with WUR wake-up function in other cells, and a STA with WUR wake-up function in other cells.
  • These six types of stations cannot resolve the WUP.
  • Class sites are collectively referred to as traditional sites.
  • the present application solves the problem of unfair competition between the WUR Tx and the traditional site channel.
  • the WUR site described in the present application refers to the above-mentioned WUR Tx.
  • the traditional site described in the present application includes the above six types of traditional sites that cannot resolve the WUP, and the present application
  • the conventional site is not limited to sites in 802.11 that cannot resolve WUPs, but also includes next-generation 802.11ax of 802.11, and sites that cannot resolve WUPs in the next generation of 802.11ax.
  • the application provides a channel competition method, including:
  • the WUR station sends a WUP wakeup packet.
  • DCF Distributed Coordination Function
  • the WUR station sends the WUP wake-up packet. Because the traditional site does not have the ability to resolve the WUP wake-up packet, the WUP wake-up packet will be treated as a wrong packet, so the EIFS time must be waited before the subsequent channel competition; and the WUR site is finished. After WUP wakes up the packet, it waits for the DIFS time before the channel competition. Because EIFS>DIFS, the WUR station preempts the channel before the traditional site, and the WUR site and the traditional site have time unfairness when competing in the channel.
  • S102 Perform channel competition after waiting for the same time as the channel competition waiting time of the traditional station from the end of the WUP wake-up packet transmission.
  • the WUR station After the WUR station finishes transmitting the WUP wake-up packet, it will not wait for the original channel competition waiting time of the WUR station to perform channel competition, but wait for the channel competition waiting time of the traditional station to perform channel competition, so that the WUR site itself and the WUR station Traditional sites simultaneously compete for channels.
  • the original channel competition waiting time of the WUR station is DIFS, and the channel competition waiting time EIFS of the legacy station; according to the method in this embodiment, the WUR site ends.
  • the WUR station After sending the WUP wake-up packet, it will not wait for the DIFS to compete for the channel, but wait for the channel competition after the EIFS; thus, from the end of the WUR station to send the WUP wake-up packet, the WUR station waits for the EIFS to compete for the channel, and the traditional station waits for the EIFS. After channel competition, the WUR site and the traditional site simultaneously compete in the channel to ensure the fairness of channel competition.
  • the method described in the first embodiment is implemented by taking three specific scenarios in which there is an unfair phenomenon in the channel competition as an example.
  • DCF Distributed coordination function
  • the WUR station After the WUR station sends the WUP wake-up packet, the WUR station waits for DIFS (Distributed Interframe Space) time for channel contention, and the legacy station waits for EIFS (Extended Interframe Space) time for channel contention, DIFS ⁇ EIFS As shown in FIG. 4, this causes the WUR site to preempt the channel before the traditional site, and the WUR site and the legacy site have time unfairness in channel competition.
  • DIFS Distributed Interframe Space
  • EIFS Extended Interframe Space
  • the WUR station waits for the EIFS time to perform channel contention.
  • the channel competition waiting time of the traditional station is not changed.
  • the traditional station monitoring channel also waits for the EIFS time for channel competition after the WUP wake-up packet is received. In this way, the WUR site and the traditional site simultaneously perform channel competition, which ensures the fairness of channel competition, as shown in FIG.
  • EDCA Enhanced Distributed Channel Access
  • the WUR station In the single-packet transmission in EDCA channel access, after the WUR station sends the WUP wake-up packet, the WUR station waits for AIFS (Arbitration Interframe Space) time for channel contention, and the traditional station waits (EIFS-DIFS+AIFS) time for channel competition.
  • AIFS Aribitration Interframe Space
  • DIFS the distributed interframe space
  • AIFS the arbitration interframe space
  • AIFS ⁇ (EIFS-DIFS+AIFS) as shown in Figure 6, thus, causing the WUR site to precede the traditional site Preempting channels, WUR sites and traditional sites have time unfairness in channel competition.
  • the WUR station waits for (EIFS-DIFS+AIFS) time to perform channel contention.
  • the channel competition waiting time of the traditional station is not changed.
  • the traditional station monitoring channel also waits (EIFS-DIFS+AIFS) time for channel competition after the WUP wake-up packet is received.
  • EIFS-DIFS+AIFS time for channel competition after the WUP wake-up packet is received.
  • the TXOP transmission in EDCA channel access is divided into the following three categories:
  • WUP wake-up packet is the last packet in TXOP, and RIT ⁇ EIFS-DIFS, RIT refers to the remaining idle time of the current TXOP;
  • the WUP wake-up packet is the last packet in the TXOP, and RIT ⁇ EIFS-DIFS, RIT refers to the remaining idle time of the current TXOP;
  • the WUR site and the legacy site will wait for AIFS time for channel contention, so there is no competition between the WUR site and the legacy site. Fairness.
  • WUP wake-up packet is the last packet in TXOP, and RIT ⁇ EIFS-DIFS, RIT refers to the remaining idle time of the current TXOP
  • the WUR station will wait for AIFS time for channel contention after the TXOP transmission ends.
  • the traditional site will select channel competition between RIT+AIFS and EIFS-DIFS+AIFS for a longer period of time, so the traditional site also The channel will be awaited for AIFS time after the TXOP transmission ends, so there is no unfair competition between the WUR site and the traditional site.
  • WUP wake-up packet is the last packet in TXOP, and RIT ⁇ EIFS-DIFS, RIT refers to the remaining idle time of the current TXOP
  • RIT+AIFS ⁇ EIFS-DIFS+AIFS is established.
  • the WUR station will wait for AIFS time for channel contention after the TXOP transmission ends.
  • the traditional site will select channel competition between RIT+AIFS and EIFS-DIFS+AIFS for a longer period of time, so the traditional site will Wait for EIFS-DIFS+AIFS time for channel contention after the WUP wake-up packet is received. That is to say, the existing WUR station waits for RIT+AIFS to compete for channels after the WUP wake-up packet transmission ends.
  • the existing legacy site will wait for EIFS-DIFS+AIFS time for channel competition after the WUP wake-up packet is received, RIT+ AIFS ⁇ EIFS-DIFS+AIFS, so there is competition unfairness between WUR sites and traditional sites.
  • the method further includes: determining that the WUP wake-up packet is the last data packet in the TXOP transmission and RIT ⁇ EIFS-DIFS.
  • the method includes:
  • the WUR site sends a WUP wakeup packet
  • the WUR station determines that the WUP wake-up packet is the last data packet in the TXOP transmission. If not, the WUR station waits for the AIFS time for channel contention after the TXOP transmission ends, as shown in FIG. 8; if yes, further determines whether the RIT is smaller than (EIFS-DIFS);
  • the WUR station determines whether RIT is less than (EIFS-DIFS). If so, the WUR station waits (EIFS-DIFS+AIFS) for channel contention after the WUP wake-up packet transmission ends, as shown in Figure 11; if not, the WUR site is After the TXOP transmission ends, it waits for the AIFS time for channel contention, as shown in FIG.
  • the WUR station waits (EIFS-DIFS+AIFS) for channel contention after the WUP wake-up packet transmission ends. As shown in Figure 11, the channel contention waiting time of the legacy station is not changed. The traditional station listening channel is also sent in the WUP wake-up packet. Wait for (EIFS-DIFS+AIFS) time to end channel competition. In this way, the WUR site and the traditional site simultaneously compete in the channel to ensure the fairness of channel competition.
  • the WUR Rx for the WUR Rx with the WUR function turned on, an additional provision is made regarding the channel contention time: in order to maintain fairness, the WUR Rx for transmitting data of the upcoming competing channel opened by the WUR function can correctly identify the WUP wake-up packet.
  • the channel competition is still performed after waiting for the same time as the channel competition waiting time of the legacy station.
  • the EIFS time is waited for channel contention; in the EDCA channel access, the (EIFS-DIFS+AIFS) time is waited for channel contention.
  • the WUR station starts channel acknowledgment from the end of the WUP wake-up packet transmission, and waits for the same time as the channel competition waiting time of the traditional station to perform channel competition, thereby ensuring that the WUR station and the legacy station simultaneously perform channel. competition.
  • the present application provides another channel competition method, including:
  • the S201 and WUR stations send WUP wake-up packets.
  • S201 is the same as S101 in the first embodiment, and is not described here.
  • the WUR station waits for a short frame interval SIFS.
  • the WUR station waits for the short frame interval SIFS. Since the short frame interval SIFS is shorter than other interframe spaces, the data transmitted after the short frame interval SIFS has a higher priority.
  • the legacy station waits for the short frame interval SIFS, and the WUR station generates and transmits the legacy data frame. .
  • the WUR station sends a legacy data frame after waiting for the short frame interval SIFS.
  • the legacy station can receive the Legacy data frame preferentially and quickly, so as to timely adjust the WUR site and the traditional site for channel competition.
  • the WUR station generates and sends a legacy data frame, so that after receiving the legacy data frame, the legacy station waits for channel competition waiting time of the corresponding channel for channel contention.
  • the WUR station In S203, the WUR station generates and sends a Legacy data frame that can be parsed by the legacy station, where the transmission is sent in a broadcast manner.
  • the channel contention waiting time of the corresponding channel is specifically: in the DCF channel access mechanism, the channel contention waiting time is the distributed interframe space DIFS; in the EDCA channel access, the channel contention waiting time is the arbitration interframe space AIFS.
  • the WUR station uses the legacy data frame to make itself and the legacy station wait for the channel competition waiting time of the corresponding channel to perform channel competition after the end of the transmission of the legacy data frame.
  • Legacy data frames that can be parsed by a conventional site, for example, a CF-END frame, a CTS-to-self frame with a Duration value of 0, an ACK frame with a Duration value of 0, and the like.
  • Legacy data frames that can be parsed by conventional sites include, but are not limited to, the above.
  • the WUR station starts from the end of the transmission of the legacy data frame, and waits for channel competition waiting time of the corresponding channel to perform channel competition.
  • the channel contention waiting time of the corresponding channel is specifically: in the DCF channel access mechanism, the channel contention waiting time is a distributed interframe space DIFS; in the EDCA channel access, the channel contention waiting time is Arbitration interframe space AIFS.
  • the traditional station in S203 waits for the channel contention waiting time of the corresponding channel to perform channel competition after receiving the Legacy data frame.
  • the WUR station waits for the channel competition waiting time of the corresponding channel after the Legacy data frame is transmitted.
  • the time difference between the legacy station receiving the legacy data frame and the WUR station ending the transmission of the legacy data frame is small, which is negligible relative to the time of the channel competition, and can be considered as being received by the traditional station.
  • the Legacy data frame is the same time point as the WUR station ends transmitting the Legacy data frame.
  • the method described in the second embodiment is implemented by taking three specific scenarios in which there is an unfair phenomenon in the channel competition as an example.
  • DCF Distributed coordination function
  • the WUR station after transmitting the WUP wake-up packet, the WUR station waits for the short frame interval SIFS, generates and sends a legacy data frame, and waits for the channel contention waiting time of the corresponding channel from the end of the transmission of the legacy data frame.
  • Channel contention in DCF channel access, the channel contention latency is the distributed interframe space DIFS.
  • the WUR site sends a WUP wakeup packet
  • the WUR station waits for the short frame interval SIFS;
  • the WUR station generates and transmits a CF-END frame (in DCF channel access, the channel contention waiting time is a distributed interframe space DIFS), so that the legacy station waits for distributed interframes after receiving the CF-END frame. Interval DIFS for channel contention;
  • the WUR station starts from the end of the transmission of the CF-END frame and waits for the distributed interframe space DIFS for channel contention.
  • the application in the EDCA channel access single-packet transmission is the same as that in the DCF channel access, and is not described here.
  • the difference is that in the EDCA channel access, the channel contention waiting time is the arbitration inter-frame interval AIFS.
  • the WUR site sends a WUP wakeup packet
  • the WUR station waits for the short frame interval SIFS;
  • the WUR station generates and transmits a CF-END frame (in the EDCA channel access, the channel contention waiting time is the arbitration interframe space AIFS), so that the legacy station waits for the arbitration interframe space AIFS after receiving the CF-END frame. Perform channel competition;
  • the WUR station starts from the end of the transmission of the CF-END frame and waits for the arbitration interframe space AIFS for channel contention.
  • EDCA Enhanced Distributed Channel Access
  • the method of this embodiment is used to solve the unfairness.
  • the application of the method in the second embodiment is the same as the application in the EDCA channel access single-packet transmission in the EDCA channel access single-packet transmission, as shown in FIG. 15 , and details are not described herein again.
  • the WUR station in the method described in Embodiment 2, the WUR station generates and sends a Legacy data frame, so that after receiving the Legacy data frame, the legacy station waits for channel competition waiting time of the corresponding channel to perform channel competition, and the WUR station ends the transmission. After the Legacy data frame, the channel competition waiting time of the corresponding channel is awaited for channel competition, thereby ensuring that the WUR station and the conventional station simultaneously perform channel competition.
  • the WUR site includes:
  • the WUP wake-up packet sending unit 301 is configured to send a WUP wake-up packet.
  • the channel contention waiting unit 302 is configured to perform channel contention after waiting for the same time as the channel contention waiting time of the legacy station from the end of the WUP wake-up packet transmission.
  • the waiting time of the channel competition waiting unit 303 is different, specifically:
  • the channel contention waiting unit 303 of the WUR station will wait for the extended interframe space EIFS to perform channel contention.
  • the channel contention waiting unit 303 of the WUR station will wait for EIFS-DIFS+AIFS to perform channel contention; wherein EIFS is an extended interframe space, DIFS For distributed interframe space, AIFS is the arbitration interframe space.
  • the WUR site includes:
  • the WUP wake-up packet sending unit 301 is configured to send a WUP wake-up packet.
  • the WUP wakeup packet determining unit 3021 is configured to determine whether the WUP wakeup packet is the last data packet in the TXOP transmission, and if not, execute the original channel contention waiting unit 3022; otherwise, the value size determining unit 3023 is executed.
  • the original channel contention waiting unit 3022 is configured to wait for the arbitration interframe space AIFS after the end of the TXOP transmission to perform channel contention.
  • the value size determining unit 3023 is configured to determine whether the RIT is smaller than the EIFS-DIFS, and if yes, execute 303, otherwise, execute 3022, where RIT refers to the remaining idle time of the current TXOP, EIFS is an extended interframe space, and DIFS is a distributed frame. Interval.
  • the channel contention waiting unit 303 is configured to perform channel contention after the end of the WUP wake-up packet transmission and wait for the EIFS-DIFS+AIFS; wherein the EIFS is an extended interframe space, the DIFS is a distributed interframe space, and the AIFS is Arbitration interframe space.
  • the WUR station in the third embodiment performs channel competition after the WUP wake-up packet transmission ends and waits for the same time as the channel competition waiting time of the legacy station, thereby ensuring that the WUR station and the legacy station simultaneously perform channel competition.
  • the WUR site includes:
  • the WUP wake-up packet sending unit 401 is configured to send a WUP wake-up packet.
  • the data frame generation sending unit 403 is configured to generate and send a legacy data frame, so that after receiving the legacy data frame, the legacy station waits for channel competition waiting time of the corresponding channel for channel contention.
  • the channel competition waiting unit 404 is configured to wait for the channel contention waiting time of the corresponding channel for channel contention from the end of the transmission of the legacy data frame.
  • the waiting time of the channel competition waiting unit 403 is different, specifically:
  • the channel contention waiting unit 403 waits for the distributed interframe space DIFS for channel contention.
  • the channel contention waiting unit 403 waits for the arbitration interframe space AIFS for channel contention.
  • the WUR site includes:
  • the WUP wake-up packet sending unit 401 is configured to send a WUP wake-up packet.
  • the WUP wakeup packet determining unit 4021 is configured to determine whether the WUP wakeup packet is the last data packet in the TXOP transmission, and if not, execute the original channel contention waiting unit 4022; otherwise, the value size determining unit 4023 is executed.
  • the original channel contention waiting unit 4022 is configured to wait for the arbitration interframe space AIFS after the TXOP transmission ends to perform channel contention.
  • the value size determining unit 4023 is configured to determine whether the RIT is smaller than the EIFS-DIFS, and if yes, execute 403. Otherwise, execute 4022, where RIT refers to the remaining idle time of the current TXOP, EIFS is an extended interframe space, and DIFS is a distributed frame. Interval.
  • the data frame generation sending unit 403 is configured to generate and send a legacy data frame, so that the legacy station waits for the arbitration interframe space AIFS to perform channel contention after receiving the legacy data frame.
  • the channel contention waiting unit 404 is configured to wait for the arbitration interframe space AIFS to perform channel contention from the end of the transmission of the legacy data frame.
  • the two WUR stations in the foregoing Embodiment 4 further include a Legacy data frame generation transmission waiting unit connected to the Legacy data frame generation and transmission unit 403, and are configured to wait for the short frame interval SIFS after the WUP wake-up packet is sent.
  • the Legacy data frame is a legacy data frame that can be parsed by a conventional station, and may be, for example, a CF-END frame, a CTS-to-self frame with a Duration value of 0, an ACK frame with a Duration value of 0, and the like.
  • Legacy data frames that can be parsed by conventional sites mentioned in the examples include, but are not limited to, the above.
  • the WUR station described in Embodiment 4 generates and sends a Legacy data frame, so that after receiving the Legacy data frame, the legacy station waits for the channel competition waiting time of the corresponding channel to perform channel competition, and the WUR station ends the transmitting station itself. After the Legacy data frame is described, the channel competition waiting time of the corresponding channel is waited for channel competition, thereby ensuring that the WUR station and the conventional station simultaneously perform channel competition.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请涉及通信技术领域，尤其涉及一种信道竞争方法及一种WUR站点。本申请所述的方法，WUR站点在发送完WUP唤醒包后，等待与传统站点的信道竞争等待时间相同的时间进行信道竞争，从而使得WUR站点和传统站点同时进行信道竞争，消除WUR站点和传统站点在信道竞争时存在时间上的不公平性，提高整个WLAN系统的有效性。

Description

一种信道竞争方法及WUR站点
本申请要求于2017年1月14日提交中国专利局、申请号为201710026817.X、发明名称为“一种信道竞争方法及WUR站点”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种信道竞争方法及一种WUR站点。
背景技术
在以物联网为代表的通信场景中，站点通常是使用电池供电的，其对低能耗有非常高的要求；通过睡眠机制可以使得能耗大大降低，睡眠周期越长，节能效果越好。但是过长的睡眠周期，会导致传输时延的增加。
为了解决上述问题，在WLAN网络中引入WUR(Wake-up Radio唤醒无线电)机制。当WLAN网络中的AP或STA有数据要发送时，AP或STA通过发送WUP(Wake-up Packet唤醒包)给数据接收站点，以此唤醒处于睡眠状态的数据接收站点。可见，利用WUR(Wake-up Radio唤醒无线电)机制，既可以达到节约能耗的效果，又不影响数据的及时发送。
但是，引入了WUR的WLAN网络，在采用竞争式访问机制时，各类站点信道竞争等待时间的设定规则使得各类站点在信道竞争时存在不公平性，严重影响整个WLAN系统的有效性。
本申请一种信道竞争方法及一种WUR站点，以解决站点在信道竞争时存在的不公平问题。
第一方面，本申请提供一种信道竞争方法，该方法包括：
唤醒无线电WUR站点发送WUP唤醒包；
从所述WUP唤醒包发送结束时开始，等待与传统站点的信道竞争等待时间相同的时间后，进行信道竞争。
进一步地，所述方法中采用DCF信道访问机制，所述传统站点的信道竞争等待时间为扩展帧间间隔EIFS。
进一步地，所述方法中采用EDCA信道访问中的单包传输机制，所述传统站点的信道竞争等待时间为EIFS-DIFS+AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
进一步地，所述方法中采用EDCA信道访问中的TXOP传输机制，所述方法还包括：确定所述WUP唤醒包是TXOP传输中的最后一个数据包且RIT<EIFS-DIFS，所述传统站点的信道竞争等待时间为EIFS-DIFS+AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
第二方面，本申请提供一种信道竞争方法，该方法包括：
WUR站点发送WUP唤醒包；
所述WUR站点生成并发送Legacy数据帧；
从所述Legacy数据帧发送结束时开始，所述WUR站点等待相应信道的信道竞争等待时间进行信道竞争。
进一步地，所述方法中采用DCF信道访问机制，所述相应信道的信道竞争等待时间为分布式帧间间隔DIFS。
进一步地，所述方法中采用EDCA信道访问中的单包传输机制，所述相应信道的信道竞争等待时间为仲裁帧间间隔AIFS。
进一步地，所述方法中采用EDCA信道访问中的TXOP传输机制，所述方法还包括：确定所述WUP唤醒包是TXOP传输中的最后一个数据包且RIT<EIFS-DIFS，所述相应信道的信道竞争等待时间为仲裁帧间间隔AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
进一步地，所述WUR站点发送WUP唤醒包之后，所述WUR站点生成并发送Legacy数据帧之前，还包括：所述WUR站点等待短帧间隔SIFS。
进一步地，Legacy数据帧为CF-END帧、Duration值设为0的CTS-to-self帧、Duration值设为0的ACK帧中的一种。
第三方面，本申请提供一种WUR站点，该一种WUR站点包括：
WUP唤醒包发送单元，用于发送WUP唤醒包；
信道竞争等待单元，用于从所述WUP唤醒包发送结束时开始，等待与传统站点的信道竞争等待时间相同的时间后，进行信道竞争。
进一步地，所述WUR站点采用DCF信道访问机制，所述传统站点的信道竞争等待时间为扩展帧间间隔EIFS。
进一步地，所述WUR站点采用EDCA信道访问中的单包传输机制，所述传统站点的信道竞争等待时间为EIFS-DIFS+AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
进一步地，所述WUR站点采用EDCA信道访问中的TXOP传输机制，所述WUR站点还包括：判断单元，用于确定所述WUP唤醒包是TXOP传输中的最后一个数据包且RIT<EIFS-DIFS；
且所述传统站点的信道竞争等待时间为EIFS-DIFS+AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
第四方面，本申请提供一种WUR站点，该一种WUR站点包括：
WUP唤醒包发送单元，用于发送WUP唤醒包；
数据帧生成发送单元，用于生成并发送Legacy数据帧；
信道竞争等待单元，用于从所述Legacy数据帧发送结束时开始，等待相应信道的信道竞争等待时间进行信道竞争。
进一步地，所述WUR站点采用DCF信道访问机制，所述相应信道的信道竞争等待时间为分布式帧间间隔DIFS。
进一步地，所述WUR站点采用EDCA信道访问中的单包传输机制，所述相应信道的信道竞争等待时间为仲裁帧间间隔AIFS。
进一步地，所述WUR站点采用EDCA信道访问中的TXOP传输机制，所述WUR站点还包括：判断单元，用于确定所述WUP唤醒包是TXOP传输中的最后一个数据包且RIT<EIFS-DIFS；
且所述相应信道的信道竞争等待时间为仲裁帧间间隔AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
进一步地，所述WUR站点还包括：数据帧生成发送等待单元，用于在所述发送WUP唤醒包后，等待短帧间隔SIFS，生成并发送Legacy数据帧。
进一步地，Legacy数据帧为CF-END帧、Duration值设为0的CTS-to-self帧、Duration值设为0的ACK帧中的一种。
本申请所述的方法，WUR站点在发送完WUP唤醒包后，等待与传统站点的信道竞争等待时间相同的时间进行信道竞争，从而使得WUR站点和传统站点同时进行信道竞争，消除WUR站点和传统站点在信道竞争时存在时间上的不公平性，提高整个WLAN系统的有效性。
附图说明
图1是本申请的一个应用场景图；
图2是本申请的另一个应用场景图；
图3是本申请一种信道竞争方法的一个流程图；
图4是DCF信道访问中，WUR站点与传统站点信道竞争不公平的示意图；
图5是DCF信道访问中，WUR站点通过改变信道竞争等待时间，使WUR站点与传统站点信道竞争公平的示意图；
图6是EDCA信道访问中的单包传输时，WUR站点与传统站点信道竞争不公平的示意图；
图7是EDCA信道访问中的单包传输时，WUR站点通过改变信道竞争等待时间，使WUR站点与传统站点信道竞争公平的示意图；
图8是EDCA信道访问中的TXOP传输中，WUP唤醒包不是TXOP中最后一个包时，WUR站点与传统站点信道竞争公平的示意图；
图9是EDCA信道访问中的TXOP传输中，WUP唤醒包是TXOP中最后一个包且RIT≥EIFS-DIFS时，WUR站点与传统站点信道竞争公平的示意图；
图10是EDCA信道访问中的TXOP传输中，WUP唤醒包是TXOP中最后一个包且RIT<EIFS-DIFS时，WUR站点与传统站点信道竞争不公平的示意图；
图11是EDCA信道访问中的TXOP传输中，WUP唤醒包是TXOP中最后一个包且RIT<EIFS-DIFS时，WUR站点通过改变信道竞争等待时间，使WUR站点与传统站点信道竞争公平的示意图；
图12是本申请一种信道竞争方法的另一个流程图；
图13是DCF信道访问中，通过数据帧方式，使WUR站点与传统站点信道竞争公平的示意图；
图14是EDCA信道访问中的单包传输中，通过数据帧方式，使WUR站点与传统站点信道竞争公平的示意图；
图15是EDCA信道访问中的TXOP传输中，WUP唤醒包是TXOP中最后一个包且RIT<EIFS-DIFS时，通过数据帧方式，使WUR站点与传统站点信道竞争公平的示意图；
图16是WUR站点采用DCF信道访问机制或EDCA信道访问机制中的单包传输时的一个结构示意图；
图17是WUR站点采用EDCA信道访问机制中的TXOP传输时的一个结构示意图；
图18是WUR站点采用DCF信道访问机制或EDCA信道访问机制中的单包传输时的另一个结构示意图；
图19是WUR站点采用EDCA信道访问机制中的TXOP传输时的另一个结构示意图。
具体实施方式
为了更清楚地说明本发明实施例的技术方案，下面将对本发明实施例中所需要使用的附图作简单地介绍，显而易见地，下面所描述的附图仅仅是本发明的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
本申请的两种应用场景：
本申请的一个应用场景，如图1所示：具有WUR唤醒功能的AP1(WUR Tx AP)向具有WUR接收功能的STA1(WUR Rx STA)发送WUP唤醒包。在AP1的覆盖范围内，除了WUR STA1，有六类站点：一类是不具备WUR功能的站点STA2、一类是不具备WUR功能的无线接入点AP2、一类是WUR接收功能关闭的站点STA3(WUR Rx STA with WUR off)、一类是WUR接收功能关闭的MAP2(MAP with WUR off)、一类是其他小区具有WUR唤醒功能的AP3(WUR Tx AP)，一类是其他小区具有WUR唤醒功能的STA4(WUR Tx STA)。
本申请的另一个应用场景，如图2所示：具有WUR唤醒功能STA1(WUR Tx STA)向具有WUR接收功能的MAP1发送WUP唤醒包。在STA1的覆盖范围内，除了MAP，还有有六类如上所描述的站点STA2，AP2，STA3，MAP2，AP3和STA4。
本申请中，将具有WUR唤醒功能的AP和具有WUR唤醒功能的STA统称为WUR Tx；将具有WUR接收功能的STA和具有WUR接收功能的MAP统称为WUR Rx；不具备WUR功能的STA、不具备WUR功能的AP、WUR接收功能关闭的STA、WUR接收功能关闭的MAP、其他小区具有WUR唤醒功能的AP、其他小区具有WUR唤醒功能的STA，这六类站点都无法解析WUP，将这六类站点统称传统站点。
本申请解决WUR Tx和传统站点信道竞争时不公平的问题，本申请所述的WUR站点指上述的WUR Tx，本申请所述的传统站点包含上述六类无法解析WUP的传统站点，且本申请所述的传统站点不限于802.11中无法解析WUP的站点，还包括802.11的下一代802.11ax、及802.11ax下一代中无法解析WUP的站点。
实施例一
如图3所示，本申请提供一种信道竞争方法，包括：
S101、WUR站点发送WUP唤醒包。
S101中，由于WUR站点发送的WUP唤醒包无法被传统站点解析，所以会导致WUR站点和传统站点在之后的信道竞争时，存在时间上的不公平性。
例如，在所有使用分布式协调功能(Distributed coordination function,DCF)的信道访问中，都会运用一项基本原则：如果之前的数据接收无误，则站点在信道竞争之前须等待DIFS时间(DIFS为分布式帧间间隔)；如果之前的数据接收出现错误，则站点在信道竞争之前须等待EIFS时间(EIFS为扩展帧间间隔)；EIFS＞DIFS。
本步骤中，WUR站点发送WUP唤醒包，传统站点因为没有能力解析WUP唤醒包，会 把WUP唤醒包当做一个错误的包，因而在之后的信道竞争之前须等待EIFS时间；而WUR站点在发送完WUP唤醒包后，在之后的信道竞争之前等待DIFS时间；由于EIFS＞DIFS，导致WUR站点先于传统站点抢占信道，WUR站点和传统站点在信道竞争时存在时间上的不公平性。
S102、从所述WUP唤醒包发送结束时开始，等待与传统站点的信道竞争等待时间相同的时间后，进行信道竞争。
S102中，WUR站点结束发送WUP唤醒包后，将不再等待WUR站点原来的信道竞争等待时间后进行信道竞争，而是等待传统站点的信道竞争等待时间后进行信道竞争，以使WUR站点自己与传统站点同时进行信道竞争。例如，在DCF(Distributed coordination function,分布式协调功能)信道访问时，WUR站点原来的信道竞争等待时间为DIFS，传统站点的信道竞争等待时间EIFS；按照本实施例所述的方法，WUR站点结束发送WUP唤醒包后，将不再等待DIFS就进行信道竞争，而是等待EIFS后进行信道竞争；如此，从WUR站点结束发送WUP唤醒包开始，WUR站点等待EIFS后进行信道竞争，传统站点等待EIFS后进行信道竞争，WUR站点与传统站点同时进行信道竞争，保证了信道竞争的公平性。
以下，分别以在信道竞争时存在不公平现象的三个具体场景为例，实施本实施例一所述的方法。
1、分布式协调功能(Distributed coordination function,DCF)信道访问
在DCF信道访问机制中，WUR站点发送完WUP唤醒包之后，WUR站点等待DIFS(分布式帧间间隔)时间进行信道竞争，传统站点等待EIFS(扩展帧间间隔)时间进行信道竞争，DIFS<EIFS，如图4所示，如此，导致WUR站点先于传统站点抢占信道，WUR站点和传统站点在信道竞争时存在时间上的不公平性。
按照实施例一所述的方法，WUR站点在所述WUP唤醒包发送结束后，等待EIFS时间后进行信道竞争。传统站点的信道竞争等待时间未作改变，传统站点监听信道，也是在WUP唤醒包接收结束后，等待EIFS时间进行信道竞争。如此，WUR站点与传统站点同时进行信道竞争，保证了信道竞争的公平性，如图5所示。
2、增强的分布式信道接入(Enhanced Distributed Channel Access,EDCA)信道访问中的单包传输
在EDCA信道访问中的单包传输中，在WUR站点发送完WUP唤醒包之后，WUR站点等待AIFS(仲裁帧间间隔)时间进行信道竞争，传统站点等待(EIFS-DIFS+AIFS)时间进行信道竞争，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔，AIFS<(EIFS-DIFS+AIFS)，如图6所示，如此，导致WUR站点先于传统站点抢占信道，WUR站点和传统站点在信道竞争时存在时间上的不公平性。
按照实施例一所述的方法，WUR站点在所述WUP唤醒包发送结束后，等待(EIFS-DIFS+AIFS)时间后进行信道竞争。传统站点的信道竞争等待时间未作改变，传统站点监听信道，也是在WUP唤醒包接收结束后，等待(EIFS-DIFS+AIFS)时间进行信道竞争。如此，WUR站点与传统站点同时进行信道竞争，保证了信道竞争的公平性，如图7所示。
3、增强的分布式信道接入(Enhanced Distributed Channel Access,EDCA)信道访问中的TXOP传输
EDCA信道访问中的TXOP传输分为以下三个类别：
1)WUP唤醒包不是TXOP中最后一个包；
2)WUP唤醒包是TXOP中最后一个包，且RIT≥EIFS-DIFS,RIT指当前TXOP的剩余空闲时间；
3)WUP唤醒包是TXOP中最后一个包，且RIT<EIFS-DIFS，RIT指当前TXOP的剩余空闲时间；
以上三种类别中，只有第3)种类别中的WUR站点和传统站点之间存在不公平性。
1)WUP唤醒包不是TXOP中最后一个包
如图8所示，如果WUP唤醒包不是TXOP传输中的最后一个包，则在TXOP传输结束后，WUR站点和传统站点都会等待AIFS时间进行信道竞争，所以WUR站点和传统站点不存在竞争的不公平性。
2)WUP唤醒包是TXOP中最后一个包，且RIT≥EIFS-DIFS,RIT指当前TXOP的剩余空闲时间
如图9所示，如果WUP唤醒包是WUR站点的TXOP中的最后一个包，且满足RIT≥EIFS-DIFS，则RIT+AIFS≥EIFS-DIFS+AIFS成立。根据802.11标准，WUR站点会在TXOP传输结束后等待AIFS时间进行信道竞争，传统站点会在RIT+AIFS和EIFS-DIFS+AIFS两者之间选择更长的时间之后进行信道竞争，因此传统站点也会在TXOP传输结束后等待AIFS时间进行信道竞争，所以WUR站点和传统站点不存在竞争的不公平性。
3)WUP唤醒包是TXOP中最后一个包，且RIT<EIFS-DIFS，RIT指当前TXOP的剩余空闲时间
如图10所示，如果WUP唤醒包是WUR站点的TXOP中的最后一个包，且满足RIT<EIFS-DIFS，则RIT+AIFS<EIFS-DIFS+AIFS成立。根据802.11标准，WUR站点会在TXOP传输结束后等待AIFS时间进行信道竞争，传统站点会在RIT+AIFS和EIFS-DIFS+AIFS两者之间选择更长的时间之后进行信道竞争，因此传统站点会在WUP唤醒包接收结束后等待EIFS-DIFS+AIFS时间进行信道竞争。也就是说，现有的WUR站点在WUP唤醒包传输结束后等待RIT+AIFS进行信道竞争，现有的传统站点会在WUP唤醒包接收结束后等待EIFS-DIFS+AIFS时间进行信道竞争，RIT+AIFS<EIFS-DIFS+AIFS，所以WUR站点和传统站点存在竞争的不公平性。
因此，若本实施例所述方法中采用EDCA信道访问中的TXOP传输机制，所述方法还包括：确定所述WUP唤醒包是TXOP传输中的最后一个数据包且RIT<EIFS-DIFS。
本实施例所述方法中采用EDCA信道访问中的TXOP传输机制时，所述方法包括：
WUR站点发送WUP唤醒包；
WUR站点判断所述WUP唤醒包是TXOP传输中的最后一个数据包，若不是，则WUR站点在TXOP传输结束后等待AIFS时间进行信道竞争，如图8所示；若是，则进一步判断RIT是否小于(EIFS-DIFS)；
WUR站点判断RIT是否小于(EIFS-DIFS)，若是，则WUR站点在WUP唤醒包传输结束后等待(EIFS-DIFS+AIFS)时间进行信道竞争，如图11所示；若不是，则WUR站点在TXOP传输结束后等待AIFS时间进行信道竞争，如图9所示。
WUR站点在WUP唤醒包传输结束后等待(EIFS-DIFS+AIFS)时间进行信道竞争，如图11所示，传统站点的信道竞争等待时间未作改变，传统站点监听信道，也是在WUP唤 醒包发送结束后等待(EIFS-DIFS+AIFS)时间进行信道竞争。如此，WUR站点与传统站点同时进行信道竞争，保证了信道竞争的公平性。
另，在本实施例中，对于WUR功能打开的WUR Rx，关于信道竞争时间做额外规定：为了保持公平性，对于WUR功能打开的即将竞争信道发送数据的WUR Rx，即使可以正确识别WUP唤醒包，在WUP唤醒包接收后，依然等待与传统站点的信道竞争等待时间相同的时间后，进行信道竞争。具体地，在DCF信道访问机制中，等待EIFS时间进行信道竞争；在EDCA信道访问中，等待(EIFS-DIFS+AIFS)时间进行信道竞争。
可见，实施例一所述的方法，WUR站点从WUP唤醒包发送结束时开始，等待与传统站点的信道竞争等待时间相同的时间后，进行信道竞争，以此保证WUR站点和传统站点同时进行信道竞争。
实施例二
如图12所示，本申请提供另一种信道竞争方法，包括：
S201、WUR站点发送WUP唤醒包。
S201同实施例一中的S101，此处不赘述。
S202、WUR站点等待短帧间隔SIFS。
S202中，在WUP唤醒包发送结束后，WUR站点等待短帧间隔SIFS。因为短帧间隔SIFS比其他帧间间隔要短，所以短帧间隔SIFS后传输的数据优先级较高。为保证下面的S203和S204中，传统站点能快速且优先地接收到Legacy数据帧，在WUR站点发送WUP唤醒包之后，WUR站点等待短帧间隔SIFS，WUR站点就生成并发送所述Legacy数据帧。WUR站点在等待短帧间隔SIFS后发送Legacy数据帧，传统站点可优先且快速地接收到所述Legacy数据帧，达到及时调整WUR站点和传统站点同时进行信道竞争的目的。
S203、WUR站点生成并发送Legacy数据帧，以使所述传统站点在接收到所述Legacy数据帧后，等待相应信道的信道竞争等待时间进行信道竞争。
S203中，WUR站点生成并发送传统站点能解析的Legacy数据帧，这里的发送指广播方式地发送。
相应信道的信道竞争等待时间，具体指：在DCF信道访问机制中，信道竞争等待时间为分布式帧间间隔DIFS；在EDCA信道访问中，信道竞争等待时间为仲裁帧间间隔AIFS。
本实施例中，WUR站点通过Legacy数据帧的方式，使自己与传统站点都在所述Legacy数据帧发送结束后，等待相应信道的信道竞争等待时间进行信道竞争。
传统站点能解析的Legacy数据帧有多种，例如，可以为CF-END帧、Duration值设为0的CTS-to-self帧、Duration值设为0的ACK帧等等，本实施例中提到的传统站点能解析的Legacy数据帧包括但不限制于上述几种。
S204、WUR站点从所述Legacy数据帧发送结束时开始，等待相应信道的信道竞争等待时间进行信道竞争。
S204中，如S203中所述，相应信道的信道竞争等待时间，具体指：在DCF信道访问机制中，信道竞争等待时间为分布式帧间间隔DIFS；在EDCA信道访问中，信道竞争等待时间为仲裁帧间间隔AIFS。
S203中传统站点是在接收到所述Legacy数据帧后等待相应信道的信道竞争等待时间进行信道竞争，S204中WUR站点是从所述Legacy数据帧发送完后等待相应信道的信道 竞争等待时间进行信道竞争，传统站点接收到所述Legacy数据帧与WUR站点结束发送所述Legacy数据帧之间存在时间差，但这个时间差很小，相对于信道竞争的时间来看可以忽略，可以认为传统站点接收到所述Legacy数据帧与WUR站点结束发送所述Legacy数据帧，是同一个时间点。
以下，分别以在信道竞争时存在不公平现象的三个具体场景为例，实施本实施例二所述的方法。
1、DCF(Distributed coordination function,分布式协调功能)信道访问
在DCF信道访问中，WUR站点和传统站点在信道竞争时存在时间上的不公平性在上述实施例一中已有描述，如图4所示，此处不再赘述。
按照实施例二所述的方法，WUR站点在发送WUP唤醒包之后，等待短帧间隔SIFS，生成并发送Legacy数据帧，从所述Legacy数据帧发送结束时开始等待相应信道的信道竞争等待时间进行信道竞争；在DCF信道访问中，信道竞争等待时间为分布式帧间间隔DIFS。
具体地，如图13所示：
WUR站点发送WUP唤醒包；
WUR站点等待短帧间隔SIFS；
WUR站点生成并发送CF-END帧(在DCF信道访问中，信道竞争等待时间为分布式帧间间隔DIFS)，以使所述传统站点在接收到所述CF-END帧后等待分布式帧间间隔DIFS进行信道竞争；
WUR站点从所述CF-END帧发送结束时开始，等待分布式帧间间隔DIFS进行信道竞争。
2、EDCA(Enhanced Distributed Channel Access,增强的分布式信道接入)信道访问中的单包传输
在EDCA信道访问中的单包传输中，WUR站点和传统站点在信道竞争时存在时间上的不公平性在上述实施例一中已有描述，如图6所示，此处不再赘述。
实施例二在EDCA信道访问单包传输中的应用与上述DCF信道访问中的相同，此处不再赘述；不同之处在于，在EDCA信道访问中，信道竞争等待时间为仲裁帧间间隔AIFS。
具体地，如图14所示：
WUR站点发送WUP唤醒包；
WUR站点等待短帧间隔SIFS；
WUR站点生成并发送CF-END帧(在EDCA信道访问中，信道竞争等待时间为仲裁帧间间隔AIFS)，以使所述传统站点在接收到所述CF-END帧后等待仲裁帧间间隔AIFS进行信道竞争；
WUR站点从所述CF-END帧发送结束时开始，等待仲裁帧间间隔AIFS进行信道竞争。
3、EDCA(Enhanced Distributed Channel Access,增强的分布式信道接入)信道访问中的TXOP传输，WUP唤醒包是TXOP中最后一个包且RIT<(EIFS-DIFS)
EDCA信道访问中的TXOP传输，在信道竞争时，有三种情况，具体的在实施例一中已做描述，此处不再赘述。
此处只针对EDCA信道访问中的TXOP传输中，WUR站点和传统站点在信道竞争时存在不公平性时，针对这种情况，采用本实施例的方法解决该不公平性。
实施例二所述方法在EDCA信道访问中的TXOP传输中的应用与上述实施例二在EDCA 信道访问单包传输中的应用相同，如图15所示，此处不再赘述。
可见，实施例二所述的方法，WUR站点生成并发送Legacy数据帧，使得传统站点在接收到所述Legacy数据帧后，等待相应信道的信道竞争等待时间进行信道竞争，WUR站点自己在结束发送所述Legacy数据帧后，等待相应信道的信道竞争等待时间进行信道竞争，以此保证WUR站点和传统站点同时进行信道竞争。
实施例三
如图16所示，若WUR站点采用DCF信道访问机制或EDCA信道访问机制中的单包传输，则所述WUR站点，包括：
WUP唤醒包发送单元301，用于发送WUP唤醒包。
信道竞争等待单元302用于从所述WUP唤醒包发送结束时开始，等待与传统站点的信道竞争等待时间相同的时间后，进行信道竞争。
根据WUR站点采用的信道访问机制不同，信道竞争等待单元303的等待时长不同，具体的：
若所述WUR站点采用DCF信道访问机制，则所述WUR站点的信道竞争等待单元303将等待扩展帧间间隔EIFS后，进行信道竞争。
若所述WUR站点采用EDCA信道访问中的单包传输机制，则所述WUR站点的信道竞争等待单元303将等待EIFS-DIFS+AIFS后，进行信道竞争；其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
如图17所示，若WUR站点采用EDCA信道访问机制中的TXOP传输，则所述WUR站点，包括：
WUP唤醒包发送单元301，用于发送WUP唤醒包。
WUP唤醒包判断单元3021，用于判断所述WUP唤醒包是否是TXOP传输中的最后一个数据包，若不是，则执行原信道竞争等待单元3022，否则，执行数值大小判断单元3023。
原信道竞争等待单元3022，用于在TXOP传输结束后等待仲裁帧间间隔AIFS，进行信道竞争。
数值大小判断单元3023，用于判断RIT是否小于EIFS-DIFS，若是，则执行303，否则，执行3022，其中，RIT指当前TXOP的剩余空闲时间，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔。
信道竞争等待单元303，用于从所述WUP唤醒包发送结束时开始，等待EIFS-DIFS+AIFS后，进行信道竞争；其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
实施例三所述的WUR站点，从WUP唤醒包发送结束时开始，等待与传统站点的信道竞争等待时间相同的时间后，进行信道竞争，以此保证WUR站点和传统站点同时进行信道竞争。
实施例四
如图18所示，若WUR站点采用DCF信道访问机制或EDCA信道访问机制中的单包传输，则所述WUR站点包括：
WUP唤醒包发送单元401，用于发送WUP唤醒包。
数据帧生成发送单元403，用于生成并发送Legacy数据帧，以使所述传统站点在接收到所述Legacy数据帧后，等待相应信道的信道竞争等待时间进行信道竞争。
信道竞争等待单元404，用于从所述Legacy数据帧发送结束时开始，等待相应信道的信道竞争等待时间进行信道竞争。
根据WUR站点采用的信道访问机制不同，信道竞争等待单元403的等待时长不同，具体的：
若WUR站点采用DCF信道访问机制，则所述信道竞争等待单元403等待分布式帧间间隔DIFS进行信道竞争。
若WUR站点采用EDCA信道访问中的单包传输机制，则所述信道竞争等待单元403等待仲裁帧间间隔AIFS进行信道竞争。
如图19所示，若WUR站点采用EDCA信道访问机制中的TXOP传输，则所述WUR站点，包括：
WUP唤醒包发送单元401，用于发送WUP唤醒包。
WUP唤醒包判断单元4021，用于判断所述WUP唤醒包是否是TXOP传输中的最后一个数据包，若不是，则执行原信道竞争等待单元4022，否则，执行数值大小判断单元4023。
原信道竞争等待单元4022，用于在TXOP传输结束后等待仲裁帧间间隔AIFS，进行信道竞争。
数值大小判断单元4023，用于判断RIT是否小于EIFS-DIFS，若是，则执行403，否则，执行4022，其中，RIT指当前TXOP的剩余空闲时间，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔。
数据帧生成发送单元403，用于生成并发送Legacy数据帧，以使所述传统站点在接收到所述Legacy数据帧后，等待仲裁帧间间隔AIFS进行信道竞争。
信道竞争等待单元404，用于从所述Legacy数据帧发送结束时开始，等待仲裁帧间间隔AIFS进行信道竞争。
上述所述的实施例四中的两种WUR站点，还包括与Legacy数据帧生成发送单元403连接的Legacy数据帧生成发送等待单元，用于在所述发送WUP唤醒包后，等待短帧间隔SIFS，生成并发送Legacy数据帧。所述的Legacy数据帧为传统站点能解析的Legacy数据帧，例如可以为CF-END帧、Duration值设为0的CTS-to-self帧、Duration值设为0的ACK帧等等，本实施例中提到的传统站点能解析的Legacy数据帧包括但不限制于上述几种。
可见，实施例四所述的WUR站点，生成并发送Legacy数据帧，使得传统站点在接收到所述Legacy数据帧后，等待相应信道的信道竞争等待时间进行信道竞争，WUR站点自己在结束发送所述Legacy数据帧后，等待相应信道的信道竞争等待时间进行信道竞争，以此保证WUR站点和传统站点同时进行信道竞争。
以上所述，仅为本发明的具体实施方式，但本发明的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本发明揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本发明的保护范围之内。因此，本发明的保护范围应以所述权利要求的保护范围为准。

Claims (20)

  1. 一种信道竞争方法，其特征在于，包括：
    唤醒无线电WUR站点发送WUP唤醒包；
    从所述WUP唤醒包发送结束时开始，所述WUR站点等待与传统站点的信道竞争等待时间相同的时间后，进行信道竞争。
  2. 根据权1所述的方法，其特征在于，所述方法中采用DCF信道访问机制，所述传统站点的信道竞争等待时间为扩展帧间间隔EIFS。
  3. 根据权1所述的方法，其特征在于，所述方法中采用EDCA信道访问中的单包传输机制，所述传统站点的信道竞争等待时间为EIFS-DIFS+AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
  4. 根据权1所述的方法，其特征在于，所述方法中采用EDCA信道访问中的TXOP传输机制，所述方法还包括：确定所述WUP唤醒包是TXOP传输中的最后一个数据包且RIT<EIFS-DIFS，所述传统站点的信道竞争等待时间为EIFS-DIFS+AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
  5. 一种信道竞争方法，其特征在于，包括：
    WUR站点发送WUP唤醒包；
    所述WUR站点生成并发送Legacy数据帧；
    从所述Legacy数据帧发送结束时开始，所述WUR站点等待相应信道的信道竞争等待时间后进行信道竞争。
  6. 根据权5所述的方法，其特征在于，所述方法中采用DCF信道访问机制，所述相应信道的信道竞争等待时间为分布式帧间间隔DIFS。
  7. 根据权5所述的方法，其特征在于，所述方法中采用EDCA信道访问中的单包传输机制，所述相应信道的信道竞争等待时间为仲裁帧间间隔AIFS。
  8. 根据权5所述的方法，其特征在于，所述方法中采用EDCA信道访问中的TXOP传输机制，所述方法还包括：确定所述WUP唤醒包是TXOP传输中的最后一个数据包且RIT<EIFS-DIFS，所述相应信道的信道竞争等待时间为仲裁帧间间隔AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
  9. 根据权5-8任一项所述的方法，其特征在于，所述WUR站点发送WUP唤醒包之后，所述WUR站点生成并发送Legacy数据帧之前，还包括：所述WUR站点等待短帧间隔SIFS。
  10. 根据权5-8任一项所述的方法，其特征在于，Legacy数据帧为CF-END帧、Duration值设为0的CTS-to-self帧、Duration值设为0的ACK帧中的一种。
  11. 一种WUR站点，其特征在于，包括：
    WUP唤醒包发送单元，用于发送WUP唤醒包；
    信道竞争等待单元，用于从所述WUP唤醒包发送结束时开始，等待与传统站点的信道竞争等待时间相同的时间后，进行信道竞争。
  12. 根据权11所述的WUR站点，其特征在于，所述WUR站点采用DCF信道访问机制，所述传统站点的信道竞争等待时间为扩展帧间间隔EIFS。
  13. 根据权11所述的WUR站点，其特征在于，所述WUR站点采用EDCA信道访问中的单包传输机制，所述传统站点的信道竞争等待时间为EIFS-DIFS+AIFS，其中，EIFS为 扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
  14. 根据权11所述的WUR站点，其特征在于，所述WUR站点采用EDCA信道访问中的TXOP传输机制，所述WUR站点还包括：判断单元，用于确定所述WUP唤醒包是TXOP传输中的最后一个数据包且RIT<EIFS-DIFS；
    且所述传统站点的信道竞争等待时间为EIFS-DIFS+AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
  15. 一种WUR站点，其特征在于，包括：
    WUP唤醒包发送单元，用于发送WUP唤醒包；
    数据帧生成发送单元，用于生成并发送Legacy数据帧；
    信道竞争等待单元，用于从所述Legacy数据帧发送结束时开始，等待相应信道的信道竞争等待时间进行信道竞争。
  16. 根据权15所述的WUR站点，其特征在于，所述WUR站点采用DCF信道访问机制，所述相应信道的信道竞争等待时间为分布式帧间间隔DIFS。
  17. 根据权15所述的WUR站点，其特征在于，所述WUR站点采用EDCA信道访问中的单包传输机制，所述相应信道的信道竞争等待时间为仲裁帧间间隔AIFS。
  18. 根据权15所述的WUR站点，其特征在于，所述WUR站点采用EDCA信道访问中的TXOP传输机制，所述WUR站点还包括：判断单元，用于确定所述WUP唤醒包是TXOP传输中的最后一个数据包且RIT<EIFS-DIFS；
    且所述相应信道的信道竞争等待时间为仲裁帧间间隔AIFS，其中，EIFS为扩展帧间间隔，DIFS为分布式帧间间隔，AIFS为仲裁帧间间隔。
  19. 根据权15-18任一项所述的WUR站点，其特征在于，所述WUR站点还包括：数据帧生成发送等待单元，用于在所述发送WUP唤醒包后，等待短帧间隔SIFS，生成并发送Legacy数据帧。
  20. 根据权15-18任一项所述的WUR站点，其特征在于，Legacy数据帧为CF-END帧、Duration值设为0的CTS-to-self帧、Duration值设为0的ACK帧中的一种。
PCT/CN2018/071931 2017-01-14 2018-01-09 一种信道竞争方法及wur站点 WO2018130144A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP18739070.3A EP3562219B1 (en) 2017-01-14 2018-01-09 Channel contention method and wur station

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710026817.X 2017-01-14
CN201710026817.XA CN108322927B (zh) 2017-01-14 2017-01-14 一种信道竞争方法及wur站点

Publications (1)

Publication Number Publication Date
WO2018130144A1 true WO2018130144A1 (zh) 2018-07-19

Family

ID=62840003

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/071931 WO2018130144A1 (zh) 2017-01-14 2018-01-09 一种信道竞争方法及wur站点

Country Status (3)

Country Link
EP (1) EP3562219B1 (zh)
CN (1) CN108322927B (zh)
WO (1) WO2018130144A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101193016A (zh) * 2006-12-01 2008-06-04 中国科学院沈阳自动化研究所 一种无线网状网络介质访问控制层节能方法
CN102413579A (zh) * 2011-11-14 2012-04-11 工业和信息化部电信传输研究所 一种避免802.11竞争式数据传输过程中网络拥塞的方法
US20140157009A1 (en) * 2012-12-05 2014-06-05 Broadcom Corporation Opportunistic Modem Wakeup
WO2016115357A1 (en) * 2015-01-15 2016-07-21 Qualcomm Incorporated Listen before talk load based channel access for co-existence with wi-fi

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150358786A1 (en) * 2013-01-22 2015-12-10 Lg Electronics Inc. Method for transmitting/receiving group addressed frame in wlan system and device therefor
CN104092523B (zh) * 2014-07-30 2017-07-28 东南大学 一种无线传感器网络多流竞争场景下的数据传输方法
CN104378812B (zh) * 2014-11-28 2017-09-29 北京农业信息技术研究中心 农田自组织网络可再生能源节点差异化拓扑控制方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101193016A (zh) * 2006-12-01 2008-06-04 中国科学院沈阳自动化研究所 一种无线网状网络介质访问控制层节能方法
CN102413579A (zh) * 2011-11-14 2012-04-11 工业和信息化部电信传输研究所 一种避免802.11竞争式数据传输过程中网络拥塞的方法
US20140157009A1 (en) * 2012-12-05 2014-06-05 Broadcom Corporation Opportunistic Modem Wakeup
WO2016115357A1 (en) * 2015-01-15 2016-07-21 Qualcomm Incorporated Listen before talk load based channel access for co-existence with wi-fi

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
See also references of EP3562219A4 *
TANG, SUHUA ET AL.: "Energy and spectrum efficient wireless LAN by tightly integrating low-power wake-up radio", 2016 IEEE 27TH ANNUAL IEEE INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS - (PIMRC): MOBILE AND WIRELESS NETWORKS, 4 September 2016 (2016-09-04) - 8 September 2016 (2016-09-08), XP033035505, Retrieved from the Internet <URL:DOI:10.1109/PIMRC.2016.7794873> *
WU, CHUNHUI ET AL.: "Detection and Punishment of MAC Layer Misbehavior in Wireless Networks", COMPUTER TECHNOLOGY AND DEVELOPMENT, vol. 16, no. 11, 30 November 2006 (2006-11-30), pages 222 - 224,227, XP009515348 *

Also Published As

Publication number Publication date
EP3562219A1 (en) 2019-10-30
EP3562219B1 (en) 2021-10-27
CN108322927B (zh) 2021-07-09
CN108322927A (zh) 2018-07-24
EP3562219A4 (en) 2019-11-06

Similar Documents

Publication Publication Date Title
US11843970B2 (en) Supporting a large number of devices in wireless communications
US10966152B2 (en) Method, wireless transmit/receive unit (WTRU) and base station for transferring small packets
JP6728359B2 (ja) アクセス方法及び装置
CN104365169B (zh) 在无线通信系统中的指示信道接入类型的方法和用于其的装置
AU2020379794A1 (en) Communication method between multi-link devices and apparatus
US10917848B2 (en) Wake-up frame transmission method and device
WO2015165205A1 (zh) 一种信道接入方法、系统、站点及计算机可读存储介质
US20160073340A1 (en) Enhancements for wifi multimedia extensions
WO2021008401A1 (zh) 通信方法、装置、计算机可读介质及电子设备
Palacios et al. Analysis of an energy-efficient MAC protocol based on polling for IEEE 802.11 WLANs
US8670345B2 (en) Wireless coexistence based on network allocation vector usage
US20230047705A1 (en) Restricted target wake time service period termination
WO2018130144A1 (zh) 一种信道竞争方法及wur站点
WO2017049955A1 (zh) 端到端通信站点发现方法、站点及接入点
WO2016173518A1 (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: 18739070

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2018739070

Country of ref document: EP

Effective date: 20190725