Quality of service (qos) for uplink access in a wireless local area network (wlan)
US-2020029350-A1 · Jan 23, 2020 · US
US12457598B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12457598-B2 |
| Application number | US-202217946924-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 16, 2022 |
| Priority date | Mar 16, 2020 |
| Publication date | Oct 28, 2025 |
| Grant date | Oct 28, 2025 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
This application provides data transmission methods and apparatuses, to introduce a buffer status report (BSR) mechanism through multi-link (ML) cooperation, to improve performance of scheduling a station by an ML device. In an example method, a multi-link transmit end determines BSR signaling sent to a multi-link receive end, where the BSR signaling can enable the multi-link receive end to schedule a station of the multi-link transmit end over one or more links. Further, the multi-link transmit end sends the B SR signaling to the multi-link transmit end over the one or more links. This introduces a BSR mechanism through ML cooperation.
Opening claim text (preview).
What is claimed is: 1. A data transmission method, comprising: sending, by a multi-link transmit end, a request message to a multi-link receive end; and receiving, by the multi-link transmit end, a response message from the multi-link receive end, wherein: the request message and the response message are used for negotiation to set up a traffic identifier-to-link (TID-to-link) mapping relationship; and wherein the request message comprises mapping information, the mapping information comprises a TID bitmap field and N link identifier bitmap fields, N is a positive integer, wherein a bit whose value is 1 in the TID bitmap field indicates that a TID identified by a position of the bit whose value is 1 in the TID bitmap field corresponds to one of the N link identifier bitmap fields, a bit whose value is 1 in a link identifier bitmap field indicates that a TID corresponding to the link identifier bitmap field is mapping to a link identified by a position of the bit whose value is 1 in the link identifier bitmap field. 2. The method according to claim 1 , wherein a length of each of the link identifier bitmap fields is fixed. 3. The method according to claim 1 , wherein a quantity of bits that are set to 1 in the TID bitmap field is N. 4. The method according to claim 1 , wherein the response message comprises control information, and the control information indicates that a TID-to-Link mapping is accepted. 5. The method according to claim 1 , wherein the response message comprises control information, and the control information indicates that a TID-to-Link mapping is rejected. 6. The method according to claim 1 , wherein the response message comprises control information, and the control information indicates that a TID-to-Link mapping is suggested. 7. A data transmission apparatus, comprising: at least one processor; and at least one memory, storing computer instructions, which when execute by the at least one processor, cause the data transmission apparatus to: send a request message to a multi-link receive end; and receive a response message from the multi-link receive end, wherein the request message and the response message are used for negotiation to set up a traffic identifier-to-link (TID-to-link) mapping relationship; and wherein the request message comprises mapping information, the mapping information comprises a TID bitmap field and N link identifier bitmap fields, N is a positive integer, wherein a bit whose value is 1 in the TID bitmap field indicates that a TID identified by a position of the bit whose value is 1 in the TID bitmap field corresponds to one of the N link identifier bitmap fields, a bit whose value is 1 in a link identifier bitmap field indicates that a TID corresponding to the link identifier bitmap field is mapping to a link identified by a position of the bit whose value is 1 in the link identifier bitmap field. 8. The data transmission apparatus according to claim 7 , wherein a length of each of the link identifier bitmap fields is fixed. 9. The data transmission apparatus according to claim 7 , wherein a quantity of bits that are set to 1 in the TID bitmap field is N. 10. The data transmission apparatus according to claim 7 , wherein the response message comprises control information, and the control information indicates that a TID-to-Link mapping is accepted. 11. The data transmission apparatus according to claim 7 , wherein the response message comprises control information, and the control information indicates that a TID-to-Link mapping is rejected. 12. The data transmission apparatus according to claim 7 , wherein the response message comprises control information, and the control information indicates that a TID-to-Link mapping is suggested. 13. A non-transitory computer-readable storage medium, comprising computer instructions, which when executed by at least one processor, cause a data transmission apparatus comprising the at least one processor to: send a request message to a multi-link receive end; and receive a response message from the multi-link receive end, wherein the request message and the response message are used for negotiation to set up a traffic identifier-to-link (TID-to-link) mapping relationship; and wherein the request message comprises mapping information, the mapping information comprises a TID bitmap field and N link identifier bitmap fields, N is a positive integer, wherein a bit whose value is 1 in the TID bitmap field indicates that a TID identified by a position of the bit whose value is 1 in the TID bitmap field corresponds to one of the N link identifier bitmap fields, a bit whose value is 1 in a link identifier bitmap field indicates that a TID corresponding to the link identifier bitmap field is mapping to a link identified by a position of the bit whose value is 1 in the link identifier bitmap field. 14. The non-transitory computer-readable storage medium according to claim 13 , wherein a length of each of the link identifier bitmap fields is fixed. 15. The non-transitory computer-readable storage medium according to claim 13 , wherein a quantity of bits that are set to 1 in the TID bitmap field is N. 16. The non-transitory computer-readable storage medium according to claim 13 , wherein the response message comprises control information, and the control information indicates that a TID-to-Link mapping is accepted. 17. The non-transitory computer-readable storage medium according to claim 13 , wherein the response message comprises control information, and the control information indicates that a TID-to-Link mapping is rejected. 18. The non-transitory computer-readable storage medium according to claim 13 , wherein the response message comprises control information, and the control information indicates that a TID-to-Link mapping is suggested.
using buffer status reports (dynamic wireless traffic scheduling definition H04W72/12) · CPC title
WLAN [Wireless Local Area Networks] · CPC title
Negotiating wireless communication parameters · CPC title
Setup of multiple wireless link connections · CPC title
in the uplink direction of a wireless link, i.e. towards the network · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.