Communication method and apparatus

Abstract

A communication method and apparatus, relating to the field of communications, are disclosed, capable of reducing the collision probability of beacon frames and data frames, and improving air interface transmission efficiency and reliability. The method is applied to a communication network including at least one access point, and may include: within a time interval between adjacent TBTTs, each of the at least one access point transmits a beacon frame; the beacon frames transmitted by each of the at least one access point constitute multiple beacon frames, and the frame interval between adjacent beacon frames in the multiple beacon frames is less than or equal to DIFS. The TBTTs of the multiple access points are identical.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to communication methods and apparatus. Background Technology

[0002] In communication systems, multiple access points (APs) can be virtualized into one AP through single frequency network (SFN) networking. This allows a station (STA) to believe that it is always associated with one AP when moving within the coverage area of ​​these multiple APs, eliminating the need for roaming (or achieving service interruption) and thus achieving a "zero roaming" effect.

[0003] In this context, multiple APs within an SFN can send beacon frames containing the same basic serviceset identifier (BSSID) to a STA. Correspondingly, a STA can receive these beacon frames from multiple APs and determine that it is always associated with the same AP based on the beacon frames containing the same BSSID.

[0004] However, the lack of an air interface coordination mechanism between the AP and STA in an SFN prevents the STA from determining the timing of the AP's beacon frame transmission. This leads to collisions between the beacon frames sent by the AP and the uplink data frames (or simply data frames) sent by the STA, resulting in data frame retransmissions and low signal-to-noise ratios (SNR) for the beacon frames. Consequently, air interface transmission efficiency and reliability decrease. The poor SNR of the beacon frames may cause some terminals to fail to receive them correctly in certain areas, and in severe cases, may cause the STA to drop out of service due to prolonged periods without receiving beacon frames. Summary of the Invention

[0005] This application provides a communication method and apparatus that can reduce the probability of collisions between beacon frames and data frames, and improve the efficiency and reliability of air interface transmission.

[0006] In a first aspect, a communication system is provided, comprising at least one access point (AP). Unless otherwise specified, "AP" in this application may refer to the AP itself, a component within the AP (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the AP. The at least one AP in the communication system is used to generate multiple beacon frames, and the at least one AP is used to transmit the multiple beacon frames within a time interval of a target beacon transmission time (TBTT) between adjacent beacon frames. The frame interval between adjacent beacon frames in the multiple beacon frames is less than or equal to the distributed coordination function interframe space (DIFS), and the TBTT of each AP in the at least one AP is the same.

[0007] The frame interval waiting time when a node sends a data frame is DIFS, meaning it must wait at least DIFS before sending a data frame. Based on this scheme, the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS. This means the time interval between adjacent beacon frames is less than or equal to the frame interval waiting time required for the node to transmit a data frame. Thus, for both the node sending a data frame and the access point sending a beacon frame, if both detect an idle channel at the end of the previous beacon frame, the access point sending the beacon frame will wait for a time interval less than or equal to DIFS before occupying the channel to send the next beacon frame. The node sending the beacon frame will wait at least until DIFS before sending the data frame. This means that the access point sending the beacon frame will compete for the channel faster and occupy the channel to send the beacon frame. This makes it so that after waiting for DIFS, the node sending the data frame will detect that the channel is occupied or busy, and the required random backoff process cannot be started. In other words, the random backoff process required to send the data frame cannot be reversed. This means that during the period of sending multiple beacon frames (i.e., the time interval between adjacent TBTTs), the node sending the data frame cannot obtain air interface resources to send the data frame, thereby reducing the probability of collision between beacon frames and data frames.

[0008] In one possible implementation, the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to the DIFS, including: under the enhanced distributed channel access (EDCA) mechanism, the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to the DIFS, and the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to the arbitration interframe space (AIFS).

[0009] Based on this possible implementation, under the EDCA mechanism, the frame interval between adjacent beacon frames in multiple beacon frames needs to be less than or equal to DIFS, and also less than or equal to AIFS, so that the scheme can be applied to the EDCA mechanism.

[0010] In one possible implementation, the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS, including: the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS, and the frame interval between adjacent beacon frames in multiple beacon frames is greater than the length of 1 symbol.

[0011] Based on this possible implementation, the frame interval between adjacent beacon frames in multiple beacon frames not only needs to be less than or equal to DIFS, but also needs to be greater than the length of 1 symbol to ensure that the receiver can distinguish adjacent beacon frames and reduce the probability of collision between beacon frames and data frames.

[0012] In one possible implementation, the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS, including: the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS, and the frame interval between adjacent beacon frames in multiple beacon frames is greater than or equal to the short interframe space (SIFS).

[0013] SIFS is the minimum frame interval specified by the IEEE 802.11 protocol. For communication networks that comply with the IEEE 802.11 protocol, the frame interval between adjacent frames sent by devices in the communication network needs to be greater than or equal to SIFS. Based on this possible implementation, the frame interval between adjacent beacon frames in multiple beacon frames needs to be not only less than or equal to DIFS, but also greater than or equal to SIFS. This allows the scheme to reduce the probability of collisions between beacon frames sent by APs and data frames sent by other nodes (e.g., STAs) in communication networks that comply with the IEEE 802.11 protocol.

[0014] In one possible implementation, when at least one AP is multiple APs associated with the same BSSID, the multiple beacon frames consist of beacon frames sent by different APs within the time interval of adjacent TBTTs, and the multiple beacon frames have the same BSSID; or, when at least one AP is a single AP, the multiple beacon frames consist of multiple beacon frames sent by a single AP within the time interval of adjacent TBTTs, and the multiple beacon frames have different BSSIDs.

[0015] Based on this possible implementation, for multiple APs associated with the same BSSID, such as multiple APs in the same BSSID scheme of SFN, the frame interval of adjacent beacon frames transmitted within the time interval of adjacent TBTTs is less than or equal to DIFS, reducing the probability of collision between beacon frames transmitted by any of these APs and data frames transmitted by other nodes (e.g., STAs, or other APs besides the one in question). For an AP, such as an AP in the BSSID following scheme of SFN, or an AP in a multi-frequency network, the frame interval of adjacent beacon frames transmitted by that AP within adjacent TBTTs is less than or equal to DIFS, reducing the probability of collision between beacon frames transmitted by that AP and data frames transmitted by other nodes (e.g., STAs).

[0016] In one possible implementation, the communication system in the first aspect further includes a wireless controller for managing at least one AP, which is a plurality of APs associated with the same BSSID, and each of the at least one AP is also used to receive first information from the wireless controller, the first information being used by each AP to determine the time to send a beacon frame.

[0017] Based on this possible implementation, each of at least one AP can send a beacon frame at the time determined according to the first information, so that the frame interval of adjacent beacon frames sent by at least one AP within the time interval of adjacent TBTT is less than or equal to DIFS.

[0018] In one possible implementation, the first information of any AP carries at least two of the following: the beacon frame interval waiting time of any AP, the second delay duration of any AP, the first delay duration of any AP, the target frame interval of adjacent beacon frames, and the timing index of the beacon frames transmitted by any AP, wherein the target frame interval of adjacent beacon frames is equal to the frame interval of adjacent beacon frames.

[0019] Based on this possible implementation, the first information of any AP can carry multiple pieces of information, allowing any AP to flexibly determine the time to send beacon frames within the time interval of adjacent TBTTs according to the information carried in the first information.

[0020] In one possible implementation, if the first information of each AP carries the beacon frame interval waiting time of the AP and the second delay duration of the AP, the AP is used to send a beacon frame after the second delay duration of the AP in the previous TBTT in the adjacent TBTT; wherein, the frame interval waiting time for sending the beacon frame is the beacon frame interval waiting time of the AP; the beacon frame interval waiting time of the AP is less than or equal to the frame interval of the adjacent beacon frames.

[0021] Based on this possible implementation, the AP transmits a beacon frame after the second delay duration of the AP carried in the first information, during the preceding TBTT in an adjacent TBTT, and the frame interval waiting time for transmitting the beacon frame is the beacon frame interval waiting time of the AP carried in the first information. Thus, the AP determines the timing for transmitting the beacon frame based on the beacon frame interval waiting time of the AP in the first information and the second delay duration of the AP.

[0022] In one possible implementation, if the first information of each AP carries the AP's beacon frame interval waiting time, the AP's first delay duration, and the timing index of the AP's beacon frame transmission, the AP is used to transmit the beacon frame after the second delay duration of the AP in the previous TBTT in the adjacent TBTT; the second delay duration of the AP is obtained from the AP's beacon frame interval waiting time, the AP's first delay duration, and the timing index of the AP's beacon frame transmission.

[0023] Based on this possible implementation, the AP transmits a beacon frame after the second delay duration of the previous TBTT in an adjacent TBTT. The second delay duration of the AP is obtained from the AP's beacon frame interval waiting time, the AP's first delay duration, and the timing index of the AP's transmitted beacon frame, all carried in the first information. Thus, the AP determines the timing of transmitting the beacon frame based on the AP's beacon frame interval waiting time, the AP's first delay duration, and the timing index of the AP's transmitted beacon frame, all in the first information.

[0024] In one possible implementation, the second delay duration is the product of the difference between the timing index of the AP's transmitted beacon frame and 1, and the duration of the time slot; the duration of the time slot is the sum of the AP's beacon frame interval waiting time, the duration of the AP's beacon frame occupying the channel, and the AP's first delay duration; wherein, the timing index of the AP's transmitted beacon frame indicates the time slot in which the AP transmits the beacon frame, and the timing index of the AP's transmitted beacon frame is less than or equal to the number of APs included in at least one AP.

[0025] Based on this possible implementation, the second delay duration of any AP can be obtained from the timing index of the AP's transmitted beacon frames, the beacon frame interval waiting time of the AP, the duration of the beacon frame occupying the channel, and the first delay duration of the AP. Then, the AP can determine the time to transmit the beacon frame based on the obtained second delay duration.

[0026] In one possible implementation, if the first information of each AP carries the target frame interval of adjacent beacon frames and the timing index of the AP's transmitted beacon frames, the AP is used to transmit beacon frames after receiving a beacon frame including the first transmission timing index, and then delaying the transmission of beacon frames by the target frame interval of adjacent beacon frames; wherein, the first transmission timing index is the timing index preceding the timing index of the AP's transmitted beacon frames.

[0027] Based on this possible implementation, the AP, after receiving a beacon frame including a first transmission timing index, transmits the beacon frame at a time delay of the target frame interval of adjacent beacon frames. The first transmission timing index is the preceding timing index of the AP's transmitted beacon frame carried in the first information, and the target frame interval of adjacent beacon frames is the target frame interval of adjacent beacon frames carried in the first information. Thus, the AP determines the time to transmit the beacon frame based on the target frame interval of adjacent beacon frames in the first information and the timing index of the AP's transmitted beacon frame.

[0028] In one possible implementation, the communication system in the first aspect further includes a wireless controller for managing at least one AP, the at least one AP being an AP, and the AP also for receiving first information from the wireless controller; the first information is used by the AP to determine the time for transmitting each of the multiple beacon frames; the BSSIDs of the different beacon frames in the multiple beacon frames are different.

[0029] Based on this possible implementation, an AP can send each beacon frame at the time determined by the first information, so that the frame interval of adjacent beacon frames sent by an AP within the time interval of adjacent TBTTs is less than or equal to DIFS.

[0030] In one possible implementation, the first information includes the AP's beacon frame interval waiting time, the first delay duration, and the timing index for sending different beacon frames. The timing index for sending different beacon frames includes the timing index of each beacon frame in the multiple beacon frames. The target frame interval of adjacent beacon frames in the multiple beacon frames is equal to the sum of the AP's beacon frame interval waiting time and the AP's first delay duration.

[0031] Based on this possible implementation, the AP can determine the transmission time of each beacon frame according to the AP's beacon frame interval waiting time, the first delay duration, and the timing index of sending different beacon frames in the first information, and then send the corresponding beacon frame at any transmission time.

[0032] Secondly, a communication method is provided, which can be executed by an AP. Unless otherwise specified, "AP" in this application can refer to the AP itself, a component in the AP (e.g., a processor, chip, or chip system), or a logic module or software that can implement all or part of the AP. The method can include: the AP generating beacon frames, and the AP transmitting beacon frames within the time interval of adjacent TBTTs; wherein the frame interval of adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, and the TBTTs of the APs transmitting beacon frames within the time interval of adjacent TBTTs are the same.

[0033] The frame interval waiting time when a node sends a data frame is DIFS, meaning it must wait at least DIFS before sending a data frame. Based on the above scheme, the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS. This means that the time interval between adjacent beacon frames is less than or equal to the frame interval waiting time required for the node to transmit a data frame. Thus, for both the node sending a data frame and the access point sending a beacon frame, if both detect that the channel is idle at the end of the previous beacon frame, the access point sending the beacon frame will wait for a time interval less than or equal to DIFS before occupying the channel to send the next beacon frame. The node sending the data frame will wait at least DIFS before sending the data frame. In other words, the access point sending the beacon frame will compete for the channel faster and occupy the channel to send the beacon frame. This causes the node sending the data frame to detect that the channel is occupied or busy after waiting for DIFS, and the required random backoff process cannot be started. In other words, the random backoff process required for sending the data frame cannot be reversed, so the node sending the data frame within the time interval of adjacent TBTTs cannot obtain air interface resources to send the data frame, thereby reducing the probability of collision between beacon frames and data frames.

[0034] In one possible implementation, the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, including: under the EDCA mechanism, the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, and the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to AIFS.

[0035] Based on this possible implementation, under the EDCA mechanism, the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs needs to be less than or equal to DIFS, and also less than or equal to AIFS, so that the scheme can be applied to the EDCA mechanism.

[0036] In one possible implementation, the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, including: the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, and the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is greater than the length of 1 symbol.

[0037] Based on this possible implementation, the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs needs to be not only less than or equal to DIFS, but also greater than the length of one symbol, in order to ensure that the receiver can distinguish adjacent beacon frames and reduce the probability of collision between beacon frames and data frames.

[0038] In one possible implementation, the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, including: the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, and the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is greater than or equal to SIFS.

[0039] SIFS is the minimum frame interval specified by the IEEE 802.11 protocol. For communication networks that comply with the IEEE 802.11 protocol, the frame interval between adjacent frames sent by devices in the network needs to be greater than or equal to SIFS. Based on this possible implementation, the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs needs to be not only less than or equal to DIFS, but also greater than or equal to SIFS. This allows the scheme to reduce the probability of collisions between beacon frames sent by APs and data frames sent by other nodes (e.g., STAs) in communication networks that comply with the IEEE 802.11 protocol.

[0040] In one possible implementation, the second aspect of the method further includes: receiving first information, which is used by the AP to determine the time to send the beacon frame.

[0041] Based on this possible implementation, the AP can send a beacon frame at the time determined according to the first information, so that the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS.

[0042] In one possible implementation, the first information carries at least two of the following: the beacon frame interval waiting time of the AP, the second delay duration of the AP, the first delay duration of the AP, the target frame interval of adjacent beacon frames, and the timing index of the AP's transmitted beacon frames, wherein the target frame interval of adjacent beacon frames is equal to the frame interval of adjacent beacon frames.

[0043] Based on this possible implementation, the first information of the AP can carry multiple pieces of information, allowing the AP to flexibly determine the time to send beacon frames within the time interval of adjacent TBTTs according to the information carried in the first information.

[0044] In one possible implementation, if the AP's first information carries the AP's beacon frame interval waiting time and the AP's second delay duration, the AP sends a beacon frame after the second delay duration of the first TBTT in an adjacent TBTT. The beacon frame interval waiting time is the AP's beacon frame interval waiting time, and the AP's beacon frame interval waiting time is less than or equal to the frame interval of the adjacent beacon frames.

[0045] Based on this possible implementation, the AP sends a beacon frame after the second delay duration of the AP carried in the first information, during the preceding TBTT in adjacent TBTTs, and the frame interval waiting time for sending this beacon frame is the beacon frame interval waiting time of the AP carried in the first information. In this way, the AP determines the time to send the beacon frame based on the beacon frame interval waiting time of the AP in the first information and the second delay duration of the AP.

[0046] In one possible implementation, if the AP's first information carries the AP's beacon frame interval waiting time, the AP's first delay duration, and the timing index of the AP's beacon frame transmission, the AP transmits the beacon frame after the second delay duration of the AP in the previous TBTT in an adjacent TBTT; the second delay duration of the AP is obtained from the AP's beacon frame interval waiting time, the AP's first delay duration, and the timing index of the AP's beacon frame transmission.

[0047] Based on this possible implementation, the AP transmits a beacon frame after the second delay duration of the previous TBTT in an adjacent TBTT. The second delay duration of the AP is obtained from the AP's beacon frame interval waiting time, the AP's first delay duration, and the timing index of the AP's transmitted beacon frame, all carried in the first information. Thus, the AP determines the timing of transmitting the beacon frame based on the AP's beacon frame interval waiting time, the AP's first delay duration, and the timing index of the AP's transmitted beacon frame, all contained in the first information.

[0048] In one possible implementation, the second delay duration is the product of the difference between the timing index of the AP's transmitted beacon frame and 1, and the duration of the time slot. The duration of the time slot is the sum of the AP's beacon frame interval waiting time, the duration of the AP's beacon frame occupying the channel, and the AP's first delay duration. The timing index of the AP's transmitted beacon frame indicates the time slot in which the AP transmits the beacon frame, and the timing index of the AP's transmitted beacon frame is less than or equal to the number of APs transmitting beacon frames within the time interval of adjacent TBTTs.

[0049] Based on this possible implementation, the second delay duration of the AP can be obtained from the timing index of the AP's transmitted beacon frames, the beacon frame interval waiting time of the AP, the duration of the AP's beacon frames occupying the channel, and the first delay duration of the AP. Then, the AP can determine the time to transmit the beacon frame based on the obtained second delay duration.

[0050] In one possible implementation, if the AP's first information carries the target frame interval of adjacent beacon frames and the timing index of the AP's transmitted beacon frames, the AP, after receiving a beacon frame including the first transmission timing index, will transmit the beacon frame at a time delay of the target frame interval of adjacent beacon frames; wherein, the first transmission timing index is the timing index preceding the timing index of the AP's transmitted beacon frames.

[0051] Based on this possible implementation, after receiving a beacon frame including a first transmission timing index, the AP transmits the beacon frame at a time delay of the target frame interval of adjacent beacon frames. The first transmission timing index is the preceding timing index of the AP's transmitted beacon frame carried in the first information, and the target frame interval of adjacent beacon frames is the target frame interval of adjacent beacon frames carried in the first information. In this way, the AP determines the time to transmit the beacon frame based on the target frame interval of adjacent beacon frames in the first information and the timing index of the AP's transmitted beacon frame.

[0052] In one possible implementation, the first information includes the AP's beacon frame interval waiting time, the first delay duration, and the timing index for sending different beacon frames; wherein, the timing index for sending different beacon frames includes the timing index of each beacon frame in the beacon frame; the target frame interval between adjacent beacon frames is equal to the sum of the AP's beacon frame interval waiting time and the AP's first delay duration.

[0053] Based on this possible implementation, the AP can determine the transmission time of each beacon frame according to the AP's beacon frame interval waiting time, the first delay duration, and the timing index of sending different beacon frames in the first information, and then send the corresponding beacon frame at any transmission time.

[0054] Thirdly, a communication device is provided for implementing the method of the second aspect described above. This communication device may be the access point (AP) as described in the second aspect, or a device or component included in the AP, such as a chip.

[0055] The communication device includes modules, units, or means that implement the methods described above. These modules, units, or means can be implemented in hardware, software, or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the functions described above.

[0056] In some possible implementations, the communication device may include a processing module and a transceiver module. The transceiver module may include a sending module and a receiving module, respectively used to implement the sending and receiving functions of the second aspect described above and any possible implementation thereof. For example, the transceiver module is used to send beacon frames within the time interval between adjacent TBTTs. The processing module may be used to implement the processing functions of the second aspect described above and any possible implementation thereof. For example, the processing module is used to generate beacon frames. Wherein, the frame interval between adjacent beacon frames within the time interval between adjacent TBTTs is less than or equal to DIFS, and the access points sending beacon frames within the time interval between adjacent TBTTs have the same TBTT.

[0057] Optionally, the transceiver module and processing module of the communication device in the third aspect may also perform the corresponding functions in the second aspect or any possible implementation of the second aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0058] Fourthly, a communication device is provided, comprising: at least one processor configured to cause the communication device to perform the method described in any two aspects or possible implementations thereof by executing computer instructions stored in a memory or by logic circuitry. The communication device may be an access point (AP) in the second aspect or any possible implementation thereof, or a device or component included in the AP, such as a chip.

