CN114844607B - Beacon frame transmitting method, device, storage medium and AP - Google Patents

Beacon frame transmitting method, device, storage medium and AP Download PDF

Info

Publication number
CN114844607B
CN114844607B CN202210155097.8A CN202210155097A CN114844607B CN 114844607 B CN114844607 B CN 114844607B CN 202210155097 A CN202210155097 A CN 202210155097A CN 114844607 B CN114844607 B CN 114844607B
Authority
CN
China
Prior art keywords
beacon frame
bitmap
length
equal
coding block
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210155097.8A
Other languages
Chinese (zh)
Other versions
CN114844607A (en
Inventor
凌德坤
张静
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhuhai Huge Ic Co ltd
Original Assignee
Zhuhai Huge Ic Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhuhai Huge Ic Co ltd filed Critical Zhuhai Huge Ic Co ltd
Priority to CN202210155097.8A priority Critical patent/CN114844607B/en
Publication of CN114844607A publication Critical patent/CN114844607A/en
Application granted granted Critical
Publication of CN114844607B publication Critical patent/CN114844607B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

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

Abstract

The embodiment of the application discloses a beacon frame sending method, a beacon frame sending device, a storage medium and an AP (access point), and belongs to the field of wireless communication. By improving the structure of the beacon frame, the method and the device not only can expand the maximum number of STAs associated with the AP, but also can greatly shorten the length of the beacon frame, thereby reducing the transmission time of the beacon frame, improving the wireless transmission efficiency and increasing the wireless transmission throughput. In addition, the length of the beacon frame is lower, so that the STA under the low-power consumption node can listen to the beacon frame in less time, the standby power consumption of the STA can be reduced, and the standby time of the STA can be prolonged.

Description

Beacon frame transmitting method, device, storage medium and AP
Technical Field
The present invention relates to the field of wireless communications, and in particular, to a method and apparatus for transmitting a beacon frame, a storage medium, and an AP.
Background
In a wireless fidelity (wireless fidelity, wi-Fi) communication system, an Access Point (AP) periodically broadcasts beacon (beacon) frames To Stations (STAs) to inform the stations of information such as whether there is a buffered frame. Since in the 802.11 protocol, the actual transmission of beacons is typically at a low rate, it is for two reasons: first, the beacon frame is a broadcast frame, which has no acknowledgement feedback, so a retransmission mechanism cannot be set; second, the beacon frame is aimed at broadcasting the basic information of the AP, so it is desirable that all stations can receive the data efficiently, so that nodes with lower rates to ensure that the signal is poor can also receive the information. Therefore, the longer the beacon frame length is, the longer the transmission time is occupied, the utilization rate of the channel is reduced, and the whole throughput is influenced; in addition, when the STA is in the low power consumption mode, the longer the STA receives the beacon frame, the larger the power consumption correspondingly.
Disclosure of Invention
The method, the device, the storage medium and the AP for sending the beacon frame can solve the problems of low channel utilization rate and high standby power consumption of the STA caused by the fact that the length of the beacon frame is large in the related technology. The technical scheme is as follows:
in a first aspect, an embodiment of the present application provides a method for sending a beacon frame, where the method includes:
generating a beacon frame according to the data cache information; the beacon frame comprises a bitmap control and a partial virtual bitmap, wherein the bitmap control comprises a flow indicator and a page index, the partial virtual bitmap is composed of n embedded coding blocks, each embedded coding block comprises a coding mode, an inversion bit, a coding block offset, a coding block bitmap and m sub coding blocks, the lengths of the sub coding blocks and the coding block bitmap are equal, m is related to the coding block bitmap, and m and n are integers which are larger than or equal to 1;
the beacon frame is transmitted to the associated STA.
In a third aspect, an embodiment of the present application provides a beacon frame transmitting apparatus, where the beacon frame transmitting apparatus includes:
the processing unit is used for generating a beacon frame according to the data cache information; the beacon frame comprises a bitmap control and a partial virtual bitmap, wherein the bitmap control comprises a flow indicator and a page index, the partial virtual bitmap is composed of n embedded coding blocks, each embedded coding block comprises a coding mode, an inversion bit, a coding block offset, a coding block bitmap and m sub coding blocks, the lengths of the sub coding blocks and the coding block bitmap are equal, m is related to the coding block bitmap, and m and n are integers which are larger than or equal to 1;
and the receiving and transmitting unit is used for transmitting the beacon frame to the associated STA.
In a third aspect, embodiments of the present application provide a computer storage medium storing a plurality of instructions adapted to be loaded by a processor and to perform the above-described method steps.
In a fourth aspect, an embodiment of the present application provides an electronic device, where the electronic device is a station or an access point, and may include: a processor and a memory; wherein the memory stores a computer program adapted to be loaded by the processor and to perform the above-mentioned method steps.
The technical scheme provided by some embodiments of the present application has the beneficial effects that at least includes:
by reconfiguring the structure of the beacon frame, not only the maximum number of STAs associated with the AP can be expanded, but also the length of the beacon frame can be greatly shortened, thereby reducing the transmission time of the beacon frame, improving the wireless transmission efficiency and increasing the wireless transmission throughput. In addition, the length of the beacon frame is lower, so that the STA under the low-power consumption node can listen to the beacon frame in less time, the standby power consumption of the STA can be reduced, and the standby time of the STA can be prolonged.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is an architecture diagram of a WiFi wireless communication system provided in an embodiment of the present application;
fig. 2 is an interaction schematic diagram of a method for sending a beacon frame according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a beacon frame transmitting device provided in the present application;
fig. 4 is another schematic structural diagram of a beacon frame transmitting apparatus provided in the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the following detailed description of the embodiments of the present application will be given with reference to the accompanying drawings.
Referring to fig. 1, fig. 1 is a network architecture diagram of a wireless fidelity communication system. The wireless fidelity communication system includes at least one station (station 11 to station 13), an access point 21, and a server 31. Before the station does not establish connection with any access point, the station selects one access point for connection by means of passive scanning or active scanning, for example: station 11 establishes a WiFi connection with access point 21. The access point 21 and the server 31 communicate with each other, and the server 31 may be an application server, and the application program installed in the station communicates with the application server.
The AP may be connected to multiple STAs at the same time, and the AP may generate a beacon frame according to the data buffering status of each STA, and then broadcast the beacon frame to each associated STA, where the STA parses the beacon frame to determine whether the AP side has data buffered, and the structure of the beacon frame is shown in table 1.
TABLE 1
Wherein, element ID is element identification code, different values indicate that different field values are included in the beacon frame. For example: when the element ID is equal to 5, the beacon frame includes the following field values: element ID (element identification code), length (length), DTIM count (transmission traffic indication message count), DTIM period (transmission traffic indication message period), bitmap control (bitmap control), and PVB (partial virtual bitmap ). The element ID, length, DTIM count, DTIM periodDTIM period are 1 byte in length, PVB is variable in length, and the length is between 1 byte and 251 bytes.
Where length represents the total length of the beacon frame. In the 802.11 protocol, we can see TIM (traffic indication map ), DTIM (delivery traffic indication map, transport traffic indication map). TIM is a basic structure of traffic indication map, and standard TIM indicates only unicast information buffered by AP, DTIM is a special TIM (DTIM count=0) which indicates multicast information buffered by AP in addition to buffered unicast information. Typically, each beacon frame contains a TIM message, but the TIM is specifically not DTIM, and two parameters, DTIM count and DTIM period, need to be considered. DTIM period is a period, a fixed value, representing the occurrence of a DTIM after several TIMs. The DTIM count is a count value that varies, and when DTIM count=0, it represents that the TIM is a DTIM. In practice, if DTIM period is set to 1, then in each TIM field, the DTIM count is equal to 0, so each TIM is DTIM.
Therein, referring to table 2, bitmap control includes: a trafficindicator (traffic indicator) and a bitmap offset (bitmap offset), the length of the traffic indicator is 1 bit, and the length of the bitmap offset is 7 bits.
trafficindicator bitmapoffset
TABLE 2
At DTIM, traffic indicator is set to 1 if there is a buffered multicast/broadcast frame in the AP, and the remaining cases traffic indicator are set to 0. The bitmap offset represents the next PVB offset, and the offset calculation formula is as follows:
bit1 offset 2 1 X 8 = 16 AIDs.
bit2 offset 2 2 X 8 = 32 AIDs.
bit3 offset 2 3 X 8 = 64 AIDs.
bit4 offset 2 4 X 8 = 128 AIDs.
bit5 offset 2 5 X 8 = 256 AIDs.
bit6 offset 2 6 X 8 = 512 AIDs
bit7 offset 2 7 X 8 = 1024 AIDs.
Herein, referring to table 3, a structure diagram of PVB is shown, and PVB (partial virtualbitmap ) is a specific field of bitmap, (1 indicates that the AP has a unicast frame of the STA buffered, and 0 indicates that there is no buffering).
TABLE 3 Table 3
Among them, AID (association IDentifier, association ID), this field value corresponds to an alias given to STA. On the AP side, a association ID table (association ID table) is provided, in which each AID is bound to the MAC address of its corresponding STA. The AID ranges from 0 to 2007, so it is also illustrated that in the protocol, at most 2007 STAs can be associated with one AP. The aid=0 position is a reserved bit (rvd) and is not allocated to STAs to represent all multicast and broadcast. The AID value of a STA may change after re-association, but the AID and STA are in one-to-one correspondence at any time.
TABLE 4 Table 4
When the AP detects that the STAs corresponding to AID1, AID2, AID63, AID2007 cache data, if a single element is used to indicate that the length of a beacon frame sent by the AP to each STA is 256 bytes (bitmap offset=0), the structure of the beacon frame is shown in table 4. Therefore, in the prior art, the data volume of the beacon frame is larger, so that more transmission time is consumed when the beacon frame is transmitted, the utilization rate of a channel is reduced, and the overall throughput is influenced; in addition, when the STA is in the low power consumption mode, the length of time for the STA to receive the beacon frame is positively correlated with the power consumption, so the longer the transmission time of the beacon frame, the greater the power consumption of the STA.
The website in the embodiment of the application may be a smart phone, a tablet computer, a game device, an AR (Augmented Reality ) device, an automobile, a data storage device, an audio playing device, a video playing device, a notebook, a desktop computing device, a wearable device such as an electronic watch, an electronic glasses, an electronic helmet, an electronic bracelet, an electronic necklace, an electronic article of clothing, and the like.
The following describes in detail the method for transmitting the beacon frame according to the embodiment of the present application with reference to fig. 2. The method for sending the beacon frame in the embodiment of the present application may be a station or an access point in fig. 1.
Referring to fig. 2, a flowchart of a method for sending a beacon frame according to an embodiment of the present application may include the following steps:
s201, generating a beacon frame according to the data buffer information.
The data buffer information indicates whether the AP side buffers data of the STA, and generates a beacon frame according to the data buffer information. The beacon frame includes the following field values: the bitmap control comprises a flow indicator and a page index, the partial virtual bitmap comprises n embedded coding blocks, each embedded coding block comprises a coding mode, an inversion bit, a coding block offset, a coding block bitmap and m sub coding blocks, the lengths of the sub coding blocks and the coding block bitmap are equal, and m is related to the coding block bitmap.
For example, referring to the structure table of the beacon frame shown in table 5, the beacon frame includes the following field values: element ID, length, DTIM count, DTIM period, bitmap control, and PVB. The meaning and length of the element ID, length, DTIM count, and DTIM period are unchanged, and refer to Table 1. The bitmap control (bitmap control) has a length of 1 byte, and the length of PVB (partial virtual bitmap) is variable.
TABLE 5
Referring to the structure table of the bitmap control shown in table 6, the bitmap control includes: traffic indicator (traffic indicator) and page index. Optionally, the bitmap control may further include page slice number (page slice number). traffic indicator may be 1 bit in length, page index may be 2 bits in length, and page slice number may be 5 bits in length. Note that, the positions and lengths of the field values included in the bitmap control are not limited to those shown in table 6, and may be flexibly set according to actual requirements.
trafficindicator pageslicenumber pageindex
TABLE 6
The page index (PVB) is a field value that is newly added, and indicates the number of pages included in PVB, and since the length of the page index is 1 bit, the maximum value of the page index is 4, that is, the PVB includes at most 4 pages, and each page includes a plurality of encoddblock (embedded coding block). The maximum number of AIDs contained in the beacon frame extends from 2007 to 8191, which is why the 802.11AH protocol can be supported.
page slice number (number of page slices) represents the number of slices divided for a plurality of STAs associated with an AP, one slice including one or more STAs, facilitating the AP to turn on slice management for the associated plurality of STAs in order to provide personalized services for the STAs. Here page slice number is 5 bits long, so page slice number has a maximum of 32, i.e., the associated STAs can be divided up into a maximum of 32 slices.
Referring to the structure table of PVB shown in table 7, PVB is composed of n encoddblocks (embedded encoded blocks), n is an integer greater than or equal to 1, and the length of each encoddblock is variable.
encodedblock1 encodedblock2 ... encodedblockn
TABLE 7
Where n is a maximum of 32, if each embedded coding block represents a maximum of 64 AIDs, page index=4 (binary 11), and the first AID (AID 0) is a reserved bit, the maximum number of AIDs represented by PVB is aid=4×32×64-1=8191.
Wherein, since the newly added field value needs to be added with 4 byte redundancy element heads, the newly added encoded block only needs to be added with 1 byte redundancy block control (1 st byte).
See the structure table of the encoddblock shown in table 8.
TABLE 8
Here, the encoding mode (encoding mode) represents the encoding mode of a bitmap, and the length of the encoding mode is 2 bits, so that it can represent the encoding mode of 4 bitmaps.
The length of the invert (inversion bit) is 1 bit, indicating whether or not the meaning of the data is inverted. For example: when index=1, aid=1 indicates no cached data, and aid=0 indicates cached data; when index=0, aid=0 indicates no cached data, and aid=1 indicates cached data. It should be noted that, the AP determines the value of the index according to the ratio of the STA with the buffered data and the STA without the buffered data, and if the number of STAs with the buffered data in one encoddblock is greater than the number of STAs without the buffered data, the length is saved by the index=1 (the meaning of the blockbitmap is unchanged, and only the meaning of the subspeck is reversed).
The length of the block offset (code block offset) may be 5 bits and may be 64 units, for example, the block offset=2 (binary 00001) indicates that the calculated offset is 2×64=128 AIDs.
The blockbitmap (coded block bitmap) indicates whether m sub-coded blocks included in an embedded coded block are valid, for example: the length of the block bitmap is 8 bits, and the block bitmap corresponds to whether 8 sublocks (m=8) are valid or not respectively; 10000001 indicates that sublock 0 and sublock 7 are active and the remaining sublocks are inactive; the sublock for all 0 s may not be listed to save the length of the beacon frame.
The length of the sub-coded block may be 1 byte, 1 indicating a unicast frame with buffered STA at the AP, and 0 indicating no buffering.
The structure of the beacon frame of the present application is described below by way of specific examples:
TABLE 9
When the STA corresponding to AID1, AID2, AID63, AID2007 has buffered data, and the structure of the beacon frame is shown in table 9 by using one element with two encoddblocks, the length of the beacon frame is 5+4+3=12 bytes, and compared with the length of the beacon frame in table 4, the length of the beacon frame is greatly saved by 256 bytes.
The 1 st encoddblock: page index=0; reverse = 0; block offset=0; .
The 2 nd encoddeblock: page index=0; reverse = 0; block offset=11111 corresponds to an offset of 31×64=1984 AIDs.
Table 10
If all 2003 AIDs except AID1, AID2, AID63, AID2007 have buffered data, they are represented by a single element (a larger length is required if represented by multiple elements), see the structure of the beacon frame in the prior art, and the length of the beacon frame is 256 bytes (bitmap offset=0).
TABLE 11
Data caching information according to table 10: in the AID1 to AID2007, except for AID1, AID2, AID63 and AID2007, the other 2003 AIDs are all cached, at this time, the length of a beacon frame is greatly reduced by the reverse of the application, the structure of the beacon frame is shown in table 11, one element contains two encoddblocks to indicate, the length of the beacon frame is 5+4+3=12 bytes, and the length of the beacon frame is greatly saved.
The 1 st encoddblock: page index=0; reverse = 1; block offset=0.
The 2 nd encoddeblock: page index=0; reverse = 1; block offset=11111 corresponds to an offset of 31×64=1984 AIDs.
S202, a beacon frame is transmitted to the associated STA.
The method comprises the steps that an AP sends a beacon frame to each associated STA, and the STA determines whether data is cached on the AP side according to each field value in the beacon frame.
In summary, the beneficial effects of implementing embodiments of the present application include: by reconfiguring the structure of the beacon frame, not only the maximum number of STAs associated with the AP can be expanded, but also the length of the beacon frame can be greatly shortened, thereby reducing the transmission time of the beacon frame, improving the wireless transmission efficiency and increasing the wireless transmission throughput. In addition, the length of the beacon frame is lower, so that the STA under the low-power consumption node can listen to the beacon frame in less time, the standby power consumption of the STA can be reduced, and the standby time of the STA is prolonged.
The following are device embodiments of the present application, which may be used to perform method embodiments of the present application. For details not disclosed in the device embodiments of the present application, please refer to the method embodiments of the present application.
Referring to fig. 4, a schematic structural diagram of a beacon frame transmitting apparatus according to an exemplary embodiment of the present application is shown. The apparatus may be implemented as a whole or as part of a terminal by software, hardware or a combination of both. The beacon frame transmitting apparatus 3 includes a transmitting/receiving unit 301 and a processing unit 302.
A processing unit 302, configured to generate a beacon frame according to the data buffering information; the beacon frame comprises a bitmap control and a partial virtual bitmap, wherein the bitmap control comprises a flow indicator and a page index, the partial virtual bitmap is composed of n embedded coding blocks, each embedded coding block comprises a coding mode, an inversion bit, a coding block offset, a coding block bitmap and m sub coding blocks, the lengths of the sub coding blocks and the coding block bitmap are equal, m is related to the coding block bitmap, and m and n are integers which are larger than or equal to 1;
a transceiver unit 301, configured to send the beacon frame to an associated STA.
In one or more embodiments, the bitmap control is 1 byte in length, the traffic indicator is 1 bit in length, and the page index is 2 bits in length.
In one or more embodiments, n has a maximum value of 32.
In one or more embodiments, the coding mode is 2 bits in length, the inversion bit is 1 bit in length, and the coding block offset is 4 bits in length.
In one or more embodiments, the coded block bitmap and each self-coded block are 1 byte in length, m is 8 at maximum, and the coded block bitmap is 8 bits in length.
In one or more embodiments, when the inversion bit is equal to 1, an association identifier equal to 1 indicates no data cache, and an association identifier equal to 0 indicates data cache; when the flip flag bit is equal to 0, the association identifier is equal to 0, which indicates that data cache exists, and is equal to 1, which indicates that no data cache exists.
In one or more embodiments, the coding block offset is in units of 64.
It should be noted that, when the beacon frame transmitting apparatus 3 provided in the foregoing embodiment performs the beacon frame transmitting method, only the division of the foregoing functional modules is used as an example, and in practical application, the foregoing functional allocation may be performed by different functional modules, that is, the internal structure of the device is divided into different functional modules, so as to complete all or part of the functions described above. In addition, the touch operation response device and the touch operation response method embodiment provided in the foregoing embodiments belong to the same concept, which embody the detailed implementation process in the method embodiment, and are not repeated here.
The foregoing embodiment numbers of the present application are merely for describing, and do not represent advantages or disadvantages of the embodiments.
The embodiment of the present application further provides a computer storage medium, where the computer storage medium may store a plurality of instructions, where the instructions are adapted to be loaded by a processor and execute the method steps of the embodiment shown in fig. 2, and the specific execution process may refer to the specific description of the embodiment shown in fig. 2, which is not repeated herein.
The present application also provides a computer program product storing at least one instruction that is loaded and executed by the processor to implement the method of transmitting a beacon frame as described in the above embodiments.
Referring to fig. 4, a schematic structural diagram of a beacon frame transmitting device is provided in an embodiment of the present application. The beacon frame transmitting apparatus 400 (abbreviated as apparatus 400) may be the AP21 in fig. 1, and as shown in fig. 4, the apparatus 400 may include: at least one processor 401, at least one network interface 404, a user interface 403, a memory 405, and at least one communication bus 402.
Wherein communication bus 402 is used to enable connected communications between these components.
Wherein the user interface 403 comprises a Display screen (Display), which may be a serial screen, optionally, the user interface may further comprise a Camera; further, the user interface 403 may also include a standard wired interface, a wireless interface.
The network interface 404 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface), among others.
Wherein the processor 401 may include one or more processing cores. The processor 401 connects the various parts within the overall apparatus 400 using various interfaces and lines, performs various functions of the apparatus 400 and processes data by executing or executing instructions, programs, code sets, or instruction sets stored in the memory 405, and invoking data stored in the memory 405. Alternatively, the processor 401 may be implemented in at least one hardware form of digital signal processing (Digital Signal Processing, DSP), field-Programmable gate array (FPGA), programmable Logic Array (PLA). The processor 401 may integrate one or a combination of several of a central processing unit (Central Processing Unit, CPU), an image processor (Graphics Processing Unit, GPU), a modem, etc. The CPU mainly processes an operating system, a user interface, an application program and the like; the GPU is used for rendering and drawing the content required to be displayed by the display screen; the modem is used to handle wireless communications. It will be appreciated that the modem may not be integrated into the processor 401 and may be implemented by a single chip.
The Memory 405 may include a random access Memory (RandomAccess Memory, RAM) or a Read-Only Memory (Read-Only Memory). Optionally, the memory 405 includes a non-transitory computer readable medium (non-transitory computer-readable storage medium). Memory 405 may be used to store instructions, programs, code sets, or instruction sets. The memory 405 may include a stored program area and a stored data area, wherein the stored program area may store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing the above-described various method embodiments, etc.; the storage data area may store data or the like referred to in the above respective method embodiments. The memory 405 may also optionally be at least one storage device located remotely from the aforementioned processor 401. As shown in fig. 4, an operating system, a network communication module, a user interface module, and application programs may be included in the memory 405, which is one type of computer storage medium.
In the apparatus 400 shown in fig. 4, the user interface 403 is mainly used as an interface for providing input for a user, and obtains data input by the user; the processor 401 may be configured to invoke an application program stored in the memory 405, and specifically execute the method shown in fig. 2, and the specific process may be shown in fig. 2, which is not repeated herein.
Those skilled in the art will appreciate that implementing all or part of the above-described methods in accordance with the embodiments may be accomplished by way of a computer program stored on a computer readable storage medium, which when executed may comprise the steps of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a read-only memory, a random access memory, or the like.
The foregoing disclosure is only illustrative of the preferred embodiments of the present application and is not intended to limit the scope of the claims herein, as the equivalent of the claims herein shall be construed to fall within the scope of the claims herein.

