WO2015066911A1 - 信息发送方法及装置 - Google Patents

信息发送方法及装置 Download PDF

Info

Publication number
WO2015066911A1
WO2015066911A1 PCT/CN2013/086833 CN2013086833W WO2015066911A1 WO 2015066911 A1 WO2015066911 A1 WO 2015066911A1 CN 2013086833 W CN2013086833 W CN 2013086833W WO 2015066911 A1 WO2015066911 A1 WO 2015066911A1
Authority
WO
WIPO (PCT)
Prior art keywords
channel
sending
time length
length
maximum
Prior art date
Application number
PCT/CN2013/086833
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 CN201380076739.4A priority Critical patent/CN105230106B/zh
Priority to PCT/CN2013/086833 priority patent/WO2015066911A1/zh
Publication of WO2015066911A1 publication Critical patent/WO2015066911A1/zh
Priority to US15/151,307 priority patent/US10313906B2/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/10—Scheduling measurement reports ; Arrangements for measurement reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • 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 embodiments of the present invention relate to communication technologies, and in particular, to a method and an apparatus for transmitting information. Background technique
  • WLAN Wireless Local Area Networks
  • the transmitting station needs to detect the busy condition of the channel during the contention channel period, and after waiting for the channel to be idle for a certain period of time, the channel reservation can be performed and the data is transmitted on the reserved channel, or the channel is not reserved. Send data directly.
  • the maximum length of time occupied by the channel is a fixed value regardless of whether the channel is busy or not, and the length of time that the transmitting station reserves the channel once does not exceed the maximum length of time.
  • the transmitting station needs to compete multiple times.
  • the channel increases the complexity of sending data at the transmitting station. In the case of a busy channel, if the transmitting station needs to send less data, and the transmitting station still uses the maximum length of time to reserve the channel, the reserved channel Resources will be wasted and channel resource utilization is not high. Summary of the invention
  • Embodiments of the present invention provide an information sending method and apparatus for improving channel utilization.
  • an embodiment of the present invention provides a method for sending information, including:
  • the sending station detects the busy condition of the channel before transmitting the data
  • the sending station increases the maximum length of time occupied by the channel, and performs data transmission, where the length of time occupied by the channel when transmitting data is less than or equal to the maximum length of time after the increase and adjustment;
  • the sending station reduces the maximum length of time occupied by the channel, and performs data transmission, where the length of time occupied by the channel when transmitting data is less than or equal to the reduction.
  • the maximum length of time after adjustment is the maximum length of time after adjustment.
  • the sending station detects a busy condition of the channel, including:
  • the sending station detects whether the channel is continuously idle for a preset duration
  • the sending station determines that the channel is in an idle state
  • the transmitting station determines that the channel is in a busy state.
  • the sending station detects a busy condition of the channel, including:
  • the sending station determines that the channel is in an idle state
  • the transmitting station determines that the channel is busy.
  • the sending station reduces the maximum length of the occupied channel , including:
  • the transmitting station reduces the maximum time length of the occupied channel according to the interference parameter of the busy state of the channel;
  • the interference parameter includes at least one of the following parameters:
  • the length of the interference the number of disturbances, the frequency of the interference, and the type of interference source.
  • the maximum time length after the increasing adjustment is less than or equal to First preset time length
  • the maximum length of the reduced adjustment is greater than or equal to a second preset time length
  • the first preset time length is greater than the second preset time length.
  • the sending by the sending station, the data sending, Sending a station reserved channel, and performing data transmission on the reserved channel, where the length of the reserved channel is less than or equal to the adjusted maximum time length.
  • an embodiment of the present invention provides a sending station, including: a detecting module, configured to detect a busy condition of the channel before performing data transmission;
  • Adjusting a sending module configured to: if the detecting module detects that the channel is in an idle state, increase a maximum length of time occupied by the channel, and perform data transmission, where a length of time occupied by the channel when transmitting data is less than or equal to the increase and adjustment Maximum length of time;
  • the adjustment sending module is further configured to: if the detecting module detects that the channel is in a busy state, reduce the maximum length of the occupied channel, and perform data transmission, where the length of time occupied by the channel when transmitting data is less than or equal to the subtraction The maximum length of time after a small adjustment.
  • the detecting module is specifically configured to:
  • the detecting module is further configured to:
  • the adjustment sending module is specifically configured to: reduce the maximum time length of the occupied channel according to the interference parameter of the busy state of the channel;
  • the interference parameter includes at least one of the following parameters:
  • the length of the interference the number of disturbances, the frequency of the interference, and the type of interference source.
  • the maximum length of time after the increase and adjustment is less than or equal to First preset time length
  • the maximum length of the reduced adjustment is greater than or equal to a second preset time length
  • the first preset time length is greater than the second preset time length.
  • the adjusting the sending module is specifically configured to: reserve a channel, and perform data transmission on the reserved channel, where the length of the reserved channel is less than or equal to The adjusted maximum length of time.
  • the transmitting station when the transmitting station needs to perform data transmission, it first detects the busy condition of the channel, and adjusts the maximum time length of the occupied channel according to the busy state of the channel, and performs data transmission, and the time length of occupying the channel when transmitting data is less than or equal to The adjusted maximum time length, thereby dynamically adjusting the maximum time length of the occupied channel according to the busy state of the channel, improving channel utilization, and taking into account fairness.
  • Embodiment 1 is a schematic flowchart of Embodiment 1 of an information sending method according to the present invention
  • Embodiment 2 is a schematic flowchart of Embodiment 2 of an information sending method according to the present invention
  • Embodiment 3 is a schematic flowchart of Embodiment 3 of a method for transmitting information according to the present invention
  • FIG. 4 is a schematic diagram 1 of an access procedure of Embodiment 3 of an information sending method according to the present invention.
  • FIG. 5 is a second schematic diagram of an access procedure according to Embodiment 3 of the method for transmitting information according to the present invention.
  • Embodiment 4 is a schematic flowchart of Embodiment 4 of an information sending method according to the present invention.
  • Embodiment 7 is a schematic flowchart of Embodiment 5 of an information sending method according to the present invention.
  • FIG. 8 is a schematic diagram 1 of an access procedure of Embodiment 5 of an information sending method according to the present invention.
  • Embodiment 9 is a second schematic diagram of an access procedure of Embodiment 5 of the method for transmitting information according to the present invention.
  • FIG. 10 is a third schematic diagram of an access procedure according to Embodiment 5 of the information sending method of the present invention.
  • FIG. 11 is a schematic flowchart of Embodiment 6 of an information sending method according to the present invention.
  • Embodiment 1 of a transmitting station is a schematic structural diagram of Embodiment 1 of a transmitting station according to the present invention.
  • FIG. 13 is a schematic structural diagram of Embodiment 2 of a transmitting station according to the present invention. detailed description
  • FIG. 1 is a schematic flowchart of Embodiment 1 of an information sending method according to the present invention. As shown in FIG. 1, the method in this embodiment may include:
  • Step 101 The sending station detects the busy condition of the channel before performing data transmission.
  • the WLAN system shares channel resources in a randomized manner. Between different WLAN systems, such as the next-generation WLAN system and the Legacy WLAN system, coexistence can be achieved through random competition.
  • a technology in which a next-generation WLAN system is coexisted with other systems (a next-generation WLAN system, a Legacy WLAN system, and a non-WLAN system) is proposed, but the principle is also applicable to other freely competing systems.
  • the transmitting station Before the transmitting station performs data transmission, that is, before the transmitting station accesses the channel, the transmitting station needs to first contend for the channel, and detects the busy condition of the channel during the contention period, that is, whether there is an interference signal in the time period of the contention channel. If there is an interference signal in the contention channel period, it is determined that the channel is in a busy state; if there is no interference signal in the contention channel period, the channel is determined to be in an idle state, where the interference signal may be a signal of another communication system, or may be a non- Signals of communication systems, such as microwave oven signals.
  • a detection method is: determining whether the channel is continuously idle within a preset time period within the contention period, that is, determining whether the channel in the preceding channel remains continuously idle during the contention period, and the preset duration may be when the first detection starts.
  • the preset duration may be equal to the length of the Distributed Coordination Function Interframe Space (DIFS) in the IEEE802.il standard, and may also be set according to actual conditions; the second detection method may be judged in the competition.
  • DIFS Distributed Coordination Function Interframe Space
  • step 102 if the sending station detection channel is in an idle state, step 102 is performed; if the sending station detecting channel is in a busy state, step 103 is performed.
  • Step 102 If the channel is in an idle state, the sending station increases the maximum length of the occupied channel, and performs data transmission, where the length of time occupied by the channel when transmitting data is less than or equal to the maximum length of time after the increase and adjustment. .
  • the transmitting station determines whether the channel is in an idle state according to the result of detecting the busy condition of the channel, and specifically, for the first detection mode, if the transmitting station detects that the channel in the preceding channel in the contention channel period remains continuously idle, That is, if the transmitting station does not receive the interference signal during the contention period, that is, the other station does not perform data transmission and there is no other non-WLAN signal transmission on the channel, the transmitting station determines that the channel is in an idle state; If the transmitting station detects that the channel remains continuously idle during the preceding idle channel and the backoff period during the contention period (ie, the channel remains continuously idle until the first backoff count is reduced until it is zero), that is, the transmitting station is in the contention channel period.
  • the interfering signal is not received, that is, the transmitting station does not have other stations to transmit data and no other non-WLAN signal transmission on the channel during the process of waiting for the channel continuous idle for the first time and the backoff counter to zero, the transmitting station determines the channel. In idle state state.
  • the sending station increases the maximum length of time occupied by the channel, that is, the sending station increases the length of time based on the maximum length of time occupied by the last time channel, wherein the maximum time length of the occupied channel means that the system allows each station to
  • the maximum length of time that the channel is occupied each time data is sent that is, the maximum length of time that the channel can be occupied when transmitting data in a single time.
  • the maximum time length of the default initial occupied channel may be T mmal , which may be set according to empirical values or set by standards and regulations.
  • the sending station performs data transmission, and the length of time occupied by the channel when transmitting data is less than or equal to the maximum length of time after the adjustment is increased, that is, the sending station uses the maximum time length of the occupied channel after the adjustment is adjusted to perform data transmission on the channel.
  • the data frame is sent directly, or the channel is reserved by increasing the adjusted maximum length of the occupied channel, such as by Request to Send/Clear to Send (RTS/CTS) frame interaction, and After the channel reservation is successful, the data is sent, that is, the station reserved channel is sent, and the data is sent on the reserved channel, and the length of the reserved channel is less than or equal to the adjusted maximum time length.
  • RTS/CTS Request to Send/Clear to Send
  • the transmitting station when the maximum time length of the occupied channel is 3 ms (ms), if the data of one transmitting station needs 7 ms to complete the transmission, when using the existing transmitting information technology, the transmitting station first reserves the channel through the competition for 3 ms. Part of the data is transmitted, and then the second part of the data is required to be transmitted again.
  • the transmitting station if the channel is idle, the transmitting station transmits part of the data by competing the reserved channel for 3 ms, and then Then, through one competition, the channel can be reserved for 4ms (the maximum time length of the occupied channel is increased to 4ms), thereby transmitting the remaining part of the data, reducing the number of times of competition and improving the channel utilization.
  • Step 103 If the channel is in a busy state, the sending station reduces the maximum length of the occupied channel, and performs data transmission, where the length of time occupied by the channel when transmitting data is less than or equal to the maximum length of the reduced adjustment. .
  • whether the channel is in a busy state is determined according to the result of detecting the busy condition of the channel, specifically, for the first detection mode, if the sending station detects that the channel is not continuously idle during the pre-competition channel period, That is, the transmitting station receives the interference signal during the contention period, that is, the other station is performing data transmission or other signal transmission on the channel, and the transmitting station determines that the channel is in a busy state.
  • the sending station may wait at least twice for the idle duration, where the channel remains continuously idle for a long time when the last waiting ; for the second detection manner, if the sending station detects the preceding and the hop in the contention channel period There is no continuous idle or no continuous idleness during the backoff process, that is, the transmitting station receives the interference signal during the contention period, that is, the transmitting station waits for the channel to continuously idle for the first time or the backoff counter is zero.
  • the transmitting station determines that the channel is in a busy state, wherein the backoff counter has not counted down to zero and the channel becomes busy, and the transmitting station needs to wait again until the channel is continuously idle for a long time. ⁇ Then perform the backoff process.
  • the sending station determines that the channel is in a busy state, and includes the following situations: First, the sending station waits for the first time to wait for the channel to remain idle for a long time! After ⁇ , after at least two backoff counts, wherein the backoff calculator is reduced to zero during the last backoff count; second, the sending station waits for the channel to remain idle for at least two times, wherein the channel remains on the last wait Long idle time! ⁇ , after the first backoff, the backoff calculator is reduced to zero; third, the sending station waits for the channel to remain idle for at least two times, wherein the channel remains continuously idle for the last time!
  • the sending station still uses the maximum length of time to reserve the channel, that is, the reserved channel has a length of time less than or equal to the maximum length of time, and other stations cannot reserve.
  • the channel is used, and the channel resource is wasted.
  • the transmitting station reduces the maximum length of time occupied by the channel, that is, the transmitting station reduces the length of time based on the maximum length of time occupied by the last time.
  • the default initial occupied channel may have a maximum time length of 2, 3 ⁇ 4 . ,.
  • the sending station performs data transmission, and the length of time occupied by the channel when transmitting data is less than or equal to the maximum length of time after the adjustment is reduced, that is, the sending station performs data transmission on the channel by reducing the maximum length of the adjusted occupied channel. For example, if the data frame is directly sent, or the channel is reserved by reducing the maximum length of the occupied channel (for example, through RTS/CTS frame interaction), and data transmission is performed after the channel reservation is successful, that is, the transmission station reserves. Channel, and data transmission on the reserved channel, and the reserved channel length is less than or equal to the adjusted maximum time length.
  • the maximum duration of the first occupied channel of the transmitting station is ⁇
  • the maximum duration of the +1st occupied channel is ⁇ +1
  • the maximum length of the increase and the adjustment is less than or equal to the first preset time length; and/or the maximum time length after the decrease is greater than or equal to the second preset time length; Let the length of time be greater than the second preset time length.
  • the maximum length of the channel is limited.
  • the maximum length of time after the adjustment is increased is less than or equal to the first preset time length r max ; on the other hand, to avoid occupying the largest channel in a scene with severe interference If the duration is too short, the system efficiency is too low. Therefore, the maximum time length after the reduction is also limited. In this embodiment, the maximum time length after the adjustment is reduced is greater than or equal to the second preset time length.
  • r max and r min may be specified by standards or regulations, r max > r min , and the above ⁇ +1 , T t , are greater than or equal to the second preset
  • the length n i is less than or equal to the first preset time length ax .
  • the sending station when the sending station needs to perform data transmission, it first detects the busy state of the channel, and adjusts the maximum time length of the occupied channel according to the busy state of the channel, and performs data transmission, and the time length of occupying the channel when transmitting data is less than It is equal to the adjusted maximum time length, so that the maximum time length of occupying the channel is dynamically adjusted according to the busy state of the channel, and the channel utilization rate is improved, and the fairness is taken into consideration.
  • Embodiment 2 is a schematic flowchart of Embodiment 2 of the information sending method of the present invention. As shown in FIG. 2, the method in this embodiment may include:
  • Step 201 Before sending the data, the sending station detects whether the channel is continuously idle for a preset duration.
  • the transmitting station before the transmitting station performs data transmission, it only needs to wait for the channel to remain continuously idle for a long time in the contention channel period, that is, directly transmit data or reserve the channel first and perform data on the reserved channel. Send without performing a backoff process.
  • the sending station determines whether the channel is busy or idle by detecting whether the channel is continuously idle within a preset duration, that is, the sending station determines that the sending station is in the process by determining whether the channel in the preceding channel in the contention channel period is continuously idle. Whether the interference signal is received during the competition channel period, that is, whether the channel is idle. Further, if the sending station detects that the channel is in an idle state, step 202 is performed; if the sending station detects that the channel is in a busy state, step 203 is performed.
  • Step 202 If yes, the sending station determines that the channel is in an idle state, and the sending station increases the maximum length of the occupied channel, and performs data transmission, where the length of time occupied by the channel when transmitting data is less than or equal to The maximum length of time after the adjustment is increased.
  • the transmitting station detects that the channel in the pre-synchronization channel period is continuously idle, that is, the duration of waiting for the channel to be continuously idle for the first time in the contention channel period, that is, the transmitting station is in the contention period of the competition channel. If no interfering signal is received, the transmitting station determines that the channel is in an idle state. Further, the sending station increases the maximum length of the occupied channel, and uses the maximum length of the adjusted occupied channel to transmit data on the channel, that is, the time length of occupying the channel when transmitting data is less than or equal to the increased adjustment. Maximum length of time, or increase adjustment After the maximum time length of the occupied channel, the channel is reserved first, and the data is transmitted after the channel reservation is successful, that is, the length of the reserved channel is less than or equal to the maximum time length after the adjustment.
  • Step 203 If no, the sending station determines that the channel is in a busy state, and the sending station reduces the maximum length of the occupied channel, and performs data transmission, where the length of time occupied by the channel when transmitting data is less than or equal to The reduction of the adjusted maximum time length.
  • the transmitting station may pass at least Wait for the idle time twice, where the channel stays idle for the last time! ⁇ , that is, the transmitting station receives the interference signal during the contention channel period, and the transmitting station determines that the channel is in a busy state.
  • the sending station reduces the maximum time length of the occupied channel, and uses the maximum length of the adjusted occupied channel to perform data transmission on the channel, that is, the time length of occupying the channel when transmitting data is less than or equal to the reduced adjustment.
  • the maximum length of time, or the channel is reserved for the maximum length of the occupied channel, and the data is transmitted on the reserved channel, that is, the length of the reserved channel is less than or equal to the maximum length of the adjusted time.
  • the sending station reduces the maximum length of the occupied channel, which may include: the sending station reduces the maximum time length of the occupied channel according to the interference parameter of the busy state of the channel; wherein the interference parameter may include the following parameters: At least one parameter: the duration of the interference, the number of disturbances, the frequency of the interference, and the type of interference source.
  • the transmitting station when the channel is busy, the transmitting station reduces the maximum occupied channel according to the interference signal parameter (the duration of the interference, the number of interferences, the interference frequency, and the type of the interference source) received during the contention period.
  • the interference signal parameter the duration of the interference, the number of interferences, the interference frequency, and the type of the interference source
  • the number of parameters is set to be the maximum duration of the first occupied channel of the transmitting station.
  • the interference source type is a Legacy WLAN system
  • the system of the embodiment of the present invention can be directly converted into the same fixed maximum as the Legacy WLAN system.
  • Channel reservation duration strategy 2) Fast convergence principle, reasonable strategy should be adopted to make the channel reservation time between multiple systems quickly converge to reach steady state.
  • the sending station first detects the busy state of the channel before performing data transmission, and adjusts the maximum time length of the occupied channel according to the busy state of the channel, and performs data transmission, and the time length of occupying the channel when transmitting data is less than or equal to The maximum time length after the adjustment, further, the maximum time length of the occupied channel can be reduced according to the interference parameter, thereby realizing the maximum time length of dynamically adjusting the occupied channel according to the busy state of the channel, and improving the channel utilization rate, and taking into consideration Fairness.
  • FIG. 3 is a schematic flowchart of a third embodiment of an information transmission method according to the present invention.
  • FIG. 4 is a schematic diagram of an access flow according to a third embodiment of the present invention. .
  • the transmitting station only needs to wait for the channel to remain continuously idle during the contention channel period.
  • the reserved channel is transmitted and the data is transmitted in the reserved channel.
  • the maximum duration of the occupied channel in this embodiment may also be referred to as the maximum reserved duration. If the maximum length of the reserved channel for the first time of the transmitting station is ⁇ , after the communication duration is continuous ⁇ , the communication should be stopped and the channel should be released. If the transmitting station still has data to transmit, as shown in FIG. 3, FIG. 4 and FIG.
  • Step 301 Detect a channel.
  • Step 302 Determine whether the channel maintains a continuous idle state or not.
  • step 303 is performed; as shown in FIG. 5, if the channel receives interference during the ⁇ period, step 304 is performed.
  • Step 303 Increase the maximum duration of channel reservation.
  • the sending station performs the +1st channel reservation, and increases the maximum channel reservation time.
  • the length is ⁇ +1 , where ⁇ ⁇ ⁇ .
  • Step 304 Wait until the channel remains continuously idle for a long time r.
  • Step 305 Reduce the maximum duration of channel reservation.
  • the transmitting station performs the +1st channel reservation, and the maximum duration of the channel reservation is reduced by ⁇ +1 , where ⁇ t ⁇ T .
  • FIG. 6 is a schematic flowchart of Embodiment 4 of the information sending method of the present invention. As shown in FIG. 6, the method in this embodiment may include:
  • Step 601 Before sending the data, the sending station detects whether the channel is continuously idle during the idle time and the backoff period in the preset duration.
  • a random backoff procedure is added before the channel is reserved to transmit data or the channel is directly sent without a reserved channel, thereby reducing simultaneous connection of multiple sites.
  • the transmitting station judges whether the transmitting station receives the interference signal during the contention period of the competition channel by detecting whether the channel in the preceding channel is continuously idle during the contention period and whether the channel is continuously idle, that is, whether the channel is idle. Further, if the sending station detects that the channel is in an idle state, step 602 is performed; if the transmitting station detects that the channel is in a busy state, step 603 is performed.
  • Step 602 If yes, the sending station determines that the channel is in an idle state, and the sending station increases the maximum length of the occupied channel, and performs data transmission, where the time length of occupying the channel when transmitting data is less than It is equal to the maximum length of time after the adjustment is increased.
  • the transmitting station waits for the channel to continuously idle for the first time in the contention period, and the channel is in the backoff process.
  • the continuous idle state i.e., the channel remains continuously idle until the first time of the backoff count until the zero is reduced
  • the transmitting station determines that the channel is in an idle state.
  • the sending station increases the maximum length of the occupied channel, and uses the maximum length of the adjusted occupied channel to transmit data on the channel, that is, the time length of occupying the channel when transmitting data is less than or equal to the increased adjustment.
  • the maximum length of time, or the channel is reserved for the maximum time length of the occupied channel, and the data is transmitted on the reserved channel, that is, the length of the reserved channel is less than or equal to the maximum time length after the adjustment. .
  • Step 603 If there is one, the sending station determines that the channel is in a busy state.
  • the transmitting station reduces the maximum length of time occupied by the channel, and performs data transmission, where the length of time occupied by the channel when transmitting data is less than or equal to the maximum length of time after the reduction and adjustment.
  • the sending station detects that the channel is not idle for the first time in the contention period. Or the channel does not remain continuously idle during the process of reducing the backoff calculator in the backoff process, that is, the transmitting station receives the interference signal during the contention channel period, and the transmitting station determines that the channel is in a busy state. Further, the sending station reduces the maximum time length of the occupied channel, and uses the maximum length of the adjusted occupied channel to perform data transmission on the channel, that is, the time length of occupying the channel when transmitting data is less than or equal to the reduced adjustment. The maximum length of time, or the channel is reserved for the maximum length of the occupied channel, and the data is transmitted on the reserved channel, that is, the length of the reserved channel is less than or equal to the maximum length of the adjusted time. .
  • the sending station reduces the maximum length of the occupied channel, which may include: the sending station reduces the maximum time length of the occupied channel according to the interference parameter of the busy state of the channel; wherein the interference parameter includes the following parameters At least one parameter: the duration of the interference, the number of disturbances, the frequency of the interference, and the type of interference source.
  • the sending station when the sending station needs to perform data transmission, it first detects the busy state of the channel, and adjusts the maximum time length of the occupied channel according to the busy state of the channel, and performs data transmission, and the time length of occupying the channel when transmitting data is less than It is equal to the adjusted maximum time length. Further, the maximum time length of the occupied channel can be reduced according to the interference parameter, thereby realizing the maximum time length of dynamically adjusting the occupied channel according to the busy state of the channel, and improving the channel utilization rate. Fairness.
  • FIG. 7 is a schematic flowchart of a fifth embodiment of an information transmission method according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of an access flow according to a fifth embodiment of the present invention.
  • FIG. 10 is an access flow of Embodiment 5 of the information sending method of the present invention.
  • the sending station waits for the channel to remain continuously idle for a period of time in the contention channel period! After the retreat process is performed, the reserved channel is transmitted and the data is transmitted in the reserved channel.
  • the maximum duration of the occupied channel in this embodiment may also be referred to as the maximum reserved duration. If the maximum length of the reserved channel for the first time of the transmitting station is ⁇ , when the communication duration is ⁇ consecutively, the communication is stopped and the channel is released.
  • the sending site also has data to send, as shown in Figures 7, 8, 9, and 10.
  • Step 701 Detect a channel.
  • Step 702 Determine whether the channel remains continuously idle in the ⁇ .
  • step 703 is performed; if not shown in FIG. 10, if no, step 705 is performed.
  • Step 703 Perform a backoff process, and determine whether the channel remains continuously idle during the backoff process. Referring to FIG. 8, if yes, step 704 is performed; if not shown in FIG. 9, if no, step 705 is performed.
  • Step 704 Increase the maximum duration of channel reservation.
  • the transmitting station performs the +1st channel reservation, and the maximum duration of the channel reservation is ⁇ +1 , where T t ⁇ T .
  • Step 705 Wait until the channel remains continuously idle for a long time r.
  • Step 706 Perform a backoff process, and determine whether the channel remains idle until the backoff count is 0. If the channel becomes busy during the backoff process, step 705 is performed; until the backoff counter is zero, step 707 is performed.
  • Step 707 Reduce the maximum duration of channel reservation.
  • the transmitting station performs the +1st channel reservation, and the maximum duration of the channel reservation is reduced by ⁇ +1 , where T t ⁇ T .
  • FIG. 11 is a schematic flowchart diagram of Embodiment 6 of an information sending method according to the present invention.
  • the transmitting station waits for the channel to remain continuously idle during the contention period of the competition channel! After the retreat process is performed, the reserved channel is transmitted and the data is transmitted in the reserved channel.
  • the maximum duration of the occupied channel in this embodiment may also be referred to as the maximum reserved duration. If the maximum length of the first reserved channel of the transmitting station is T t , when the communication duration is continuous n, the communication is stopped and the channel is released. If the transmitting station still has data to transmit, as shown in FIG.
  • Step 1101 Detect a channel.
  • Step 1102 Wait until the channel remains idle for up to ⁇ .
  • Step 1103 Perform a backoff process, and determine whether the channel remains idle until the backoff count is 0. If the channel becomes busy during the backoff process, step 1102 is performed; until the backoff counter is zero, step 1104 is performed.
  • Step 1104 Determine whether interference is encountered during the detection channel or the backoff process. If no interference is encountered, step 1105 is performed; if interference is encountered, step 1106 is performed.
  • Step 1105 Increase the maximum duration of channel reservation.
  • the transmitting station performs the +1st channel reservation, and the maximum duration of the channel reservation is ⁇ +1 , where T t ⁇ T .
  • Step 1106 Reduce the maximum duration of channel reservation.
  • the transmitting station performs the +1st channel reservation, and the maximum duration of the channel reservation is reduced by ⁇ +1 , where T t ⁇ T .
  • FIG. 12 is a schematic structural diagram of Embodiment 1 of a transmitting station according to the present invention.
  • the transmitting station 120 provided in this embodiment includes: a detecting module 1201 and an adjusting transmitting module 1202.
  • the detecting module 1201 is configured to detect a channel busy condition before performing data transmission
  • the adjusting sending module 1202 is configured to: if the detecting module detects that the channel is in an idle state, increase a maximum time length of the occupied channel, and perform data transmission. The length of time that the channel is occupied when the data is sent is less than or equal to the maximum length of time after the increase and adjustment;
  • the adjustment sending module 1202 is further configured to: if the detecting module detects that the channel is in a busy state, reduce the maximum length of the occupied channel, and perform data transmission, where the length of the occupied channel when transmitting the data is less than or equal to the reduced adjustment The maximum length of time afterwards.
  • the detecting module 1201 is specifically configured to: detect whether the channel is continuously idle within a preset duration;
  • the detecting module 1201 is further configured to: detect whether the channel is continuously idle during continuous idle and backoff in the preset duration;
  • the adjusting the sending module 1202 is further configured to: reduce the maximum time length of the occupied channel according to the interference parameter of the busy state of the channel;
  • the interference parameter includes at least one of the following parameters:
  • the length of the interference the number of disturbances, the frequency of the interference, and the type of interference source.
  • the maximum length of time after the increase and adjustment is less than or equal to a first preset time length; and / or,
  • the maximum length of the reduced adjustment is greater than or equal to a second preset time length
  • the first preset time length is greater than the second preset time length.
  • the adjustment sending module 1202 is further configured to: reserve a channel, and perform data transmission on the reserved channel, where the length of the reserved channel is less than or equal to the adjusted maximum time. length.
  • the transmitting station in this embodiment may be used in the technical solutions of the first embodiment to the sixth embodiment of the information sending method, and the implementation principle and technical effects are similar, and details are not described herein again.
  • FIG. 13 is a schematic structural diagram of Embodiment 2 of a transmitting station according to the present invention.
  • the transmitting station 130 provided in this embodiment includes a processor 1301, a detector 1302, and a transmitter 1303.
  • the transmitter 1303 can be connected to the processor 1301, and the detector 1302 can be connected to the processor 1301.
  • the detector 1302 is configured to detect a busy condition of the channel before performing data transmission.
  • the processor 1301 is configured to: if the detector 1302 detects that the channel is in an idle state, increase the maximum length of the occupied channel and notify the transmitter 1303 to perform data.
  • the processor 1301 is further configured to reduce the maximum time of occupying the channel if the detector 1302 detects that the channel is in a busy state The length is notified to the sender 1303 for data transmission, wherein the length of time occupied by the channel when transmitting data is less than or equal to the maximum length of time after the reduction is adjusted.
  • the sending station of this embodiment may be used to perform the technical solution of the information sending method performed by the sending station in the foregoing embodiment of the present invention.
  • the implementation principle and the technical effect are similar, and details are not described herein again.
  • the aforementioned program can be stored in a computer readable storage medium.
  • the program when executed, performs the steps including the foregoing method embodiments; and the foregoing storage medium includes: a medium that can store program codes, such as a ROM, a RAM, a magnetic disk, or an optical disk.