[0059] In some possible implementations, the communication device also includes a memory for storing configuration files of computer instructions and / or logic circuits. Optionally, the memory is integrated with the processor, or the memory is independent of the processor.

[0060] Fifthly, a communication device is provided, comprising: a processor and a communication interface; the communication interface being used for inputting and / or outputting signals; the processor being used to execute computer programs or instructions to cause the communication device to perform the method described in the second aspect above. The communication device may be an access point (AP) in the second aspect or any possible implementation of the second aspect, or a device or component included in the AP, such as a chip.

[0061] In some possible implementations, the communication interface is an interface circuit used to read and write computer instructions. For example, the interface circuit is used to receive computer execution instructions (which are stored in memory and may be read directly from memory or may be transmitted through other devices) and transmit them to the processor.

[0062] In some possible implementations, the communication interface is used to communicate with modules outside the communication device.

[0063] In some possible implementations, the communication device can be a chip or a chip system. When the device is a chip system, the chip system may include chips or contain chips and other discrete components.

[0064] A sixth aspect provides a communication device, comprising: a logic circuit and an interface circuit; the interface circuit being used for inputting information and / or outputting information; the logic circuit being used to perform the method described in the second aspect above, processing the input information and / or generating the output information. The communication device may be an access point (AP) in the second aspect or any possible implementation of the second aspect, or a device or component included in the AP, such as a chip.

[0065] In a seventh aspect, a computer-readable storage medium is provided, wherein a computer program or instructions are stored therein, which, when executed by a processor, cause the method described in the second aspect to be performed.

[0066] Eighthly, a computer program product is provided that, when executed by a processor, causes the method described in the second aspect to be performed.

[0067] It is understood that when the communication device provided by any of the third to eighth aspects is a chip, the aforementioned sending action / function can be understood as output information, and the aforementioned receiving action / function can be understood as input information.

[0068] The technical effects of any possible implementation of aspects three through eight can be found in the technical effects of aspect two or any possible implementation of aspect two, and will not be repeated here.

[0069] Ninth aspect, a communication system is provided, the communication system comprising the communication system described in the first aspect or any possible implementation thereof. Attached Figure Description

[0070] Figure 1 This is a schematic diagram of data frame transmission under a WLAN channel access mechanism provided in an embodiment of this application;

[0071] Figure 2 A schematic diagram of a BSSID following scheme provided in an embodiment of this application;

[0072] Figure 3 A schematic diagram of a BSSID scheme provided for an embodiment of this application;

[0073] Figure 4 A schematic diagram illustrating the transmission of beacon frames by an access point in an SFN, provided as an embodiment of this application;

[0074] Figure 5This application provides a schematic diagram of the structure of a communication system according to an embodiment of the present application.

[0075] Figure 6 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0076] Figure 7 A flowchart illustrating a communication method provided in an embodiment of this application;

[0077] Figure 8 A timing diagram illustrating the transmission of a beacon frame provided in an embodiment of this application;

[0078] Figure 9 A timing diagram illustrating the transmission of another beacon frame provided in an embodiment of this application;

[0079] Figure 10 A flowchart illustrating another communication method provided in an embodiment of this application;

[0080] Figure 11 A timing diagram illustrating the transmission of beacon frames by an access point, provided as an embodiment of this application;

[0081] Figure 12 A flowchart illustrating yet another communication method provided in an embodiment of this application;

[0082] Figure 13 A flowchart illustrating yet another communication method provided in an embodiment of this application;

[0083] Figure 14 A flowchart illustrating yet another communication method provided in an embodiment of this application;

[0084] Figure 15 This is a schematic diagram of another communication device provided in an embodiment of this application;

[0085] Figure 16 This is a schematic diagram of another communication device provided in an embodiment of this application. Detailed Implementation

[0086] Before introducing the embodiments of this application, some technical terms involved in the embodiments of this application will be explained. It should be understood that the following explanations are for the purpose of making the embodiments of this application easier to understand, and should not be regarded as a limitation on the scope of protection claimed by the embodiments of this application.

[0087] 1. Wireless Local Area Network (WLAN) Channel Access Mechanism

[0088] The WLAN channel access mechanism determines the time when nodes (or devices) in a WLAN network can send data frames (or data), and is the foundation for data communication between nodes in a WLAN network. The main idea of ​​the WLAN channel access mechanism is as follows: When the channel is idle, a node in the WLAN network (such as a node waiting to send a data frame) first waits for the frame interval before sending data, then checks whether the channel is idle. If the channel is detected as idle, a random backoff process is executed. During the random backoff process, the idle status of the channel is continuously checked. After the channel is continuously detected as idle, the node begins to send data frames.

[0089] For example, Figure 1 This is a schematic diagram of data frame transmission under the WLAN channel access mechanism. For example... Figure 1 As shown, when the channel is idle, the node waiting to send a data frame first waits for a frame interval and then checks the channel again. If the channel is still idle, a random backoff process is executed, and the node occupies the channel to send the data frame after the random backoff process ends. If the channel is not idle, the random backoff process is not executed.

[0090] Therefore, sending a data frame requires at least the sum of a frame interval waiting time and the time required to execute a random backoff process.

[0091] In this context, "channel idle" can mean that there is no information transmission in the channel or that the noise is relatively low; "channel idle" can be simply referred to as "channel busy." "Channel busy" can mean that information is being transmitted in the channel or that the noise is relatively high; "channel busy" can be simply referred to as "channel busy."

[0092] The node's random backoff process can include: the node randomly selecting a backoff time during which it does not occupy the channel to transmit data frames, thus backing off to reduce the probability of collisions with other nodes simultaneously transmitting data frames on the channel. This backoff time is typically a random value, determined based on a contention window (CW) (or backoff window). For example, the CW might be A. Initially, the node can randomly select an integer N from [0, A-1] as the backoff value, multiplying this value by a unit time to obtain the backoff time. In this application, the unit time can be a time slot, and the backoff time can be N * the length of a time slot. The node can back off within this backoff time, i.e., it does not occupy the channel to transmit data frames. During the backoff process, the node will check the channel busy / idle status in each time slot. If the channel is not busy in a time slot, the backoff value N is decremented by 1 and the backoff time is reduced by one time slot length. If the station detects that the channel is busy at any detection time, the backoff count is paused and the current value N is recorded. After confirming that the channel is idle again and waiting for one frame interval, the backoff process is resumed. When the backoff value is 0, that is, when the backoff time is 0, the node starts to send data frames.

[0093] It should be understood that the above random rollback process is a single random rollback process. In practical applications, a node can execute one or more rollback processes. The size of the CW used in each random rollback process can be the same or different, without restriction.