Claims (8)

1. A method for transmitting a beacon frame, the method comprising:
generating a beacon frame according to the data cache information; the beacon frame comprises a bitmap control and a partial virtual bitmap, the bitmap control comprises a flow indicator and a page index, the partial virtual bitmap PVB consists of n embedded coding blocks, each embedded coding block comprises a coding mode, an inversion bit, a coding block offset, a coding block bitmap and m sub coding blocks, the lengths of the respective sub coding blocks and the coding block bitmap are equal, m is related to the coding block bitmap, m and n are integers which are greater than or equal to 1, the maximum value of n is 32, the bitmap control further comprises a page slice number, the length of the bitmap control is 1 byte, the length of the flow indicator is 1 bit, the length of the page index is 2 bits, the length of the page slice number is 5 bits, and the page slice number represents the number of a plurality of divided slices of the STA associated with the AP;
the beacon frame is transmitted to the associated STA.
2. The method of claim 1, wherein the coding mode is 2 bits in length, the inversion bit is 1 bit in length, and the coding block offset is 4 bits in length.
3. The method of claim 2, wherein the coded block bitmap and each sub-coded block have a length of 1 byte, a maximum value of m is 8, and the coded block bitmap has a length of 8 bits.
4. The method of claim 1, wherein when the inversion bit is equal to 1, an association identifier equal to 1 indicates no data buffering, and an association identifier equal to 0 indicates data buffering; when the inversion bit is equal to 0, the association identifier is equal to 0, which indicates that no data buffer exists, and is equal to 1, which indicates that data buffer exists.
5. A method according to claim 3, wherein the coding block offset is in units of 64.
6. A beacon frame transmitting apparatus, comprising:
the processing unit is used for generating a beacon frame according to the data cache information; the beacon frame comprises a bitmap control and a partial virtual bitmap, wherein the bitmap control comprises a flow indicator and a page index, the partial virtual bitmap is composed of n embedded coding blocks, each embedded coding block comprises a coding mode, an inversion bit, a coding block offset, a coding block bitmap and m sub coding blocks, the lengths of the respective sub coding blocks and the coding block bitmap are equal, m is related to the coding block bitmap, m and n are integers which are greater than or equal to 1, the maximum value of n is 32, the bitmap control further comprises a page slice number, the length of the bitmap control is 1 byte, the length of the flow indicator is 1 bit, the length of the page index is 2 bits, the length of the page slice number is 5 bits, and the page slice number represents the number of a plurality of divided STAs (STAs) associated with an AP;
and the receiving and transmitting unit is used for transmitting the beacon frame to the associated STA.
7. A computer storage medium storing a plurality of instructions adapted to be loaded by a processor and to perform the method steps of any one of claims 1 to 5.
8. An AP, comprising: a processor and a memory; wherein the memory stores a computer program adapted to be loaded by the processor and to perform the method steps of any of claims 1-5.
CN202210155097.8A 2022-02-21 2022-02-21 Beacon frame transmitting method, device, storage medium and AP Active CN114844607B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210155097.8A CN114844607B (en) 2022-02-21 2022-02-21 Beacon frame transmitting method, device, storage medium and AP

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210155097.8A CN114844607B (en) 2022-02-21 2022-02-21 Beacon frame transmitting method, device, storage medium and AP

