IP Library › Granted Patent US 12,457,598
Granted Patent B2
US 12,457,598 · App. 17/946,924 · Granted Oct 28, 2025

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

Inventors: Ming Gan (Shenzhen, CN); Guogang Huang (Shenzhen, CN); Dandan Liang (Shenzhen, CN); Jian Yu (Shenzhen, CN); Yunbo Li (Shenzhen, CN); Yuchen Guo (Shenzhen, CN); Mengshi Hu (Shenzhen, CN)
Assignee: Huawei Technologies Co., Ltd.
H04W72/12H04W28/0278
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,457,598
App. No.
17/946,924
Granted
Oct 28, 2025
Kind
B2
Abstract

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.

Claims (32)

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.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2023
From: GAN, MING; HUANG, GUOGANG; LIANG, DANDAN; YU, JIAN; LI, YUNBO; GUO, YUCHEN; HU, MENGSHI
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 064027/0091 →
Priority Claims (1)
CN 202010183125.8 · Mar 16, 2020 · national
Continuity (2)
Continuation PCTCN2021080836 · Mar 15, 2021
Related Publication 20230013454A1 · Jan 19, 2023
References Cited (22)
US 20190246312A1 · Kim et al. · 2019 [cited by applicant]
US 20200029350A1 · Asterjadhi et al. · 2020 [cited by applicant]
CN 107771401A · 2018 [cited by applicant]
CN 110199494A · 2019 [cited by applicant]
CN 110418404A · 2019 [cited by applicant]
CN 110830175A · 2020 [cited by applicant]
CN 110876165A · 2020 [cited by applicant]
CN 113411831B · 2023 [cited by applicant]
EP 4462947A2 · 2024 [cited by applicant]
WO WO2021183045A1 · 2021 [cited by examiner]
Vivo, “Remaining issues on BSR and UAI for NR Sidelink mode 1,” 3GPP TSG-RAN WG2 Meeting #106, R2-1905839, Reno, USA, May 13-17, 2019, 4 pages. [cited by applicant]
Nayarasi, “CWAP—802.11 : Block Ack,” Nov. 1, 2014, retrieved from URL: <https://mmcciew.com/2014/11/01/cwap-802-11-block-ack>, 11 pages. [cited by applicant]
IEEE Std 802.Nov. 2016, “IEEE Standard for Information technology—Telecommunications and information exchange between systems Local and metropolitan area networks—Specific requirements, Part 11: Wireless LAN Medium Acce… [cited by applicant]
IEEE P802.11ax /D1.0, “Draft Standard for Information technology—Telecommunications and information exchange between systems Local and metropolitan area networks—Specific requirements; Part 11: Wireless LAN Medium Acces… [cited by applicant]
Office Action in Chinese Appln. No. 202010183125.8, dated Apr. 14, 2023, 7 pages. [cited by applicant]
Office Action in Indian Appln. No. 202237055187, dated Feb. 14, 2023, 6 pages (with English translation). [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/CN2021/080836, mailed on May 28, 2021, 11 pages (with partial English translation). [cited by applicant]
Jang et al., “Indication of Multi-link Information,” IEEE 802.11-20/0028r0, Jan. 13, 2020, 13 pages. [cited by applicant]
Patil et al., “Multi-TID ML BA Negotiation Scheme,” IEEE 802.11-20/0914r0, Jun. 16, 2020, 18 pages. [cited by applicant]
Seok et al., “Proposed Draft Text for MLO TID-to-Link Mapping,” IEEE 802.11-21/0019r4, Mar. 4, 2021, 11 pages. [cited by applicant]
Extended European Search Report in European Appln No. 21771321.3, dated Jul. 18, 2023, 11 pages. [cited by applicant]
EP Communication Pursuant to Article 94(3) EPC in European Appln. No. 21771321.3, mailed on Apr. 1, 2025, 8 pages. [cited by applicant]