[0094] Optionally, the 802.11 protocol standard provides two parameters to determine the contention window size: the exponent from contention window minimum (ECWmin) and the exponent from contention window maximum (CWmax). The initial window size (initial size) of the CW is determined by ECWmin, for example, 2^ECWmin-1. If a node transmits a data frame on the channel and does not receive a response frame, the CW doubles during the next random backoff process; for example, the CW is adjusted from 2^ECWmin-1 to 2^(ECWmin+1)-1. However, if the CW doubles to 2^ECWmax-1, the CW will not double again during the next random backoff process. If the node successfully transmits a data frame on the channel, the node resets the contention window value to the initial window size.

[0095] In this application, the data frame can be a physical layer protocol data unit (PPDU) or other data formats, without limitation.

[0096] In this application, the frame interval waiting time can be configured by the access point itself. The frame interval waiting time can also be named Extended Interframe Space (XIFS) or other names, without limitation. Based on the length of the frame interval waiting time, the above-mentioned frame interval waiting time can be divided into the following four types:

[0097] (1) SIFS:

[0098] SIFS is the smallest frame interval wait time in the 802.11 protocol, typically 16 microseconds (µs). SIFS is used for the transmission of the highest priority information. This highest priority information may include, but is not limited to, request-to-send (RTS) frames, clear-to-send (CTS) frames, and acknowledgement (ACK) frames.

[0099] (2) Point coordination function interframe space (PIFS):

[0100] PIFS refers to the frame interval waiting time used in Point Coordination Function (PCF) mode. PIFS = SIFS + the length of one time slot. For example, if the length of one time slot is 9µs and SIFS is 16µs, then PIFS = 16 + 9 = 25µs. PIFS has a lower access priority than SIFS and can be used for accessing higher priority services.

[0101] (3) DIFS:

[0102] DIFS refers to the frame interval waiting time used in the distributed coordination function (DCF) mode. Typically, DIFS = SIFS + 2 * time slot. For example, if the time slot is 9us and SIFS is 16us, then DIFS = 16 + 2 * 9 = 34us.

[0103] The frame interval waiting time configured for a node depends on the type of frame the node is about to send. For example, the 802.11 protocol standard currently specifies that the frame interval waiting time for data frames should be greater than or equal to DIFS, and the frame interval waiting time for management frames (such as beacon frames) should be greater than or equal to PIFS.

[0104] (4) AIFS:

[0105] AIFS refers to the frame interval waiting time used under the EDCA mechanism. EDCA is a channel access mechanism introduced by the Institute of Electrical and Electronics Engineers (IEEE) 802.11e standard. By setting different contention parameters for different types of services, high-priority services have a greater chance of winning channel access compared to low-priority services during the channel contention process. Typically, AIFS = SIFS + the value of the arbitration interframe spacing number (AIFSN) * time slot. Generally, the value of AIFSN is greater than or equal to 2. Taking a time slot length of 9µs and SIFS of 16µs as an example, AIFS should be greater than or equal to SIFS + 2 * time slot, that is, AIFS is greater than DIFS, or AIFS is equal to DIFS, where DIFS is 34µs.

[0106] 2. SFN (or WLAN co-frequency networking)

[0107] SFN refers to grouping multiple access points in a WLAN network into a single frequency group, where access points within the same group operate on the same channel. Access points within the same frequency group can carry the same BSSID in the beacon frames they send to a station. This ensures that when a station moves between the coverage areas of different access points within the same frequency group, the BSSID in the detected beacon frames remains unchanged, allowing it to believe it is always associated with the same access point and thus eliminating the need for roaming, achieving a "zero roaming" effect.

[0108] According to the IEEE 802.11 protocol, access points do not need to perform a random backoff process when sending beacon frames (referred to as beacons). The beacon frame sending procedure is as follows: after the TBTT arrives, the access point sends the beacon frame.

[0109] Optionally, before sending a beacon frame, the access point performs a preparation operation. After this preparation operation is completed, the beacon frame is sent. The preparation operation for sending the beacon frame includes: the access point checks if the channel is busy or idle. If the channel is idle, it waits for one XIFS and then checks if the channel is busy or idle again. If the channel is still idle, the preparation operation ends and the beacon frame is sent. If the channel is detected to be busy, the access point needs to wait for the channel to become idle before performing the above process. Therefore, at least one XIFS is required from the arrival of the TBTT to the time of sending the beacon frame. The XIFS can be the PIFS mentioned above or other types of XIFS, etc., without limitation.

[0110] Here, TBTT refers to the time point at which a node needs to or is ready to send a beacon frame. Optionally, TBTT is defined by the protocol. Multiple TBTTs can be included; for example, these multiple TBTTs can include the first TBTT (or first TBTT), the second TBTT (or second TBTT), the third TBTT (or third TBTT), and so on. In other words, there can be K TBTTs, where K is an integer greater than 1, and the value of K can be set as needed without restriction.

[0111] Access points should periodically send beacon frames. For example, after the first TBTT arrives, the access point sends the first beacon frame. Further, after the second TBTT arrives, the access point sends the second beacon frame, and so on, sending the third beacon frame after the third TBTT arrives, and so on. The second TBTT is the time elapsed after the first TBTT, and the third TBTT is the time elapsed after the second TBTT, also within a beacon interval.

[0112] The first TBTT can be the "zero point" time. The "zero point" time refers to the moment when the node starts. In this application, the first TBTT can also be alternatively described as the first TBTT, the starting TBTT, or the reference TBTT, without limitation.

[0113] The beacon interval refers to the period at which the access point should send a beacon frame; that is, the beacon interval can be the time interval between adjacent TBTTs. The beacon interval of a beacon frame is carried in that beacon frame.

[0114] A beacon frame is a broadcast frame periodically sent by an access point. Beacon frames are primarily used for time synchronization, waking up terminals, and periodically announcing the existence of a wireless network (such as a WLAN). Beacon frames may contain, but are not limited to,: a service set identifier (SSID), a BSSID, and a traffic indication map (TIM).

[0115] SSID is an identifier for a WLAN network, used to distinguish different WLAN networks. BSSID is typically the media access control (MAC) address of the access point, used to uniquely identify an access point at the physical layer. TIM is information carried in the beacon frame, used to indicate which sites among the sites associated with the access point have data buffered in the access point awaiting transmission.

[0116] In this application, WLAN co-frequency networking can be achieved through a BSSID following scheme or a same BSSID scheme.

[0117] The BSSID following scheme refers to a WLAN network where different access points send beacon frames with the same BSSID for the same site, and send beacon frames with different BSSIDs for different sites. In other words, different sites in the BSSID following scheme have different BSSIDs, while the BSSID for the same site does not change with the access point.

[0118] For example, Figure 2 A schematic diagram of the BSSID following scheme is shown. (For example...) Figure 2 As shown, in the BSSID following scheme, the devices in the WLAN network include the access controller (AC), access point 1 (AP1), access point 2 (AP2), access point 3 (AP3), site 1 (STA1), and site 2 (STA2). Figure 2 As shown, in the BSSID following scheme, Figure 2 The AP in the system can provide a unique BSSID for each STA, such as STA1: BSSID1, STA2: BSSID2. Different STAs will have different BSSIDs in their beacon frames. For example, when STA1 is within the signal coverage of AP1, AP1 sends a beacon frame carrying BSSID1; when STA1 moves to the signal coverage of AP2, AP2 sends a beacon frame carrying BSSID1; when STA1 moves to the signal coverage of AP3, AP3 sends a beacon frame carrying BSSID1. Similarly, when STA2 is within the signal coverage of AP1, AP1 sends a beacon frame carrying BSSID2; when STA2 moves to the signal coverage of AP2, AP2 sends a beacon frame carrying BSSID2; when STA2 moves to the signal coverage of AP3, AP3 sends a beacon frame carrying BSSID2.

[0119] In the same BSSID scheme, different access points in a WLAN network send beacon frames with the same BSSID to different sites.

[0120] For example, Figure 3 A schematic diagram of the same BSSID scheme is shown, such as... Figure 3 As shown, in the same BSSID scheme, the devices in the WLAN network include AC, AP1, AP2, and AP3, and STA1, STA2, and STA3. STA1 is the associated STA of AP1, STA2 is the associated STA of AP2, and STA3 is the associated STA of AP3. The BSSID in the beacon frames sent by AP1, AP2, and AP3 is the same, which is BSSID1.

[0121] However, the lack of an air interface coordination mechanism between APs and STAs in an SFN causes STAs to be unable to determine the timing of beacon frame transmission by APs. This leads to collisions between beacon frames sent by APs and uplink data frames (or simply data frames) sent by STAs, resulting in data frame retransmissions and beacon frames with low signal-to-noise ratios, thus degrading air interface transmission efficiency and reliability. Furthermore, the lack of an air interface coordination mechanism between APs in an SFN also causes collisions between beacon frames sent by one AP and downlink data frames (or simply data frames) sent by another AP, resulting in data frame retransmissions and beacon frames with low signal-to-noise ratios, further reducing air interface transmission efficiency and reliability.

[0122] For example, taking XIFS as an example of PIFS, such as Figure 4As shown, the devices in the SFN include Access Point 1 (AP1), Access Point 2 (AP2), Access Point 3 (AP3), and Stations (STA). All devices in the SFN maintain clock synchronization. All access points in the SFN transmit beacon frames on the same channel, and the beacon interval for transmitting beacon frames is the same for all access points in the SFN, but the timing of beacon frame transmission differs for each access point: AP1 transmits beacon frame 1 after the first TBTT arrives. Specifically, at the first TBTT, AP1 checks if the channel is busy or idle. If the channel is idle, AP1 checks if the channel is busy or idle again at time t0 after XIFS (such as PIFS). If the channel is still idle at time t0, AP1 transmits beacon frame 1 at time t0. AP1 transmits beacon frame 1 again at the second TBTT when the second TBTT arrives, based on the above beacon frame preparation operation. AP2 sends beacon frame 2 at a time after the first TBTT delay. Specifically, after the first TBTT delay, AP2 checks if the channel is busy or idle. If the channel is idle, AP2 checks if the channel is busy or idle again at time t1 after XIFS (or PIFS). If the channel is still idle at time t1, AP2 sends beacon frame 2 at time t1. AP3 sends beacon frame 3 at a time after the second TBTT delay (the second time is longer than the first time). Specifically, after the second TBTT delay, AP3 checks if the channel is busy or idle. If the channel is idle, AP3 checks if the channel is busy or idle again at time t2 after XIFS (or PIFS). If the channel is still idle at time t2, AP3 sends beacon frame 3 at time t2. If, at the end of beacon frame 2, the station also detects that the channel is idle, and after undergoing an XIFS and random backoff process, sends a data frame at time t2, such as a QoS Null data frame or a Null data frame, to indicate that the station is changing from sleep mode to wake-up mode, then a collision will occur between beacon frame 3 sent by AP3 and the data frame sent by the station. Since beacon frame 3 and the data frame are sent simultaneously on the same channel, the beacon frame sent by AP3 has a poor signal-to-noise ratio, causing the station to fail to send the data frame at time t2. That is, the data frame cannot be successfully demodulated by its receiver, and the station cannot receive the acknowledgment frame from its receiver.

[0123] In this application, a poor signal-to-noise ratio (SNR) of a beacon frame can be understood as a low SNR of the beacon frame. In this case, the SNR of the beacon frame received by the station will be lower than the demodulation threshold of the station, causing the station to be unable to parse the information carried by the beacon frame, resulting in the station being unable to receive the beacon frame correctly. In severe cases, the station may lose connection due to not receiving beacon frames for a long time.

[0124] Since the station failed to send a data frame at time t2, the station needs to retransmit the data frame, which increases the air interface latency of the station's data frame transmission, reduces the reliability of data transmission, and decreases the air interface transmission efficiency.

[0125] The collision between data frames and beacon frames can refer to the simultaneous transmission of data frames and beacon frames on the same channel, with the two influencing each other.

[0126] The signal-to-noise ratio (SNR) (or signal-to-interference-plus-noise ratio) refers to the ratio of the average power of the signal received by the receiver to the average power of the noise on the channel. The noise on the channel can include naturally occurring noise (such as white noise) as well as other signals besides the signal to be received; that is, other signals on the channel are also considered noise. For a receiver, it cannot distinguish between two signals transmitted simultaneously at the same frequency; it can only treat one signal as a signal and the other as part of the noise for demodulation. For the receiver to correctly demodulate the signal, the average power of the signal needs to be significantly higher than the noise. For example, when beacon frames and data frames are transmitted simultaneously on the same channel, the data frames can be regarded as noise. The signal-to-noise ratio of the beacon frame can be equal to the ratio of the average power of the beacon frame received by the station to the average power of (white noise + data frame) on the channel. If the beacon frame needs to be demodulated correctly, the ratio of the average power of the beacon frame to the average power of (white noise + data frame) needs to be greater than the demodulation threshold. That is, the average power of the beacon frame is higher than the average power of (white noise + data frame) to a certain extent in order to demodulate the beacon frame correctly.

[0127] To address the collision issue between beacon frames and data frames mentioned above, embodiments of this application provide a communication method applied to a communication network including at least one access point. The method may include: at least one access point sending multiple beacon frames within the time interval between adjacent TBTTs, wherein the frame interval between adjacent beacon frames is less than or equal to DIFS. Each access point has the same TBTT, and after each TBTT arrives, each of the multiple access points may send a beacon frame.