Publications (2)

Publication Number Publication Date
CN114844607A CN114844607A (en) 2022-08-02
CN114844607B true CN114844607B (en) 2024-03-12

Family

ID=82562073

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210155097.8A Active CN114844607B (en) 2022-02-21 2022-02-21 Beacon frame transmitting method, device, storage medium and AP

Country Status (1)

Country Link
CN (1) CN114844607B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008104095A1 (en) * 2007-02-27 2008-09-04 Thomson Licensing Method and apparatus for power management in wlan
CN103096421A (en) * 2011-11-01 2013-05-08 华为技术有限公司 Access method, access station and access point of wireless local area network
WO2013122437A1 (en) * 2012-02-18 2013-08-22 엘지전자 주식회사 Method for transmitting and receiving traffic indication maps in wireless communication systems and apparatus for same
WO2014031239A1 (en) * 2012-08-24 2014-02-27 Intel Corporation Methods and arrangements for traffic indication mapping in wireless networks
CN106411460A (en) * 2011-11-01 2017-02-15 英特尔公司 Methods and arrangements for traffic indication mapping in wireless networks
CN113613316A (en) * 2017-03-03 2021-11-05 华为技术有限公司 Indication method and device of downlink service data

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9148842B2 (en) * 2012-10-24 2015-09-29 Intel Corporation Methods, wireless communication stations, and system for device-to-device discovery and advertisement
US9743275B2 (en) * 2014-04-29 2017-08-22 Qualcomm Incorporated Multiple BSSID procedure with TIM encoding

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008104095A1 (en) * 2007-02-27 2008-09-04 Thomson Licensing Method and apparatus for power management in wlan
CN103096421A (en) * 2011-11-01 2013-05-08 华为技术有限公司 Access method, access station and access point of wireless local area network
CN106411460A (en) * 2011-11-01 2017-02-15 英特尔公司 Methods and arrangements for traffic indication mapping in wireless networks
WO2013122437A1 (en) * 2012-02-18 2013-08-22 엘지전자 주식회사 Method for transmitting and receiving traffic indication maps in wireless communication systems and apparatus for same
WO2014031239A1 (en) * 2012-08-24 2014-02-27 Intel Corporation Methods and arrangements for traffic indication mapping in wireless networks
CN113613316A (en) * 2017-03-03 2021-11-05 华为技术有限公司 Indication method and device of downlink service data