Landscapes

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

Abstract

本发明实施例提供一种信息发送方法及装置。本发明信息发送方法，包括：发送站点在进行数据发送前，检测信道忙闲情况；若信道处于空闲状态，则所述发送站点增大占用信道的最大时间长度，并进行数据发送，其中，发送数据时占用信道的时间长度小于等于所述增大调整后的最大时间长度；若信道处于繁忙状态，则所述发送站点减小占用信道的最大时间长度，并进行数据发送，其中，发送数据时占用信道的时间长度小于等于所述减小调整后的最大时间长度。本发明实施例实现了根据信道忙闲情况动态调整占用信道的最大时间长度，提高信道利用率，同时兼顾了公平性。

Description

信息发送方法及装置
技术领域
本发明实施例涉及通信技术， 尤其涉及一种信息发送方法及装置。 背景技术
无线局域网 （Wireless Local Area Networks, 简称 WLAN)***工作在非 授权频谱上， 而非授权频谱属于公共频谱， 因此， 当发送站点发送数据前， 发送站点需先竞争信道。
现有技术中， 发送站点需要在竞争信道时段内检测信道忙闲情况， 在等 待信道空闲达一定时间后， 即可进行信道预留并在预留的信道上发送数据， 或者无需预留信道而直接发送数据。 现有技术中， 不管信道繁忙与否， 占用 信道的最大时间长度是一个固定值， 发送站点一次预留信道的时间长度不超 过该最大时间长度。 但是， 在信道空闲的情况下， 如果发送站点所需发送的 数据较多， 即使预留信道的时间长度为最大时间长度也无法在本次预留信道 上完成发送， 则发送站点需要多次竞争信道， 增加了发送站点发送数据的复 杂性， 而在信道繁忙的情况下， 如果发送站点所需发送的数据较少， 而发送 站点依然采用该最大时间长度来预留信道， 则预留的信道资源将被浪费， 信 道资源利用率不高。 发明内容
本发明实施例提供一种信息发送方法及装置， 用以提高信道利用率。 第一方面， 本发明实施例提供一种信息发送方法， 包括：
发送站点在进行数据发送前， 检测信道忙闲情况；
若信道处于空闲状态， 则所述发送站点增大占用信道的最大时间长度， 并进行数据发送， 其中， 发送数据时占用信道的时间长度小于等于所述增大 调整后的最大时间长度；
若信道处于繁忙状态， 则所述发送站点减小占用信道的最大时间长度， 并进行数据发送， 其中， 发送数据时占用信道的时间长度小于等于所述减小 调整后的最大时间长度。
结合第一方面， 在第一方面的第一种可能的实现方式中， 所述发送站点 检测信道忙闲情况， 包括：
所述发送站点检测信道在预设时长内是否连续空闲；
若是， 则所述发送站点确定所述信道处于空闲状态；
若否， 则所述发送站点确定所述信道处于繁忙状态。
结合第一方面， 在第一方面的第二种可能的实现方式中， 所述发送站点 检测信道忙闲情况， 包括：
所述发送站点检测信道在预设时长内是否连续空闲和退避过程中信道是 否连续空闲；
若均是， 则所述发送站点确定所述信道处于空闲状态；
若有一个否， 则所述发送站点确定所述信道处于繁忙状态。
结合第一方面、 第一方面的第一种及第二种任一种可能的实现方式， 在 第一方面的第三种可能的实现方式中， 所述发送站点减小占用信道的最大时 间长度， 包括：
所述发送站点根据信道繁忙状态的干扰参数， 减小占用信道的最大时间 长度；
所述干扰参数， 包括下述参数中的至少一种参数：
干扰的时长、 干扰的次数、 干扰的频率及干扰源类型。
结合第一方面、 第一方面的第一种至第三种任一种可能的实现方式， 在 第一方面的第四种可能的实现方式中， 所述增大调整后的最大时间长度小于 等于第一预设时间长度；
和 /或，
所述减小调整后的最大时间长度大于等于第二预设时间长度；
所述第一预设时间长度大于第二预设时间长度。
结合第一方面、 第一方面的第一种至第四种任一种可能的实现方式， 在 第一方面的第五种可能的实现方式中， 所述发送站点进行数据发送， 包括： 所述发送站点预留信道， 并在所述预留信道上进行数据发送， 其中， 所 述预留信道的时间长度小于等于所述调整后的最大时间长度。
第二方面， 本发明实施例提供一种发送站点， 包括： 检测模块， 用于在进行数据发送前， 检测信道忙闲情况；
调整发送模块， 用于若所述检测模块检测信道处于空闲状态， 则增大占 用信道的最大时间长度， 并进行数据发送， 其中， 发送数据时占用信道的时 间长度小于等于所述增大调整后的最大时间长度；
所述调整发送模块， 还用于若所述检测模块检测信道处于繁忙状态， 则 减小占用信道的最大时间长度， 并进行数据发送， 其中， 发送数据时占用信 道的时间长度小于等于所述减小调整后的最大时间长度。
结合第二方面， 在第二方面的第一种可能的实现方式中， 所述检测模块 具体用于：
检测信道在预设时长内是否连续空闲；
若是， 则确定所述信道处于空闲状态；
若否， 则确定所述信道处于繁忙状态。
结合第二方面， 在第二方面的第二种可能的实现方式中， 所述检测模块 还具体用于：
检测信道在预设时长内是否连续空闲和退避过程中信道是否连续空闲； 若均是， 则确定所述信道处于空闲状态；
若有一个否， 则确定所述信道处于繁忙状态。
结合第二方面、 第二方面的第一种及第二种任一种可能的实现方式， 在 第二方面的第三种可能的实现方式中， 若所述检测模块检测信道处于繁忙状 态， 所述调整发送模块具体用于： 根据信道繁忙状态的干扰参数， 减小占用 信道的最大时间长度；
所述干扰参数， 包括下述参数中的至少一种参数：
干扰的时长、 干扰的次数、 干扰的频率及干扰源类型。
结合第二方面、 第二方面的第一种至第三种任一种可能的实现方式， 在 第二方面的第四种可能的实现方式中， 所述增大调整后的最大时间长度小于 等于第一预设时间长度；
和 /或，
所述减小调整后的最大时间长度大于等于第二预设时间长度；
所述第一预设时间长度大于第二预设时间长度。
结合第二方面、 第二方面的第一种至第四种任一种可能的实现方式， 在 第二方面的第五种可能的实现方式中， 所述调整发送模块具体用于： 预留信 道， 并在所述预留信道上进行数据发送， 其中， 所述预留信道的时间长度小 于等于所述调整后的最大时间长度。
本发明中发送站点通过在需要进行数据发送时， 先检测信道忙闲情况， 并根据信道忙闲状态调整占用信道的最大时间长度， 并进行数据发送， 且发 送数据时占用信道的时间长度小于等于调整后的最大时间长度， 从而实现了 根据信道忙闲情况动态调整占用信道的最大时间长度， 提高信道利用率， 同 时兼顾了公平性。 附图说明 为了更清楚地说明本发明实施例或现有技术中的技术方案， 下面将对实 施例或现有技术描述中所需要使用的附图作一简单地介绍， 显而易见地， 下 面描述中的附图是本发明的一些实施例， 对于本领域普通技术人员来讲， 在 不付出创造性劳动性的前提下， 还可以根据这些附图获得其他的附图。
图 1为本发明信息发送方法实施例一的流程示意图；
图 2为本发明信息发送方法实施例二的流程示意图；
图 3为本发明信息发送方法实施例三的流程示意图；
图 4为本发明信息发送方法实施例三的接入流程示意图一；
图 5为本发明信息发送方法实施例三的接入流程示意图二；
图 6为本发明信息发送方法实施例四的流程示意图；
图 7为本发明信息发送方法实施例五的流程示意图；
图 8为本发明信息发送方法实施例五的接入流程示意图一；
图 9为本发明信息发送方法实施例五的接入流程示意图二；
图 10为本发明信息发送方法实施例五的接入流程示意图三；
图 11为本发明信息发送方法实施例六流程示意图；
图 12为本发明发送站点实施例一的结构示意图；
图 13为本发明发送站点实施例二的结构示意图。 具体实施方式
Figure imgf000006_0001
下面将结合本发 明实施例中的附图， 对本发明实施例中的技术方案进行清楚、 完整地描述， 显然， 所描述的实施例是本发明一部分实施例， 而不是全部的实施例。 基于 本发明中的实施例， 本领域普通技术人员在没有作出创造性劳动前提下所获 得的所有其他实施例， 都属于本发明保护的范围。
图 1为本发明信息发送方法实施例一的流程示意图， 如图 1所示， 本实 施例的方法可以包括：
步骤 101、 发送站点在进行数据发送前， 检测信道忙闲情况。
WLAN***通过随机竞争的方式共享信道资源， 不同的 WLAN***之 间， 如下一代 WLAN***和 Legacy WLAN***可以通过随机竞争方式达到 共存。本实施例中提出了一种以下一代 WLAN***为例与其它***（下一代 WLAN***、 Legacy WLAN***及非 WLAN***） 共存的技术， 但其原理 亦适用于其它自由竞争的***。
发送站点在进行数据发送前， 即发送站点在接入信道前， 发送站点需先 竞争信道， 在该竞争信道时段内检测信道忙闲情况， 即判断在该竞争信道时 段内是否存在干扰信号。 若在该竞争信道时段内存在干扰信号则确定信道为 繁忙状态； 若在该竞争信道时段内不存在干扰信号则确定信道为空闲状态， 其中， 干扰信号可以是其它通信***的信号， 也可以是非通信***的信号， 如微波炉信号等。
本实施例中， 根据发送站点发送数据的不同， 对应地有至少两种不同的 检测方式， 具体地， 如对于发送站点发送优先级比较高的数据帧时无需进行 退避过程， 对应地可以采用第一种检测方式： 判断在该竞争信道时段内信道 在预设时长 Γ 内是否连续空闲， 即判断在竞争信道时段内的前 Γ 内信道是 否保持连续空闲， 该预设时长可以为首次检测开始时的预设时长， 该时长可 以等于 IEEE802.il 标准中的分布式协调帧间隔 （Distributed Coordination Function Interframe Space, 简称 DIFS) 长度， 也可以根据实际情况设置； 第 二种检测方式可以为判断在该竞争信道时段内信道在 Γ 内是否连续空闲和退 避过程中信道是否连续空闲， 即判断在竞争信道时段内的前 Γ 内信道是否保 持连续空闲和在退避过程中信道是否保持连续空闲。 该第二种检测方式中， 在竞争时段内信道保持空闲时长达 Γ 后与预留信道以发送数据或者无需预留 信道而直接发送数据开始时刻之间加入了随机退避过程， 从而降低了多个站 点同时接入信道而发送冲突的概率。本实施例中也可以采用其它的检测方式， 本发明并不以此为限。 进一步地， 若发送站点检测信道处于空闲状态， 则执 行步骤 102; 若发送站点检测信道处于繁忙状态， 则执行步骤 103。
步骤 102、 若信道处于空闲状态， 则所述发送站点增大占用信道的最大 时间长度， 并进行数据发送， 其中， 发送数据时占用信道的时间长度小于等 于所述增大调整后的最大时间长度。
本实施例中， 根据上述检测信道忙闲情况的结果来判断信道是否处于空 闲状态， 具体地针对上述第一种检测方式， 若发送站点检测在竞争信道时段 内的前 Γ 内信道保持连续空闲，即发送站点在竞争信道时段内没有接收到干 扰信号，即其它站点没有进行数据发送并且信道上没有其它非 WLAN信号传 输， 则发送站点确定所述信道处于空闲状态； 针对上述第二种检测方式， 若 发送站点检测在竞争信道时段内的前 Γ 内信道保持连续空闲和退避过程中 信道保持连续空闲（即第一次退避计数时信道保持连续空闲直至减为零）， 即 发送站点在竞争信道时段内没有接收到干扰信号， 即发送站点在首次等待信 道连续空闲达 Γ 及退避计数器倒数为零的过程中没有其它站点进行发送数 据并且信道上没有其它非 WLAN信号传输，则发送站点确定所述信道处于空 闲状态。
为了充分利用信道， 发送站点增大占用信道的最大时间长度， 即发送站 点在上一次占用信道的最大时间长度的基础上增加时间长度， 其中， 占用信 道的最大时间长度指***允许每个站点在每次发送数据时占用信道的最大时 间长度， 即可以为单次发送数据时占用信道的最大时间长度。 特别地， 当下 一代 WLAN***首次接入信道时，默认的初始占用信道的最大时间长度可以 为 Tmmal， 该时长可以根据经验值设定或者由标准和法规设定。 进一步地， 发 送站点进行数据发送， 且发送数据时占用信道的时间长度小于等于增大调整 后的最大时间长度， 即发送站点采用增大调整后的占用信道的最大时间长度 在信道上进行数据发送， 如直接发送数据帧， 或者采用增大调整后的占用信 道的最大时间长度先预留信道， 如通过请求发送 /允许发送 （Request to Send/Clear to Send, 简称 RTS/CTS) 帧交互， 并在信道预留成功后进行数据 发送， 即发送站点预留信道， 并在预留信道上进行数据发送， 且预留信道的 时间长度小于等于调整后的最大时间长度。 例如， 当规定占用信道的最大时间长度为 3 毫秒 (ms)时， 若一个发送站 点的数据需要 7ms才能传输完毕， 当利用现有的发送信息技术， 则该发送站 点先通过竞争预留信道 3ms将部分数据进行传输， 然后还需要再竞争两次才 能将剩余部分数据进行传输； 而通过本发明的技术方案， 若信道空闲时， 该 发送站点通过竞争预留信道 3ms将部分数据进行传输， 然后再通过一次竞争 可以预留信道 4ms (占用信道的最大时间长度增加为 4ms)， 从而将剩余部分 数据进行传输， 减少了竞争次数， 提高了信道利用率。
步骤 103、 若信道处于繁忙状态， 则所述发送站点减小占用信道的最大 时间长度， 并进行数据发送， 其中， 发送数据时占用信道的时间长度小于等 于所述减小调整后的最大时间长度。
本实施例中， 根据上述检测信道忙闲情况的结果来判断信道是否处于繁 忙状态， 具体地针对上述第一种检测方式， 若发送站点检测在竞争信道时段 内的前 Γ 内没有保持连续空闲，即发送站点在竞争信道时段内接收到干扰信 号， 即其它站点在进行数据发送或者信道上有其它信号传输， 则发送站点确 定所述信道处于繁忙状态。 具体地， 发送站点可以经过至少两次等待空闲时 长， 其中， 在最后一次等待时信道保持连续空闲时长达 Tfe ; 针对上述第二种 检测方式，若发送站点检测在竞争信道时段内的前 Γ 内没有保持连续空闲或 退避过程中没有一直保持连续空闲， 即发送站点在竞争信道时段内接收到干 扰信号，即发送站点在首次等待信道连续空闲达 Γ 或退避计数器倒数为零的 过程中， 其它站点进行发送数据或者信道上有其它信号传输， 则发送站点确 定所述信道处于繁忙状态， 其中， 退避计数器还未倒数为零而信道变为繁忙， 则发送站点需再次等待至信道连续空闲时长达 Γ 后再执行退避过程。
具体地， 针对上述第二种检测方式， 发送站点确定所述信道处于繁忙状 态包含以下几种情况： 第一种， 发送站点在首次等待信道保持连续空闲时长 达！^后， 经过至少两次退避计数， 其中， 最后一次退避计数过程中退避计算 器减为零； 第二种， 发送站点经过至少两次等待信道保持空闲时长， 其中， 在最后一次等待时信道保持连续空闲时长达！^，之后首次退避时退避计算器 减为零； 第三种， 发送站点经过至少两次等待信道保持空闲时长， 其中， 在 最后一次等待时信道保持连续空闲时长达！^， 之后经过至少两次退避计数， 其中， 最后一次退避计数过程中退避计算器减为零。 进一步地， 为了避免若发送站点所需发送的数据较少， 但发送站点依然 采用该最大时间长度来预留信道， 即预留信道的时间长度小于等于该最大时 间长度， 其它站点则无法预留并使用信道， 而引起信道资源浪费的问题， 发 送站点减小占用信道的最大时间长度， 即发送站点在上一次占用信道的最大 时间长度的基础上减小时间长度。特别地， 当下一代 WLAN***首次接入信 道时， 默认的初始占用信道的最大时间长度可以为 2 ,¾。,。 进一步地， 发送站 点进行数据发送， 且发送数据时占用信道的时间长度小于等于减小调整后的 最大时间长度， 即发送站点采用减小调整后的占用信道的最大时间长度在信 道上进行数据发送， 如直接发送数据帧， 或者采用减小调整后的占用信道的 最大时间长度先预留信道 （如通过 RTS/CTS帧交互）， 并在信道预留成功后 进行数据发送， 即发送站点预留信道， 并在预留信道上进行数据发送， 且预 留信道的时间长度小于等于调整后的最大时间长度。
进一步地， 设发送站点第 次占用信道的最大时长为 η， 第 +1次占用信 道的最大时长为 η+1， 本实施例中， 对于增大 /减少占用信道的最大时间长度的 方法并不做限定， 可选地， 可以采用指数增加 /减少、 线性增加 /减少以及其组 合方式， 其中， 利用指数增加 /减少占用信道的最大时间长度的方式中， 令 Τι+ι = Τ^ Κ , 当^ > 1时表示增加， 当 时表示减少； 利用线性增加 /减少占用 信道的最大时间长度的方式中，令 η+1 = η + ΔΓ，当 ΔΓ > 0时表示增加，当 ΔΓ < 0 时表示减少。
进一步地，所述增大调整后的最大时间长度小于等于第一预设时间长度; 和 /或， 所述减小调整后的最大时间长度大于等于第二预设时间长度； 所述第 一预设时间长度大于第二预设时间长度。
在实际的操作过程中， 为了避免一个站点占用信道时间过长而影响其它 ***或站点的信道接入， 从而导致信道利用率不高及公平性的问题， 因此， 通常需要对增大后的占用信道的最大时间长度做一个限定， 本实施例中， 规 定增大调整后的最大时间长度小于等于第一预设时间长度 rmax； 另一方面， 为 了避免在干扰严重的场景中占用信道的最大时长过短而导致***效率太低的 问题， 因此， 也对减小后的最大时间长度做一个限定， 本实施例中， 规定减 小调整后的最大时间长度大于等于第二预设时间长度 rmin， 其中， rmax及 rmin可 以由标准或法规规定， rmax > rmin， 且上述 η+1、 Tt、 都大于等于第二预设时 间长度 n i小于等于第一预设时间长度 ax。 当调整后的最大时间长度 l+i > Tmax , 取 =rmax ; 当调整后的最大时间长度 7;+1 < rmm时， 取 2：+1 = 。
本实施例， 发送站点通过在需要进行数据发送时， 先检测信道忙闲情况， 并根据信道忙闲状态调整占用信道的最大时间长度， 并进行数据发送， 且发 送数据时占用信道的时间长度小于等于调整后的最大时间长度， 从而实现了 根据信道忙闲情况动态调整占用信道的最大时间长度， 提高信道利用率， 同 时兼顾了公平性。
下面采用几个具体的实施例， 对图 1所示方法实施例的技术方案进行详 细说明。
图 2为本发明信息发送方法实施例二的流程示意图， 如图 2所示， 本实 施例的方法可以包括：
步骤 201、 发送站点在进行数据发送前， 检测信道在预设时长内是否连 续空闲。
本实施例中， 发送站点在进行数据发送前， 只需在竞争信道时段内等待 信道保持连续空闲时长达 Γ 后，即可以直接进行数据发送或者先预留信道并 在该预留信道上进行数据发送， 而无需执行退避过程。 本实施例中， 发送站 点通过检测信道在预设时长内是否连续空闲来判断信道是否繁忙或空闲， 即 发送站点通过判断在竞争信道时段内的前 Γ 内信道是否保持连续空闲来判 断发送站点在竞争信道时段内是否收到干扰信号， 即信道是否空闲。 进一步 地， 若发送站点检测信道处于空闲状态， 则执行步骤 202; 若发送站点检测 信道处于繁忙状态， 则执行步骤 203。
步骤 202、 若是， 则所述发送站点确定所述信道处于空闲状态， 则所述 发送站点增大占用信道的最大时间长度， 并进行数据发送， 其中， 发送数据 时占用信道的时间长度小于等于所述增大调整后的最大时间长度。
本实施例中，若发送站点检测在竞争信道时段内的前 Γ 内信道保持连续 空闲， 也即在竞争信道时段内第一次等待信道连续空闲的时长达 Γ ， 即发送 站点在竞争信道时段内没有接收到干扰信号， 则发送站点确定所述信道处于 空闲状态。 进一步地， 发送站点增大占用信道的最大时间长度， 并采用增大 调整后的占用信道的最大时间长度在信道上进行数据发送， 即发送数据时占 用信道的时间长度小于等于增大调整后的最大时间长度， 或者采用增大调整 后的占用信道的最大时间长度先预留信道， 并在信道预留成功后进行数据发 送， 即预留信道的时间长度小于等于增大调整后的最大时间长度。
步骤 203、 若否， 则所述发送站点确定所述信道处于繁忙状态， 则所述 发送站点减小占用信道的最大时间长度， 并进行数据发送， 其中， 发送数据 时占用信道的时间长度小于等于所述减小调整后的最大时间长度。
本实施例中，若发送站点检测在竞争信道时段内的前 Γ 内信道没有保持 连续空闲， 也即在竞争信道时段内第一次等待信道连续空闲的时长未达到 Tfree， 发送站点可以经过至少两次等待空闲时长， 其中， 在最后一次等待时信 道保持连续空闲时长达！^， 即发送站点在竞争信道时段内接收到干扰信号， 则发送站点确定所述信道处于繁忙状态。 进一步地， 发送站点减小占用信道 的最大时间长度， 并采用减小调整后的占用信道的最大时间长度在信道上进 行数据发送， 即发送数据时占用信道的时间长度小于等于减小调整后的最大 时间长度， 或者采用减小调整后的占用信道的最大时间长度先预留信道， 并 在该预留信道上进行数据发送， 即预留信道的时间长度小于等于减小调整后 的最大时间长度。
进一步地， 发送站点减小占用信道的最大时间长度， 具体可以包括： 发 送站点根据信道繁忙状态的干扰参数， 减小占用信道的最大时间长度； 其中， 所述干扰参数， 可以包括下述参数中的至少一种参数： 干扰的时长、 干扰的 次数、 干扰的频率及干扰源类型。
本实施例中， 发送站点在信道繁忙时根据在竞争时段内接收到干扰信号 参数（干扰的时长、干扰的次数、干扰频率及干扰源类型中的至少一种参数）， 减小占用信道的最大时间长度，其中，干扰源类型包括但不限于下一代 WLAN ***、 Legacy WLAN***、 非 WLAN***等； 且上述干扰参数并不仅限于 上述四种参数。
本实施例中， 设参数个数为^ 设发送站点第 次占用信道的最大时长为
Tt , 第 + 1次占用信道的最大时长为 η+1， 第一种可实现方式， 可令 = ^, ,..., ， 其中， F代表函数关系； 自变量 χρ χ 2..., χ„分别代表信道在竞 争时段内接收到干扰的时长、次数或频率等参数；本实施例中对 ,..., 的 表达式没有特殊要求， 但推荐的一般原则为： 干扰时间越长、 干扰次数越多、 干扰频率越高则占用信道的最大时长减小的速度和幅度越大。 第二种可实现 方式， 根据竞争时段内干扰源类型的不同， 而使用不同的方式动态调整占用 信道的最大时间长度， 可令 η+1 = ( ， 其中， F„表示对应于第《种干扰源类 型的函数。 第三种可实现方式， 可令 7：+1 = ^„(7 ,..., ， 其中， F„表示对应于 第《种干扰源类型的函数； 自变量 χΡ χ 2..., χ„分别代表信道在竞争时段内接收到 干扰的时长、 次数或频率等参数； 本实施例中对 F„的表达式没有特殊要求， 但推荐的一般原则为： 1 )公平性原则， 若已知干扰源类型***的信道预留机 制，应保持与干扰源类型***的公平，如当干扰源类型为 Legacy WLAN*** 时，本发明实施例的***可以直接蜕变成为与 Legacy WLAN***相同的固定 最大信道预留时长策略； 2)快速收敛原则， 应采取合理的策略使多个***之 间的信道预留时长快速收敛达到稳态。
本实施例， 发送站点通过在进行数据发送前， 先检测信道忙闲情况， 并 根据信道忙闲状态调整占用信道的最大时间长度， 并进行数据发送， 且发送 数据时占用信道的时间长度小于等于调整后的最大时间长度， 进一步地， 其 中可以根据干扰参数， 减小占用信道的最大时间长度， 从而实现了根据信道 忙闲情况动态调整占用信道的最大时间长度， 提高信道利用率， 同时兼顾了 公平性。
图 3为本发明信息发送方法实施例三的流程示意图， 图 4为本发明信息 发送方法实施例三的接入流程示意图一， 图 5为本发明信息发送方法实施例 三的接入流程示意图二。
本实施例中发送站点在竞争信道时段内只需等待信道保持连续空闲达
Tfe后， 则进行预留信道并在该预留信道内发送数据， 其中， 本实施例中占用 信道的最大时长亦可以称为最大预留时长。若发送站点第 次预留信道的最大 时长为 η， 当通信时长连续 η后， 应该停止通信并释放信道， 若该发送站点还 有数据需要发送， 如图 3、 图 4及图 5所示。
步骤 301、 检测信道。
步骤 302、 判断信道保持连续空闲状态是否达 Γ 。
结合图 4所示， 若信道在 Γ 时段内保持空闲， 则执行步骤 303 ; 结合图 5所示， 若信道在 Γ 时段内接收到了干扰， 则执行步骤 304。
步骤 303、 增加信道预留的最大时长。
本实施例中， 发送站点进行第 + 1次信道预留， 且增加信道预留的最大时 长为 η+1， 其中， τ ΤΜ。
步骤 304、 等待至信道保持连续空闲状态长达 r 。
步骤 305、 减小信道预留的最大时长。
本实施例中， 发送站点进行第 + 1次信道预留， 且减小信道预留的最大时 长为 η+1， 其中， τ t≥T 。
图 6为本发明信息发送方法实施例四的流程示意图， 如图 6所示， 本实 施例的方法可以包括：
步骤 601、 发送站点在进行数据发送前， 检测信道在预设时长内是否连 续空闲和退避过程中信道是否连续空闲。
本实施例中， 在竞争时段内信道保持空闲时长达 Γ 后， 在预留信道以发 送数据或者无需预留信道而直接发送数据开始时刻之前加入了随机退避过 程， 从而降低了多个站点同时接入信道而发送冲突的概率。 发送站点通过检 测在竞争信道时段内的前 Γ 内信道是否连续空闲和退避过程中信道是否连 续空闲来判断发送站点在竞争信道时段内是否收到干扰信号， 即信道是否空 闲。 进一步地， 若发送站点检测信道处于空闲状态， 则执行步骤 602; 若发 送站点检测信道处于繁忙状态， 则执行步骤 603。
步骤 602、 若均是， 则所述发送站点确定所述信道处于空闲状态， 则所 述发送站点增大占用信道的最大时间长度， 并进行数据发送， 其中， 发送数 据时占用信道的时间长度小于等于所述增大调整后的最大时间长度。
本实施例中，若发送站点检测信道在 Γ 内保持连续空闲且退避过程中信 道保持连续空闲， 即发送站点在竞争信道时段内第一次等待信道连续空闲的 时长达 Γ 且在退避过程中信道保持连续空闲（即第一次退避计数时信道保持 连续空闲直至减为零）， 即发送站点在竞争信道时段内没有接收到干扰信号， 则发送站点确定所述信道处于空闲状态。 进一步地， 发送站点增大占用信道 的最大时间长度， 并采用增大调整后的占用信道的最大时间长度在信道上进 行数据发送， 即发送数据时占用信道的时间长度小于等于增大调整后的最大 时间长度， 或者采用增大调整后的占用信道的最大时间长度先预留信道， 并 在该预留信道上进行数据发送， 即预留信道的时间长度小于等于增大调整后 的最大时间长度。
步骤 603、 若有一个否， 则所述发送站点确定所述信道处于繁忙状态， 则所述发送站点减小占用信道的最大时间长度， 并进行数据发送， 其中， 发 送数据时占用信道的时间长度小于等于所述减小调整后的最大时间长度。
本实施例中， 若发送站点检测信道在预设时长内没有保持连续空闲或退 避过程中信道没有保持连续空闲， 即发送站点检测在竞争信道时段内第一次 等待信道连续空闲的时长未达到 Γ 或退避过程中的退避计算器减为零的过 程中信道没有保持连续空闲，即发送站点在竞争信道时段内接收到干扰信号， 则发送站点确定所述信道处于繁忙状态。 进一步地， 发送站点减小占用信道 的最大时间长度， 并采用减小调整后的占用信道的最大时间长度在信道上进 行数据发送， 即发送数据时占用信道的时间长度小于等于减小调整后的最大 时间长度， 或者采用减小调整后的占用信道的最大时间长度先预留信道， 并 在该预留信道上进行数据发送， 即预留信道的时间长度小于等于减小调整后 的最大时间长度。
进一步地， 发送站点减小占用信道的最大时间长度， 具体可以包括： 发 送站点根据信道繁忙状态的干扰参数， 减小占用信道的最大时间长度； 其中， 所述干扰参数， 包括下述参数中的至少一种参数： 干扰的时长、 干扰的次数、 干扰的频率及干扰源类型。
本实施例， 发送站点通过在需要进行数据发送时， 先检测信道忙闲情况， 并根据信道忙闲状态调整占用信道的最大时间长度， 并进行数据发送， 且发 送数据时占用信道的时间长度小于等于调整后的最大时间长度， 进一步地， 其中可以根据干扰参数， 减小占用信道的最大时间长度， 从而实现了根据信 道忙闲情况动态调整占用信道的最大时间长度， 提高信道利用率， 同时兼顾 了公平性。
图 7为本发明信息发送方法实施例五的流程示意图， 图 8为本发明信息 发送方法实施例五的接入流程示意图一， 图 9为本发明信息发送方法实施例 五的接入流程示意图二， 图 10为本发明信息发送方法实施例五的接入流程示 本实施例中发送站点在竞争信道时段内在等待信道保持连续空闲达！^ 后， 需执行退避过程， 从而进行预留信道并在该预留信道内发送数据， 其中， 本实施例中占用信道的最大时长亦可以称为最大预留时长。若发送站点第 次 预留信道的最大时长为 η， 当通信时长连续 η后， 则停止通信并释放信道， 若 该发送站点还有数据需要发送， 如图 7、 图 8、 图 9及图 10所示。
步骤 701、 检测信道。
步骤 702、 判断信道在 Γ 内是否保持连续空闲。
结合图 8所示， 若是， 则执行步骤 703 ; 结合图 10所示， 若否， 则执行 步骤 705。
步骤 703、 执行退避过程， 判断在退避过程中信道是否保持连续空闲。 结合图 8所示， 若是， 则执行步骤 704; 结合图 9所示， 若否， 则执行 步骤 705。
步骤 704、 增加信道预留的最大时长。
本实施例中， 发送站点进行第 + 1次信道预留， 且增加信道预留的最大时 长为 η+1， 其中， T t≤T 。
步骤 705、 等待至信道保持连续空闲状态长达 r 。
步骤 706、 执行退避过程， 判断信道是否保持空闲直至退避计数为 0。 若退避过程中信道变为繁忙状态， 则执行步骤 705 ; 直至退避计数器为 零， 则执行步骤 707。
步骤 707、 减小信道预留的最大时长。
本实施例中， 发送站点进行第 + 1次信道预留， 且减小信道预留的最大时 长为 η+1， 其中， T t≥T 。
图 11为本发明信息发送方法实施例六流程示意图。本实施例中发送站点 在竞争信道时段内在等待信道保持连续空闲达！^后， 需执行退避过程， 从而 进行预留信道并在该预留信道内发送数据， 其中， 本实施例中占用信道的最 大时长亦可以称为最大预留时长。 若发送站点第 次预留信道的最大时长为 Tt , 当通信时长连续 η后， 则停止通信并释放信道， 若该发送站点还有数据需 要发送， 如图 11所示。
步骤 1101、 检测信道。
步骤 1102、 等待至信道保持空闲状态达 Γ 。
步骤 1103、 执行退避过程， 判断信道是否保持空闲直至退避计数为 0。 若在退避过程中信道变为繁忙状态， 则执行步骤 1102; 直至退避计数器 为零， 则执行步骤 1104。
步骤 1104、 判断在检测信道或退避过程中是否遇到干扰。 若没有遇到干扰则执行步骤 1105 ; 若遇到干扰则执行步骤 1106。
步骤 1105、 增加信道预留的最大时长。
本实施例中， 发送站点进行第 + 1次信道预留， 且增加信道预留的最大时 长为 η+1， 其中， T t≤T 。
步骤 1106、 减小信道预留的最大时长。
本实施例中， 发送站点进行第 + 1次信道预留， 且减小信道预留的最大时 长为 η+1， 其中， T t≥T 。
图 12为本发明发送站点实施例一的结构示意图。如图 12所示， 本实施例 提供的发送站点 120包括： 检测模块 1201及调整发送模块 1202。
其中， 检测模块 1201用于在进行数据发送前， 检测信道忙闲情况； 调整发送模块 1202用于若所述检测模块检测信道处于空闲状态， 则增大 占用信道的最大时间长度， 并进行数据发送， 其中， 发送数据时占用信道的时 间长度小于等于所述增大调整后的最大时间长度；
调整发送模块 1202还用于若所述检测模块检测信道处于繁忙状态， 则减 小占用信道的最大时间长度， 并进行数据发送， 其中， 发送数据时占用信道的 时间长度小于等于所述减小调整后的最大时间长度。
可选地， 所述检测模块 1201具体用于： 检测信道在预设时长内是否连续 空闲；
若是， 则确定所述信道处于空闲状态；
若否， 则确定所述信道处于繁忙状态。
可选地， 所述检测模块 1201还具体用于： 检测信道在预设时长内是否连 续空闲和退避过程中信道是否连续空闲；
若均是， 则确定所述信道处于空闲状态；
若有一个否， 则确定所述信道处于繁忙状态。
可选地， 若所述检测模块 1201检测信道处于繁忙状态， 所述调整发送模 块 1202还具体用于： 根据信道繁忙状态的干扰参数， 减小占用信道的最大时 间长度；
所述干扰参数， 包括下述参数中的至少一种参数：
干扰的时长、 干扰的次数、 干扰的频率及干扰源类型。
可选地， 所述增大调整后的最大时间长度小于等于第一预设时间长度； 和 /或，
所述减小调整后的最大时间长度大于等于第二预设时间长度；
所述第一预设时间长度大于第二预设时间长度。
可选地， 所述调整发送模块 1202还具体用于： 预留信道， 并在所述预留 信道上进行数据发送， 其中， 所述预留信道的时间长度小于等于所述调整后的 最大时间长度。
本实施例的发送站点，可以用于信息发送方法实施例一至实施例六的技术 方案， 其实现原理和技术效果类似， 此处不再赘述。
图 13为本发明发送站点实施例二的结构示意图。如图 13所示， 本实施例 提供的发送站点 130包括处理器 1301、检测器 1302及发送器 1303， 该发送器 1303可以和处理器 1301相连， 检测器 1302可以和处理器 1301相连。 其中， 检测器 1302用于在进行数据发送前， 检测信道忙闲情况； 处理器 1301用于若 检测器 1302检测信道处于空闲状态， 则增大占用信道的最大时间长度并通知 发送器 1303进行数据发送， 其中， 发送数据时占用信道的时间长度小于等于 所述增大调整后的最大时间长度；该处理器 1301还用于若检测器 1302检测信 道处于繁忙状态， 则减小占用信道的最大时间长度并通知发送器 1303进行数 据发送， 其中， 发送数据时占用信道的时间长度小于等于所述减小调整后的最 大时间长度。
本实施例的发送站点，可以用于执行本发明上述实施例中发送站点所执行 的信息发送方法的技术方案， 其实现原理和技术效果类似， 此处不再赘述。
本领域普通技术人员可以理解：实现上述各方法实施例的全部或部分步骤 可以通过程序指令相关的硬件来完成。前述的程序可以存储于一计算机可读取 存储介质中。 该程序在执行时， 执行包括上述各方法实施例的步骤； 而前述的 存储介质包括： ROM, RAM,磁碟或者光盘等各种可以存储程序代码的介质。
最后应说明的是： 以上各实施例仅用以说明本发明的技术方案， 而非对其 限制； 尽管参照前述各实施例对本发明进行了详细的说明， 本领域的普通技术 人员应当理解： 其依然可以对前述各实施例所记载的技术方案进行修改， 或者 对其中部分或者全部技术特征进行等同替换； 而这些修改或者替换， 并不使相 应技术方案的本质脱离本发明各实施例技术方案的范围。

Claims

权 利 要 求 书
1、 一种信息发送方法， 其特征在于， 包括：
发送站点在进行数据发送前， 检测信道忙闲情况；
若信道处于空闲状态， 则所述发送站点增大占用信道的最大时间长度， 并进行数据发送， 其中， 发送数据时占用信道的时间长度小于等于所述增大 调整后的最大时间长度；
若信道处于繁忙状态， 则所述发送站点减小占用信道的最大时间长度， 并进行数据发送， 其中， 发送数据时占用信道的时间长度小于等于所述减小 调整后的最大时间长度。
2、根据权利要求 1所述的方法， 其特征在于， 所述发送站点检测信道忙 闲情况， 包括：
所述发送站点检测信道在预设时长内是否连续空闲；
若是， 则所述发送站点确定所述信道处于空闲状态；
若否， 则所述发送站点确定所述信道处于繁忙状态。
3、根据权利要求 1所述的方法， 其特征在于， 所述发送站点检测信道忙 闲情况， 包括：
所述发送站点检测信道在预设时长内是否连续空闲和退避过程中信道是 否连续空闲；
若均是， 则所述发送站点确定所述信道处于空闲状态；
若有一个否， 则所述发送站点确定所述信道处于繁忙状态。
4、根据权利要求 1〜3中任一项所述的方法， 其特征在于， 所述发送站点 减小占用信道的最大时间长度， 包括：
所述发送站点根据信道繁忙状态的干扰参数， 减小占用信道的最大时间 长度；
所述干扰参数， 包括下述参数中的至少一种参数：
干扰的时长、 干扰的次数、 干扰的频率及干扰源类型。
5、根据权利要求 1〜4中任一项所述的方法， 其特征在于， 所述增大调整 后的最大时间长度小于等于第一预设时间长度；
和 /或，
所述减小调整后的最大时间长度大于等于第二预设时间长度； 所述第一预设时间长度大于第二预设时间长度。
6、根据权利要求 1〜5中任一项所述的方法， 其特征在于， 所述发送站点 进行数据发送， 包括：
所述发送站点预留信道， 并在所述预留信道上进行数据发送， 其中， 所 述预留信道的时间长度小于等于所述调整后的最大时间长度。
7、 一种发送站点， 其特征在于， 包括：
检测模块， 用于在进行数据发送前， 检测信道忙闲情况；
调整发送模块， 用于若所述检测模块检测信道处于空闲状态， 则增大占 用信道的最大时间长度， 并进行数据发送， 其中， 发送数据时占用信道的时 间长度小于等于所述增大调整后的最大时间长度；
所述调整发送模块， 还用于若所述检测模块检测信道处于繁忙状态， 则 减小占用信道的最大时间长度， 并进行数据发送， 其中， 发送数据时占用信 道的时间长度小于等于所述减小调整后的最大时间长度。
8、根据权利要求 7所述的发送站点， 其特征在于， 所述检测模块具体用 于：
检测信道在预设时长内是否连续空闲；
若是， 则确定所述信道处于空闲状态；
若否， 则确定所述信道处于繁忙状态。
9、根据权利要求 7所述的发送站点， 其特征在于， 所述检测模块还具体 用于：
检测信道在预设时长内是否连续空闲和退避过程中信道是否连续空闲； 若均是， 则确定所述信道处于空闲状态；
若有一个否， 则确定所述信道处于繁忙状态。
10、 根据权利要求 7〜9中任一项所述的发送站点， 其特征在于， 若所述 检测模块检测信道处于繁忙状态， 所述调整发送模块具体用于： 根据信道繁 忙状态的干扰参数， 减小占用信道的最大时间长度；
所述干扰参数， 包括下述参数中的至少一种参数：
干扰的时长、 干扰的次数、 干扰的频率及干扰源类型。
11、根据权利要求 7〜10中任一项所述的发送站点， 其特征在于， 所述增 大调整后的最大时间长度小于等于第一预设时间长度； 和 /或，
所述减小调整后的最大时间长度大于等于第二预设时间长度；
所述第一预设时间长度大于第二预设时间长度。
12、 根据权利要求 7〜11中任一项所述的发送站点， 其特征在于， 所述调 整发送模块具体用于： 预留信道， 并在所述预留信道上进行数据发送， 其中， 所述预留信道的时间长度小于等于所述调整后的最大时间长度。
PCT/CN2013/086833 2013-11-11 2013-11-11 信息发送方法及装置 WO2015066911A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
CN201380076739.4A CN105230106B (zh) 2013-11-11 2013-11-11 信息发送方法及装置
PCT/CN2013/086833 WO2015066911A1 (zh) 2013-11-11 2013-11-11 信息发送方法及装置
US15/151,307 US10313906B2 (en) 2013-11-11 2016-05-10 Method and device for sending information

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2013/086833 WO2015066911A1 (zh) 2013-11-11 2013-11-11 信息发送方法及装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/151,307 Continuation US10313906B2 (en) 2013-11-11 2016-05-10 Method and device for sending information

Publications (1)

Publication Number Publication Date
WO2015066911A1 true WO2015066911A1 (zh) 2015-05-14

Family

ID=53040806

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/086833 WO2015066911A1 (zh) 2013-11-11 2013-11-11 信息发送方法及装置

Country Status (3)

Country Link
US (1) US10313906B2 (zh)
CN (1) CN105230106B (zh)
WO (1) WO2015066911A1 (zh)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10461791B2 (en) * 2017-05-03 2019-10-29 Telefonaktiebolaget Lm Ericsson (Publ) Interference analysis in wireless networks
US10820349B2 (en) 2018-12-20 2020-10-27 Autonomous Roadway Intelligence, Llc Wireless message collision avoidance with high throughput
US10939471B2 (en) 2019-06-13 2021-03-02 David E. Newman Managed transmission of wireless DAT messages
US10820182B1 (en) 2019-06-13 2020-10-27 David E. Newman Wireless protocols for emergency message transmission
US20220264349A1 (en) * 2019-07-11 2022-08-18 Telefonaktiebolaget Lm Ericsson (Publ) Methods and Devices for Wireless Communication
WO2021026897A1 (zh) * 2019-08-15 2021-02-18 北京小米移动软件有限公司 网络分配向量设置方法和装置
US10856331B1 (en) * 2019-09-10 2020-12-01 Cypress Semiconductor Corporation Devices, systems, and methods for mitigating aggressive medium reservations
EP3952588B1 (en) * 2020-08-05 2023-12-27 Nokia Technologies Oy Determining channel occupancy for sidelink communication

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101815302A (zh) * 2010-01-07 2010-08-25 北京邮电大学 一种利用认知无线电网络中空闲信道的频谱接入方法
CN103299698A (zh) * 2011-01-14 2013-09-11 诺基亚公司 用于无线介质访问的方法和装置
CN103379381A (zh) * 2012-04-17 2013-10-30 中兴通讯股份有限公司 基于wap网关的视频播放方法、wap网关及***

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1429494B1 (en) * 2001-09-17 2012-11-14 Sharp Kabushiki Kaisha Communication management method, communication terminal, communication management program, recording medium containing the communication management program, and communication system
TWI459754B (zh) * 2007-01-12 2014-11-01 Koninkl Philips Electronics Nv 無線網狀網路中擁擠管理之方法
US9807803B2 (en) * 2007-03-01 2017-10-31 Qualcomm Incorporated Transmission control for wireless communication networks
US8249030B2 (en) * 2007-03-23 2012-08-21 Intel Corporation Adapting TXOP requests for multi-radio platforms
US20100000822A1 (en) * 2008-07-03 2010-01-07 Spanz Pty Ltd Scaffolding system
KR100964187B1 (ko) * 2008-07-09 2010-06-17 한국전자통신연구원 무선 네트워크의 ｐｃｓ 임계값조정방법 및 단말장치
US8767570B2 (en) * 2011-02-14 2014-07-01 Nokia Corporation Indicating status of radio resources in wireless network
WO2012162875A1 (en) * 2011-05-30 2012-12-06 Renesas Mobile Corporation Methods and apparatus for managing wireless communication using unlicensed frequency bands
US9042324B2 (en) * 2012-05-03 2015-05-26 Interdigital Patent Holdings, Inc. Enhanced active scanning in wireless local area networks
US10793342B2 (en) * 2012-07-16 2020-10-06 John Minson Credit card dispenser
US9277532B2 (en) * 2012-09-18 2016-03-01 Alcatel Lucent Methods for allocating and scheduling uplink and downlink transmissions and apparatuses thereof
US9736859B2 (en) * 2012-11-28 2017-08-15 Samsung Electronics Co., Ltd. Method and apparatus for providing voice service in wireless local area network
GB2510139B (en) * 2013-01-24 2015-06-03 Broadcom Corp Method, apparatus and computer program for providing a transmission opportunity
US20140293868A1 (en) * 2013-03-27 2014-10-02 Broadcom Corporation Method and apparatus for providing feedback
KR20160006209A (ko) * 2013-05-07 2016-01-18 브이아이디 스케일, 인크. 비디오 애플리케이션들을 위한 비디오를 위한 qoe-인식 wifi 향상
US9813938B2 (en) * 2013-07-11 2017-11-07 Qualcomm Incorporated Systems and methods for dynamic adaptation of channel access or transmission parameters

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101815302A (zh) * 2010-01-07 2010-08-25 北京邮电大学 一种利用认知无线电网络中空闲信道的频谱接入方法
CN103299698A (zh) * 2011-01-14 2013-09-11 诺基亚公司 用于无线介质访问的方法和装置
CN103379381A (zh) * 2012-04-17 2013-10-30 中兴通讯股份有限公司 基于wap网关的视频播放方法、wap网关及***