[0128] As mentioned above, the frame interval waiting time when a node sends a data frame is DIFS, meaning it must wait at least DIFS before sending a data frame. If the frame interval between adjacent beacon frames is less than or equal to DIFS, it means the time interval between adjacent beacon frames is less than or equal to the frame interval waiting time required for the node to transmit a data frame. Therefore, for both the node sending a data frame and the access point sending a beacon frame, if both detect an idle channel at the end of the previous beacon frame, the access point sending the beacon frame will wait for a time interval less than or equal to DIFS before occupying the channel to send the next beacon frame. The node sending the frame will wait at least until DIFS before sending the data frame, in accordance with the data frame sending mechanism described above. That is, the access point sending the beacon frame will compete for the channel faster and occupy the channel to send the beacon frame. This means that after waiting for DIFS, the node sending the data frame will detect that the channel is occupied or busy, and the required random backoff process cannot be started. In other words, the random backoff process required to send the data frame cannot be rolled back. During the period of sending multiple beacon frames (i.e., within the time interval of adjacent TBTTs), the node sending the data frame cannot obtain air interface resources to send the data frame, thereby reducing the probability of collision between beacon frames and data frames.

[0129] The communication method provided in this application is applicable to WLANs that support IEEE-related standards. These IEEE-related standards include: 802.11a / b / g, 802.11n, 802.11ac, 802.11ax, 802.11be, 802.11bn, 802.11ad, 802.11ay, 802.11bf / sensing standards, ultra-wideband (UWB) standards / 802.15 standards, and subsequent related evolution standards, without limitation.

[0130] For example, such as Figure 5 The diagram shown is a structural schematic of a communication system provided in this application. Figure 5The communication system shown includes at least one access point and stations. Any one of the at least one access point can communicate with one or more stations, and this application does not limit this. This application can be applied to any networking scenario in SFN or inter-frequency networking, where SFN can be implemented through a same BSSID scheme or a BSSID following scheme. In the same BSSID scheme, multiple access points in the communication system are associated with the same BSSID, that is, multiple access points send beacon frames with the same BSSID. In the BSSID following scheme or inter-frequency networking, for any one of the at least one access point, multiple virtual access points (VAPs) can be configured in that access point. These multiple VAPs are associated with different BSSIDs, that is, multiple VAPs correspond to multiple beacon frames with different BSSIDs, and the access point can send multiple beacon frames corresponding to multiple VAPs.

[0131] For example, with Figure 5 For example, SFN includes Figure 5 In the BSSID scheme, access points 0, 1, and 2 all send beacon frame 1, beacon frame 2, and beacon frame 3. The BSSIDs in beacon frames 1, 2, and 3 are the same. In BSSID-following schemes or inter-frequency networks, for... Figure 5 Any of the access points shown, such as Figure 5 Access point 1 can send multiple beacon frames corresponding to multiple VAPs in access point 1. For example, access point 1 sends beacon frame 1 corresponding to VAP1, beacon frame 2 corresponding to VAP2, and beacon frame 3 corresponding to VAP3. The BSSIDs in beacon frame 1, beacon frame 2, and beacon frame 3 are different.

[0132] For example, an access point can be a device that supports multiple WLAN standards, such as the 802.11be standard or future Wi-Fi standards; it can also be a device that supports the 802.11a / b / g, 802.11n, 802.11ax, 802.11be, and 802.11bn standards, without limitation. For instance, an access point can be a terminal device with a Wi-Fi chip, network device, communication server, router, switch, bridge, computer, etc. Access points can also serve as access points for mobile users to access wired networks, primarily deployed in homes, buildings, and campuses, with a typical coverage radius of tens to hundreds of meters; of course, they can also be deployed outdoors. An access point acts as a bridge connecting wired and wireless networks, for example, connecting various wireless network clients together and then connecting the wireless network to an Ethernet network.

[0133] For example, a site can be a device that supports multiple WLAN standards, such as the 802.11be standard or future Wi-Fi standards; it can also be a device that supports the 802.11a / b / g, 802.11n, 802.11ax, 802.11be, and 802.11bn standards, without limitation. For example, a site can be a wireless communication chip, wireless sensor, wireless communication terminal, communication server, router, switch, bridge, computer, etc. For example, a site can be a mobile phone with Wi-Fi communication function, a tablet computer with Wi-Fi communication function, a set-top box with Wi-Fi communication function, a smart TV with Wi-Fi communication function, a smart wearable device with Wi-Fi communication function, an in-vehicle communication device with Wi-Fi communication function, and a computer with Wi-Fi communication function, without limitation.

[0134] Optional, Figure 5 The communication system shown may further include a wireless controller. The wireless controller is a device responsible for managing access points; for example, the wireless controller may be an AC (Access Controller). The wireless controller can manage one or more access points, and this application is not limited thereto. The wireless controller may include a unit with data processing capabilities.

[0135] The communication system described in this application is intended to more clearly illustrate the technical solutions of this application and does not constitute a limitation on the technical solutions provided in this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in this application are also applicable to similar technical problems.

[0136] In practical implementation, Figure 5 The access points and sites shown can all be used. Figure 6 The shown composition structure, or including Figure 6 The components shown. Figure 6 This is a schematic diagram of the structure of a communication device 60 provided in an embodiment of this application. The communication device 60 can be an access point or a chip or system-on-a-chip in the access point; it can also be a station or a chip or system-on-a-chip in the station.

[0137] like Figure 6 As shown, the communication device 60 includes one or more processors 601. Furthermore, the communication device 60 may also include a communication bus 602 and at least one communication interface 604. Figure 6 (The above is merely an example, illustrating a communication device 60 including a communication interface 604 and a processor 601.) Optionally, the communication device 60 may also include a memory 603.

[0138] Processor 601 can be a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of the program according to the present application, or a processing core for processing data (e.g., computer program instructions). The processor can be a single-core processor or a multi-core processor. In a specific implementation, as one embodiment, processor 601 may include one or more CPUs, for example... Figure 6 CPU0 and CPU1 in the CPU.

[0139] The communication bus 602 can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. This bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 6 The bus is represented by only one thick line, but this does not mean that there is only one bus or one type of bus. The communication bus 602 is used to connect different components in the communication device 60, so that different components in the communication device 60 can communicate and interact with each other.

[0140] The communication interface 604 can be a transceiver module used to communicate with other devices or communication networks, such as Ethernet, radio access network (RAN), or WLAN. For example, the communication interface 604 can be a transceiver or similar device. Alternatively, the communication interface 604 can also be a transceiver circuit located within the processor 601, used to implement signal input and signal output for the processor.

[0141] The memory 603 can be a device with storage functionality. For example, it can be read-only memory (ROM) or other types of static storage devices capable of storing static information and instructions; random access memory (RAM) or other types of dynamic storage devices capable of storing information and instructions; electrically erasable programmable read-only memory (EEPROM); compact disc read-only memory (CD-ROM) or other optical disc storage; optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.); magnetic disk storage media or other magnetic storage devices; or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but not limited thereto. The memory can exist independently and be connected to the processor via the communication bus 602. The memory can also be integrated with the processor.

[0142] For example, memory 603 is used to store computer execution instructions for implementing the scheme of this application, and the execution is controlled by processor 601. Processor 601 is used to execute the computer execution instructions stored in memory 603, thereby implementing the methods provided in the embodiments of this application. For example, processor 601 performs processing-related functions in the methods provided in the following embodiments of this application, and processor 601 controls communication interface 604 to perform communication with other devices or communication networks, which are not specifically limited in the embodiments of this application.

[0143] Optionally, the computer execution instructions in the embodiments of this application may also be referred to as application code, without specific limitation.

[0144] In a specific implementation, as one embodiment, the communication device 60 may further include an output device 605 and an input device 606. The output device 605 communicates with the processor 601 and can display information in various ways. For example, the output device 605 may be a liquid crystal display (LCD), a light-emitting diode (LED) display device, a cathode ray tube (CRT) display device, or a projector, etc. The input device 606 communicates with the processor 601 and can receive user input in various ways. For example, the input device 606 may be a mouse, keyboard, touchscreen device, or sensing device, etc.

[0145] Figure 6The structural composition shown does not constitute a limitation on the communication device, except... Figure 6 In addition to the components shown, the communication device may include more or fewer components than illustrated, or combine certain components, or have different component arrangements.

[0146] The following will be combined with the appendix Figure 7 The communication method provided in the embodiments of this application will be described in detail below. Figure 7 The diagram shown illustrates an interaction method provided in this application. The communication method is described using the interaction between an access point and a site as an example. For instance, this communication method is applied to... Figure 5 The communication network shown may include at least one access point, and the communication method includes the following steps:

[0147] S701: At least one access point generates multiple beacon frames.

[0148] The beacon frame may carry the BSSID and other radio parameters. Specifically, the information carried in the beacon frame can be found above, and the process of the access point generating the beacon frame can be referenced from existing technologies, which will not be elaborated here.

[0149] At least one access point can be understood as one access point or multiple access points.

[0150] In the case where at least one access point is a single access point, multiple VAPs are configured within that single access point, and these VAPs are associated with different BSSIDs. This single access point can be... Figure 5 In the communication system shown, any access point configured with multiple VAPs can be used, such as access point 1 or access point 2, without restriction. In this case, at least one access point generating multiple beacon frames can be understood as multiple VAPs within that access point generating multiple beacon frames, with different VAPs generating beacon frames having different BSSIDs.

[0151] In the case where at least one access point is multiple access points, the multiple access points can be Figure 5 The communication system shown contains multiple access points associated with the same BSSID. In this case, the generation of multiple beacon frames by at least one access point can be understood as each access point generating a beacon frame, and the BSSID carried in the beacon frames generated by each access point is the same.

[0152] S702: At least one access point transmits multiple beacon frames within the time interval of adjacent TBTTs; correspondingly, a station receives multiple beacon frames from at least one access point within the time interval of adjacent TBTTs.

[0153] In this application, a site can refer to any site within the coverage area of ​​an access point. The site and the access point share the same channel, that is, they operate on the same channel. S702 can be understood as at least one access point sending beacon frames on the channel, and correspondingly, the site receiving beacon frames sent by at least one access point on the channel.

[0154] In this application, the time interval between adjacent TBTTs refers to the time interval between the Kth TBTT and the (K+1)th TBTT. The Kth TBTT refers to the Kth TBTT, and the (K+1)th TBTT refers to the (K+1)th TBTT, where K is a positive integer. In this application, the 1st TBTT refers to the first TBTT, the 2nd TBTT refers to the second TBTT, and so on.

[0155] In one example, when at least one access point is an access point, S702 specifically involves: the access point sending multiple beacon frames within the time interval of adjacent TBTTs, and correspondingly, the station receiving the multiple beacon frames sent by the access point within the time interval of adjacent TBTTs.

[0156] Optionally, the access point can send multiple beacon frames within the time interval between adjacent TBTTs, referring to the beacon frame transmission mechanism described above. For example, within the time interval between the Kth TBTT and the (K+1)th TBTT, the access point sends the first beacon frame after the Kth TBTT arrives; the access point sends the second beacon frame after the time of the Kth TBTT is delayed by one time, and so on, until the access point has sent all the beacon frames.

[0157] To reduce the probability of collisions between beacon frames sent by an access point and data frames sent by nodes (such as stations) during the transmission of multiple beacon frames, the frame interval between adjacent beacon frames transmitted by the access point within the time interval of adjacent TBTTs is less than or equal to DIFS. For example, the frame interval between adjacent beacon frames transmitted by the access point within the time interval of the Kth TBTT and the (K+1)th TBTT is less than or equal to DIFS, that is, less than or equal to the minimum waiting delay required for data frame transmission.

[0158] In another example, when at least one access point is multiple access points, S702 specifically involves: each of the multiple access points sending a beacon frame within the time interval of adjacent TBTTs, and the beacon frames sent by each of the multiple access points within the time interval of adjacent TBTTs forming multiple beacon frames; correspondingly, the station receives at least one beacon frame sent by the multiple access points within the time interval of adjacent TBTTs.

[0159] In this scenario, different access points among the multiple access points send beacon frames at different times. Each access point can send beacon frames according to the beacon frame sending mechanism described above. For example, within the time interval between the Kth TBTT and the (K+1)th TBTT, access point 1 sends the first beacon frame after the Kth TBTT arrives; access point 2 sends the second beacon frame after the Kth TBTT arrives at a time one time later than the Kth TBTT, and so on, until each access point has sent a beacon frame, i.e., the sending of multiple beacon frames ends.

[0160] To reduce the probability of collisions between a beacon frame sent by one of the multiple access points and a data frame sent by a node (such as a site, or other access points besides that access point) during the transmission of multiple beacon frames by multiple access points, if beacon frames sent by two access points within the time interval of adjacent TBTTs are adjacent, then the frame interval of those adjacent beacon frames is less than or equal to DIFS. Furthermore, the TBTTs of each of the multiple access points are the same. Thus, for both the node sending a data frame and the access point sending a beacon frame, if both detect that the channel is idle at the end of the previous beacon frame, the access point sending the beacon frame will wait for a time interval less than or equal to DIFS before occupying the channel to send the next beacon frame. The node sending the data frame will, according to the data frame sending mechanism described above, wait at least until DIFS before starting the random backoff process. Then, after the random backoff process ends and the access point occupies the channel, it will send the data frame. In other words, the access point sending the beacon frame will compete for the channel more quickly and occupy the channel to send the beacon frame. This makes it impossible for the node sending the data frame to start the required random backoff process after waiting for DIFS, or in other words, the random backoff process required for sending the data frame cannot be reversed. This prevents the node sending the data frame from acquiring air interface resources to send data frames during the period of sending multiple beacon frames, thereby reducing the probability of collision between beacon frames and data frames.

[0161] In this application, the duration of each beacon frame occupying the channel may be the same or different.

[0162] In one example, where at least one access point is multiple access points associated with the same BSSID, the multiple beacon frames consist of beacon frames sent by different access points within the time interval of adjacent TBTTs; the BSSIDs in the different beacon frames sent by different access points within the time interval of TBTTs are the same.

[0163] For example, Figure 8 This is a timing diagram illustrating the transmission of a beacon frame. For example... Figure 8 As shown, the communication network includes stations and at least one access point, where at least one access point is... Figure 8 Access points 1, 2, 3, and 4 with the same BSSID are associated with each other. The clocks of access points 1, 2, 3, and 4 are kept synchronized. The TBTT of access points 1, 2, 3, and 4 are the same, that is, the first TBTT and the second TBTT of access points 1, 2, 3, and 4 are the same. Figure 8 In the time interval between the first TBTT and the second TBTT, multiple beacon frames include: beacon frame 1 sent by access point 1 at time t0, beacon frame 2 sent by access point 2 at time t1, beacon frame 3 sent by access point 3 at time t2, and beacon frame 4 sent by access point 4 at time t3. The BSSIDs of beacon frame 1, beacon frame 2, beacon frame 3, and beacon frame 4 are the same.

[0164] In another example, where at least one access point is a single access point, multiple beacon frames consist of multiple beacon frames sent by one access point within the time interval of adjacent TBTTs, with different BSSIDs in the multiple beacon frames. In this case, the access point is configured with multiple VAPs, which generate multiple beacon frames. The beacon frames generated by different VAPs carry different BSSIDs, and the access point sends multiple beacon frames generated by multiple VAPs.

[0165] For example, Figure 9 This is a timing diagram illustrating the transmission of another type of beacon frame. (Example:) Figure 9 As shown, the communication network includes a station and an access point 1. Access point 1 is configured with VAP1, VAP2, VAP3 and VAP4. VAP1 generates beacon frame 1, VAP2 generates beacon frame 2, VAP3 generates beacon frame 3 and VAP4 generates beacon frame 4. Figure 9 In the time interval between the first TBTT and the second TBTT, multiple beacon frames include: beacon frame 1 sent by access point 1 at time t0, beacon frame 2 sent at time t1, beacon frame 3 sent at time t2, and beacon frame 4 sent at time t3. The BSSIDs of beacon frame 1, beacon frame 2, beacon frame 3, and beacon frame 4 are different.

[0166] In this application, the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS, and DIFS is typically 34µs.

[0167] The frame interval between adjacent beacon frames refers to the time interval between the start time of the later beacon frame and the end time of the earlier beacon frame. For example, Figure 8 and Figure 9In this context, the frame interval between beacon frame 1 and beacon frame 2 refers to the time interval between the end time of sending beacon frame 1 and the start time of sending beacon frame 2, and is a first value, which is less than or equal to DIFS.

[0168] Among multiple beacon frames, the frame interval between adjacent beacon frames being less than or equal to DIFS can include any of the following:

[0169] (1) Under the EDCA mechanism, the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS, and the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to the minimum AIFS. The EDCA mechanism divides services into 4 types, and configures different AIFSNs (value range 1-15) for each type of service. The minimum AIFS depends on the smallest configured AIFSN. Normally, all AIFSN values ​​are greater than or equal to 2, that is, the minimum AIFS is greater than or equal to DIFS. In special cases, the AIFSN value is 1, and the minimum AIFS is SIFS + 1 * time slot = PIFS. Usually, PIFS is 25us, and PIFS is less than DIFS. In this case, the frame interval between adjacent beacon frames in multiple beacon frames should be less than or equal to PIFS.

[0170] If the parameters configured under the EDCA mechanism represent the access point without random backoff, for example, if ECWmin / ECWmax under the EDCA mechanism is configured to 0, that is, CW is 0, the frame interval between adjacent beacon frames in multiple beacon frames is less than the minimum AIFS. The minimum AIFS depends on the configured minimum AIFSN. For example, the minimum AIFSN = SIFS + the configured minimum AIFSN * time slot.

[0171] Optionally, under the EDCA mechanism, the frame interval between adjacent beacon frames in multiple beacon frames also needs to be greater than or equal to the minimum frame interval specified by the IEEE 802.11 protocol, such as greater than or equal to SIFS.

[0172] (2) The frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS, and the frame interval between adjacent beacon frames in multiple beacon frames is greater than the length of 1 symbol.

[0173] For example, in a communication network, at least one access point does not conform to the IEEE 802.11 protocol specification. The frame interval between adjacent beacon frames in multiple beacon frames can be less than the minimum frame interval specified by the IEEE 802.11 protocol, i.e., the frame interval between adjacent beacon frames can be less than SIFS. However, the frame interval between adjacent beacon frames in multiple beacon frames needs to be greater than the length of one symbol so that the receiver can distinguish adjacent beacon frames. In this case, the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS, and the frame interval between adjacent beacon frames in multiple beacon frames is greater than the length of one symbol. Optionally, the length of one symbol is 4 µs.

[0174] (3) The frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS, and the frame interval between adjacent beacon frames in multiple beacon frames is greater than or equal to SIFS.

[0175] SIFS is the minimum frame interval specified by the IEEE 802.11 protocol. For communication networks that comply with the IEEE 802.11 protocol, the frame interval between adjacent frames sent by devices in that network must be greater than or equal to SIFS. In this case, the frame interval between adjacent beacon frames in multiple beacon frames is less than or equal to DIFS, and the frame interval between adjacent beacon frames in multiple beacon frames is greater than or equal to SIFS.

[0176] based on Figure 7 The method described involves at least one access point in a communication network sending multiple beacon frames, where the frame interval between adjacent beacon frames is less than or equal to DIFS, while the frame interval required for transmitting data frames is at least DIFS. In this case, the next beacon frame in an adjacent beacon frame will compete for the channel faster than the data frame, preventing the backoff value in the random backoff process required for transmitting the data frame from being decremented by one, or in other words, preventing the backoff value in the random backoff process required for transmitting the data frame from being rolled back. This ensures that the node transmitting the data frame cannot acquire air interface resources during the transmission of multiple beacon frames, thereby reducing the probability of collision between beacon frames and data frames.

[0177] Optionally, within the time interval of adjacent TBTTs, there may be multiple pairs of adjacent beacon frames. The frame interval between any pair of adjacent beacon frames may be less than or equal to DIFS. The frame intervals between different pairs of adjacent beacon frames may be the same or different. For example, Figure 8 or Figure 9Within the time interval between the first TBTT and the second TBTT, beacon frames 1-4 contain three pairs of adjacent beacon frames. The first pair includes beacon frame 1 and beacon frame 2; the second pair includes beacon frame 2 and beacon frame 3; and the third pair includes beacon frame 3 and beacon frame 4. The frame interval between beacon frame 1 and beacon frame 2 in the first pair is less than or equal to a first value of DIFS; the frame interval between beacon frame 2 and beacon frame 3 in the second pair is less than or equal to a second value of DIFS; and the frame interval between beacon frame 3 and beacon frame 4 in the third pair is less than or equal to a third value of DIFS. The first, second, and third values ​​are all the same. Alternatively, two or more of the first, second, and third values ​​may differ; for example, the first and second values ​​may differ, while the first and third values ​​may be the same. Figure 8 and Figure 9 The following is an example of a beacon frame transmission timing diagram. Assuming that the frame interval between different pairs of adjacent beacon frames is the same, based on... Figure 7 The method shown, Figure 8 and Figure 9 In the first TBTT and the second TBTT, the frame interval of different pairs of adjacent beacon frames within the time interval is equal to the first value, which is a value between SIFS and DIFS, between time t0 and t4. Figure 8 and Figure 9 The random backoff process required for a station in the middle to send data frames cannot begin, therefore Figure 8 or Figure 9 During this period, the site was unable to access air interface resources.

[0178] In this example, Figure 8 In this context, time t0 is the moment when access point 1 sends beacon frame 1 after the first TBTT; time t1 is the moment when access point 2 sends beacon frame 2 after a third time delay from the first TBTT; and so on, with time t3 being the moment when access point 4 sends beacon frame 2 after a fifth time delay from the first TBTT. The third time is less than the fourth time, and the fourth time is less than the fifth time.

[0179] In this example, Figure 9 In the diagram, time t0 is the time when access point 1 sends beacon frame 1 after the first TBTT; time t1 is the time when access point 1 sends beacon frame 2, which is the time after time t0 has elapsed for the duration beacon frame 1 occupies the channel, and then after the first value of time elapsed; and so on, time t3 is the time when access point 1 sends beacon frame 4, which is the time after time t2 has elapsed for the duration beacon frame 3 occupies the channel, and then after the first value of time elapsed.

[0180] Optional, Figure 8 and Figure 9The site in the process can begin the random backoff process after time t4, after the AIFS time. Furthermore, when the backoff value changes to 0 during the random backoff process... Figure 8 and Figure 9 The station in the middle sends data frames.

[0181] Optional, Figure 5 The communication system / network shown also includes a wireless controller that manages at least one access point. Figure 7 In the method shown, at least one access point can determine the timing of transmitting each of the multiple beacon frames based on first information from the wireless controller. The specific implementation is as follows:

[0182] In the first possible implementation Figure 7 In the method shown, at least one access point is one of multiple access points associated with the same BSSID. Each access point associated with the same BSSID receives first information from the radio management controller. This first information is used by the access point to determine the time to send a beacon frame. Furthermore, the access point sends the beacon frame when the time for sending the beacon frame arrives. Notably, the first information received by different access points associated with the same BSSID from the radio management controller is different.

[0183] Under this possible implementation, the first information received by one of the multiple access points associated with the same BSSID can carry multiple pieces of information. For example, the first information can carry at least two of the following: the target frame interval of adjacent beacon frames, the beacon frame interval waiting time of the access point, the first delay duration of the access point, the second delay duration of the access point, and the timing index of the beacon frame sent by the access point, so that the access point can flexibly determine the time when the beacon frame occurs.

[0184] In this application, the beacon frame interval waiting time refers to the node's frame interval waiting time when the frame to be sent is a beacon frame.

[0185] The target frame interval between adjacent beacon frames is used to indicate the frame interval between adjacent beacon frames set by the radio management controller. The frame interval between adjacent beacon frames is described in the relevant section of S702 above, and will not be repeated here.

[0186] Among them, the beacon frame interval waiting time of the access point is less than or equal to the target frame interval of the adjacent beacon frame.

[0187] The first delay time of the access point is the difference between the target frame interval of adjacent beacon frames and the beacon frame interval waiting time of the access point.

[0188] Specifically, the access point sends a beacon frame after the TBTT preceding the adjacent TBTT arrives, followed by a second delay of that access point. Optionally, the second delay of the access point is the time interval between the arrival time of the access point's TBTT and the start time of the preparation operation for sending the beacon frame.

[0189] Optionally, the time interval between adjacent TBTTs can be divided into multiple time slots, each of which has the same duration.

[0190] For example, the second delay duration of the access point can be determined by the duration of the time slot and the timing index i of the beacon frame sent by the access point. For instance, the second delay duration of the access point satisfies the following relationship: Second delay duration = (i-1) × duration of the time slot;

[0191] The duration of a time slot = the beacon frame interval waiting time of the access point + the duration of the access point's beacon frame occupying the channel + the first delay duration of the access point; or, the duration of a time slot = the target frame interval between adjacent beacon frames + the duration of the access point's beacon frame occupying the channel.

[0192] The timing index i of the beacon frame sent by the access point is used to indicate that the access point sends the beacon frame in the i-th time slot within the time interval of adjacent TBTTs.

[0193] Optionally, in this application, i ∈ [1,2,…,N], and N is less than or equal to the number of access points included in at least one access point. When N is equal to the number of access points included in at least one access point, different access points among multiple access points transmit a beacon frame in different time slots within the time interval of adjacent TBTTs. When N is less than the number of access points included in at least one access point, different access points among multiple access points may transmit their respective beacon frames in the same time slot within the time interval of adjacent TBTTs. Optionally, when i is 1, the second delay duration is 0. That is, if an access point transmits a beacon frame within the duration of the first time slot within the time interval of adjacent TBTTs, the second delay duration of that access point is 0.

[0194] In this possible implementation, the time interval between adjacent TBTTs is the time interval between the Kth TBTT and the (K+1)th TBTT. In one example, the first information of each access point carries the access point's beacon frame interval waiting time and the second delay duration. The access point sends a beacon frame after the second delay duration of the previous TBTT in the adjacent TBTT; the frame interval waiting time for sending the beacon frame is the access point's beacon frame interval waiting time. The interaction process between the wireless controller and each of the multiple access points in this example is described below. Figure 10 The method shown will not be elaborated further here.

[0195] In another possible implementation, the first information of each access point carries the access point's beacon frame interval waiting time, first delay duration, and timing index of the transmitted beacon frame. The access point transmits the beacon frame after the second delay duration of the Kth TBTT. The second delay duration of the access point is obtained based on the access point's beacon frame interval waiting time, first delay duration, and timing index of the transmitted beacon frame. The interaction flow between the wireless controller and each of the multiple access points in this example is described below. Figure 12 The method shown will not be elaborated further here.

[0196] In another possible implementation, the first information of each access point carries the target frame interval between adjacent beacon frames and the timing index of the access point's transmitted beacon frame. After receiving the beacon frame including the first transmission timing index, the access point transmits the beacon frame after a delay of the target frame interval between adjacent beacon frames. The first transmission timing index is the preceding timing index of the access point's transmitted beacon frame. The interaction process between the wireless controller and each of the multiple access points in this example is described below. Figure 13 The method shown will not be elaborated further here.

[0197] In the second possible implementation, Figure 7 In the method shown, at least one access point is an access point that receives first information from a wireless controller. This first information is used by the access point to determine the timing for transmitting each beacon frame among multiple beacon frames. Furthermore, when the timing for transmitting each beacon frame arrives, the access point transmits the corresponding beacon frame. The BSSIDs of different beacon frames among the multiple beacon frames are different.

[0198] In this possible implementation, the first information may carry the beacon frame interval waiting time of the access point, the first delay duration, and the timing index (or timing index value) for sending different beacon frames. The timing index for sending different beacon frames includes the timing index of each beacon frame among multiple beacon frames, and the timing index of the beacon frame is used to identify the sending timing / order / time sequence of the beacon frame. In this application, the timing indices of multiple beacon frames can be numbered from largest to smallest according to the order in which the multiple beacon frames are sent, or numbered from smallest to largest, without restriction.

[0199] For example, assuming the timing indices of multiple beacon frames are numbered in ascending order according to their transmission sequence, and taking the example of an access point transmitting multiple beacon frames within the time interval between the Kth TBTT and the (K+1)th TBTT, after obtaining the first information, the access point can, based on the beacon frame timing indices, determine the first beacon frame with the smallest timing index after the Kth TBTT arrives and transmit it. After the time interval following the target frame interval after the Kth TBTT arrives, the access point transmits the second beacon frame with the next smallest timing index, and so on, until all beacon frames have been transmitted according to their timing indices. The target frame interval is equal to the sum of the beacon frame interval waiting time and the first delay duration. The target frame intervals are the same for any adjacent beacon frames. The interaction process between the wireless controller and the access point in this example is described below. Figure 14 The method shown will not be elaborated further here.

[0200] by Figure 7 In the method shown, at least one access point is access point 0, access point 1, and access point 2 associated with the same BSSID. Taking multiple beacon frames, including beacon frame 1 sent by access point 0, beacon frame 2 sent by access point 1, and beacon frame 3 sent by access point 2, as an example, any one of access points 0, 1, and 2 determines the time when it sends the beacon frame by using first information sent to that access point via the AC. The method for determining the time of beacon frame transmission differs depending on the different information carried in the first information; see Embodiments 1, 2, and 3 below for specific methods.

[0201] Example 1

[0202] Each of the multiple access points receives first information from the AC. This first information carries the access point's second delay duration and the beacon frame interval waiting time. The method for each access point to send a beacon frame based on this first information is described in [reference needed]. Figure 10 . Figure 10 The method shown includes steps S1001-S1006.

[0203] S1001: Access point 0, access point 1, and access point 2 perform clock synchronization.

[0204] The clock synchronization process for access points 0, 1, and 2 can refer to existing technologies and will not be elaborated further. For example, the clock synchronization process may include: each of access points 0, 1, and 2 acquiring a synchronization signal, adjusting its own clock according to the synchronization signal, and adjusting its own clock to the time indicated by the synchronization signal.

[0205] S1002: The AC sets the timing index for sending beacon frames for each access point within the time interval between adjacent TBTTs.

[0206] Here, AC is the timing index set for any one of access points 0, 1, and 2, and the timing index for sending beacon frames should be less than or equal to the number of access points; that is, the timing index for sending beacon frames for any access point should be less than or equal to 3. Optionally, the timing index i for sending beacon frames can be set starting from 1.

[0207] Optionally, the AC can set the same timing index for transmitting beacon frames for different access points, or it can set different timing indexes for transmitting beacon frames for different access points, without restriction. For example, if the AC needs different access points to transmit beacon frames at the same time, it can set the same timing index for transmitting beacon frames for different access points; conversely, the AC can set different timing indexes for transmitting beacon frames for different access points.

[0208] Taking the example of different timing indices for beacon frames sent by different access points, assuming that the timing index for beacon frames is set starting from 1, the AC sets the timing index for beacon frames sent by access point 0 to 1, the timing index for beacon frames sent by access point 1 to 2, and the timing index for beacon frames sent by access point 2 to 3. In this case, access point 0 sends beacon frame 1 in the first time slot, which is the first time slot within the time interval of the adjacent TBTT. Access point 1 sends beacon frame 2 in the duration of the second time slot, which is the second time slot within the time interval of the adjacent TBTT. Access point 2 sends beacon frame 3 in the third time slot, which is the third time slot within the time interval of the adjacent TBTT.

[0209] It should be understood that the time slot length of a time slot described in this application is the sum of the beacon frame interval waiting time of the access point, the duration of the beacon frame occupying the channel at the access point, and the first delay duration of the access point.

[0210] S1003: AC sets the beacon frame interval waiting time for each access point within the time interval between adjacent TBTTs.

[0211] Taking AC as the first access point and setting the beacon frame interval waiting time as an example, the first access point is access point j. j iterates through each element in [0, 1, 2], and the element encountered is used as j. For example, when j is 0, the first access point is access point 0, and so on. When j is 2, the first access point is access point 2. The timing index corresponding to the first access point is i.

[0212] Step 1: Set the target frame interval for adjacent beacon frames in AC.

[0213] The target frame interval of adjacent beacon frames is the same as the frame interval of the aforementioned adjacent beacon frames, for example, both are less than or equal to DIFS, or both are less than or equal to PIFS.

[0214] Optionally, the target frame interval between adjacent beacon frames can be set by the AC itself, or the AC can set the frame interval between adjacent beacon frames predefined by the protocol as the target frame interval between adjacent beacon frames. For example, if the target frame interval between adjacent beacon frames is set by the AC, the AC selects a value less than or equal to DIFS as the target frame interval between adjacent beacon frames.

[0215] Step 2: The AC selects a value less than or equal to the target frame interval of the adjacent beacon frames as the beacon frame interval waiting time 'a' for the access point corresponding to the i-th time sequence index. i .

[0216] Optionally, for two access points that send beacon frames with different timing indices, or for two access points that send beacon frames in different time slots, the AC can set the same or different beacon frame interval waiting time for these two access points.

[0217] S1004: The AC determines the second delay duration for each access point.

[0218] The description of the second delay duration is as described above and will not be repeated here.

[0219] The second delay duration τ of the access point corresponding to the i-th time sequence index is determined by AC. i For example.

[0220] AC determines the second delay duration τ of the access point corresponding to the i-th time sequence index. i This can include: determining the duration of a time slot within the time interval of adjacent TBTTs, and multiplying the difference between time sequence index i and 1 by the duration of the time slot as the second delay duration τ of the access point corresponding to the i-th time sequence index. i That is, the second delay duration τ of the first access point. i = (i-1) * duration of the time slot.

[0221] The duration of a time slot is the sum of the target frame interval between adjacent beacon frames and the duration of the channel occupied by the beacon frame of the first access point. In this embodiment, the channel occupancy duration of beacon frames transmitted by each access point is the same. Therefore, once the AC determines the channel occupancy duration of a beacon frame transmitted by one access point, it is not necessary to calculate the channel occupancy duration of beacon frames transmitted by other access points. Furthermore, the target frame interval between adjacent beacon frames of each access point is also the same, and consequently, the duration of the time slot corresponding to each access point is also the same.

[0222] Optionally, the AC can obtain the duration of channel occupancy by a beacon frame sent by an access point through packet capture. Alternatively, the AC can receive the duration of channel occupancy reported by the access point.

[0223] AC designates the first access point as access point j. j iterates through each element in the range [0, 1, 2], using the encountered element as j. Based on step S1004, the second delay duration τ of access point j is obtained. i For example, when j is 0 and i is 1, the second delay duration of access point 0 is τ1; when j is 1 and i is 2, the second delay duration of access point 1 is τ2; and when j is 2 and i is 3, the second delay duration of access point 2 is τ3.

[0224] Optionally, in S1002, the AC configures the timing index i of the beacon frame sent by access point j to be 1, which means that the beacon frame sent by access point j is the first beacon frame sent / transmitted within the time interval of adjacent TBTTs. In other words, access point j sends the beacon frame in the first time slot within the time interval of adjacent TBTTs, so the second delay duration τ1 of access point j is 0.

[0225] S1005: The AC sends its own first information to each access point, and each access point receives the first information from the AC.

[0226] The first information for different access points includes the same information type: the second delay duration and the beacon frame interval waiting time. Access points with the same time-series index have the same first information content, but access points with different time-series indices have different first information content. For example, the first information for access point 0 with time-series index 1 includes the beacon frame interval waiting time a1 obtained after step S1003, and the second delay duration τ1 obtained after step S1004; the first information for access point 1 with time-series index 2 includes the beacon frame interval waiting time a2 obtained after step S1003, and the second delay duration τ2 obtained after step S1004; the first information for access point 2 with time-series index 3 includes the beacon frame interval waiting time a3 obtained after step S1003, and the second delay duration τ3 obtained after step S1004.

[0227] S1006: Access point 0, access point 1 and access point 2 respectively send their generated beacon frames according to the first information they receive.

[0228] The first information carries the time sequence index i of the transmitted beacon frame based on this access point, obtained as a. i and τ iAn access point sending a generated beacon frame based on the received first information may include: the access point configuring the beacon frame interval waiting time to be the beacon frame interval waiting time a. i During the Kth TBTT, τ i After that, then a i At that moment, the generated beacon frame is sent.

[0229] For example, after receiving the first information carrying τ1 and a1, Access Point 0 (AP0) sets τ1 to 0 and configures its own beacon frame interval waiting time to beacon frame interval waiting time a1. Further, at the time after τ1 in the Kth TBTT, that is, at the time of the Kth TBTT, AP0 detects whether the channel is busy or idle. When the channel is idle, AP0 detects that the channel is idle again at time t1 after the beacon frame interval waiting time a1. If the channel is still idle at time t1, AP0 sends the generated beacon frame 1 at time t1.

[0230] Similarly, after receiving the first information carrying τ2 and a2, Access Point 1 (AP1) configures its own beacon frame interval waiting time to beacon frame interval waiting time a2. Further, after the Kth TBTT passes τ2, AP1 detects whether the channel is busy or idle. If the channel is idle, AP1 detects that the channel is idle again at time t2 after the beacon frame interval waiting time a2. If the channel is still idle at time t2, AP1 sends the generated beacon frame 2 at time t2.

[0231] Similarly, after receiving the first information carrying τ3 and a3, Access Point 2 (AP2) configures its own beacon frame interval waiting time to beacon frame interval waiting time a3. Further, after the Kth TBTT passes τ3, AP2 detects whether the channel is busy or idle. If the channel is idle, AP2 detects that the channel is idle again at time t3 after the beacon frame interval waiting time a3. If the channel is still idle at time t3, AP2 sends the generated beacon frame 3 at time t3.

[0232] The BSSID carried in beacon frame 1, beacon frame 2, and beacon frame 3 is the same. Each access point generates beacon frames according to existing technology, which will not be described in detail here.

[0233] In summary, the timing of beacon frame transmissions by access points 0, 1, and 2 within the time interval between adjacent TBTTs is as follows: Figure 11 .like Figure 11 As shown, access point 0 sends beacon frame 1 at time t1, access point 1 sends beacon frame 2 at time t2, and access point 2 sends beacon frame 3 at time t3. Figure 11The frame interval between beacon frame 1 and beacon frame 2 is the target frame interval between adjacent beacon frames, and the frame interval between beacon frame 2 and beacon frame 3 is also the target frame interval between adjacent beacon frames.

[0234] Example 2

[0235] Any one of the multiple access points receives first information from the AC. This first information carries the access point's beacon frame interval waiting time, the access point's first delay duration, and the timing index of the access point's beacon frame transmission. The method for this access point to transmit beacon frames based on this first information is described in [reference needed]. Figure 12 . Figure 12 The method shown includes steps S1201-S1204.

[0236] S1201: Access point 0, access point 1, and access point 2 perform clock synchronization.

[0237] S1202: The AC sets the beacon frame interval waiting time, the first delay duration, and the timing index for sending beacon frames for each access point within the time interval between adjacent TBTTs.

[0238] Specifically, the AC sets the beacon frame interval waiting time, the first delay duration, and the timing index for sending beacon frames for each access point from access point 0 to access point 2. Taking the AC setting the beacon frame interval waiting time, the first delay duration, and the timing index for sending beacon frames for the first access point as an example, the first access point is described above and will not be repeated here.

[0239] Step 1: AC sets the target frame interval between adjacent beacon frames. See the relevant description of Step 1 in S1003 for Step 1, which will not be repeated here.

[0240] Step 2: The AC sets the timing index of the beacon frame for each access point within the time interval of adjacent TBTTs. See the relevant description in S1002 for Step 2, which will not be repeated here.

[0241] Step 3: The AC selects a value less than or equal to the target frame interval of the adjacent beacon frames as the beacon frame interval waiting time 'a' for the access point corresponding to the i-th time sequence index. i Step 3 is described in the relevant description of step 2 in S1003, and will not be repeated here.

[0242] Step 4: The AC waits for the target frame interval of adjacent beacon frames and the beacon frame interval of the access point corresponding to the i-th time sequence index, based on the time interval a. i Determine the first delay duration y of the access point corresponding to the i-th time sequence index. i .

[0243] The first delay duration y of the access point corresponding to the i-th time sequence indexi It is the target frame interval between adjacent beacon frames minus a. i The difference, i.e., y i = Target frame interval between adjacent beacon frames - a i Optionally, the first delay duration for different time-series access points can be the same or different, without restriction. The beacon frame interval waiting time 'a' at different time-series access points... i Under the same conditions, the first delay duration y of different time-series index access points i Same; beacon frame interval waiting time a at different time-series index access points i Under different circumstances, the first delay duration y of different time-series index access points i different.

[0244] AC designates the first access point as access point j. j iterates through each element in [0, 1, 2], using the encountered element as j. Based on step S1202, the timing index i of the beacon frame sent by access point j and the beacon frame interval waiting time a are obtained. i First delay duration y i For example, when j is 0 and i is 1, the timing index of the beacon frame sent by access point 0 is 1, the beacon frame interval waiting time is a1, and the first delay duration is y1; when j is 1 and i is 2, the timing index of the beacon frame sent by access point 1 is 2, the beacon frame interval waiting time is a2, and the first delay duration is y2; when j is 2 and i is 3, the timing index of the beacon frame sent by access point 2 is 3, the beacon frame interval waiting time is a3, and the first delay duration is y3.

[0245] S1203: The AC sends its own first information to each access point, and each access point receives the first information from the AC.

[0246] The first information for different access points includes the same information type: the beacon frame interval waiting time, the first delay duration, and the timing index of the transmitted beacon frame. Access points with the same timing index have the same information content in their first information, but access points with different timing indices have different information content in their first information.

[0247] For example, the first information of access point 0 includes the timing index i of the beacon frame to be sent, i is 1, the beacon frame interval waiting time a1, and the first delay duration y1 obtained after step S1202; the first information of access point 1 includes the timing index i of the beacon frame to be sent, i is 2, the beacon frame interval waiting time a2, and the first delay duration y2 obtained after step S1202; the first information of access point 2 includes the timing index i of the beacon frame to be sent, i is 3, the beacon frame interval waiting time a3, and the first delay duration y3 obtained after step S1202.

[0248] S1204: Access point 0, access point 1 and access point 2 respectively send their generated beacon frames according to the first information they receive.

[0249] The first information carries the timing index i of the beacon frame sent by the access point, and a i and τ i An access point sending a generated beacon frame based on received first information may include: the access point sending a generated beacon frame based on the first information (a) i and y i First, determine the duration of the time slot; then, based on the timing index i of the transmitted beacon frame in the first information and the duration of the time slot, calculate the second delay τ of the access point. i Based on the foregoing, τ is obtained. i and a i Send the generated beacon frame.

[0250] Taking access point 0 as an example, based on the received first information, which carries the timing index i (i=1), a1, and y1 of the beacon frame to be sent, the generated beacon frame is sent:

[0251] Step 1: Access point 0 determines the duration of the time slot based on a1 and y1 in the first information.

[0252] In this embodiment, access point 0 uses the sum of a1, the duration of the channel occupied by the generated beacon frame, and y1 as the duration of the time slot. The duration of the channel occupied by the beacon frame sent by each access point is the same.

[0253] Step 2: Access point 0 calculates the second delay duration τ1 based on the timing index i (i=1) of the transmitted beacon frame in the first information and the duration of the time slot.

[0254] In this case, the second delay duration τ1 of access point 0 is the product of the difference between i and 1 and the duration of the time slot. That is, the second delay duration τ1 of access point 0 is (i-1) * the duration of the time slot, and the second delay duration τ1 of access point 0 is 0.

[0255] Step 3: Based on the aforementioned τ1 and a1, access point 0 sends the generated beacon frame.

[0256] Access point 0 configures its own beacon frame interval waiting time as beacon frame interval waiting time a1. Further, at the time after τ1 in the Kth TBTT, τ1 is 0. That is, in the Kth TBTT, AP0 detects whether the channel is busy or idle. When the channel is idle, AP0 detects that the channel is idle again at time t1 after the beacon frame interval waiting time a1. If the channel is still idle at time t1, AP0 sends the generated beacon frame at time t1.

[0257] Similarly, the process of access point 1 sending the generated beacon frame based on the received first information, which carries the timing index i (i=2) of the beacon frame sent by access point 1, the beacon frame interval waiting time a2 obtained based on i, and the first delay duration y2, can be referred to the process of access point 0 sending the generated beacon frame described above, and will not be repeated here.

[0258] The process of sending the generated beacon frame by access point 2 based on the received first information, which carries the timing index i (i=3) of the beacon frame sent by access point 2, the beacon frame interval waiting time a3 obtained based on i, and the first delay duration y3, can be referred to the process of sending the generated beacon frame by access point 0 described above, and will not be repeated here.

[0259] Example 3

[0260] Any one of the multiple access points receives first information from the AC. This first information carries the target frame interval between adjacent beacon frames and the timing index of the beacon frames transmitted by that access point. The method for that access point to transmit beacon frames based on this first information is described in [reference needed]. Figure 13 . Figure 13 The method shown includes steps S1301-S1305.

[0261] S1301: AC sets the target frame interval between adjacent beacon frames.

[0262] S1301 refers to the relevant description of step 1 in S1003, and will not be repeated here.

[0263] S1302: The AC sets the timing index for sending beacon frames for each access point within the time interval between adjacent TBTTs.

[0264] S1302 is similar to the description in S1002, and will not be repeated here.

[0265] S1303: The AC sends its own first information to each access point, and each access point receives the first information from the AC.

[0266] The first information for different access points includes the same information type: the target frame interval between adjacent beacon frames and the beacon frame interval waiting time of the access point. Access points with the same time-series index have the same first information content, but access points with different time-series indices have different first information content.

[0267] For example, the first information of access point 0 includes the target frame interval of adjacent beacon frames and the timing index i of the transmitted beacon frame, i is 1, obtained after steps S1301 and S1302; the first information of access point 1 includes the target frame interval of adjacent beacon frames and the timing index i of the transmitted beacon frame, i is 2, obtained after steps S1301 and S1302; the first information of access point 2 includes the target frame interval of adjacent beacon frames and the timing index i of the transmitted beacon frame, i is 3, obtained after steps S1301 and S1302.

[0268] S1304: Access point 0, access point 1 and access point 2 determine whether they are the first access point to send a beacon frame based on the first information they receive. If they determine that they are the first access point to send a beacon frame, they send the generated beacon frame after the Kth TBTT arrives.

[0269] Each beacon frame generated by an access point carries the timing index of the beacon frames sent by that access point.

[0270] Specifically, the process of executing S1304 at different access points is as follows:

[0271] Access point 0 compares the timing index i of the transmitted beacon frame in the received first information with the reference timing index. Since timing index i is 1 and the reference timing index is also 1, access point 0 determines that it is the first access point to transmit a beacon frame. Further, after the Kth TBTT arrives, access point 0 transmits a generated beacon frame, such as beacon frame 1. Generated beacon frame 1 carries the timing index i of access point 0's transmitted beacon frame, where i is 1.

[0272] Access point 1 compares the timing index i of the transmitted beacon frame in the received first information with the reference timing index. Since timing index i is 2 and the reference timing index is 1, access point 1 determines that the timing index is different from the reference timing index, and therefore determines that it is not the first access point to transmit a beacon frame. Further, after access point 0 finishes transmitting the beacon frame, access point 1 transmits the generated beacon frame, such as beacon frame 2.

[0273] Access point 2 compares the timing index i of the transmitted beacon frame in the received first information with the reference timing index. Since timing index i is 3 and the reference timing index is 1, access point 2 determines that the timing index i is different from the reference timing index, and therefore determines that it is not the first access point to transmit a beacon frame. Further, after access point 0 finishes transmitting the beacon frame, access point 2 transmits the generated beacon frame, such as beacon frame 3.

[0274] S1305: Access point 1 and access point 2 determine whether they are the second access point to send a beacon frame based on the received beacon frame 1 and the first information. If they determine that they are the second access point to send a beacon frame, they send the generated beacon frame at the time when they receive beacon frame 1 and at the time after the target frame interval of the adjacent beacon frame carried in the first information.

[0275] Specifically, the process of executing S1305 at different access points is as follows:

[0276] Access point 1 compares the timing index i of the transmitted beacon frame in the received beacon frame 1 with the preceding timing index i of the transmitted beacon frame in the first information. Since the timing index i of the transmitted beacon frame in beacon frame 1 is 1, and the timing index i of the transmitted beacon frame in the first information is 2, access point 1 determines that the timing index of the transmitted beacon frame in beacon frame 1 is the preceding index of the transmitted beacon frame in the first information. Therefore, access point 1 determines that it is the access point for the second transmitted beacon frame. Further, at the time of receiving beacon frame 1, after the target frame interval of the adjacent beacon frame carried in the first information (e.g., at time t2), access point 1 transmits the generated beacon frame 2. The generated beacon frame 2 carries the timing index i of the transmitted beacon frame of access point 1, where i is 2.

[0277] Access point 2 compares the timing index i of the transmitted beacon frame in the received beacon frame 1 with the preceding timing index i of the transmitted beacon frame in the first information. Since the timing index i of the transmitted beacon frame in beacon frame 1 is 1, and the timing index i of the transmitted beacon frame in the first information is 3, access point 2 determines that the timing index i of the transmitted beacon frame in beacon frame 1 is not the preceding index i of the transmitted beacon frame in the first information. Therefore, access point 2 determines that it is not the access point that will transmit the second beacon frame. Furthermore, at the time of receiving beacon frame 1, and after the target frame interval of the adjacent beacon frames carried in the first information (e.g., at time t2), access point 2 does not transmit the generated beacon frame 3.

[0278] It should be understood that if one of the multiple access points has already sent a beacon frame within the time interval between adjacent TBTTs, then no more beacon frames will be sent within the time interval between adjacent TBTTs.

[0279] S1306: Access point 2 sends the generated beacon frame based on the received beacon frame 2.

[0280] Access point 2, based on the received beacon frame 2, sends a generated beacon frame including: at the time access point 2 receives beacon frame 2, and at a time after the target frame interval of the adjacent beacon frame carried in the first information, such as time t3, it sends the generated beacon frame 3. The generated beacon frame 3 carries the timing index i of the beacon frame sent by access point 2, where i is 3. Optionally, in this application, the timing index of the sent beacon frame can be carried in the vendor-specific field in the beacon frame.

[0281] by Figure 7 In the method shown, at least one access point is considered, such as access point 1. Taking multiple beacon frames, including beacon frame 1, beacon frame 2, and beacon frame 3 transmitted by access point 1 within the time interval of adjacent TBTTs, as an example, the BSSIDs carried in beacon frame 1, beacon frame 2, and beacon frame 3 are different. Access point 1 determines the timing of transmitting each beacon frame by sending first information to access point 1 via the AC. See Example 4 below for a detailed explanation.

[0282] Example 4

[0283] Access point 1 receives first information from the AC. This first information carries the beacon frame interval waiting time of access point 1, the first delay duration of access point 1, and the timing index for sending different beacon frames. The timing index for sending different beacon frames includes the timing index of each beacon frame among multiple beacon frames, and the timing indices of different beacon frames among multiple beacon frames are different. The method by which access point 1 sends beacon frame 1, beacon frame 2, and beacon frame 3 according to the first information is described below. Figure 14 . Figure 14 The method shown includes steps S1401-S1406.

[0284] S1401: AC sends the first information to access point 1, and access point 1 receives the first information from AC.

[0285] The first information is used by access point 1 to send beacon frame 1, beacon frame 2, and beacon frame 3. The first information carries the beacon frame interval waiting time of access point 1, the first delay duration of access point 1, and the timing index of access point 1 for sending different beacon frames.

[0286] S1402: Access point 1 determines the target frame interval between adjacent beacon frames based on the first information.

[0287] Access point 1 uses the sum of its beacon frame interval waiting time and its first delay duration as the target frame interval for adjacent beacon frames. The sum of access point 1's beacon frame interval waiting time and its first delay duration should be less than or equal to DIFS, meaning the target frame interval for adjacent beacon frames is less than or equal to DIFS. Alternatively, the sum of access point 1's beacon frame interval waiting time and its first delay duration should be less than or equal to PIFS, meaning the target frame interval for adjacent beacon frames is less than or equal to PIFS.

[0288] S1403: Access point 1 sets the timing index for sending beacon frame 1, beacon frame 2, and beacon frame 3 within adjacent TBTT time intervals based on the first information.

[0289] In this application, access point 1 sets the timing of sending beacon frame 1, beacon frame 2, and beacon frame 3 within adjacent TBTT time intervals based on the first information, including: access point 1 sets the timing index of beacon frame 1 in the timing index of sending different beacon frames as the timing index of beacon frame 1; sets the timing index of beacon frame 2 in the timing index of sending different beacon frames as the timing index of beacon frame 2; and sets the timing index of beacon frame 3 in the timing index of sending different beacon frames as the timing index of beacon frame 3.

[0290] The timing index of the beacon frame is used to indicate the timing of the beacon frame transmission within the time interval of adjacent TBTTs.

[0291] In this embodiment, beacon frame 1 has a timing index of 1, beacon frame 2 has a timing index of 2, and beacon frame 3 has a timing index of 3. In this case, beacon frame 1 is the first beacon frame sent by access point 1 within the time interval between adjacent TBTTs, beacon frame 2 is the second beacon frame sent by access point 1 within the time interval between adjacent TBTTs, and beacon frame 3 is the third beacon frame sent by access point 1 within the time interval between adjacent TBTTs.

[0292] S1404: When the Kth TBTT arrives, access point 1 sends beacon frame 1.

[0293] Specifically, when the Kth TBTT arrives, access point 1 checks if the channel is busy or idle. If the channel is idle, access point 1 detects that the channel is idle again at time t1 after the frame interval waiting time in the first information. If the channel is still idle at time t1, access point 1 sends beacon frame 1 at time t1.

[0294] S1405: After sending beacon frame 1, at the time interval between the target frames of the adjacent beacon frames, access point 1 sends beacon frame 2.

[0295] S1406: After sending beacon frame 2, at the time interval between the target frames of the adjacent beacon frames, access point 1 sends beacon frame 3.

[0296] The various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or in conflict of logic, the terminology and / or descriptions between the different embodiments provided in this application are consistent and can be referenced mutually. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0297] It is understood that in the embodiments of this application, the executing entity may perform some or all of the steps in the embodiments of this application. These steps or operations are merely examples, and the embodiments of this application may also perform other operations or variations thereof. Furthermore, the various steps may be executed in different orders as presented in the embodiments of this application, and it is not necessarily necessary to execute all the operations in the embodiments of this application.

