Data transmission method, data transmission apparatus and non-transitory computer-readable storage medium for tid-to-link mapping

US12457598B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12457598-B2
Application numberUS-202217946924-A
CountryUS
Kind codeB2
Filing dateSep 16, 2022
Priority dateMar 16, 2020
Publication dateOct 28, 2025
Grant dateOct 28, 2025

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

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.

First claim

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.

Assignees

Inventors

Classifications

  • 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

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12457598B2 cover?
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 sch…
Who is the assignee on this patent?
Huawei Tech Co Ltd
What technology area does this patent fall under?
Primary CPC classification H04W28/0278. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Oct 28 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 2 related publications on this page (citations in our corpus or others sharing the same primary CPC).