Also Published As

Publication number Publication date
US20160255530A1 (en) 2016-09-01
CN105230106A (zh) 2016-01-06
CN105230106B (zh) 2020-01-31
US10313906B2 (en) 2019-06-04

Similar Documents

Publication Publication Date Title
WO2015066911A1 (zh) 信息发送方法及装置
US11658843B2 (en) System and method for full-duplex media access control using request-to-send signaling
US9560548B2 (en) Dynamic adjustment of a wireless network media access control parameter
EP3393145B1 (en) Access method and apparatus
US11071168B2 (en) Multi-station access method, apparatus, and system
EP2894928B1 (en) Method and device for adjusting contention window value adaptively
JP4152322B2 (ja) ＩＥＥＥ８０２．１１ｅハイブリッドコーディネータの回復及びバックオフ規則を定める装置及び方法
WO2017000411A1 (zh) 一种用于非授权频段的冲突避免方法及装置
TWI629912B (zh) 於無線網路中減少碰撞之系統及方法
WO2016187853A1 (zh) 一种信道接入方法及装置
WO2020168946A1 (zh) 传输数据的方法和通信装置
CN106455114B (zh) 基于多信道的退避方法及设备
US10368370B2 (en) Multichannel access method and apparatus
WO2021008401A1 (zh) 通信方法、装置、计算机可读介质及电子设备
JP2016528793A (ja) コンテンション制御機構
WO2020172982A1 (zh) 多无线射频***的数据传输方法及装置、存储介质、终端
WO2016188245A1 (zh) 信道协商方法、站点及***
WO2014187087A1 (zh) 一种信道竞争方法及设备
WO2014173164A1 (zh) 一种信道接入的处理方法、装置和计算机可读存储介质
CN107750057B (zh) 认知无线电网络中控制信道建立方法
US9924407B2 (en) Contention adjustment method, apparatus, and system in wireless local area network
WO2017031645A1 (zh) 一种退避方法、传输消息方法及装置
WO2011124151A1 (zh) 占用信道时间的分配方法及接入点设备与接入网络***
CN105379384B (zh) 数据发送方法和装置、数据接收方法和装置
WO2023207505A1 (zh) 应用于直通链路的信道接入处理方法、装置和网络侧设备

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 201380076739.4

Country of ref document: CN

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

Ref document number: 13897258

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13897258

Country of ref document: EP

Kind code of ref document: A1