[0298] The foregoing primarily describes the solutions provided in this application from the perspective of device-to-device interaction. It is understood that each device, in order to achieve the aforementioned functions, includes corresponding hardware structures and / or software modules for executing each function. Those skilled in the art will readily recognize that, in conjunction with the algorithm steps of the examples described in the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0299] This application embodiment can divide each device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. The module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[0300] When dividing each function into modules according to its corresponding function. Figure 15 An access point 150 (AP150) is shown. The AP150 can perform the actions performed by the AP in the method shown in the above embodiments. All relevant content of each step involved in the above method embodiments can be referred to the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0301] The AP 150 may include a processing module 1501 and a transceiver module 1502. Exemplarily, the AP 150 may be a communication device, or a chip or other combination device or component with the aforementioned AP functions applied in a communication device. When the AP 150 is a communication device, the transceiver module 1502 may be a transceiver, which may include an antenna and radio frequency circuitry; the processing module 1501 may be a processor (or processing circuitry), such as a baseband processor, which may include one or more CPUs. When the AP 150 is a component with the aforementioned AP functions, the transceiver module 1502 may be a radio frequency unit; the processing module 1501 may be a processor (or processing circuitry), such as a baseband processor. When the AP 150 is a chip system, the transceiver module 1502 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1501 may be a processor (or processing circuitry) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 1502 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 1501 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0302] For example, the transceiver module 1502 can be used to perform all the transceiver operations performed by the AP in the embodiments shown in the examples, and / or to support other processes of the technology described herein; the processing module 1501 can be used to perform all the operations performed by the AP in the embodiments shown in the examples other than the transceiver operations, and / or to support other processes of the technology described herein.

[0303] As another feasible approach Figure 15 The transceiver module 1502 can be replaced by a transceiver unit, which can integrate the functions of the transceiver module 1502; the processing module 1501 can be replaced by a processor, which can integrate the functions of the processing module 1501. Furthermore, Figure 15 The AP 150 shown may also include a memory.

[0304] Alternatively, when the processing module 1501 is replaced by a processor and the transceiver module 1502 is replaced by a transceiver, the AP 150 involved in the embodiments of this application can also be... Figure 16 The communication device 160 shown.

[0305] The processor can be logic circuit 1601, and the transceiver can be interface circuit 1602. Furthermore, Figure 16 The communication device 160 shown may also include a memory 1603.

[0306] This application also provides a communication system, which includes at least one access point for generating beacon frames; the at least one access point is also used to transmit multiple beacon frames within the time interval of adjacent TBTTs; wherein the frame interval between adjacent beacon frames in the multiple beacon frames is less than or equal to DIFS; and the TBTTs of each access point in the at least one access point are the same. The function or operation method of each access point in this communication system can be found in the foregoing. Figures 5 to 16 A detailed description of it is omitted here.

[0307] This application also provides a computer program product that, when executed by a computer, can implement the function of the access point in any of the above method embodiments.

[0308] This application also provides a computer program that, when executed by a computer, can implement the functions of the access point in any of the above method embodiments.

[0309] This application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be implemented by a computer program instructing related hardware. This program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the foregoing embodiments, such as the terminal's hard disk or memory. The computer-readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the terminal. Further, the computer-readable storage medium can include both the terminal's internal storage unit and external storage devices. The computer-readable storage medium is used to store the computer program and other programs and data required by the terminal. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0310] The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. "First" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first" and "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "a plurality of" means two or more.

[0311] Furthermore, the terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0312] In this application, "at least one (item)" means one or more. "More than one" means two or more. "At least two (items)" means two or three or more. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple. "...when" and "if" both mean that a corresponding action will be taken under certain objective circumstances, not a time limit, nor do they require a judgment action at the time of implementation, nor do they imply any other limitations.

[0313] In the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner to facilitate understanding.

[0314] In this application, "sending information to...(terminal device)" can be understood as the destination of the information being the terminal device. This can include sending information directly or indirectly to the terminal device. "Receiving information from...(terminal device)" can be understood as the source of the information being the terminal device, and can include receiving information directly or indirectly from the terminal device. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source.

[0315] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0316] In the several embodiments provided in this application, the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual couplings, direct couplings, or communication connections may be through some interfaces; indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms.

[0317] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0318] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0319] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of this application embodiment, or all or part of the technical solution, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

Claims

1. A communication system, characterized in that, The communication system includes at least one access point. The at least one access point is used to generate multiple beacon frames; The at least one access point is also configured to transmit the plurality of beacon frames within a time interval of the Predetermined Transmission Time (TBTT) between adjacent beacons; wherein the frame interval between adjacent beacon frames in the plurality of beacon frames is less than or equal to the Distributed Coordination Function Inter-Frame Interval (DIFS); and the TBTT of each of the at least one access point is the same.

2. The communication system according to claim 1, characterized in that, The frame interval between adjacent beacon frames in the plurality of beacon frames is less than or equal to the DIFS, including: Under the Enhanced Distributed Channel Access (EDCA) mechanism, the frame interval between adjacent beacon frames in the plurality of beacon frames is less than or equal to the DIFS, and the frame interval between adjacent beacon frames in the plurality of beacon frames is less than or equal to the Minimum Arbitration Inter-Frame Interval (AIFS).

3. The communication system according to claim 1 or 2, characterized in that, The frame interval between adjacent beacon frames in the plurality of beacon frames is less than or equal to the DIFS, including: The frame interval between adjacent beacon frames in the plurality of beacon frames is less than or equal to the DIFS, and the frame interval between adjacent beacon frames in the plurality of beacon frames is greater than the length of one symbol.

4. The communication system according to any one of claims 1-3, characterized in that, The frame interval between adjacent beacon frames in the plurality of beacon frames is less than or equal to the DIFS, including: The frame interval between adjacent beacon frames in the plurality of beacon frames is less than or equal to the DIFS, and the frame interval between adjacent beacon frames in the plurality of beacon frames is greater than or equal to the short inter-frame interval SIFS.

5. The communication system according to any one of claims 1-4, characterized in that, In the case where at least one access point is multiple access points associated with the same Basic Service Set Identifier (BSSID), the multiple beacon frames consist of beacon frames transmitted by different access points within the time interval of the adjacent TBTTs, and the multiple beacon frames contain the same BSSID; or, In the case where at least one access point is a single access point, the plurality of beacon frames consist of a plurality of beacon frames sent by the single access point within the time interval of the adjacent TBTT, wherein the BSSIDs of the plurality of beacon frames are different.

6. The communication system according to any one of claims 1-5, characterized in that, The communication system further includes a wireless controller for managing the at least one access point, which is a plurality of access points associated with the same BSSID. Each of the at least one access point is further configured to receive first information from the wireless controller, the first information being used by each access point to determine the time to send a beacon frame.

7. The communication system according to claim 6, characterized in that, The first information of any access point carries at least two items, namely, the beacon frame interval waiting time of the access point, the second delay duration of the access point, the first delay duration of the access point, the target frame interval of adjacent beacon frames, and the timing index of the transmitted beacon frames of the access point, wherein the target frame interval of adjacent beacon frames is equal to the frame interval of adjacent beacon frames.

8. The communication system according to claim 7, characterized in that, When the first information of each access point carries the beacon frame interval waiting time of the access point and the second delay duration of the access point, the access point is used to send a beacon frame after the second delay duration of the access point in the previous TBTT in the adjacent TBTT; Wherein, the frame interval waiting time for sending beacon frames is the beacon frame interval waiting time of the access point; the beacon frame interval waiting time of the access point is less than or equal to the frame interval of the adjacent beacon frames.

9. The communication system according to claim 7, characterized in that, When the first information of each access point carries the beacon frame interval waiting time, the first delay duration of the access point, and the timing index of the beacon frame transmission of the access point, the access point is used to transmit the beacon frame after the second delay duration of the access point in the previous TBTT in the adjacent TBTT; the second delay duration of the access point is obtained by the beacon frame interval waiting time, the first delay duration of the access point, and the timing index of the beacon frame transmission of the access point.

10. The communication system according to claim 9, characterized in that, The second delay duration is the product of the difference between the timing index of the beacon frame sent by the access point and 1, and the duration of the time slot; the duration of the time slot is the sum of the beacon frame interval waiting time of the access point, the duration of the beacon frame occupying the channel by the access point, and the first delay duration of the access point. Wherein, the timing index of the beacon frame transmitted by the access point indicates the time slot in which the beacon frame is transmitted by the access point, and the timing index of the beacon frame transmitted by the access point is less than or equal to the number of access points included in the at least one access point.

11. The communication system according to claim 7, characterized in that, When the first information of each access point carries the target frame interval of the adjacent beacon frames and the timing index of the beacon frames sent by the access point, the access point is used to send the beacon frame after receiving the beacon frame including the first sending timing index, by delaying the time of the target frame interval of the adjacent beacon frames. Wherein, the first transmission timing index is the timing index preceding the timing index of the transmission beacon frame of the access point.

12. The communication system according to any one of claims 1-5, characterized in that, The communication network further includes a wireless controller for managing the at least one access point, wherein the at least one access point is a single access point. The access point is also configured to receive first information from the wireless controller; the first information is used by the access point to determine the time for transmitting each of the plurality of beacon frames; the BSSIDs of different beacon frames are different.

13. The communication system according to claim 12, characterized in that, The first information includes the beacon frame interval waiting time of the access point, the first delay duration, and the timing index of sending different beacon frames; Wherein, the timing index for sending different beacon frames includes the timing index of each beacon frame among the plurality of beacon frames; The target frame interval between adjacent beacon frames in the plurality of beacon frames is equal to the sum of the beacon frame interval waiting time of the access point and the first delay duration of the access point.

14. A communication method, characterized in that, The method is applied to an access point, and the method includes: The access point generates a beacon frame; The access point transmits the beacon frame within the time interval of the Predetermined Transmission Time (TBTT) of adjacent beacons; wherein, within the time interval of adjacent TBTT, the frame interval of adjacent beacon frames is less than or equal to the Distributed Coordination Function Inter-Frame Interval (DIFS), and the TBTTs of the access points transmitting beacon frames within the time interval of adjacent TBTT are the same.

15. The method according to claim 14, characterized in that, The frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, including: Under the Enhanced Distributed Channel Access (EDCA) mechanism, the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, and the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to the Minimum Arbitration Inter-Frame Interval (AIFS).

16. The method according to claim 14 or 15, characterized in that, The frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, including: The frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, and the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is greater than the length of 1 symbol.

17. The method according to any one of claims 14-16, characterized in that, The frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, including: The frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is less than or equal to DIFS, and the frame interval between adjacent beacon frames within the time interval of adjacent TBTTs is greater than or equal to short inter-frame interval SIFS.

18. The method according to any one of claims 14-17, characterized in that, The method further includes: The access point receives first information, which is used to determine the time to send the beacon frame.

19. The method according to claim 18, characterized in that, The first information carries at least two of the following: the beacon frame interval waiting time of the access point, the second delay duration of the access point, the first delay duration of the access point, the target frame interval of adjacent beacon frames, and the timing index of the transmitted beacon frames of the access point, wherein the target frame interval of adjacent beacon frames is equal to the frame interval of adjacent beacon frames.

20. The method according to claim 19, characterized in that, If the first information of the access point carries the beacon frame interval waiting time of the access point and the second delay duration of the access point, the access point sends the beacon frame after the second delay duration of the access point in the previous TBTT in the adjacent TBTT; Wherein, the frame interval waiting time for sending beacon frames is the beacon frame interval waiting time of the access point; the beacon frame interval waiting time of the access point is less than or equal to the frame interval of the adjacent beacon frames.

21. The method according to claim 19, characterized in that, When the first information of the access point carries the beacon frame interval waiting time, the first delay duration of the access point, and the timing index of the beacon frame sent by the access point, the access point sends the beacon frame after the second delay duration of the access point in the previous TBTT in the adjacent TBTT; the second delay duration of the access point is obtained by the beacon frame interval waiting time, the first delay duration of the access point, and the timing index of the beacon frame sent by the access point.

22. The method according to claim 21, characterized in that, The second delay duration is the product of the difference between the timing index of the beacon frame sent by the access point and 1, and the duration of the time slot; the duration of the time slot is the sum of the beacon frame interval waiting time of the access point, the duration of the beacon frame occupying the channel by the access point, and the first delay duration of the access point. The timing index of the beacon frame transmitted by the access point indicates the time slot in which the beacon frame is transmitted by the access point, and the timing index of the beacon frame transmitted by the access point is less than or equal to the number of access points that transmit beacon frames within the time interval of the adjacent TBTT.

23. The method according to claim 19, characterized in that, If the first information of the access point carries the target frame interval of the adjacent beacon frames and the timing index of the beacon frames sent by the access point, the access point, after receiving the beacon frame including the first sending timing index, will send the beacon frame after delaying the time of the target frame interval of the adjacent beacon frames. Wherein, the first transmission timing index is the timing index preceding the timing index of the transmission beacon frame of the access point.

24. The method according to claim 19, characterized in that, The first information includes the beacon frame interval waiting time of the access point, the first delay duration, and the timing index of sending different beacon frames; The timing index for sending different beacon frames includes the timing index of each beacon frame in the beacon frames; the target frame interval between adjacent beacon frames is equal to the sum of the beacon frame interval waiting time of the access point and the first delay duration of the access point.

25. A communication device, characterized in that, The communication device includes a processor for running a computer program or instructions that cause the communication method as described in any one of claims 14-24 to be executed.

26. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed on a computer, cause the communication method as described in any one of claims 14-24 to be performed.

27. A computer program product, characterized in that, The computer program product includes computer instructions that, when some or all of the computer instructions are executed, cause the communication method as described in any one of claims 14-24 to be performed.

Images