Also Published As

Publication number Publication date
CN114844607A (en) 2022-08-02

Similar Documents

Publication Publication Date Title
US9907051B2 (en) Determining paging frames in a wireless network
US20180199321A1 (en) System and Method for Downlink Transmission in a Wireless Network
CN111698775B (en) Communication method based on double cards and related device
WO2020143617A1 (en) Downlink control channel transmission method, terminal, and network side device
US9363825B2 (en) Indication map delivery method, indication operation method, device, and system
CN111181707B (en) Data transmission method and communication device
CN107040977A (en) A kind of system information transmission method and relevant device
CN112804755B (en) Uplink resource determining method, indicating method, terminal and network equipment
CN100446580C (en) Method for intensifying short message business
EP4017133A1 (en) Energy-saving indication method and apparatus thereof
WO2021036375A1 (en) Communication method and apparatus
EP2802098A1 (en) Transmission method, device and system for traffic indication message
CN101132597B (en) Resource allocation method, resource allocation system, resource allocation entity and mobile station
CN114844607B (en) Beacon frame transmitting method, device, storage medium and AP
CN111369444B (en) Image scaling processing method and device
CN107846709B (en) Wireless communication device and wireless communication method based on LoRa
EP3713315A1 (en) Association method, instruction method, and device for synchronization block and paging-scheduling signaling message
WO2022133918A1 (en) Decoding failure processing method, apparatus and system
WO2020233401A1 (en) Communication method and device
EP3910854A1 (en) Data transmission method, terminal and network side device
CN109644074B (en) Data transmission method, terminal, network side equipment and system
CN111193650A (en) Node receiving and dispatching control device based on SAE AS5643 standard
EP4369796A1 (en) Signal processing method and apparatus, electronic device, and storage medium
CN114980319A (en) Method and device for indicating paging grouping
CN114090484B (en) Remote direct data access method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant