Methods and apparatuses for cooperative UL transmissions
Patent Information
- Application Number
- PCT/CN2023/125592
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-10-20
- Publication Date
- 2024-11-21
Smart Images

Figure CN2023125592_21112024_PF_FP_ABST
Abstract
Description
METHODS AND APPARATUSES FOR COOPERATIVE UL TRANSMISSIONSTECHNICAL FIELD
[0001] The present disclosure relates to wireless communications, and more specifically to methods and apparatuses for cooperative uplink (UL) transmissions from multiple user equipments (UEs) .BACKGROUND
[0002] A wireless communications system may include one or multiple network communication devices, such as base stations (BSs) , which may support wireless communications for one or multiple user communication devices, which may be otherwise known as UE, or other suitable terminology. The wireless communications system may support wireless communications with one or multiple user communication devices by utilizing resources of the wireless communication system (e.g., time resources (e.g., symbols, slots, subframes, frames, or the like) or frequency resources (e.g., subcarriers, carriers, or the like) . Additionally, the wireless communications system may support wireless communications across various radio access technologies including third generation (3G) radio access technology, fourth generation (4G) radio access technology, fifth generation (5G) radio access technology, among other suitable radio access technologies beyond 5G (e.g., sixth generation (6G) ) .SUMMARY
[0003] An article "a" before an element is unrestricted and understood to refer to "at least one" of those elements or "one or more" of those elements. The terms "a, " "at least one, " "one or more, " and "at least one of one or more" may be interchangeable. As used herein, including in the claims, "or" as used in a list of items (e.g., a list of items prefaced by a phrase such as "at least one of" or "one or more of" or "one or both of" ) indicates an inclusive list such that, for example, a list of at least one of A, B, or C means A or B or C or AB or AC or BC or ABC (i.e., A and B and C) . Also, as used herein, the phrase "based on" shall not be construed as a reference to a closed set of conditions. For example, an example step that is described as "based on condition A" may be based on both a condition A and a condition B without departing from the scope of the present disclosure. In other words, as used herein, the phrase "based on" shall be construed in the same manner as the phrase "based at least in part on. " Further, as used herein, including in the claims, a "set" may include one or more elements.
[0004] Some implementations of the methods and apparatuses described herein may include a first UE for wireless communication. The first UE may include: at least one memory; and at least one processor coupled with the at least one memory and configured to cause the first UE to: transmit, to one or more second UEs via a multicast manner or a direct link between each of the one or more second UEs and the first UE, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of information blocks (IBs) with a same size for each of the first UE and the one or more second UEs; encode the plurality of IBs into one or more coded blocks (CBs) using Fountain codes, wherein each CB is based on a key; and transmit the one or more CBs with their corresponding keys to the destination node.
[0005] In some implementations of the first UE described herein, the at least one processor is further configured to cause the first UE to transmit, to the destination node, a message indicating a transmission of the information, wherein the message includes at least one of: information related to the one or more second UEs, a size of the information, a number of the plurality of IBs, or a size of each IB.
[0006] In some implementations of the first UE described herein, the at least one processor is further configured to cause the first UE to transmit a start message indicating the one or more second UEs to start a joint transmission of the information via a multicast manner or the direct link between each of the one or more second UEs and the first UE after transmitting the message indicating the transmission of the information.
[0007] In some implementations of the first UE described herein, the at least one processor is further configured to cause the first UE to transmit, to the one or more second UEs, an address or an identity (ID) of the destination node along with the information before transmitting the start message, or the start message includes an address or an ID of the destination node.
[0008] In some implementations of the first UE described herein, the at least one processor is further configured to cause the first UE to perform one of the followings: encoding the one or more CBs with their corresponding keys using a channel encoding scheme; and transmitting the one or more CBs with their corresponding keys to a transmit-receive point (TRP) corresponding to the first UE via an uplink channel.
[0009] In some implementations of the first UE described herein, the at least one processor is further configured to cause the first UE to: receive an acknowledgement (ACK) message indicating a successful receipt of the information from the destination node; and stop transmission of the one or more CBs in response to receiving the ACK message.
[0010] In some implementations of the first UE described herein, the at least one processor is further configured to cause the first UE to transmit, to the one or more second UEs, a stop message indicating the one or more second UEs to stop a joint transmission of the information via a multicast manner or the direct link between each of the one or more second UEs and the first UE after receiving the ACK message from the destination node.
[0011] In some implementations of the first UE described herein, the direct link includes a sidelink, a device-to-device (D2D) link, a wireless fidelity (WiFi) link, a Bluetooth link, a SparkLink, or an optical fiber link.
[0012] Some implementations of the methods and apparatuses described herein may include a second UE for wireless communication. The second UE may include: at least one memory; and at least one processor coupled with the at least one memory and configured to cause the second UE to: receive, from a first UE via a multicast manner or a direct link between each of the second UE and the first UE, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of IBs with a same size for each of the first UE and the second UE; encode the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key; and transmit the one or more CBs with their corresponding keys to the destination node.
[0013] In some implementations of the second UE described herein, the at least one processor is further configured to cause the second UE to receive a start message indicating the second UE to start a joint transmission of the information via a multicast manner or the direct link between the second UE and the first UE.
[0014] In some implementations of the second UE described herein, the at least one processor is further configured to cause the second UE to receive an address or an ID of the destination node along with the information from the first UE before receiving the start message, or the start message includes an address or an ID of the destination node.
[0015] In some implementations of the second UE described herein, the at least one processor is further configured to cause the second UE to perform one of the followings: encoding the one or more CBs with their corresponding keys using a channel encoding scheme; and transmitting the one or more CBs with their corresponding keys to a TRP corresponding to the second UE via an uplink channel.
[0016] In some implementations of the second UE described herein, the at least one processor is further configured to cause the second UE to: receive a stop message from the first UE via a multicast manner or the direct link between the second UE and the first UE; and stop transmission of the one or more CBs in response to receiving the stop message.
[0017] In some implementations of the second UE described herein, the at least one processor is further configured to cause the second UE to: receive an ACK message indicating a successful receipt of the information from the destination node; and stop transmission of the one or more CBs in response to receiving the ACK message.
[0018] In some implementations of the second UE described herein, the direct link includes a sidelink, a D2D link, a WiFi link, a Bluetooth link, a SparkLink, or an optical fiber link.
[0019] Some implementations of the methods and apparatuses described herein may include a destination node for wireless communication. The destination node may include: at least one memory; and at least one processor coupled with the at least one memory and configured to cause the destination node to: receive, from a plurality of UEs, one or more CBs of information with their corresponding keys through a network, wherein the plurality of UEs include a first UE and one or more second UEs, the information is segmented into a plurality of IBs with a same size for each of the plurality of UEs, the one or more CBs are generated by encoding the plurality of IBs using Fountain codes, and each CB is based on a key; and reconstruct the plurality of IBs based on the one or more CBs and their corresponding keys.
[0020] In some implementations of the destination node described herein, the at least one processor is further configured to cause the destination node to receive, from the first UE, a message indicating a transmission of the information before receiving the one or more CBs, wherein the message includes at least one of: information related to the one or more second UEs, a size of the information, a number of the plurality of IBs, or a size of each IB.
[0021] In some implementations of the destination node described herein, the at least one processor is further configured to cause the destination node to transmit an ACK message to the first UE or each of the plurality of UEs in response to receiving a sufficient number of CBs for reconstructing the plurality of IBs.
[0022] Some implementations of the methods and apparatuses described herein may include a processor for wireless communication. The processor may include: at least one controller coupled with at least one memory and configured to cause the processor to: transmit, to one or more UEs, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of IBs with a same size for each of the processor and the one or more UEs; encode the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key; and transmit the one or more CBs with their corresponding keys to the destination node.
[0023] Some implementations of the methods and apparatuses described herein may include a processor for wireless communication. The processor may include: at least one controller coupled with at least one memory and configured to cause the processor to: receive, from a first UE, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of IBs with a same size for each of the first UE and the processor; encode the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key; and transmit the one or more CBs with their corresponding keys to the destination node.
[0024] Some implementations of the methods and apparatuses described herein may include a processor for wireless communication. The processor may include: at least one controller coupled with at least one memory and configured to cause the processor to: receive, from a plurality of UEs, one or more CBs of information with their corresponding keys through a network, wherein the plurality of UEs include a first UE and one or more second UEs, the information is segmented into a plurality of IBs with a same size for each of the plurality of UEs, the one or more CBs are generated by encoding the plurality of IBs using Fountain codes, and each CB is based on a key; and reconstruct the plurality of IBs based on the one or more CBs and their corresponding keys.
[0025] Some implementations of the methods and apparatuses described herein may include a method performed by a first UE. The method may include: transmitting, to one or more second UEs, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of IBs with a same size for each of the first UE and the one or more second UEs; encoding the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key; and transmitting the one or more CBs with their corresponding keys to the destination node.
[0026] Some implementations of the methods and apparatuses described herein may include a method performed by a second UE. The method may include: receiving, from a first UE, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of IBs with a same size for each of the first UE and the second UE; encoding the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key; and transmitting the one or more CBs with their corresponding keys to the destination node.
[0027] Some implementations of the methods and apparatuses described herein may include a method performed by a destination node. The method may include: receiving, from a plurality of UEs, one or more CBs of information with their corresponding keys through a network, wherein the plurality of UEs include a first UE and one or more second UEs, the information is segmented into a plurality of IBs with a same size for each of the plurality of UEs, the one or more CBs are generated by encoding the plurality of IBs using Fountain codes, and each CB is based on a key; and reconstructing the plurality of IBs based on the one or more CBs and their corresponding keys.BRIEF DESCRIPTION OF THE DRAWINGS
[0028] In order to describe the manner in which advantages and features of the application can be obtained, a description of the application is rendered by reference to specific embodiments thereof, which are illustrated in the appended drawings. These drawings depict only example embodiments of the application and are not therefore to be considered limiting of its scope.
[0029] Figure 1 illustrates an example of a wireless communications system in accordance with aspects of the present disclosure.
[0030] Figure 2 illustrates an exemplary cooperative UL transmission scenario in accordance with aspects of the present disclosure.
[0031] Figure 3 illustrates exemplary Fountain codes in accordance with aspects of the present disclosure.
[0032] Figure 4 illustrates a flowchart of an exemplary method for cooperative UL transmissions from a plurality of UEs based on Fountain codes in accordance with aspects of the present disclosure.
[0033] Figure 5 illustrates an example of cooperative UL transmissions based on Fountain codes in accordance with aspects of the present disclosure.
[0034] Figure 6 illustrates another example of cooperative UL transmissions based on Fountain codes in accordance with aspects of the present disclosure.
[0035] Figure 7 illustrates yet another example of cooperative UL transmissions based on Fountain codes in accordance with aspects of the present disclosure.
[0036] Figure 8 illustrates a flowchart of an exemplary method performed by a UE in accordance with aspects of the present disclosure.
[0037] Figure 9 illustrates a flowchart of another exemplary method performed by a UE in accordance with aspects of the present disclosure.
[0038] Figure 10 illustrates a flowchart of an exemplary method performed by a destination node in accordance with aspects of the present disclosure.
[0039] Figure 11 illustrates an example of a UE in accordance with aspects of the present disclosure.
[0040] Figure 12 illustrates an example of a processor in accordance with aspects of the present disclosure.
[0041] Figure 13 illustrates an example of an NE in accordance with aspects of the present disclosure.DETAILED DESCRIPTION
[0042] The detailed description of the appended drawings is intended as a description of preferred embodiments of the present application and is not intended to represent the only form in which the present application may be practiced. It should be understood that the same or equivalent functions may be accomplished by different embodiments that are intended to be encompassed within the spirit and scope of the present application.
[0043] While operations are depicted in the drawings in a particular order, persons skilled in the art will readily recognize that such operations need not be performed in the particular order as shown or in a sequential order, or that all illustrated operations need be performed, to achieve desirable results; sometimes one or more operations can be skipped. Further, the drawings can schematically depict one or more example processes in the form of a flow diagram. However, other operations that are not depicted can be incorporated in the example processes that are schematically illustrated. For example, one or more additional operations can be performed before, after, simultaneously, or between any of the illustrated operations. In certain circumstances, multitasking and parallel processing can be advantageous.
[0044] Reference will now be made in detail to some embodiments of the present application, examples of which are illustrated in the accompanying drawings. To facilitate understanding, embodiments are provided under specific network architecture and new service scenarios, such as 3rd generation partnership project (3GPP) long-term evolution (LTE) and LTE advanced, 3GPP 5G new radio (NR) , 5G-Advanced, 6G, and so on. It is contemplated that along with developments of network architectures and new service scenarios, all embodiments in the present application are also applicable to similar technical problems; and moreover, the terminologies recited in the present application may change, which should not affect the principle of the present application.
[0045] Aspects of the present disclosure are described in the context of a wireless communications system.
[0046] Figure 1 illustrates an example of a wireless communications system 100 in accordance with aspects of the present disclosure. The wireless communications system 100 may include one or more network equipments (NEs) (e.g., BSs) 102, one or more UEs 104, and a core network (CN) 106. The wireless communications system 100 may support various radio access technologies. In some implementations, the wireless communications system 100 may be a 4G network, such as an LTE network or an LTE-Advanced (LTE-A) network. In some other implementations, the wireless communications system 100 may be a NR network, such as a 5G network, a 5G-Advanced (5G-A) network, or a 5G ultrawideband (5G-UWB) network. In other implementations, the wireless communications system 100 may be a combination of a 4G network and a 5G network, or other suitable radio access technology including Institute of Electrical and Electronics Engineers (IEEE) 802.11 (Wi-Fi) , IEEE 802.16 (WiMAX) , IEEE 802.20. The wireless communications system 100 may support radio access technologies beyond 5G, for example, 6G. Additionally, the wireless communications system 100 may support technologies, such as time division multiple access (TDMA) , frequency division multiple access (FDMA) , or code division multiple access (CDMA) , etc.
[0047] The one or more NEs 102 may be dispersed throughout a geographic region to form the wireless communications system 100. One or more of the NEs 102 described herein may be or include or may be referred to as a network node, a base station, a network element, a network function, a network entity, a radio access network (RAN) , a NodeB, an eNodeB (eNB) , a next-generation NodeB (gNB) , or other suitable terminology. An NE 102 and a UE 104 may communicate via a communication link, which may be a wireless or wired connection. For example, an NE 102 and a UE 104 may perform wireless communication (e.g., receive signaling, transmit signaling) over a Uu interface.
[0048] An NE 102 may provide a geographic coverage area for which the NE 102 may support services for one or more UEs 104 within the geographic coverage area. For example, an NE 102 and a UE 104 may support wireless communication of signals related to services (e.g., voice, video, packet data, messaging, broadcast, etc. ) according to one or multiple radio access technologies. In some implementations, an NE 102 may be moveable, for example, a satellite associated with a non-terrestrial network (NTN) . In some implementations, different geographic coverage areas associated with the same or different radio access technologies may overlap, but the different geographic coverage areas may be associated with different NEs 102.
[0049] The one or more UEs 104 may be dispersed throughout a geographic region of the wireless communications system 100. A UE 104 may include or may be referred to as a remote unit, a mobile device, a wireless device, a remote device, a subscriber device, a transmitter device, a receiver device, or some other suitable terminology. In some implementations, the UE 104 may be referred to as a unit, a station, a terminal, or a client, among other examples. Additionally, or alternatively, the UE 104 may be referred to as an Internet-of-Things (IoT) device, an Internet-of-Everything (IoE) device, or machine-type communication (MTC) device, among other examples.
[0050] A UE 104 may be able to support wireless communication directly with other UEs 104 over a communication link. For example, a UE 104 may support wireless communication directly with another UE 104 over a D2D communication link. In some implementations, such as vehicle-to-vehicle (V2V) deployments, vehicle-to-everything (V2X) deployments, or cellular-V2X deployments, the communication link may be referred to as a sidelink. For example, a UE 104 may support wireless communication directly with another UE 104 over a PC5 interface.
[0051] An NE 102 may support communications with the CN 106, or with another NE 102, or both. For example, an NE 102 may interface with other NE 102 or the CN 106 through one or more backhaul links (e.g., S1, N2, N2, or network interface) . In some implementations, the NEs 102 may communicate with each other directly. In some other implementations, the NEs 102 may communicate with each other indirectly (e.g., via the CN 106. In some implementations, one or more NEs 102 may include subcomponents, such as an access network entity, which may be an example of an access node controller (ANC) . An ANC may communicate with the one or more UEs 104 through one or more other access network transmission entities, which may be referred to as radio heads, smart radio heads, or transmission-reception points (TRPs) .
[0052] The CN 106 may support user authentication, access authorization, tracking, connectivity, and other access, routing, or mobility functions. The CN 106 may be an evolved packet core (EPC) , or a 5G core (5GC) , which may include a control plane entity that manages access and mobility (e.g., a mobility management entity (MME) , an access and mobility management function (AMF) ) and a user plane entity that routes packets or interconnects to external networks (e.g., a serving gateway (S-GW) , a Packet Data Network (PDN) gateway (P-GW) , or a user plane function (UPF) ) . In some implementations, the control plane entity may manage non-access stratum (NAS) functions, such as mobility, authentication, and bearer management (e.g., data bearers, signal bearers, etc. ) for the one or more UEs 104 served by the one or more NEs 102 associated with the CN 106.
[0053] The CN 106 may communicate with a packet data network over one or more backhaul links (e.g., via an S1, N2, N2, or another network interface) . The packet data network may include an application server. In some implementations, one or more UEs 104 may communicate with the application server. A UE 104 may establish a session (e.g., a protocol data unit (PDU) session, or the like) with the CN 106 via an NE 102. The CN 106 may route traffic (e.g., control information, data, and the like) between the UE 104 and the application server using the established session (e.g., the established PDU session) . The PDU session may be an example of a logical connection between the UE 104 and the CN 106 (e.g., one or more network functions of the CN 106) .
[0054] In the wireless communications system 100, the NEs 102 and the UEs 104 may use resources of the wireless communications system 100 (e.g., time resources (e.g., symbols, slots, subframes, frames, or the like) or frequency resources (e.g., subcarriers, carriers) ) to perform various operations (e.g., wireless communications) . In some implementations, the NEs 102 and the UEs 104 may support different resource structures. For example, the NEs 102 and the UEs 104 may support different frame structures. In some implementations, such as in 4G, the NEs 102 and the UEs 104 may support a single frame structure. In some other implementations, such as in 5G and among other suitable radio access technologies, the NEs 102 and the UEs 104 may support various frame structures (e.g., multiple frame structures) . The NEs 102 and the UEs 104 may support various frame structures based on one or more numerologies.
[0055] One or more numerologies may be supported in the wireless communications system 100, and a numerology may include a subcarrier spacing and a cyclic prefix. A first numerology (e.g., μ=0) may be associated with a first subcarrier spacing (e.g., 15 kHz) and a normal cyclic prefix. In some implementations, the first numerology (e.g., μ=0) associated with the first subcarrier spacing (e.g., 15 kHz) may utilize one slot per subframe. A second numerology (e.g., μ=1) may be associated with a second subcarrier spacing (e.g., 30 kHz) and a normal cyclic prefix. A third numerology (e.g., μ=2) may be associated with a third subcarrier spacing (e.g., 60 kHz) and a normal cyclic prefix or an extended cyclic prefix. A fourth numerology (e.g., μ=3) may be associated with a fourth subcarrier spacing (e.g., 120 kHz) and a normal cyclic prefix. A fifth numerology (e.g., μ=4) may be associated with a fifth subcarrier spacing (e.g., 240 kHz) and a normal cyclic prefix.
[0056] A time interval of a resource (e.g., a communication resource) may be organized according to frames (also referred to as radio frames) . Each frame may have a duration, for example, a 10 millisecond (ms) duration. In some implementations, each frame may include multiple subframes. For example, each frame may include 10 subframes, and each subframe may have a duration, for example, a 1 ms duration. In some implementations, each frame may have the same duration. In some implementations, each subframe of a frame may have the same duration.
[0057] Additionally or alternatively, a time interval of a resource (e.g., a communication resource) may be organized according to slots. For example, a subframe may include a number (e.g., quantity) of slots. The number of slots in each subframe may also depend on the one or more numerologies supported in the wireless communications system 100. For instance, the first, second, third, fourth, and fifth numerologies (e.g., μ=0, μ=1, μ=2, μ=3, μ=4) associated with respective subcarrier spacings of 15 kHz, 30 kHz, 60 kHz, 120 kHz, and 240 kHz may utilize a single slot per subframe, two slots per subframe, four slots per subframe, eight slots per subframe, and 16 slots per subframe, respectively. Each slot may include a number (e.g., quantity) of symbols (e.g., orthogonal frequency division multiplexing (OFDM) symbols) . In some implementations, the number (e.g., quantity) of slots for a subframe may depend on a numerology. For a normal cyclic prefix, a slot may include 14 symbols. For an extended cyclic prefix (e.g., applicable for 60 kHz subcarrier spacing) , a slot may include 12 symbols. The relationship between the number of symbols per slot, the number of slots per subframe, and the number of slots per frame for a normal cyclic prefix and an extended cyclic prefix may depend on a numerology. It should be understood that reference to a first numerology (e.g., μ=0) associated with a first subcarrier spacing (e.g., 15 kHz) may be used interchangeably between subframes and slots.
[0058] In the wireless communications system 100, an electromagnetic (EM) spectrum may be split, based on frequency or wavelength, into various classes, frequency bands, frequency channels, etc. By way of example, the wireless communications system 100 may support one or multiple operating frequency bands, such as frequency range designations FR1 (410 MHz –7.125 GHz) , FR2 (24.25 GHz –52.6 GHz) , FR3 (7.125 GHz –24.25 GHz) , FR4 (52.6 GHz –114.25 GHz) , FR4a or FR4-1 (52.6 GHz –71 GHz) , and FR5 (114.25 GHz –300 GHz) . In some implementations, the NEs 102 and the UEs 104 may perform wireless communications over one or more of the operating frequency bands. In some implementations, FR1 may be used by the NEs 102 and the UEs 104, among other equipment or devices for cellular communications traffic (e.g., control information, data) . In some implementations, FR2 may be used by the NEs 102 and the UEs 104, among other equipment or devices for short-range, high data rate capabilities.
[0059] FR1 may be associated with one or multiple numerologies (e.g., at least three numerologies) . For example, FR1 may be associated with a first numerology (e.g., μ=0) , which includes 15 kHz subcarrier spacing; a second numerology (e.g., μ=1) , which includes 30 kHz subcarrier spacing; and a third numerology (e.g., μ=2) , which includes 60 kHz subcarrier spacing. FR2 may be associated with one or multiple numerologies (e.g., at least 2 numerologies) . For example, FR2 may be associated with a third numerology (e.g., μ=2) , which includes 60 kHz subcarrier spacing; and a fourth numerology (e.g., μ=3) , which includes 120 kHz subcarrier spacing.
[0060] Distributed multiple input multiple output (MIMO) will be an important part of 6G networks. The distributed MIMO may include both downlink (DL) transmission where multiple TRPs transmit jointly to one of multiple UEs, and UL transmission where multiple UEs transmit jointly to multiple TRPs. For UL transmission where multiple UEs transmit jointly to multiple TRPs, the introduction of a direct link between UEs opens the possibility of cooperation between different UEs. The direct link between UEs may refer to any direct communication technology between UEs. For example, the direct link may include a sidelink, a D2D link, a WiFi link, a Bluetooth link, a SparkLink, or a wired link (e.g., an optical fiber link) . However, compared with Uu link, the direct link between UEs is limited in terms of throughput and delay. Then, how to design an efficient scheme for cooperative (joint) UL transmission which fully utilizes the capacity of the Uu links from the UEs to the TRPs without being bottlenecked by the direct link between the UEs needs to be studied.
[0061] Figure 2 illustrates an exemplary cooperative UL transmission scenario in accordance with aspects of the present disclosure.
[0062] In the example shown in Figure 2, two different UEs (e.g., UE#1 and UE#2) cooperatively transmit the same content or information, such as a file, to a destination node through a network. For example, UE#1 and UE#2 may be two UEs 104 as shown in Figure 1 and the destination node may be an NE 102 as shown in Figure 1. UE#1 and UE#2 may communicate with the network through TRP#1 and TRP#2, respectively. In other words, TRP#1 and TRP#2 may correspond to UE#1 and UE#2, respectively.
[0063] It is assumed that UE#1 intends to send a big file to the destination node through the network. In the case that the UL capacity from UE#1 to TRP#1 is limited, UE#1 may first transmit the file to UE#2 via a direct link (e.g., D2D link) between UE#1 and UE#2 (i.e., the file is shared by UE#1 and UE#2) , hoping to use the additional UL capacity from UE#2 to TRP#2 to transmit the file. With transmitting simultaneously through two UL channels, the aggregated UL capacity increases and the file can be sent to the destination node sooner.
[0064] There may be several solutions for jointly transmitting the file by two UEs.
[0065] As an example, both UE#1 and UE#2 may transmit the entire file, e.g., via two physical uplink shared channels (PUSCHs) (e.g., PUSCH#1 and PUSCH#2) , respectively. In such example, many transmissions from UE#1 and UE#2 may be duplicate, and the destination node may receive the file when one of the two UEs completes transmitting the entire file first. Assuming that the size of the file is L bits, and the average transmission rates of UE#1 and UE#2 to their respective TRPs are T1 bits and T2 bits per second, respectively, then the file is received by the destination node after and the effective throughput of the joint UL transmission is max (T1, T2) . However, such throughput is far from the total throughput from the two UEs, i.e., the sum of their respective throughputs, T1+T2.
[0066] As another example, each of UE#1 and UE#2 transmits half of the file, e.g., via PUSCH#1 and PUSCH#2, respectively. For example, UE#1 may transmit the first half of the file with a size being L / 2 bits, and UE#2 may transmit the second half of the file with a size being L / 2 bits. This reduces redundant transmissions from the two UEs, and the time for the destination node to receive the complete file may be max However, another issue arises when the two UEs have different transmission rates. In theory, the transmission sizes of the two UEs may be assigned based on their respective transmission rates, e.g., bits are assigned to UE#1 and bits are assigned to UE#2. However, it is impossible to know the transmission rates T1 and T2 in advance in a wireless network actually. The transmission rates T1 and T2 are random variables, because the transmission from a UE to a TRP is subject to many factors, such as channel condition and fading, interference, scheduling by the TRP when the TRP is serving more than one UE, etc. These factors make it impossible to accurately predict the transmission rates T1 and T2 during the transmission.
[0067] As yet another example, the two UEs may closely coordinate with each other during the transmission. For example, if ACK or negative acknowledgement (NACK) for each transmission from one UE is known to the other UE, it is possible for the other UE to know which part of the file has been transmitted by one UE, and thus it can transmit another part in its next transmission, thereby avoiding duplicate transmission. However, such solution also has its own technical challenges. For example, in some cases, it is not possible for one UE to receive a physical downlink control channel (PDCCH) containing the scheduling information for the other UE. In the example of Figure 2, UE#1 and UE#2 are served by separate TRPs (e.g., TRP#1 and TRP#2) , respectively. There is no guarantee that PDCCH#1 sent from TRP#1 to UE#1 can be received successfully by UE#2 or PDCCH#2 sent from TRP#2 to UE#2 can be received successfully by UE#1. Even when UE#1 and UE#2 are served by the same TRP, PDCCH#1 and PDCCH#2 may be transmitted using different transmission beams targeting the two UEs in different directions, making it hard for a UE to snoop on PDCCH to the other UE. Although it may be possible for the two UEs to exchange their ACK / NACK through the direct link between them, such exchange will cause additional delay and complication.
[0068] Given the above, how to design an efficient scheme for cooperative UL transmission from multiple UEs needed to be solved.
[0069] Embodiments of the present disclosure provide solutions for cooperative UL transmission from multiple UEs to the network, which may fully utilize the capacity of the Uu links from UEs to TRP (s) without being bottlenecked by the direct link between UEs. In the cooperative UL transmission scheme provided in the embodiments of the present disclosure, there is no need for snooping or frequent exchanges over the direct link between UEs, the transmission of each UE is performed independently of the other UE, and the two UEs can fully utilize their UL transmission bandwidths. Under the aforementioned assumptions for the example of Figure 2, the cooperative UL transmission scheme provided in the embodiments of the present disclosure may achieve an effective transmission rate of T1+T2, and the destination node can recover the transmitted file after time which is a significant reduction of delay from or More details will be described in the following text in combination with the appended drawings.
[0070] The cooperative UL transmission scheme may be designed based on an erasure channel model. An erasure channel is a communication channel where a packet is subject to random deletion (erasure) . A packet is either received correctly by a receiver or is lost in the transmission. This loss may be due to some known or unknown reasons, such as packet loss in the network or packet corruption detected by cyclic redundancy check (CRC) .
[0071] Fountain code is a class of codes developed for the erasure channel. It requires a transmitter to generate coded packets (or blocks) continuously until a receiver has received enough packets (or blocks) to recover the original information. It is called "rateless" because the code rate continuously decreases with the number of transmitted packets. A typical Fountain code should have the following properties:
[0072] · The number of coded packets which can be generated from a given set of input packets (e.g., K input packets) should be sufficiently large.
[0073] · Irrespective of which packets the receiver has received, the receiver should be able to decode the K input packets using any K linearly independent received packets.
[0074] · The encoding and decoding computation cost should be linear.
[0075] Figure 3 illustrates exemplary Fountain codes in accordance with aspects of the present disclosure.
[0076] In the example shown in Figure 3, it is assumed that there are K information blocks (or packets) to be transmitted. The transmitter may use an original generator matrix of Fountain codes to generate a plurality of encoded blocks (or packets) from the K information blocks. In the original generator matrix, each key is represented by a column. Each encoded block may be generated based on a corresponding key and the K information blocks.
[0077] For example, the nth encoded block may be computed with a unique key with a degree d, wherein indicates the position of the jth 1 in the nth column of the original generator matrix. Then, the nth encoded block may be computed as wherein is the th information block, and is an exclusive OR (XOR) operation.
[0078] [Rectified under Rule 91, 11.09.2024]The transmitter may transmit the plurality encoded blocks to the receiver. However, a subset of them (which is represented by white blocks in Figure 3) may be received by the receiver, while the rest (which is represented by black blocks in Figure 3) may be lost in the transmission.
[0079] After the receiver receives N encoded blocks (or packets) which include no less than K innovative blocks, it is able to reconstruct the K information blocks from the received N encoded blocks. An innovative block is a block which is linearly independent with respect to all the blocks that the receiver already has. An innovative block may also be referred to as an independent encoded block. For example, the receiver may construct a new generator matrix by using the keys of the N encoded blocks, which are appended to the corresponding encoded blocks, respectively. As shown in Figure 3, the new generator matrix may have K rows and N columns, wherein each column of the new generator matrix represents a key corresponding to a received encoded block of the received N encoded blocks. Then, the receiver may reconstruct the K information blocks based on the new generator matrix and the received N encoded blocks.
[0080] Typical Fountain codes may include Tornado codes, Luby Transform (LT) codes, Raptor codes, and R10 and RaptorQ (RQ) codes.
[0081] In the cooperative UL transmissions, the UL transmissions from multiple UEs on their PUSCHs are scheduled by separate TRPs (or a same TRP) through their corresponding PDCCHs, and are subject to different transmission rates. An UL transmission may be affected by factors such as fading, interference, scheduled time and / or frequency resources, transmission rank, and the physical (PHY) layer retransmission (e.g., hybrid automatic repeat request (HARQ) ) process. The final effect is that each UE is subject to a random transmission rate on its PUSCH, wherein a number of packets may be not delivered at any time. Although the PHY layer has the HARQ mechanism to guarantee that most of the transmissions are successful, there is no absolute guarantee for all the transmissions. Due to the variable rate of PUSCH transmissions from a UE, the uplink channel from the UE to a corresponding TRP may be considered as a special type of erasure channel, where a packet is subject to random deletion when the PHY layer HARQ process fails to deliver the packet to Layer 2, or the packet has not been transmitted at all due to the slow transmission rate (which can be considered as a special type of deletion) . This makes the Fountain codes particularly useful for the cooperative UL transmissions from multiple UEs. Given this, embodiments of the present application provide solutions for cooperative UL transmissions from multiple UEs by using Fountain codes.
[0082] Figure 4 illustrates a flowchart of an exemplary method for cooperative UL transmissions from a plurality of UEs based on Fountain codes in accordance with aspects of the present disclosure.
[0083] The method in the example of Figure 4 may be performed by a first UE (e.g., UE#1) and one or more second UEs (e.g., UE#2-1 and UE#2-2) , a plurality of TRPs (e.g., TRP#1, TRP#2, and TRP#3) , and a destination node.
[0084] The first UE may intend to transmit information (e.g., a file) to the destination node, and may be referred to as a source-master UE. Each second UE may jointly transmit the information with the first UE to the destination node, and may be referred to as a source-assistant UE. The transmission of the source-assistant UE may be controlled by the source-master UE. Each of the first UE and the one or more second UEs may be served by (or correspond to) a respective TRP. For example, UE#1, UE#2-1, and UE#2-2 may be served by TRP#1, TRP#2, and TRP#3, respectively. In some other examples, different UEs may be served by the same TRP. The destination node may be an NE, e.g., NE 102 in Figure 1. For example, the NE may be a BS, a server, etc.
[0085] Although two second UEs are depicted in Figure 4 for illustrative purpose, it is contemplated that any number of second UEs may be involved in the procedure illustrated in Figure 4. Although the method is illustrated in a system level by three UEs, three TRPs, and a destination node, persons skilled in the art can understand that the operations implemented in the first UE, the two second UEs, the three TRPs, and the destination node can be separately implemented and incorporated by other apparatus with the like functions.
[0086] In step 401, the first UE (e.g., UE#1) may transmit the information which is to be transmitted to the destination node to the one or more second UEs (e.g., UE#2-1 and UE#2-2) . In some embodiments, the first UE may transmit an address or an ID of the destination node along with the information to the one or more second UEs.
[0087] In some examples, the first UE may transmit the information (or along with the address or the ID of the destination node) to the one or more second UEs via a multicast manner.
[0088] In some other examples, the first UE may transmit the information (or along with the address or the ID of the destination node) to the one or more second UEs via a direct link between each of the one or more second UEs and the first UE. For example, UE#1 may transmit the information (or along with the address or the ID of the destination node) to UE#2-1 via a direct link between UE#2-1 and UE#1, and transmit the information (or along with the address or the ID of the destination node) to UE#2-2 via a direct link between UE#2-2 and UE#1. The direct link between two UEs may refer to any direct communication technology between the two UEs. For example, the direct link may include a sidelink, a D2D link, a WiFi link, a Bluetooth link, a SparkLink, or a wired link (e.g., an optical fiber link) . Between two source-assistant UEs (e.g., UE#2-1 and UE#2-2) , there may exist a direct link or may not exist a direct link.
[0089] Consequently, in step 401, each of the one or more second UEs may receive the information to be transmitted to the destination node via a multicast manner or via a direct link between each of the one or more second UEs and the first UE. The information to be transmitted to the destination node may be stored on the first UE and the one or more second UEs.
[0090] In step 402, the first UE may initiate a high layer handshake with the destination node to prepare for transfer of the information. For example, the first UE may transmit, to the destination node, a message indicating a transmission of the information. The message may include at least one of the following: information related to the one or more second UEs, a size of the information, a number (e.g., denoted as N) of a plurality of IBs segmented from the information by the first UE and the one or more second UEs (which will be described in the following text) , or a size (e.g., denoted as M bits) of each IB. As an example, the information related to the one or more second UEs may include ID (s) of the one or more second UEs. Alternatively or Additionally, if the information is transmitted via file transfer protocol (FTP) , the information related to the one or more second UEs may include address (es) of the one or more second UEs such that a transmission control protocol (TCP) or a user datagram protocol (UDP) session with each second UE may be established for transfer of the information.
[0091] Although in the example of Figure 4, step 401 is shown prior to step 402, it is contemplated that step 401 may occur before, simultaneously, or after step 402.
[0092] After transmitting the message indicating the transmission of the information, in step 403, the first UE (e.g., UE#1) may transmit a start message indicating the one or more second UEs (e.g., UE#2-1 and UE#2-2) to start a joint transmission of the information. In some embodiments, the start message may include an address or an ID of the destination node such that each second UE may transmit the information to the destination node. In some embodiments, before transmitting the start message, the first UE may transmit the address or the ID of the destination node along with the information in step 401.
[0093] In some examples, the first UE may transmit the start message to the one or more second UEs via a multicast manner.
[0094] In some other examples, the first UE may transmit the start message to the one or more second UEs via a direct link between each of the one or more second UEs and the first UE. For example, UE#1 may transmit the start message to UE#2-1 via the direct link between UE#2-1 and UE#1, and transmit the start message to UE#2-2 via the direct link between UE#2-2 and UE#1.
[0095] Consequently, in step 403, each of the one or more second UEs may receive the start message from the first UE via a multicast manner or via a direct link between each of the one or more second UEs and the first UE.
[0096] In some embodiments, step 401 may be included in step 403. That is, in step 403, the first UE may transmit the start message along with the information to be transmitted to the destination node to the one or more second UEs via a multicast manner or via a direct link between each of the one or more second UEs and the first UE.
[0097] In step 404, each of the first UE (e.g., UE#1) and the one or more second UEs (e.g., UE#2-1 and UE#2-2) may segment the information to be transmitted into a plurality of IBs with a same size. For example, each of UE#1, UE#2-1, and UE#2-2 may segment the information into N IBs (e.g., denoted as {IB1, IB2, …, IBN} ) and each IB may have M bits.
[0098] Then, also in step 404, each of the first UE and the one or more second UEs may encode the plurality of IBs into one or more CBs (e.g., denoted as {CB1, CB2, …} ) using Fountain codes, wherein each CB is generated based on a corresponding key. For example, each UE may encode the plurality of IBs using Fountain codes as shown in Figure 3. Different UEs may use different keys. The corresponding key for each CB may be appended to each CB.
[0099] Then, in step 405, each of the first UE (e.g., UE#1) and the one or more second UEs (e.g., UE#2-1 and UE#2-2) may transmit the one or more CBs with their corresponding keys to the destination node via a corresponding TRP. For example, in step 405-1, UE#1 may transmit the one or more CBs generated by UE#1 with their corresponding keys (e.g., one CB with its corresponding key a time) to TRP#1 via an uplink channel (e.g., PUSCH) , and then TRP#1 may transmit the received CB (s) to the destination node, e.g., through a core network; in step 405-2, UE#2-1 may transmit the one or more CBs generated by UE#2-1 with their corresponding keys (e.g., one CB with its corresponding key a time) to TRP#2 via an uplink channel (e.g., PUSCH) , and then TRP#2 may transmit the received CB (s) to the destination node, e.g., through the core network; in step 405-3, UE#2-2 may transmit the one or more CBs generated by UE#2-2 with their corresponding keys (e.g., one CB with its corresponding key a time) to TRP#3 via an uplink channel (e.g., PUSCH) , and then TRP#3 may transmit the received CB (s) to the destination node, e.g., through the core network. Steps 405-1, 405-2, and 405-3 may occur simultaneously.
[0100] In some examples of the present disclosure, before transmitting the one or more CBs with their corresponding keys, each of the first UE and the one or more second UEs may encode the one or more CBs with their corresponding keys using a channel encoding scheme, e.g., using low density parity check (LDPC) code. In such examples, the CBs transmitted in step 405 are channel encoded CBs.
[0101] For an uplink channel from a UE (e.g., UE#1, UE#2-1, or UE#2-2) to its corresponding TRP, the existing technology may be used to schedule the uplink channel. In some examples, the UE may perform an automatic repeat request (ARQ) procedure or a hybrid automatic repeat request (HARQ) procedure for each of the one or more CBs transmitted via the uplink channel.
[0102] Each of the first UE and the one or more second UEs may keep transmitting the CBs of the information until it receives an ACK message indicating a successful receipt of the information from the destination node (which will be described in the following text) .
[0103] Consequently, in step 405, the destination node may receive, from the first UE (e.g., UE#1) and the one or more second UEs (e.g., UE#2-1 and UE#2-2) , one or more CBs with their corresponding keys. In some examples, not all CBs transmitted by the UEs can be successfully received by the destination node. For example, the one or more CBs received by the destination node may be part or all of the CBs transmitted by the first UE and the one or more second UEs.
[0104] The designation node may store and keep track of the received one or more CBs. In step 406, the destination node may reconstruct the plurality of IBs based on the received one or more CBs and their corresponding keys. For example, after receiving a sufficient number (e.g., no less than N) of innovative (or independent) CBs, the destination node may reconstruct the N IBs from the innovative CBs and recover the information.
[0105] In response to receiving a sufficient number of CBs (including no less than N innovative CBs) for reconstructing the plurality of IBs or in response to reconstructing the plurality of IBs or in response to recovering the information, either step 407 or step 408 may be performed.
[0106] Step 407 may include steps 407-1 and 407-2. In step 407-1, in response to receiving a sufficient number of CBs for reconstructing the plurality of IBs or in response to reconstructing the plurality of IBs or in response to recovering the information, the destination node may transmit an ACK message (e.g., a high layer message) indicating a successful receipt of the information to the first UE (e.g., UE#1) . In response to receiving the ACK message, the first UE may stop transmission of the one or more CBs of the information.
[0107] After receiving the ACK message from the destination node, in step 407-2, the first UE (e.g., UE#1) may transmit a stop message indicating the one or more second UEs (e.g., UE#2-1 and UE#2-2) to stop the joint transmission of the information. In some embodiments, the first UE may directly forward the ACK message received from the destination node as the stop message to the one or more second UEs.
[0108] In some examples, the first UE may transmit the stop message to the one or more second UEs via a multicast manner.
[0109] In some other examples, the first UE may transmit the stop message to the one or more second UEs via a direct link between each of the one or more second UEs and the first UE. For example, UE#1 may transmit the stop message to UE#2-1 via the direct link between UE#2-1 and UE#1, and transmit the stop message to UE#2-2 via the direct link between UE#2-2 and UE#1.
[0110] Consequently, in step 407-2, each of the one or more second UEs may receive the stop message from the first UE via a multicast manner or via a direct link between each of the one or more second UEs and the first UE. In response to receiving the stop message, each of the one or more second UEs may stop transmission of the one or more CBs of the information.
[0111] Alternatively, step 408 may be performed. In step 408, in response to receiving a sufficient number of CBs for reconstructing the plurality of IBs or in response to reconstructing the plurality of IBs or in response to recovering the information, the destination node may transmit an ACK message (e.g., a high layer message) indicating a successful receipt of the information to each of the first UE (e.g., UE#1) and the one or more second UEs (e.g., UE#2-1 and UE#2-2) . In response to receiving the ACK message, each of the first UE and the one or more second UEs may stop transmission of the one or more CBs of the information.
[0112] After step 407 or 408, each of the first UE and the one or more second UEs may delete the information from the transport layer.
[0113] Figure 5 illustrates an example of cooperative UL transmissions based on Fountain codes in accordance with aspects of the present disclosure.
[0114] In the example shown in Figure 5, two UEs (e.g., UE#1 and UE#2) may cooperatively or jointly transmit information (e.g., a file) to a destination node. UE#1 may be a source-master UE and UE#2 may a source-assistant UE. Although only one source-assistant UE is depicted in Figure 5 for illustrative purpose, it is contemplated that any number of source-assistant UEs may be involved in the procedure illustrated in Figure 5.
[0115] UE#1 may transmit the file to UE#2 via a multicast manner or a direct link between UE#1 and UE#2 to share the file with UE#2. In some examples, UE#1 may transmit an address or an ID of the destination node along with the file to UE#2.
[0116] UE#1 may transmit a message indicating a transmission of the file to the destination node. The message may include at least one of the following: information related to UE#2 (e.g., an ID or an address of UE#2) , a size of the file, a number (e.g., denoted as N) of the plurality of IBs segmented from the file by UE#1 and UE#2, or a size (e.g., denoted as M bits) of each IB.
[0117] After transmitting the message indicating the transmission of the file, UE#1 may transmit a start message indicating UE#2 to start a joint transmission of the file via a multicast manner or the direct link between UE#1 and UE#2. In some embodiments, the start message may include the address or the ID of the destination node such that UE#2 may transmit the file to the destination node.
[0118] Then, each of UE#1 and UE#2 may segment the file into 4 IBs (e.g., IBs #1-#4) with a same size, i.e., N=4.
[0119] After that, each of UE#1 and UE#2 may encode the 4 IBs into one or more CBs using Fountain codes, wherein each CB is generated based on a corresponding key. For example, UE#1 may generate CB#1, CB#3, CB#5, etc., wherein each CB is generated based on a corresponding key and IBs #1-#4. For example, CB#1 may be generated based on an XOR operation for IB#1 and IB#2. Similarly, UE#2 may generate CB#2, CB#4, CB#6, etc., wherein each CB is generated based on a corresponding key and IBs #1-#4. For example, CB#2 may be generated based on an XOR operation for IB#1 and IB#3. Each CB may be appended with its corresponding key.
[0120] Each of UE#1 and UE#2 may encode the one or more CBs with their corresponding keys using LDPC, and then transmit the encoded CBs with their corresponding keys to a corresponding TRP. For example, UE#1 may transmit encoded CB#1, CB#3, CB#5, etc. with their corresponding keys to TRP#1 and UE#2 may transmit encoded CB#2, CB#4, CB#6, etc. with their corresponding keys to TRP#2. For the transmissions from each UE, the existing PUSCH transmission and HARQ (or ARQ) schemes may be applied.
[0121] Not all the CBs generated by UE#1 or UE#2 can be received by the corresponding TRP. For example, some of the CBs (e.g., CB#3) may be garbled and discarded during the transmission, or some of the CBs (e.g., CB#6) may not be transmitted in time before the destination node receives sufficient CBs for reconstructing IBs #1-#4. In the example shown in Figure 5, TRP#1 may receive CB#1 appended with its corresponding key and CB#5 appended with its corresponding key from UE#1, and then transmit the same to the destination node; TRP#2 may receive CB#2 appended with its corresponding key and CB#4 appended with its corresponding key from UE#2, and then transmit the same to the destination node.
[0122] In the example shown in Figure 5, CB#1, CB#2, CB#4, and CB#5 received by the destination node are innovative (or independent) CBs, which means that the destination node receives a sufficient number of CBs for reconstructing IBs #1-#4 (i.e., sufficient innovative CBs) Then, the destination node may reconstruct IBs #1-#4 based on CB#1, CB#2, CB#4, and CB#5 and their corresponding keys, thereby recovering the file. After determining that a sufficient number of CBs for reconstructing IBs #1-#4 has been received, the destination node may transmit an ACK message indicating a successful receipt of the file to UE#1. In response to receiving the ACK message, UE#1 may stop transmission of the one or more CBs of the file.
[0123] After receiving the ACK message from the destination node, UE#1 may transmit a stop message (or forward the ACK message received from the destination node) to UE#2 indicating UE#2 to stop the joint transmission of the file. In response to receiving the stop message (or the ACK message) from UE#1, UE#2 may stop transmission of the one or more CBs of the file.
[0124] Figure 6 illustrates another example of cooperative UL transmissions based on Fountain codes in accordance with aspects of the present disclosure.
[0125] The difference between Figure 6 and Figure 5 only lies in that UE#1 and UE#2 correspond to a same TRP in Figure 6. That is, the TRP may receive CBs with their corresponding keys from both UE#1 and UE#2 and transmit the received CBs to the destination node. Other operations performed by UE#1, UE#2 and the destination node in the example shown in Figure 6 may be the same as those described with respect to Figure 5.
[0126] Figure 7 illustrates yet another example of cooperative UL transmissions based on Fountain codes in accordance with aspects of the present disclosure.
[0127] The difference between Figure 7 and Figure 5 lies in that: in Figure 7, in response to receiving a sufficient number of CBs (e.g., CB#1, CB#2, CB#4, and CB#5) for reconstructing the plurality of IBs of the file, the destination node may transmit an ACK message indicating a successful receipt of the file to both UE#1 and UE#2. In response to receiving the ACK message, UE#1 and UE#2 may stop transmission of the one or more CBs of the file. In the example of Figure 7, UE#1 does not need to transmit a stop message to UE#2. Other operations performed by UE#1, UE#2, TRP#1, TRP#2, and the destination node in the example shown in Figure 7 may be the same as those described with respect to Figure 5.
[0128] Figure 8 illustrates a flowchart of an exemplary method in accordance with aspects of the present disclosure. The operations of the method illustrated in Figure 8 may be performed by a UE (e.g., UE 104 in Figure 1) as described herein or other apparatus with the like functions. In some implementations, the UE may be a first UE which is a source-master UE that intends to transmit information to a destination node.
[0129] As shown in Figure 8, in step 802, the first UE may transmit, to one or more second UEs (e.g., one or more source-assistant UEs) , the information to be transmitted to the destination node through a network. The information may be segmented into a plurality of IBs with a same size for each of the first UE and the one or more second UEs. In some embodiments of the present disclosure, in step 802, the first UE may transmit, to the one or more second UEs, an address or an ID of the destination node along with the information.
[0130] According to some embodiments of the present disclosure, the first UE may transmit the information to the one or more second UEs via a multicast manner or a direct link between each of the one or more second UEs and the first UE.
[0131] According to some embodiments of the present disclosure, the first UE may transmit, to the destination node, a message indicating a transmission of the information, wherein the message includes at least one of: information related to the one or more second UEs, a size of the information, a number of the plurality of IBs, or a size of each IB.
[0132] According to some embodiments of the present disclosure, after transmitting the message indicating the transmission of the information, the first UE may transmit a start message indicating the one or more second UEs to start a joint transmission of the information via a multicast manner or the direct link between each of the one or more second UEs and the first UE.
[0133] In some embodiments of the present disclosure, the start message may include the address or the ID of the destination node. In some embodiments of the present disclosure, before transmitting the start message, the first UE may transmit, to the one or more second UEs, the address or the ID of the destination node along with the information in step 802.
[0134] In step 804, the first UE may encode the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key. For example, the one or more CBs may be generated from the plurality of IBs by using an original generator matrix (e.g., the original generator matrix shown in Figure 3) , wherein the key corresponding to a CB is represented by a corresponding column in the original generator matrix.
[0135] In step 806, the first UE may transmit the one or more CBs with their corresponding keys to the destination node.
[0136] According to some embodiments of the present disclosure, the first UE may perform one of the followings: encoding the one or more CBs with their corresponding keys using a channel encoding scheme; and transmitting the one or more CBs with their corresponding keys to a TRP corresponding to the first UE via an uplink channel.
[0137] According to some embodiments of the present disclosure, the first UE may receive an ACK message indicating a successful receipt of the information from the destination node. The first UE may stop transmission of the one or more CBs in response to receiving the ACK message.
[0138] In some embodiments of the present disclosure, after receiving the ACK message from the destination node, the first UE may transmit, to the one or more second UEs, a stop message indicating the one or more second UEs to stop the joint transmission of the information via a multicast manner or the direct link between each of the one or more second UEs and the first UE.
[0139] According to some embodiments of the present disclosure, the direct link may include a sidelink, a D2D link, a WiFi link, a Bluetooth link, a SparkLink, or a wired link (e.g., an optical fiber link) .
[0140] Figure 9 illustrates a flowchart of an exemplary method in accordance with aspects of the present disclosure. The operations of the method illustrated in Figure 9 may be performed by a UE (e.g., UE 104 in Figure 1) as described herein or other apparatus with the like functions. In some implementations, the UE may be a second UE which is a source-assistant UE.
[0141] As shown in Figure 9, in step 902, the second UE may receive, from a first UE (e.g., a source-master UE) , information to be transmitted to a destination node through a network. The information may be segmented into a plurality of IBs with a same size for each of the first UE and the second UE. In some embodiments of the present disclosure, in step 902, the second UE may receive, from the first UE, an address or an ID of the destination node along with the information.
[0142] According to some embodiments of the present disclosure, the second UE may receive the information from the first UE via a multicast manner or a direct link between the second UE and the first UE.
[0143] According to some embodiments of the present disclosure, the second UE may receive, from the first UE, a start message indicating the second UE to start a joint transmission of the information via a multicast manner or the direct link between the second UE and the first UE.
[0144] In some embodiments of the present disclosure, the start message may include the address or the ID of the destination node. In some embodiments of the present disclosure, before receiving the start message, the second UE may receive, from the first UE, the address or the ID of the destination node along with the information in step 902.
[0145] In step 904, the second UE may encode the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key. For example, the one or more CBs may be generated from the plurality of IBs by using an original generator matrix (e.g., the original generator matrix shown in Figure 3) , wherein the key corresponding to a CB is represented by a corresponding column in the original generator matrix.
[0146] In step 906, the second UE may transmit the one or more CBs with their corresponding keys to the destination node.
[0147] According to some embodiments of the present disclosure, the second UE may perform one of the followings: encoding the one or more CBs with their corresponding keys using a channel encoding scheme; and transmitting the one or more CBs with their corresponding keys to a TRP corresponding to the first UE via an uplink channel.
[0148] According to some embodiments of the present disclosure, the second UE may receive a stop message from the first UE via a multicast manner or the direct link between the second UE and the first UE. The second UE may stop transmission of the one or more CBs in response to receiving the stop message.
[0149] According to some embodiments of the present disclosure, the second UE may receive an ACK message indicating a successful receipt of the information from the destination node. The second UE may stop transmission of the one or more CBs in response to receiving the ACK message.
[0150] Figure 10 illustrates a flowchart of an exemplary method in accordance with aspects of the present disclosure. The operations of the method illustrated in Figure 10 may be performed by a destination node (e.g., NE 102 in Figure 1) as described herein or other apparatus with the like functions. In some implementations, the destination node may be a BS, a server, etc.
[0151] As shown in Figure 10, in step 1002, the destination node may receive, from a plurality of UEs, one or more CBs of information with their corresponding keys. The plurality of UEs may include a first UE (e.g., a source-master UE) and one or more second UEs (e.g., one or more source-assistant UEs) , and the information is segmented into a plurality of IBs with a same size for each of the plurality of UEs. The one or more CBs may be generated by encoding the plurality of IBs using Fountain codes, wherein each CB is based on a key.
[0152] According to some embodiments of the present disclosure, before receiving the one or more CBs, the destination node may receive, from the first UE, a message indicating a transmission of the information. The message may include at least one of: information related to the one or more second UEs, a size of the information, a number of the plurality of IBs, or a size of each IB
[0153] In step 1004, the destination node may reconstruct the plurality of IBs based on the one or more CBs and their corresponding keys. For example, the destination node may construct a new generator matrix (e.g., the new generator matrix shown in Figure 3) by using the keys of the one or more CBs, and reconstruct the plurality of IBs based on the new generator matrix and the one or more CBs.
[0154] According to some embodiments of the present disclosure, the destination node may transmit an ACK message to the first UE or each of the plurality of UEs in response to receiving a sufficient number of CBs for reconstructing the plurality of IBs.
[0155] Figure 11 illustrates an example of a UE 1100 in accordance with aspects of the present disclosure. The UE 1100 may include at least one processor 1102 and at least one memory 1104. Additionally, the UE 1100 may also include one or more of at least one controller 1106 or at least one transceiver 1108. The processor 1102, the memory 1104, the controller 1106, or the transceiver 1108, or various combinations thereof or various components thereof may be examples of means for performing various aspects of the present disclosure as described herein. These components may be coupled (e.g., operatively, communicatively, functionally, electronically, electrically) via one or more interfaces.
[0156] The processor 1102, the memory 1104, the controller 1106, or the transceiver 1108, or various combinations or components thereof may be implemented in hardware (e.g., circuitry) . The hardware may include a processor, a digital signal processor (DSP) , an application-specific integrated circuit (ASIC) , or other programmable logic device, or any combination thereof configured as or otherwise supporting a means for performing the functions described in the present disclosure.
[0157] The processor 1102 may include an intelligent hardware device (e.g., a general-purpose processor, a DSP, a CPU, an ASIC, an FPGA, or any combination thereof) . In some implementations, the processor 1102 may be configured to operate the memory 1104. In some other implementations, the memory 1104 may be integrated into the processor 1102. The processor 1102 may be configured to execute computer-readable instructions stored in the memory 1104 to cause the UE 1100 to perform various functions of the present disclosure.
[0158] The memory 1104 may include volatile or non-volatile memory. The memory 1104 may store computer-readable, computer-executable code including instructions when executed by the processor 1102 cause the UE 1100 to perform various functions described herein. The code may be stored in a non-transitory computer-readable medium such as the memory 1104 or another type of memory. Computer-readable media includes both non-transitory computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A non-transitory storage medium may be any available medium that may be accessed by a general-purpose or special-purpose computer.
[0159] In some implementations, the processor 1102 and the memory 1104 coupled with the processor 1102 may be configured to cause the UE 1100 to perform one or more of the functions described herein (e.g., executing, by the processor 1102, instructions stored in the memory 1104) . For example, the processor 1102 may support wireless communication at the UE 1100 in accordance with examples as disclosed herein. The UE 1100 may be configured to support a means for performing the operations of the methods described in the embodiments of the present disclosure.
[0160] In an embodiment, the UE 1100 may be implemented as a source-master UE. The processor 1102 may be configured to cause the UE 1100 to: transmit, to one or more second UEs, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of IBs with a same size for each of the UE 1100 and the one or more second UEs; encode the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key; and transmit the one or more CBs with their corresponding keys to the destination node.
[0161] In another embodiment, the UE 1100 may be implemented as a source-assistant UE. The processor 1102 may be configured to cause the UE 1100 to: receive, from a first UE, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of IBs with a same size for each of the first UE and the UE 1100; encode the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key; and transmit the one or more CBs with their corresponding keys to the destination node.
[0162] The controller 1106 may manage input and output signals for the UE 1100. The controller 1106 may also manage peripherals not integrated into the UE 1100. In some implementations, the controller 1106 may utilize an operating system such as or other operating systems. In some implementations, the controller 1106 may be implemented as part of the processor 1102.
[0163] In some implementations, the UE 1100 may include at least one transceiver 1108. In some other implementations, the UE 1100 may have more than one transceiver 1108. The transceiver 1108 may represent a wireless transceiver. The transceiver 1108 may include one or more receiver chains 1110, one or more transmitter chains 1112, or a combination thereof.
[0164] A receiver chain 1110 may be configured to receive signals (e.g., control information, data, packets) over a wireless medium. For example, the receiver chain 1110 may include one or more antennas for receive the signal over the air or wireless medium. The receiver chain 1110 may include at least one amplifier (e.g., a low-noise amplifier (LNA) ) configured to amplify the received signal. The receiver chain 1110 may include at least one demodulator configured to demodulate the receive signal and obtain the transmitted data by reversing the modulation technique applied during transmission of the signal. The receiver chain 1110 may include at least one decoder for decoding the demodulated signal to receive the transmitted data.
[0165] A transmitter chain 1112 may be configured to generate and transmit signals (e.g., control information, data, packets) . The transmitter chain 1112 may include at least one modulator for modulating data onto a carrier signal, preparing the signal for transmission over a wireless medium. The at least one modulator may be configured to support one or more techniques such as amplitude modulation (AM) , frequency modulation (FM) , or digital modulation schemes like phase-shift keying (PSK) or quadrature amplitude modulation (QAM) . The transmitter chain 1112 may also include at least one power amplifier configured to amplify the modulated signal to an appropriate power level suitable for transmission over the wireless medium. The transmitter chain 1112 may also include one or more antennas for transmitting the amplified signal into the air or wireless medium.
[0166] Figure 12 illustrates an example of a processor 1200 in accordance with aspects of the present disclosure. The processor 1200 may be an example of a processor configured to perform various operations in accordance with examples as described herein. The processor 1200 may include a controller 1202 configured to perform various operations in accordance with examples as described herein. The processor 1200 may optionally include at least one memory 1204, which may be, for example, a layer 1 (L1) , layer 2 (L2) , or layer 3 (L3) cache. Additionally, or alternatively, the processor 1200 may optionally include one or more arithmetic-logic units (ALUs) 1206. One or more of these components may be in electronic communication or otherwise coupled (e.g., operatively, communicatively, functionally, electronically, electrically) via one or more interfaces (e.g., buses) .
[0167] The processor 1200 may be a processor chipset and include a protocol stack (e.g., a software stack) executed by the processor chipset to perform various operations (e.g., receiving, obtaining, retrieving, transmitting, outputting, forwarding, storing, determining, identifying, accessing, writing, reading) in accordance with examples as described herein. The processor chipset may include one or more cores, one or more caches (e.g., memory local to or included in the processor chipset (e.g., the processor 1200) or other memory (e.g., random access memory (RAM) , read-only memory (ROM) , dynamic RAM (DRAM) , synchronous dynamic RAM (SDRAM) , static RAM (SRAM) , ferroelectric RAM (FeRAM) , magnetic RAM (MRAM) , resistive RAM (RRAM) , flash memory, phase change memory (PCM) , and others) .
[0168] The controller 1202 may be configured to manage and coordinate various operations (e.g., signaling, receiving, obtaining, retrieving, transmitting, outputting, forwarding, storing, determining, identifying, accessing, writing, reading) of the processor 1200 to cause the processor 1200 to support various operations in accordance with examples as described herein. For example, the controller 1202 may operate as a control unit of the processor 1200, generating control signals that manage the operation of various components of the processor 1200. These control signals include enabling or disabling functional units, selecting data paths, initiating memory access, and coordinating timing of operations.
[0169] The controller 1202 may be configured to fetch (e.g., obtain, retrieve, receive) instructions from the memory 1204 and determine subsequent instruction (s) to be executed to cause the processor 1200 to support various operations in accordance with examples as described herein. The controller 1202 may be configured to track memory address of instructions associated with the memory 1204. The controller 1202 may be configured to decode instructions to determine the operation to be performed and the operands involved. For example, the controller 1202 may be configured to interpret the instruction and determine control signals to be output to other components of the processor 1200 to cause the processor 1200 to support various operations in accordance with examples as described herein. Additionally, or alternatively, the controller 1202 may be configured to manage flow of data within the processor 1200. The controller 1202 may be configured to control transfer of data between registers, ALUs, and other functional units of the processor 1200.
[0170] The memory 1204 may include one or more caches (e.g., memory local to or included in the processor 1200 or other memory, such RAM, ROM, DRAM, SDRAM, SRAM, MRAM, flash memory, etc. ) . In some implementations, the memory 1204 may reside within or on a processor chipset (e.g., local to the processor 1200) . In some other implementations, the memory 1204 may reside external to the processor chipset (e.g., remote to the processor 1200) .
[0171] The memory 1204 may store computer-readable, computer-executable code including instructions that, when executed by the processor 1200, cause the processor 1200 to perform various functions described herein. The code may be stored in a non-transitory computer-readable medium such as system memory or another type of memory. The controller 1202 and / or the processor 1200 may be configured to execute computer-readable instructions stored in the memory 1204 to cause the processor 1200 to perform various functions. For example, the processor 1200 and / or the controller 1202 may be coupled with or to the memory 1204, the processor 1200, the controller 1202, and the memory 1204 may be configured to perform various functions described herein. In some examples, the processor 1200 may include multiple processors and the memory 1204 may include multiple memories. One or more of the multiple processors may be coupled with one or more of the multiple memories, which may, individually or collectively, be configured to perform various functions herein.
[0172] The one or more ALUs 1206 may be configured to support various operations in accordance with examples as described herein. In some implementations, the one or more ALUs 1206 may reside within or on a processor chipset (e.g., the processor 1200) . In some other implementations, the one or more ALUs 1206 may reside external to the processor chipset (e.g., the processor 1200) . One or more ALUs 1206 may perform one or more computations such as addition, subtraction, multiplication, and division on data. For example, one or more ALUs 1206 may receive input operands and an operation code, which determines an operation to be executed. One or more ALUs 1206 be configured with a variety of logical and arithmetic circuits, including adders, subtractors, shifters, and logic gates, to process and manipulate the data according to the operation. Additionally, or alternatively, the one or more ALUs 1206 may support logical operations such as AND, OR, exclusive-OR (XOR) , not-OR (NOR) , and not-AND (NAND) , enabling the one or more ALUs 1206 to handle conditional operations, comparisons, and bitwise operations.
[0173] The processor 1200 may support wireless communication in accordance with examples as disclosed herein. The processor 1200 may be configured to or operable to support a means for performing the operations of the methods described in the embodiments of the present disclosure.
[0174] In an embodiment, the controller 1202 may cause the processor 1200 to: transmit, to one or more UEs, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of IBs with a same size for each of the processor and the one or more UEs; encode the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key; and transmit the one or more CBs with their corresponding keys to the destination node.
[0175] In another embodiment, the controller 1202 may cause the processor 1200 to: receive, from a first UE, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of IBs with a same size for each of the first UE and the processor; encode the plurality of IBs into one or more CBs using Fountain codes, wherein each CB is based on a key; and transmit the one or more CBs with their corresponding keys to the destination node.
[0176] In yet another embodiment, the controller 1202 may cause the processor 1200 to: receive, from a plurality of UEs, one or more CBs of information with their corresponding keys through a network, wherein the plurality of UEs include a first UE and one or more second UEs, the information is segmented into a plurality of IBs with a same size for each of the plurality of UEs, the one or more CBs are generated by encoding the plurality of IBs using Fountain codes, and each CB is based on a key; and reconstruct the plurality of IBs based on the one or more CBs and their corresponding keys.
[0177] Figure 13 illustrates an example of an NE 1300 in accordance with aspects of the present disclosure. The NE 1300 may include at least one processor 1302 and at least one memory 1304. Additionally, the NE 1300 may also include one or more of at least one controller 1306 or at least one transceiver 1308. The processor 1302, the memory 1304, the controller 1306, or the transceiver 1308, or various combinations thereof or various components thereof may be examples of means for performing various aspects of the present disclosure as described herein. These components may be coupled (e.g., operatively, communicatively, functionally, electronically, electrically) via one or more interfaces.
[0178] The processor 1302, the memory 1304, the controller 1306, or the transceiver 1308, or various combinations or components thereof may be implemented in hardware (e.g., circuitry) . The hardware may include a processor, a digital signal processor (DSP) , an application-specific integrated circuit (ASIC) , or other programmable logic device, or any combination thereof configured as or otherwise supporting a means for performing the functions described in the present disclosure.
[0179] The processor 1302 may include an intelligent hardware device (e.g., a general-purpose processor, a DSP, a CPU, an ASIC, an FPGA, or any combination thereof) . In some implementations, the processor 1302 may be configured to operate the memory 1304. In some other implementations, the memory 1304 may be integrated into the processor 1302. The processor 1302 may be configured to execute computer-readable instructions stored in the memory 1304 to cause the NE 1300 to perform various functions of the present disclosure.
[0180] The memory 1304 may include volatile or non-volatile memory. The memory 1304 may store computer-readable, computer-executable code including instructions when executed by the processor 1302 cause the NE 1300 to perform various functions described herein. The code may be stored in a non-transitory computer-readable medium such as the memory 1304 or another type of memory. Computer-readable media includes both non-transitory computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A non-transitory storage medium may be any available medium that may be accessed by a general-purpose or special-purpose computer.
[0181] In some implementations, the processor 1302 and the memory 1304 coupled with the processor 1302 may be configured to cause the NE 1300 to perform one or more of the functions described herein (e.g., executing, by the processor 1302, instructions stored in the memory 1304) . For example, the processor 1302 may support wireless communication at the NE 1300 in accordance with examples as disclosed herein. The NE 1300 may be configured to support a means for performing the operations of the methods described in the embodiments of the present disclosure. In an embodiment, the NE 1300 may be implemented as a destination node. The processor 1302 may be configured to cause the NE 1300 to: receive, from a plurality of UEs, one or more CBs of information with their corresponding keys through a network, wherein the plurality of UEs include a first UE and one or more second UEs, the information is segmented into a plurality of IBs with a same size for each of the plurality of UEs, the one or more CBs are generated by encoding the plurality of IBs using Fountain codes, and each CB is based on a key; and reconstruct the plurality of IBs based on the one or more CBs and their corresponding keys.
[0182] The controller 1306 may manage input and output signals for the NE 1300. The controller 1306 may also manage peripherals not integrated into the NE 1300. In some implementations, the controller 1306 may utilize an operating system such as or other operating systems. In some implementations, the controller 1306 may be implemented as part of the processor 1302.
[0183] In some implementations, the NE 1300 may include at least one transceiver 1308. In some other implementations, the NE 1300 may have more than one transceiver 1308. The transceiver 1308 may represent a wireless transceiver. The transceiver 1308 may include one or more receiver chains 1310, one or more transmitter chains 1312, or a combination thereof.
[0184] A receiver chain 1300 may be configured to receive signals (e.g., control information, data, packets) over a wireless medium. For example, the receiver chain 1310 may include one or more antennas for receive the signal over the air or wireless medium. The receiver chain 1310 may include at least one amplifier (e.g., a low-noise amplifier (LNA) ) configured to amplify the received signal. The receiver chain 1310 may include at least one demodulator configured to demodulate the receive signal and obtain the transmitted data by reversing the modulation technique applied during transmission of the signal. The receiver chain 1310 may include at least one decoder for decoding the demodulated signal to receive the transmitted data.
[0185] A transmitter chain 1312 may be configured to generate and transmit signals (e.g., control information, data, packets) . The transmitter chain 1312 may include at least one modulator for modulating data onto a carrier signal, preparing the signal for transmission over a wireless medium. The at least one modulator may be configured to support one or more techniques such as amplitude modulation (AM) , frequency modulation (FM) , or digital modulation schemes like phase-shift keying (PSK) or quadrature amplitude modulation (QAM) . The transmitter chain 1312 may also include at least one power amplifier configured to amplify the modulated signal to an appropriate power level suitable for transmission over the wireless medium. The transmitter chain 1312 may also include one or more antennas for transmitting the amplified signal into the air or wireless medium.
[0186] The description herein is provided to enable a person having ordinary skill in the art to make or use the disclosure. Various modifications to the disclosure will be apparent to a person having ordinary skill in the art, and the generic principles defined herein may be applied to other variations without departing from the scope of the disclosure. Thus, the disclosure is not limited to the examples and designs described herein but is to be accorded the broadest scope consistent with the principles and novel features disclosed herein.
Claims
1.A first user equipment (UE) for wireless communication, comprising:at least one memory; andat least one processor coupled with the at least one memory and configured to cause the first UE to:transmit, to one or more second UEs via a multicast manner or a direct link between each of the one or more second UEs and the first UE, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of information blocks (IBs) with a same size for each of the first UE and the one or more second UEs;encode the plurality of IBs into one or more coded blocks (CBs) using Fountain codes, wherein each CB is based on a key; andtransmit the one or more CBs with their corresponding keys to the destination node.2.The first UE of Claim 1, wherein the at least one processor is further configured to cause the first UE to transmit, to the destination node, a message indicating a transmission of the information, wherein the message includes at least one of: information related to the one or more second UEs, a size of the information, a number of the plurality of IBs, or a size of each IB.3.The first UE of Claim 2, wherein the at least one processor is further configured to cause the first UE to transmit a start message indicating the one or more second UEs to start a joint transmission of the information via a multicast manner or the direct link between each of the one or more second UEs and the first UE after transmitting the message indicating the transmission of the information.4.The first UE of Claim 3, wherein the at least one processor is further configured to cause the first UE to transmit, to the one or more second UEs, an address or an identity (ID) of the destination node along with the information before transmitting the start message, or the start message includes an address or an ID of the destination node.5.The first UE of Claim 1, wherein the at least one processor is further configured to cause the first UE to perform one of the followings:encoding the one or more CBs with their corresponding keys using a channel encoding scheme; andtransmitting the one or more CBs with their corresponding keys to a transmit-receive point (TRP) corresponding to the first UE via an uplink channel.6.The first UE of Claim 1, wherein the at least one processor is further configured to cause the first UE to:receive an acknowledgement (ACK) message indicating a successful receipt of the information from the destination node; andstop transmission of the one or more CBs in response to receiving the ACK message.7.The first UE of Claim 6, wherein the at least one processor is further configured to cause the first UE to transmit, to the one or more second UEs, a stop message indicating the one or more second UEs to stop a joint transmission of the information via a multicast manner or the direct link between each of the one or more second UEs and the first UE after receiving the ACK message from the destination node.8.The first UE of Claim 1, wherein the direct link includes a sidelink, a device-to-device (D2D) link, a wireless fidelity (WiFi) link, a Bluetooth link, a SparkLink, or an optical fiber link.9.A second user equipment (UE) for wireless communication, comprising:at least one memory; andat least one processor coupled with the at least one memory and configured to cause the second UE to:receive, from a first UE via a multicast manner or a direct link between the second UE and the first UE, information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of information blocks (IBs) with a same size for each of the first UE and the second UE;encode the plurality of IBs into one or more coded blocks (CBs) using Fountain codes, wherein each CB is based on a key; andtransmit the one or more CBs with their corresponding keys to the destination node.10.The second UE of Claim 9, wherein the at least one processor is further configured to cause the second UE to receive a start message indicating the second UE to start a joint transmission of the information via a multicast manner or the direct link between the second UE and the first UE.11.The second UE of Claim 10, wherein the at least one processor is further configured to cause the second UE to receive an address or an identity (ID) of the destination node along with the information from the first UE before receiving the start message, or the start message includes an address or an ID of the destination node.12.The second UE of Claim 9, wherein the at least one processor is further configured to cause the second UE to perform one of the followings:encoding the one or more CBs with their corresponding keys using a channel encoding scheme; andtransmitting the one or more CBs with their corresponding keys to a transmit-receive point (TRP) corresponding to the second UE via an uplink channel.13.The second UE of Claim 9, wherein the at least one processor is further configured to cause the second UE to:receive a stop message from the first UE via a multicast manner or the direct link between the second UE and the first UE; andstop transmission of the one or more CBs in response to receiving the stop message.14.The second UE of Claim 9, wherein the at least one processor is further configured to cause the second UE to:receive an acknowledgement (ACK) message indicating a successful receipt of the information from the destination node; andstop transmission of the one or more CBs in response to receiving the ACK message.15.The second UE of Claim 9, wherein the direct link includes a sidelink, a device-to-device (D2D) link, a wireless fidelity (WiFi) link, a Bluetooth link, a SparkLink, or an optical fiber link.16.A destination node for wireless communication, comprising:at least one memory; andat least one processor coupled with the at least one memory and configured to cause the destination node to:receive, from a plurality of user equipments (UEs) , one or more coded blocks (CBs) of information with their corresponding keys through a network, wherein the plurality of UEs include a first UE and one or more second UEs, the information is segmented into a plurality of information blocks (IBs) with a same size for each of the plurality of UEs, the one or more CBs are generated by encoding the plurality of IBs using Fountain codes, and each CB is based on a key; andreconstruct the plurality of IBs based on the one or more CBs and their corresponding keys.17.The destination node of Claim 16, wherein the at least one processor is further configured to cause the destination node to receive, from the first UE, a message indicating a transmission of the information before receiving the one or more CBs, wherein the message includes at least one of: information related to the one or more second UEs, a size of the information, a number of the plurality of IBs, or a size of each IB.18.The destination node of Claim 16, wherein the at least one processor is further configured to cause the destination node to transmit an acknowledgement (ACK) message to the first UE or each of the plurality of UEs in response to receiving a sufficient number of CBs for reconstructing the plurality of IBs.19.A processor for wireless communication, comprising:at least one controller coupled with at least one memory and configured to cause the processor to:transmit, to one or more user equipments (UEs) , information to be transmitted to a destination node through a network, wherein the information is segmented into a plurality of information blocks (IBs) with a same size for each of the processor and the one or more UEs;encode the plurality of IBs into one or more coded blocks (CBs) using Fountain codes, wherein each CB is based on a key; andtransmit the one or more CBs with their corresponding keys to the destination node.
