EP3314949B1 - Appareils et procédés pour relayer des données dans un réseau de communication sans fil - Google Patents

Appareils et procédés pour relayer des données dans un réseau de communication sans fil Download PDF

Info

Publication number
EP3314949B1
EP3314949B1 EP15896483.3A EP15896483A EP3314949B1 EP 3314949 B1 EP3314949 B1 EP 3314949B1 EP 15896483 A EP15896483 A EP 15896483A EP 3314949 B1 EP3314949 B1 EP 3314949B1
Authority
EP
European Patent Office
Prior art keywords
wireless node
payload data
relaying
indicator
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP15896483.3A
Other languages
German (de)
English (en)
Other versions
EP3314949A4 (fr
EP3314949A1 (fr
Inventor
Martin HESSLER
Pål FRENGER
Jonas FRÖBERG OLSSON
Erik Eriksson
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP3314949A1 publication Critical patent/EP3314949A1/fr
Publication of EP3314949A4 publication Critical patent/EP3314949A4/fr
Application granted granted Critical
Publication of EP3314949B1 publication Critical patent/EP3314949B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/155—Ground-based stations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/155—Ground-based stations
    • H04B7/15528—Control of operation parameters of a relay station to exploit the physical medium
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/56—Provisioning of proxy services
    • H04L67/563—Data redirection of data network streams
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/324—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • H04W28/065—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/02—Terminal devices
    • H04W88/04—Terminal devices adapted for relaying to or from another terminal or user
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/56—Routing software
    • H04L45/566—Routing instructions carried by the data packet, e.g. active networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04—Large scale networks; Deep hierarchical networks
    • H04W84/042—Public Land Mobile systems, e.g. cellular systems
    • H04W84/047—Public Land Mobile systems, e.g. cellular systems using dedicated repeater stations

Definitions

  • Embodiments herein relate to apparatuses and methods therein for relaying data in a wireless communications network.
  • UE User Equipments
  • MS Mobile Stations
  • wireless terminals wireless terminals
  • UEs are enabled to communicate wirelessly in a wireless communications network or wireless communication system, sometimes also referred to as a cellular radio system or cellular networks.
  • the communication may be performed e.g. between two UEs, between a mobile station and a regular telephone and/or between a mobile station and a server via a Radio Access Network (RAN) and possibly one or more core networks, comprised within the wireless communications network.
  • RAN Radio Access Network
  • LTE Long Term Evolution
  • UMTS Universal Mobile Telecommunications System
  • GSM Global System for Mobile communications
  • UEs may further be referred to as mobile telephones, cellular telephones, laptops, or tablets with wireless capability, just to mention some further examples.
  • the UEs in the present context may be, for example, portable, pocket-storable, hand-held, computer-comprised, or vehicle-mounted mobile devices, enabled to communicate voice and/or data, via the RAN, with another entity, such as another mobile station or a server.
  • the wireless communications network covers a geographical area which is divided into cell areas, wherein each cell area being served by an access node such as a Base Station (BS), e.g. a Radio Base Station (RBS), which sometimes may be referred to as e.g. "eNB”, “eNodeB”, “NodeB”, “B node”, or BTS (Base Transceiver Station), depending on the technology and terminology used.
  • BS Base Station
  • RBS Radio Base Station
  • eNB Radio Base Station
  • eNodeB eNodeB
  • NodeB Node
  • BTS Base Transceiver Station
  • the base stations may be of different classes such as e.g. macro eNodeB, home eNodeB or pico base station, based on transmission power and thereby also cell size.
  • a cell is the geographical area where radio coverage is provided by the base station at a base station site.
  • One base station, situated on the base station site may serve one or several cells.
  • each base station may support one or several communication technologies.
  • the base stations communicate over the air interface operating on radio frequencies with the UEs within range of the base stations.
  • the expression Downlink (DL) is used for the transmission path from the base station to the mobile station.
  • the expression Uplink (UL) is used for the transmission path in the opposite direction i.e. from the mobile station to the base station.
  • a wireless node When communicating over a wireless link a wireless node needs information about the procedure for receiving data, and in the case of a scheduled Medium Access Control (MAC) protocol also how and when to transmit data.
  • the procedure for receiving data may be governed by transmission parameters.
  • Radio access technologies use scheduled radio access wherein two wireless nodes, such as a base station and a wireless communications device, may send payload data after first negotiating about transmission parameters.
  • the radio access schemes using scheduled radio access aim to be resource efficient for receivers and to avoid collisions on radio resources.
  • LTE will be used here as an example.
  • a UE wants to have access to uplink spectrum in LTE in order to send for example payload data in uplink there is a periodic resource for scheduling requests from the UE.
  • a scheduling request from the UE is followed by an uplink grant sent from the base station to the UE.
  • the uplink grant enables the UE to transmit the payload data in uplink.
  • Figure 1 illustrates parts of a prior art wireless communications network, exemplified as an LTE network.
  • a first base station BS1 may communicate directly with one or more UEs as described above.
  • the first base station BS1 may communicate directly with a first user equipment UE1 or a second user equipment UE2.
  • the first base station BS1 may not transmit data directly to the first user equipment UE1 or the second user equipment UE2, e.g., sometimes the first user equipment UE1 cannot be reached directly for some reason, due to e.g. the physical location of the first user equipment UE1.
  • the first base station BS1 may as an alternative transmit the data intended for reception by the first user equipment UE1 to a second base station BS2, which may relay or forward the data to the first user equipment UE1.
  • a similar relaying method is possible for transmitting data to the second user equipment UE2 via the second base station BS2, or via the first user equipment UE1.
  • the above examples were given for DL communication. However, without going into details similar examples may be given for the UL. Networks making use of such relaying or forwarding as described above may be referred to as multi-hop networks.
  • a multi-hop network is a wireless communications network adopting multi-hop wireless technology without deployment of wired backhaul links.
  • Categories that may be used are for example: relay and mesh.
  • the relay category may have a tree based topology, wherein one end of the path may be a base station.
  • the mesh category has a mesh topology, wherein multiple connections are possible among user equipments.
  • Benefits of multi-hop technology may be:
  • Relaying in multi-hop networks may for example be used when a UE cannot be reached directly and/or for inband self-backhauling.
  • inband self-backhauling a base station uses the same frequency band for the backhaul and for the radio access. This may for example be used when a base station does not have access to wired backhauling.
  • the backhaul portion of the network comprises the intermediate links between the core network and the small subnetworks at the "edge" of the entire hierarchical network.
  • the small subnetworks at the "edge” is in the context of wireless communications networks the radio access network. Sometimes it may be cheaper both in terms of radio resource consumption and in cost to use inband self-backhauling.
  • Inband self-backhauling has been identified to simplify deployments for 5th generation (5G) mobile networks.
  • scheduled radio access communication works well for a single link
  • a MAC forwarding frame comprises a MAC Frame Body including a number of Device Address (DevAddr) fields, a cyclic redundancy check (CRC) field, a frame check sequence (FCS) field and a frame payload field.
  • DevAddr Device Address
  • CRC cyclic redundancy check
  • FCS frame check sequence
  • the DevAddress fields carry the MAC addresses of the devices in forwarding path to the destination device for the frame.
  • the CRC field is utilizied to detect and correct bit errors in fields of the MAC Frame body (excluding the CRC, FCS and frame payload fields).
  • EP 2 343 939 discloses an access node performing a coordinated multipoint (CoMP) transmission with a relay node toward a user equipment.
  • CoMP control information might be transmitted between the relay node and the accss node as a MAC control element that may be concatenated with a MAC PDU from the same user.
  • a frame structure used with the MAC protocol includes one or more MAC protocol data unit (MPDU) fields and a MAP field providing a directory of locations withing the frame structure in which to locate particular MPDUs.
  • the MPDU includes a payload data field which includes data that will eventually be processed by a mobile subscriber.
  • each relaying node independently decodes and forwards a payload packet originating from the transmitting node according to some route or routing algorithm.
  • each relay node independently decodes the payload packet received on one radio link and forwards the payload packet on the next link according to some predetermined route or routing algorithm.
  • the routing decision may for example be configured in the nodes of the multi-hop relay chain, e.g. by a central node.
  • a problem with such prior art solutions for relaying is that a payload packet needs to be brought to a high communication protocol level, e.g. to Internet Protocol (IP) level.
  • IP Internet Protocol
  • the relay node further needs prior knowledge about the radio link that corresponds to the next node or device with an IP-address or to a device with the IP-address in a routing table located in the relay node.
  • the routing table may be obtained for example by setting up radio links to all available nodes and/or devices which is very costly and time consuming.
  • Figure 2 illustrates a prior art solution for multi-hop radio networks using scheduled radio access.
  • a transmitting node such as a UE or an eNodeB
  • a radio link connection towards a receiving entity that it wants to schedule.
  • relaying requires a radio bearer setup procedure via a relaying node. This involves a lot of control signaling before any payload data may be transmitted.
  • Figure 2 illustrates protocol levels of the user plane for a UE, a relaying node and an eNodeB in LTE.
  • IP Internet Protocol
  • PDCP Packet Data Convergence Protocol
  • RLC Radio Link Control
  • MAC Medium Access Control
  • L1 Layer 1
  • GTP-U GPRS Tunneling Protocol
  • UDP User Datagram Protocol
  • L2 Layer 2
  • the network has to configure the relaying node with the protocols in Figure 2 , which involves a lot of signaling. Further, when the relaying node has been configured with the protocols a radio access bearer has to be set up by associating the PDCP instances in the UE and the eNodeB. For this other prior art solution to work the network needs to know which sequence of nodes to configure for relaying.
  • An object of embodiments herein is to improve the performance of a wireless communications network.
  • the performance of the wireless communications network is improved by improving relaying of data, e.g. relaying of data in a multi-hop network.
  • the object is achieved by a method performed by a first wireless node for enabling relaying by a relaying wireless node of data intended for reception by a second wireless node.
  • the first wireless node, second wireless node and relaying wireless node each operate in a wireless communications network.
  • the first wireless node transmits a first payload data to the relaying wireless node.
  • the first payload data comprises a second payload data intended for the second wireless node.
  • the first payload data further comprises an indicator, which indicator indicates to the relaying wireless node how to relay the second payload data, and the indicator comprises parameters related to radio transmission of the second payload data, the parameters including demodulation reference signal assignments.
  • the object is achieved by a method performed by a relaying wireless node for relaying data from a first wireless node and intended for reception by a second wireless node.
  • the first wireless node, second wireless node and relaying wireless node each operate in a wireless communications network.
  • the relaying wireless node receives a first payload data from the first wireless node.
  • the first payload data comprises a second payload data intended for the second wireless node.
  • the first payload data further comprises an indicator, which indicator indicates to the relaying wireless node how to relay the second payload data, and the indicator comprises parameters related to radio transmission of the second payload data, the parameters including demodulation reference signal assignments.
  • the relaying wireless node further relays the second payload data based on the indicator.
  • the object is achieved by a first wireless node configured to operate in a wireless communications network.
  • the first wireless node is configured to perform the method according to the first aspect.
  • the object is achieved by a relaying wireless node configured to operate in a wireless communications network.
  • the relaying wireless node is configured to perform the method according to the second aspect.
  • the first payload data comprises the second payload data and the indicator which indicates to the relaying wireless node how to relay the second payload data, and the indicator comprises parameters related to radio transmission of the second payload data.
  • the indicator indicates to the relaying wireless node how to relay the second payload data and comprises parameters related to radio transmission of the second payload data the relaying wireless node is able to perform relaying of the second payload data without being pre-configured for the relaying.
  • the relaying wireless node is able to relay the second payload data without prior knowledge of the second wireless node and/or the path to the second wireless node.
  • An advantage with embodiments herein is that they enable faster initial transmissions in a relay network.
  • Embodiments herein enable relay nodes to relay payload data without prior knowledge of the path to a target node and without setting up higher protocol level functionality. Further, embodiments herein improve the performance of a wireless communication network by improving relaying of data by a relaying wireless node.
  • FIG. 3 is a schematic block diagram depicting a wireless communications network 300 also known as a radio communications network, a telecommunications network or similar in which embodiments herein may be implemented.
  • the wireless communications network 300 may comprise one or more Radio Access Networks (RAN) and one or more Core Networks (CN).
  • the wireless communications network 300 may use a number of different technologies, such as Long Term Evolution (LTE), LTE-Advanced, Wideband Code Division Multiple Access (WCDMA), Global System for Mobile communications/Enhanced Data rate for GSM Evolution (GSM/EDGE), Worldwide Interoperability for Microwave Access (WiMAX), Bluetooth Low-Energy (BLE), Wi-Fi or Ultra Mobile Broadband (UMB), just to mention a few possible implementations.
  • LTE Long Term Evolution
  • WCDMA Wideband Code Division Multiple Access
  • GSM/EDGE Global System for Mobile communications/Enhanced Data rate for GSM Evolution
  • WiMAX Worldwide Interoperability for Microwave Access
  • BLE Bluetooth Low-Energy
  • UMB
  • a first wireless node 311 may be a base station as depicted in Figure 3 .
  • the first wireless node 311 may for example be capable of communicating with wireless communications devices, such as user equipment, other base stations and core network nodes, such as Mobility Management Entities (MME) that operate in the wireless communications network 300.
  • MME Mobility Management Entities
  • the first wireless node 311 may also be referred to as a radio base station and e.g. a NodeB, an evolved Node B (eNB, eNode B), a base transceiver station, Access Point Base Station, base station router, or any other network unit capable of communicating with wireless communications devices.
  • a second wireless node 322 also operates in the wireless communications network 300.
  • the second wireless node 322 is exemplified herein as a user equipment.
  • the second wireless node 322 may also be known as a mobile station, wireless device, wireless communications device and/or a wireless terminal.
  • user equipment is a non-limiting term which means for example any wireless communications device, wireless terminal, user equipment, Machine Type Communication (MTC) device, a Device to Device (D2D) terminal, or node e.g. Personal Digital Assistant (PDA), laptop, mobile, sensor, relay, mobile tablets or even a small base station.
  • MTC Machine Type Communication
  • D2D Device to Device
  • node e.g. Personal Digital Assistant (PDA), laptop, mobile, sensor, relay, mobile tablets or even a small base station.
  • PDA Personal Digital Assistant
  • the first wireless node 311 wants to communicate with the second wireless node 322, which may also be referred to as a target wireless node. Due to some reason, for example in order to extend the coverage or due to in-band backhauling, the first wireless node 311 wants to communicate with the second wireless node 322 via a relaying wireless node 312.
  • the relaying wireless node 312 is exemplified with a base station.
  • the first wireless node 311 wants to communicate with a third wireless node 323 via for example the relaying wireless node 312 and the second wireless node 322.
  • the third wireless node 323 is exemplified as a user equipment in embodiments herein.
  • the second wireless node 322 may also be referred to as a second relaying wireless node 322.
  • a communication path from the first wireless node 311 to the second wireless node 322 via the relaying wireless node 312 is a multi-hop path 331 to the second wireless node 322.
  • a communication path from the second wireless node 322 to the first wireless node 311 via the relaying wireless node 312 is a multi-hop path 332 to the first wireless node 311.
  • the first wireless node 311, the relaying wireless node 312 and the second wireless node 322 may be regarded as a multi-hop network, sometimes referred to as a relay network.
  • Multi-hop paths to and from the third wireless node 323 are also possible and the third wireless node 323 may also be comprised in the multi-hop network mentioned above or in another multi-hop network comprising one or more of the wireless nodes mentioned above.
  • wireless nodes and other scenarios are of course possible, for example a scenario in which the third wireless node 323 wants to communicate with the relaying wireless node 312 via the second wireless node 322.
  • Other scenarios may comprise further wireless nodes, not shown in Figure 5 , in the multi-hop network.
  • embodiments targeting such other scenarios and arrangements would comprise the same or similar actions as described herein for the two scenarios described above.
  • a method is disclosed herein for enabling relaying by the relaying wireless node 312 of data intended for reception by the second wireless node 322.
  • Embodiments herein enable the relaying wireless node 312 to perform relaying of the second payload data without being pre-configured for the relaying.
  • the relaying wireless node is able to relay the second payload data without prior knowledge of the second wireless node and/or the path to the second wireless node.
  • the indicator A1 may be implemented in L1 or L2/MAC.
  • An advantage of these embodiments is that they enable intermediate wireless nodes, such as the relaying wireless node 312, of the multi-hop network to function without knowledge about functionalities of higher communication protocol levels in the wireless communications network 300, e.g. higher level functionalities in the multi-hop network,.
  • Embodiments herein also save processing resources and reduce the overhead data that is needed to send payload data.
  • the first wireless node 311 transmits the data intended for reception by the second wireless node 322 to the relaying wireless node 312 together with an indicator for the succeeding transmission from the relaying wireless node 312.
  • the indicator for the succeeding transmission is a control message that comprises radio transmission parameters that the relaying wireless node 312 uses in order to relay or forward the data in a radio transmission.
  • the relaying wireless node 312 does not need to be pre-configured with information about the second wireless node 322 or the transmission path to the second wireless node 322.
  • the indicator may e.g. be referred to as a data forward indicator or an indicator for relaying payload data.
  • the indicator may be implemented as a lower layer indicator, i.e. layer 1 (PHY) or layer 2 (MAC) indicator. This enables the relaying wireless node 312 to relay the data without requiring any detailed knowledge about higher level protocols.
  • FIG. 4 schematically illustrates some embodiments herein wherein the indicator is embedded in the payload data.
  • Figure 4 illustrates how a first payload data B0 transmitted to the relaying wireless node 312 may comprise a second payload data B1 intended for reception by the second wireless node 322 and an indicator A1 for the succeeding transmission.
  • the multi-hop network may comprise more than two hops. Embodiments herein may then be used to reach wireless target nodes that are more than two hops away.
  • a wireless target node is e.g. the third wireless node 323 in Figure 3 . Therefore, the second payload data B1 may comprise a third payload data B2 intended for the third wireless node 323, and a second indicator A2 which indicates to the second wireless node 322 how to relay the third payload data B2.
  • the second indicator A2 comprises parameters related to radio transmission of the third payload data B2.
  • the relaying wireless node 312 is an L2 relaying node that performs L2 relaying.
  • Figure 5 illustrates an L2 relaying node in a multi-hop network comprising the first wireless node 311, such as an eNodeB, the L2 relaying wireless node 312 and the second wireless node 322, such as a UE.
  • the indicator A1 may be comprised in a MAC element.
  • Said indicator may further be implemented with one or more embedded MAC headers in a data transmission.
  • the MAC header may point to the indicator and describe what information that is comprised in the indicator.
  • the relaying wireless node 312 is an L1 relaying node that performs L1 forwarding.
  • Figure 6 illustrates an L1 relaying node in a multi-hop network comprising the first wireless node 311, such as an eNodeB, the L2 relaying wireless node 312 and the second wireless node 322, such as a UE. Then the indicator may be encoded separately from payload data intended for reception by the second wireless node 322.
  • the indicator A1 may comprise a transmission format for the second payload data B1, which helps the relaying wireless node 312 to transmit the second payload data B1.
  • the indicator A1 may further comprise a radio resource allocation to use for relaying the second payload data B1.
  • the indicator A1 may also comprise a processing and transmitting method of the second payload data B1, which helps the relaying wireless node 312 to optimize the transmission of the second payload data B1.
  • the indicator A1 may comprise Demodulation reference signal assignments.
  • the Demodulation reference signal assignments are used by the relaying wireless node 312 to enable the second wireless node 322 to decode the second payload data.
  • the indicator A1 comprises a number of layers to use when transmitting the second payload data B1.
  • the layers are related to Multiple Input Multiple Output (MIMO).
  • the indicator A1 comprises instructions relating to how to derive pre-coding for transmission of the second payload data B1.
  • the indicator A1 comprises prioritization information for scheduling of the second payload data B1. This helps the relaying wireless node 312 to prioritize among several second payload data B1.
  • the indicator A1 comprises one or more identities ID1, ID2, ID3, ID4 of wireless nodes 311, 312, 322, 323.
  • the identities may be used as routing information in the multi-hop network. E.g. so that the relaying wireless node 312 is able to relay the second payload data in a dedicated transmission instead of a broadcast or multicast transmission.
  • the processing and transmitting method of the second payload data B1 may comprise any one or more out of: decoding encoded second payload data B1 and L2-forwarding; and L1-forwarding.
  • L1-forwarding may comprise L1-relaying and/or soft-bit remapping as described in more detail below.
  • Figure 7a and Figure 7b illustrate two possible embodiments which will serve to get a general understanding of embodiments herein and to get an overview of actions that take place in the different nodes.
  • Figure 7a illustrate a first embodiment wherein the processing and transmitting method of the second payload data B1 comprises L1-relaying and L1-processing, such as soft-bit remapping.
  • the first wireless node 311 transmits a first assignment As0 on a control channel, such as a Physical Control Channel (PCCH), to the relaying wireless node 312.
  • the assignment As0 relates to the first payload data B0 which is to be transmitted to the relaying wireless node 312.
  • the relaying wireless node 312 may use the assignment As0 to decode the indicator A1.
  • the first wireless node 311 further transmits the first payload data B0 to the relaying wireless node 312 on several data channels. E.g.
  • the indicator A1 may be sent on a first data channel, such as a first Physical Data Channel (PDCH), PDCH1.
  • the second payload data may be sent on a second data channel, such as a second PDCH, PDCH2.
  • the second payload data B1 comprises the third payload data B2 and the second forwarding indicator A2, e.g. when there are more than two hops, the second payload data B1 may be sent on several channels, e.g. one data channel for the second indicator A2 and one data channel for the third payload data B2. This is not shown in Figure 7a .
  • the relaying wireless node 312 decodes the first assignment As0 and uses the decoded information from the first assignment As0 to decode the indicator A1.
  • the indicator A1 comprises instructions on how to process the second payload data B1, e.g. partial decoding for soft-bit remapping.
  • the relaying wireless node 312 then processes the second payload data B1.
  • the relaying wireless node 312 constructs a second assignment As1 by encoding the indicator A1 to be transmitted on the PCCH and transmits the second assignment As1 on the PCCH to the second wireless node 322.
  • the second wireless node 322 decodes the second assignment As1 and uses the decoded information from the second assignment As1 to decode the second payload data B1 transmitted from the relaying wireless node 312.
  • Figure 7b also illustrates one way of transmitting information related to routing in the multi-hop network.
  • information may for example comprise identities of the wireless nodes.
  • the first wireless node 311 may e.g. add its identity ID1 on the first data channel PDCH1.
  • the relaying wireless node 312 decodes the first data channel PDCH1 and obtains the indicator A1, the second indicator A2 and the identity ID1 of the first wireless node 311. Then the relaying wireless node 312 encodes the second assignment As1 based on the indicator A1 and transmits the second assignment As1 on the control channel PCCH.
  • the relaying wireless node 312 further adds its identity ID2 to the data to be transmitted to the second wireless node 322, e.g. to the data sent on the first data channel PDCH1, such as the second indicator A2.
  • the third payload data B2 is processed according to the instructions in the indicator A1.
  • Figure 7c is a combined signalling diagram and flow chart that describes a method for enabling relaying by the relaying wireless node 312 of data intended for reception by the second wireless node 322 according to embodiments herein.
  • Figure 8 is a flowchart that describes a method performed by the first wireless node 311 for enabling relaying by the relaying wireless node 312 of data intended for reception by the second wireless node 322 according to embodiments herein.
  • Figure 9 is a flowchart that describes a method performed by the relaying wireless node 312 for enabling relaying by the relaying wireless node 312 of data intended for reception by the second wireless node 322 according to embodiments herein.
  • the first wireless node 311 receives a payload data D1 originating from the second wireless node 322 and comprising an indication of a multi-hop path 331 to the second wireless node 322.
  • the indication may comprise identities of the wireless nodes in the multi-hop network, such as an identity ID2 of the relaying wireless node 312 and an identity ID3 of the second wireless node 322.
  • the first wireless node 311 may use the indication of the multi-hop path 331 to route a future payload data through the multi-hop path 331 to the second wireless node 322.
  • An advantage with using the known multi-hop path 331 to the second wireless node 322 is that the first wireless node 311 and the relaying wireless node 312 may use dedicated transmissions instead of broadcast transmissions for transmitting the payload data intended for reception by the second wireless node 322. This reduces the used transmission resources in the wireless communications network. Further, having established a communication route, such as the multi-hop path 331, to the second wireless node 322 any method to improve the route to the second wireless node 322 may be utilized. For example, all stored routes or multi-hop paths to the second wireless node 322 may be compared and the route or multi-hop path with the best performance, e.g. with highest throughput and/or capacity, is chosen to transmit a future payload data to the second wireless node 322.
  • the payload data D1 may have been transmitted from the second wireless node 322 to the relaying wireless node 312 for relaying to the first wireless node 311.
  • the payload data D1 may have been comprised in another payload data DO when transmitted from the second wireless node 322.
  • the first wireless node 311 may store the indication of the multi-hop path 331 for future use.
  • the first wireless node 311 Before the first wireless node 311 transmits the first payload data B0 to the relaying wireless node 312 the first wireless node 311 may encode the first payload data B0.
  • the relaying wireless node 312 When the relaying wireless node 312 is to use L1-forwarding the first wireless node 311 encodes the indicator A1 separately from the second payload data B1.
  • Separate channel coding for the indicator A1 and the second payload data B1 may be implemented to enable, for example, L1 relays and/or L1 network coding.
  • a more robust channel coding may be utilized for the indicator A1.
  • An advantage with this is that it enables the relaying wireless node 312 to decode the indicator A1 even if it is not able to decode the second payload data B1.
  • the relaying wireless node 312 knows how to decode the second payload data B1 but may fail.
  • the relaying wireless node 312 does not know anything about the decoding procedure for second payload data B1.
  • Separate channel coding of the indicator A1 and the second payload data B1 enables the relaying wireless node 312 to forward the second payload data B1 towards the target wireless node, such as the second wireless node 322, even if it cannot decode the second payload data B1.
  • This may be used by network coding algorithms. E.g. some data is encoded over one route or multi-hop path, and some other data is encoded over a second route or multi-hop path, and only in the target wireless node, is there sufficient data to decode a message.
  • Another benefit of enabling intermediate relaying nodes to know how to decode the second payload data B1 is that the decoding process may improve the quality of the relayed data, even if the data is not decoded completely. This will be further explained below in action 705.
  • the first network node 311 transmits an assignment As0, e.g. on a control channel such as PCCH, to the relaying wireless node 312.
  • the assignment As0 relates to the first payload data B0 which is to be transmitted to the relaying wireless node 312.
  • the relaying wireless node 312 may use the assignment As0 to decode the indicator A1 below in actions 706, 902.
  • the first wireless node 311 transmits the first payload data B0 to the relaying wireless node 312.
  • the first payload data B0 comprises the second payload data B1 intended for the second wireless node 322 and the indicator A1.
  • the indicator A1 indicates to the relaying wireless node 312 how to relay the second payload data B1, and comprises parameters related to radio transmission of the second payload data B1.
  • the target node is two hops away.
  • An example of such an embodiment is illustrated in Figure 10 where a broadcast or multicast transmission of payload data is implemented by embedding the indicator A1 to be used in a broadcast message BC0.
  • the first wireless node 311 transmits 1001 the assignment As0, e.g. on a control channel such as PCCH to the relaying wireless node 312. Then the first wireless node 311 transmits 1002 a broadcast message BCO comprising the first payload data B0.
  • the first payload data B0 comprises the indicator A1.
  • the broadcast message may be intended for relaying wireless nodes of a specific type, such as type A in Figure 10 .
  • This is indicated in Figure 10 by having the assignment As0 for the broadcast message comprise transmission parameters BCA for transmitting to relaying wireless nodes of type A.
  • the first wireless node 311 may reach the second wireless node 322 through any relaying wireless node of the specific type.
  • type A comprises the relaying wireless node 312.
  • the indicator A1 comprises the identity ID3 of the second wireless node 322.
  • the identity ID3 of the second wireless node 322 enables the relaying wireless node 312 to transmit 1003 an assignment As1, constructed based on the indicator A1 or parts thereof, to the second wireless node 322 with a dedicated transmission. Further, the identity ID3 of the second wireless node 322 enables the relaying wireless node 312 to relay the second payload data B1 in a dedicated transmission 1004 to the second wireless node 322.
  • the multi-hop network may comprise more than two hops.
  • Figure 11 illustrates an embodiment of two hop relaying.
  • the first wireless node 311 embeds both the indicator A1 and the second indicator A2 in a broadcast message BCO for wireless nodes of type A.
  • the indicator A1 comprises transmission parameters for a second broadcast message BD1 for wireless nodes of type B.
  • the first wireless node 311 may reach the third wireless node 323 through any relaying wireless node of type A and any relaying wireless node of type B in that order.
  • type A comprises base stations and type B comprises user equipment.
  • the first wireless node 311 transmits 1101 an assignment As0 to the relaying wireless node 312. Then the first wireless node 311 transmits 1102 the broadcast message BCO and when the relaying wireless node 312 has received the broadcast message BCO it transmits 1103 an assignment comprising the indicator A1 or parts thereof to relaying wireless nodes of type B, such as the second relaying wireless node 322.
  • the relaying wireless node 312 further transmits 1104 the broadcast message BD1 to relaying wireless nodes of type B, such as the second relaying wireless node 322. Then the second relaying wireless node 322 may relay the payload intended for the third wireless node 323 in a dedicated transmission, for example using transmission parameters suitable for the identity ID4 of the third wireless node 323.
  • the first wireless node 311 when the first wireless node 311 have received the indication of the multi-hop path 331, the first wireless node 311 transmits the first payload data B0 comprising the second payload data B1 intended for the second wireless node 322 to the relaying wireless node 312 and further through the multi-hop path 331 based on the received indication of the multi-hop path 331 to the second wireless node 322.
  • the indicator A1 is based on the received indication.
  • the first wireless node 311 has received the indication of the multi-hop path 331.
  • the indication comprises the identity ID2 of the relaying wireless node 312 and the identity ID3 of the second wireless node 322.
  • the first wireless node 311 transmits the first payload data B0 to the relaying wireless node 312.
  • the indicator A1 comprises the identity ID3 of the second wireless node 322.
  • the relaying wireless node 312 then relays the second payload data B1 to the second wireless node 322.
  • the third wireless node 323 is in this case the target wireless node.
  • the indicator A1 may then comprise the identity ID3 of the second wireless node 322, which is now the second relaying wireless node 322, and the identity ID4 of the third wireless node 323. Since the relaying wireless node 312 may be addressed directly from the first wireless node 311 the identity ID2 of the relaying wireless node 312 does not need to be comprised in the indicator A1. When the relaying wireless node 312 receives the indicator A1 with the identities ID3 and ID4, and the second payload data B1, it may remove its own identity ID2 from the indicator A1.
  • the relaying wireless node 312 transmits the second indicator A2 comprising the identity ID4 of the third wireless node 323 to the second wireless node 322, and also forwards the third payload data B2.
  • the second wireless node 322 then forwards the third payload data B2 to the third wireless node 323.
  • the first wireless node 311 also adds or appends its own identity ID1 to the first payload data B0.
  • Figure 12 illustrates how routing information, such as identities of the wireless nodes, may be added or appended to the payload data.
  • the identity ID1 of the first wireless node 311 may be comprised either in the indicator A1 or in the second payload data B1.
  • the routing information may be used by the target wireless node, such as the second wireless node 322, in order to make transmissions over the multi-hop network in the reverse direction.
  • the second wireless node 322 may first store the routing information.
  • the indicator A1 comprises identities of wireless nodes for all hops. In some other embodiments the identities of the wireless nodes being "not-next-hop" is part of the second payload data B1.
  • the indicator A1 comprises identities of wireless nodes for all hops
  • no identity is removed from the indicator. This may for example be the case when a receiver of payload data, such as the target wireless node, may use a multi-hop path in the reverse direction. This is illustrated in Figure 13 and described in more detail below in action 708.
  • the relaying wireless node 312 receives the first payload data B0 from the first wireless node 311.
  • the relaying wireless node 312 when the relaying wireless node 312 implementing embodiments herein receives the first payload data B0 it will transmit the relevant parts of the indicator A1 on PDCCH/EPDCCH if it is logically an eNodeB. If the relaying wireless node 312 is a user equipment, it will read the indicator A1, e.g. if the indicator A1 includes an UL-grant.
  • Such an UL-grant may be of a new type or a standard UL-grant with an extension.
  • the relaying wireless node 312 may decode the indicator A1, e.g. in order to be able to read a content of it.
  • the relaying wireless node 312 may decode the indicator A1 separately from the second payload data B1.
  • the relaying wireless node 312 when the relaying wireless node 312 is to use L1-forwarding and the first wireless node 311 has encoded the indicator A1 separately from the second payload data B1, then the relaying wireless node 312 decodes the indicator A1 separately from the second payload data B1.
  • the relaying wireless node 312 relays the second payload data B1 based on the indicator A1 comprised in the first payload data B0.
  • the first payload data B0 comprises the second payload data B1 intended for the second wireless node 322 and the indicator A1.
  • the indicator A1 indicates to the relaying wireless node 312 how to relay the second payload data B1, and comprises parameters related to radio transmission of the second payload data B1.
  • the indicator A1 comprises instructions to the relaying wireless node 312 how to relay the second payload data B1 the relaying wireless node 312 is able to relay the second payload data B1 without prior knowledge of a path to the second wireless node 322. This improves the performance of the wireless communications network 300. E.g. it enables faster initial transmissions in the wireless communications network 300.
  • the relaying wireless node 312 is able to relay the second payload data B1 without knowledge of higher protocol level functionality. This reduces overhead associated with setting up a traditional protocol chain for a multi-hop network. This also enables the wireless nodes, such as the first wireless node 311, the relaying wireless node 312 and the second wireless node 322, operating in the wireless communications network 300 to use new techniques such as L1 network coding.
  • the indicator A1 may comprise an indication of a multi-hop path to the second wireless node 322.
  • the indicator A1 may comprises an indication of the multi-hop path 331 to the second wireless node 322.
  • the relaying wireless node 312 may relay the second payload data B1 through the multi-hop path 331 to the second wireless node 322.
  • the indicator A1 comprises the processing and transmitting method of the second payload data B1.
  • the processing refers to pre-processing of the second payload data B1 before transmission on the next hop.
  • Pre-processing may for example comprise any linear transformation of the second payload data B1, e.g. linear amplification as illustrated in Figure 14 .
  • the received second payload data B1 comprises a set ⁇ b i ⁇ of received encoded data b i .
  • the set ⁇ b i ⁇ of received encoded data corresponds to a set of transmitted encoded data not shown.
  • the set of transmitted encoded data has been transmitted from the first wireless node 311 on one or more resource elements 1411 for transmission.
  • the resource elements 1411 are comprised in a resource element time-frequency grid schematically illustrated in Figure 14 .
  • the relaying wireless node 312 then performs processing of the second payload data B1.
  • the processing is exemplified by multiplying each encoded data b i with a constant k i in order to produce a scaled output k i b i .
  • This scaled second payload data B1 is then transmitted according to the transmission parameters comprised in the indicator A1.
  • the scaled second payload data B1 is transmitted by the relaying wireless node 312 on one or more second resource elements 1412 for transmission.
  • the one or more second resource elements 1412 used for relaying the scaled second payload data B1 are the same resource elements as the first wireless node 311 used for transmitting the second payload data B1 comprised in the first payload data B0.
  • the one or more second resource elements 1412 used for relaying the scaled second payload data B1 are different resource elements compared to those used by the first wireless node 311 for transmitting the second payload data B1 comprised in the first payload data B0.
  • the second payload data comprises the second indicator A2 and the third payload data B2.
  • the second payload data B1 may then be partially decoded and partially processed.
  • the second payload data B1 may comprise a first subset ⁇ bi 1 ⁇ of encoded data comprising the second indicator A2 and a second subset ⁇ b i2 ⁇ of encoded data comprising the third payload data B2. Then the first subset ⁇ b i1 ⁇ of encoded data may be decoded, while the second subset ⁇ b i2 ⁇ of encoded data may be processed.
  • relaying comprises processing the encoded second payload data B1 and transmitting the encoded second payload data B1.
  • relaying comprises processing part of the encoded second payload data B1 and transmitting part of the encoded second payload data B1.
  • Figure 15 illustrates another embodiment of relaying in which L1-forwarding is used.
  • Figure 15 illustrate how the relaying wireless node 312 may perform soft-bit remapping on the second payload data B1.
  • the relaying wireless node 312 partially decodes the second payload data B1 which means that received symbols ⁇ b i ⁇ are processed to processed symbols ⁇ c i ⁇ before transmission to the second wireless node 322.
  • relaying comprises processing decoded second payload data B1.
  • the relaying wireless node 312 encodes the second payload data B1 for transmission.
  • the relaying wireless node then transmits the processed second payload data B1.
  • relaying comprises processing decoded second payload data B1 and transmitting processed second payload data B1.
  • separate channel coding for the indicator A1 and the second payload data B1 may be implemented to enable, for example, L1 relays and/or L1 network coding. As mentioned above, this may be used by network coding algorithms.
  • the decoding process may improve the quality of the relayed data, even if the data is not decoded completely.
  • the relaying wireless node 312 may improve soft-bits related to the second payload data B1 before relaying the improved soft-bits on a forward link, i.e. towards the second wireless node 322.
  • the soft-bits which are derived from a received signal carrying the second payload data B1 represent an uncertainty in an estimation of the second payload data B1 transmitted from the first wireless node 311.
  • the estimation of the transmitted data may be performed in a decoding action in e.g. the relaying wireless node 312.
  • the transmission on the forward link may be done using the soft-bit information according to any state of the art technique for this type of transmissions.
  • pre-processing of the second payload data B1 is done according to information carried by the forwarding indicator A1. Such information may comprise the method for processing of the second payload data B1.
  • the relaying wireless node 312 will be able to decode the indicator A1 even if it is not able to decode the second payload data B1.
  • the relaying wireless node 312 transmits the second payload data B1 as received, based on the indicator A1, e.g. according to the instructions in the indicator A1. I.e. in these embodiments the relaying wireless node 312 transmits the second payload data B1 without processing the second payload data B1. In other words, in these embodiments relaying comprises transmitting the second payload data B1.
  • Figure 16 illustrates that relaying may also comprise encoding the second payload data B1.
  • the relaying wireless node 312 encodes the second payload data B1 to a dedicated transmission format DT1, which is different from the broadcast transmission format used by the first wireless node 311 to transmit the second payload data B1.
  • a broadcasted message requires an encoding format that enables reception in all broadcasted relaying wireless nodes.
  • a dedicated message is a message encoded differently compared with the broadcasted message and which is optimized for the receiver of the message.
  • the first wireless node 311 may broadcast the first payload data B0 when it does not know how to reach the second wireless node 322.
  • the first wireless node 311 may transmit the first payload data B0 without first establishing a path to the second wireless node 322, which may be time consuming.
  • the relaying node 312 knows how to reach the second wireless node 322 it is more radio resource efficient to use a dedicated message, i.e. a dedicated transmission.
  • Figure 12 illustrates how routing information, such as identities of the wireless nodes, may be added or appended to the payload data.
  • the routing information may be used by the target wireless node, such as the second wireless node 322, in order to make transmissions over the multi-hop network in the reverse direction.
  • the relaying wireless node 312 may add an indication of the multi-hop path 332 to the first wireless node 311 to the second payload data B1. Adding may be performed in several ways.
  • the relaying wireless node 312 unpacks a received MAC element comprising the indicator A1 and then constructs a new MAC element comprising the indication of the multi-hop path 332 to the first wireless node 311.
  • the new MAC element may be transmitted on a data channel separate from the second payload data, e.g. PDCH1 as in Figure 7b .
  • adding may comprise appending a data field in the second payload data B1.
  • the indication of the multi-hop path 332 to the first wireless node 311 may comprise an identity ID2 of the relaying wireless node 312.
  • the relaying wireless node 312 may transmit an assignment As1 with information on how to decode the second payload data B1.
  • the second wireless node 322 may store the indication of the multi-hop path 332 to the first wireless node 311 for future use, e.g. for communicating with the first wireless node 311 using dedicated transmissions as illustrated in Figure 13 .
  • the first wireless node 311 adds 1201 its identity ID1 to the indication of the multi-hop path 332 to the first wireless node 311.
  • the indication of the multi-hop path 332 is comprised in the first payload data B0, e.g. comprised in the indicator A1 or transmitted on the same channel as the indicator A1, e.g. on a first PDCH.
  • the first wireless node 311 then transmits 1202 the assignment As0 as a broadcast message, which is received by the relaying wireless node 312.
  • the first wireless node 311 further transmits 1203 the first payload data BCO as a broadcast or multicast message intended for relaying nodes of type A.
  • the indicator A1 comprised in the first payload data B0 may be sent on a first PDCH, while the second payload data B1 may be sent on a second PDCH.
  • the relaying wireless node 312 receives the first payload data B0.
  • the relaying wireless node 312 then adds 1204 its identity ID2 to the multi-hop path 332 to the first wireless node 311. If the first wireless node 311 has not added its identity then the relaying wireless node 312 may also add the identity ID1 of the first wireless node 311.
  • the relaying wireless node 312 transmits the second assignment As1 in a dedicated transmission to the second wireless node 322.
  • the relaying wireless node 312 further transmits 1206 the second payload data B1 in a dedicated transmission to the second wireless node 322, e.g. on a PDCH.
  • the relaying wireless node 312 also transmits the multi-hop path 332 to the first wireless node 311, e.g.
  • the second wireless node 322 stores the path to the first wireless node 311 by storing a combination of the identity ID1 of the first wireless node 311 and the identity ID2 of the relaying wireless node 312. The stored combination matches the order of the wireless nodes in the multi-hop path.
  • Figure 13 illustrates how the second wireless node 322 may use the added routing information when transmitting a payload data D1 intended for the first wireless node 311 in the reverse direction.
  • the assignment actions are not shown for simplicity.
  • the second wireless node 322 transmits 1301 the payload data D1 intended for the first wireless node 311 in a dedicated transmission to the relaying wireless node 312 using transmission parameters suitable for the relaying wireless node 312 identified with its identity ID2.
  • the relaying wireless node 312 then transmits 1302 the payload data D1 intended for the first wireless node 311 in a dedicated transmission to the first wireless node 311 using transmission parameters suitable for the first wireless node 311 identified with its identity ID1.
  • g j and f j are encoding functions.
  • the inverse functions to g j and f j are known to node D j while the inverse of g i is known by node D i .
  • M1 comprises an UL relaying grant for the relaying wireless node 312.
  • M2 comprises an UL grant for the second wireless node 322.
  • M1 may also comprise parameters for receiving an UL transmission from the second wireless node 322.
  • the first wireless node 311 wants to transmit the message M i to the wireless node D i .
  • the inverse function to f j is known to the devices in S while the inverse function to g i is known to D i .
  • the inverse function may for example be the decoding procedure to extract the data that should be forwarded according to the data forward procedure in the indicator.
  • the modification functions may also be referred to as processing functions. I.e. they are related to the processing of the payload data mentioned above.
  • An alternative way to describe embodiments herein is by scheduling a receiver, such as the relaying wireless node 312, to transmit from a specified data-queue.
  • a receiver such as the relaying wireless node 312
  • receiving an uplink grant maps data from either higher layer buffers, such as MAC/RLC buffers, down to a HARQ buffer if the transmission is signaled as a new data transmission, or directly from the HARQ retransmission buffer if it is a retransmission.
  • one more data-sources may be added. Data may be mapped from the concurrent received transmission from the first wireless node 311. This data may for different embodiments be mapped into different layers in a decoder-chain.
  • the relaying wireless node 312 operates as an L1 relay, and the data is mapped directly to physical layer symbols as illustrated in Figure 14 .
  • the data may be demodulated and re-modulated, de-coded/recoded or even mapped into HARQ buffers.
  • different nodes transmit the hierarchical header and the data the inner header grant is pointing to.
  • a use-case is uplink relaying where the relaying wireless node 312 receives a reception order message, where the reception order refers to a data transmission from a UE, such as the second wireless node 322, lower in the relay chain.
  • the reception order message also comprises a transmission order message where the relaying wireless node 312 is instructed to transmit the data just received.
  • the indicator A i comprises an L2 indicator, a DeModulation Reference Signal (DMRS) assignment, a Cyclic Redundancy Check (CRC) information field, e.g. UE-identity, a receiver specific control channel search space and a Sounding Reference Signal (SRS) resource.
  • DMRS DeModulation Reference Signal
  • CRC Cyclic Redundancy Check
  • UE-identity e.g. UE-identity
  • SRS Sounding Reference Signal
  • the relaying wireless node 312 After the relaying wireless node 312 has finished decoding the indicator A i the relaying wireless node 312 reads the content of the indicator A i , places the decoded data in a transmit-buffer, e.g. a transmit buffer for L2 data forwarding. In some embodiments the relaying wireless node 312 also decodes the payload data B i .
  • the relaying wireless node 312 measures on the SRS resource to make a link adaptation, makes a channel estimate and uses the channel estimate to make a link adaptation decision. Further, using the link adaptation decision and the DMRS and the CRC, the relaying wireless node 312 constructs a control message to be sent on a control channel within a search space for the receiver. The receiver will perform a number of decoding attempts for each of the candidates of the search space.
  • the control channel may be a PCCH. Examples of PCCH are PDCCH and ePDCCH.
  • the relaying wireless node 312 further constructs a DMRS-based data transmission granted on ePDCCH, for the assigned resources.
  • the indicator A i comprises an L1 indicator, an indicator to use direct soft-bit remapping and a time-frequency resource for transmitting the remapped soft-bits.
  • Direct soft-bit remapping means that a that the relaying wireless node 312 re-uses the same set of symbols of the same type for transmitting the second payload data B1 is as the first wireless node 311 used for the transmission of the second payload data B1 to the relaying wireless node 312. Then the relaying wireless node 312 stores the soft-bits, e.g. 4 soft-values per 16 Quadrature Amplitude Modulation (QAM) symbol, for the reception.
  • QAM Quadrature Amplitude Modulation
  • the relaying wireless node 312 then remaps the soft-bits to the time-frequency resource and transmits on the assigned time-frequency resource.
  • the relaying wireless node 312 may receive data on resource blocks 0..9 using 16 QAM, i.e. 4 soft-values per resource element.
  • the transmit resource may then be resource blocks 10..29 using QPSK. This means that each 4 soft-values from an 16QAM symbol are remapped to two QPSK symbols and hence the 10 resource blocks are transformed into 20 resource blocks in the transmission.
  • the first wireless node 311 comprises the following arrangement depicted in Figure 18 .
  • the first wireless node 311 is configured to operate in the wireless communications network 300.
  • the first wireless node 311 is configured to, e.g. by means of the transmitting module 1810 configured to, transmit the first payload data B0 to the relaying wireless node 312.
  • the first payload data B0 comprises the second payload data B1 intended for the second wireless node 322 and the indicator A1.
  • the indicator A1 indicates to the relaying wireless node 312 how to relay the second payload data B1, and comprises parameters related to radio transmission of the second payload data B1.
  • the indicator A1 is comprised in a MAC element.
  • the indicator A1 may comprise any one or more out of:
  • the processing and transmitting method of the second payload data B1 comprises any one or more out of:
  • the second payload data B1 comprises the third payload data B2 intended for the third wireless node 323, and the second indicator A2.
  • the second indicator A2 indicates to the second wireless node 322 how to relay the third payload data B2.
  • the second indicator A2 comprises parameters related to radio transmission of the third payload data B2.
  • the first wireless node 311 may transmit the first payload data B0 comprising the second payload data B1 intended for the second wireless node 322 to the relaying wireless node 312 and further through the multi-hop path 331 based on the received indication of the multi-hop path 331 to the second wireless node 322. Then the indicator A1 is based on the received indication.
  • the transmitting module 1810 may be implemented by a transmitter or a processor 1880 in the first wireless node 311.
  • the first wireless node 311 is further configured to, e.g. by means of the encoding module 1820 configured to, encode the indicator A1 separately from the second payload data B1.
  • the encoding module 1820 may be implemented by the processor 1880 in the first wireless node 311.
  • the first wireless node 311 may further be configured to, e.g. by means of the receiving module 1830 configured to, receive a payload data D1 originating from the second wireless node 322 and comprising an indication of a multi-hop path 331 to the second wireless node 322.
  • the receiving module 1830 may be implemented by the processor 1880 in the network node 311, 115.
  • the embodiments herein for enabling relaying by the relaying wireless node 312 of data intended for reception by the second wireless node 322 may be implemented through one or more processors, such as the processor 1880 in the first wireless node 311 depicted in Figure 18 together with computer program code for performing the functions and actions of the embodiments herein.
  • the program code mentioned above may also be provided as a computer program product 1891 for instance in the form of a data carrier carrying computer program code 1892 for performing the embodiments herein when being loaded into the first wireless node 311.
  • One such carrier may be in the form of a CD ROM disc. It is however feasible with other data carriers such as a memory stick.
  • the computer program code may furthermore be provided as pure program code on a server and downloaded to.
  • the methods according to the embodiments described herein for the first wireless node 311 may be implemented by means of a computer program product, comprising instructions, i.e., software code portions, which, when executed on at least one processor, cause the at least one processor to carry out the actions described herein, as performed by the first wireless node 311.
  • the computer program product may be stored on a computer-readable storage medium.
  • the computer-readable storage medium, having stored there on the computer program may comprise the instructions which, when executed on at least one processor, cause the at least one processor to carry out the actions described herein, as performed by the first wireless node 311.
  • the computer-readable storage medium may be a non-transitory computer-readable storage medium.
  • the transmitting module 1810, the encoding module 1820 and the receiving module 1830 described above may refer to a combination of analogue and digital circuits, and/or one or more processors configured with software and/or firmware, e.g. stored in a memory 1890 that when executed by the one or more processors such as the processor 1880 perform as described above.
  • processors as well as the other digital hardware, may be included in a single ASIC, or several processors and various digital hardware may be distributed among several separate components, whether individually packaged or assembled into a SoC.
  • the first wireless node 311 may further be configured to, e.g. by means of the memory 1890 configured to, store for example, the payloads, the indicators, such as MAC elements and/or MAC headers, indications of multi-hop paths, identities of relaying wireless nodes and configuration, transmission formats for the second payload data B1, radio resource allocations to use for relaying the second payload data B1, processing and transmitting methods of the second payload data B1, Demodulation reference signal assignments, number of layers to use when transmitting the second payload data B1, instructions relating to how to derive pre-coding for transmission of the second payload data B1, prioritization information for scheduling of the second payload data B1, schedulings and applications etc. to perform the methods herein when being executed in the first wireless node 311.
  • the memory 1890 comprises one or more memory units.
  • the relaying wireless node 312 comprises the following arrangement depicted in Figure 19 .
  • the relaying wireless node 312 is configured to operate in the wireless communications network 300.
  • the relaying wireless node 312 is configured to, e.g. by means of the receiving module 1910 configured to, receive the first payload data B0 from the first wireless node 311.
  • the first payload data B0 comprises the second payload data B1 intended for the second wireless node 322 and the indicator A1.
  • the indicator A1 indicates to the relaying wireless node 312 how to relay the second payload data B1, and comprises parameters related to radio transmission of the second payload data B1.
  • the indicator A1 is comprised in a MAC element.
  • the indicator A1 may comprise any one or more out of:
  • the processing and transmitting method of the second payload data B1 comprises any one or more out of:
  • the second payload data B1 comprises the third payload data B2 intended for the third wireless node 323, and the second indicator A2.
  • the second indicator A2 indicates to the second wireless node 322 how to relay the third payload data B2 and comprises parameters related to radio transmission of the third payload data B2.
  • the receiving module 1910 may be implemented by a receiver or a processor 1980 in the relaying wireless node 312.
  • the relaying wireless node 312 is further configured to, e.g. by means of the relaying module 1820 configured to, relay the second payload data B1 based on the indicator A1.
  • the indicator A1 comprises an indication of the multi-hop path 331 to the second wireless node 322. Then the relaying wireless node 312 is further configured to relay the second payload data B1 through the multi-hop path 331 to the second wireless node 322.
  • the relaying wireless node 312 is configured to relay the second payload data B1 by being configured to transmit the second payload data B1.
  • the second payload data B1 and the indicator A1 are encoded separately. Then the relaying wireless node 312 may be configured to relay the second payload data B1 by being configured to process the encoded second payload data B1 and transmit the encoded second payload data B1.
  • the relaying wireless node 312 is configured to relay the second payload data B1 by being configured to process decoded second payload data B1 and transmit processed second payload data B1.
  • the relaying module 1920 may be implemented by the processor 1980 in the relaying wireless node 312.
  • the relaying wireless node 312 is further configured to, e.g. by means of the decoding module 1930 configured to, decode the indicator A1 separately from the second payload data B1.
  • the decoding module 1930 may be implemented by the processor 1980 in the relaying wireless node 312.
  • the relaying wireless node 312 may further be configured to, e.g. by means of the adding module 1930 configured to, add the indication of the multi-hop path 332 to the first wireless node 311 to the second payload data B1.
  • the adding module 1930 may be implemented by the processor 1980 in the relaying wireless node 312.
  • the embodiments herein for relaying data from the first wireless node 311 and intended for reception by the second wireless node 322 may be implemented through one or more processors, such as the processor 1980 in the relaying wireless node 312 depicted in Figure 19 together with computer program code for performing the functions and actions of the embodiments herein.
  • the program code mentioned above may also be provided as a computer program product 1991 for instance in the form of a data carrier carrying computer program code 1992 for performing the embodiments herein when being loaded into the relaying wireless node 312.
  • One such carrier may be in the form of a CD ROM disc. It is however feasible with other data carriers such as a memory stick.
  • the computer program code may furthermore be provided as pure program code on a server and downloaded to.
  • the methods according to the embodiments described herein for the relaying wireless node 312 may be implemented by means of a computer program product, comprising instructions, i.e., software code portions, which, when executed on at least one processor, cause the at least one processor to carry out the actions described herein, as performed by the relaying wireless node 312.
  • the computer program product may be stored on a computer-readable storage medium.
  • the computer-readable storage medium, having stored there on the computer program may comprise the instructions which, when executed on at least one processor, cause the at least one processor to carry out the actions described herein, as performed by the relaying wireless node 312.
  • the computer-readable storage medium may be a non-transitory computer-readable storage medium.
  • the receiving module 1910, the relaying module 1920 and the decoding module 1930 and the adding module 1940 described above may refer to a combination of analogue and digital circuits, and/or one or more processors configured with software and/or firmware, e.g. stored in a memory 1990 that when executed by the one or more processors such as the processor 1980 perform as described above.
  • processors as well as the other digital hardware, may be included in a single ASIC, or several processors and various digital hardware may be distributed among several separate components, whether individually packaged or assembled into a SoC.
  • the relaying wireless node 312 may further be configured to, e.g. by means of the memory 1990 configured to, store for example, the payloads, the indicators, such as MAC elements and/or MAC headers, indications of multi-hop paths, identities of relaying wireless nodes and configuration, transmission formats for the second payload data B1, radio resource allocations to use for relaying the second payload data B1, processing and transmitting methods of the second payload data B1, Demodulation reference signal assignments, number of layers to use when transmitting the second payload data B1, instructions relating to how to derive pre-coding for transmission of the second payload data B1, prioritization information for scheduling of the second payload data B1, schedulings and applications etc. to perform the methods herein when being executed in the relaying wireless node 312.
  • the memory 1990 comprises one or more memory units.
  • Embodiments herein may be enabled as a 5G function but may also be added to legacy standards such as LTE or WiFi.
  • a channel coding of the MAC header and the remapping of the data in the forward data transmission may be different depending on the radio standard.

Landscapes

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

Claims (15)

  1. Procédé effectué par un premier noeud sans fil (311) pour permettre le relais, par un noeud sans fil de relais (312), de données destinées à être reçues par un deuxième noeud sans fil (322), chacun du premier noeud sans fil (311), du deuxième noeud sans fil (322) et du noeud sans fil de relais (312) fonctionnant dans un réseau de communication sans fil (300), le procédé comprenant :
    la transmission (705, 805) de premières données de charge utile (B0) à destination du noeud sans fil de relais (312), les premières données de charge utile (B0) comprenant des deuxièmes données de charge utile (B1) destinées au deuxième noeud sans fil (322), et les premières données de charge utile (B0) comprenant en outre un indicateur (A1), l'indicateur (A1) indiquant, au noeud sans fil de relais (312), comment relayer les deuxièmes données de charge utile (B1), et l'indicateur (A1) comprenant des paramètres relatifs à une transmission radio des deuxièmes données de charge utile (B1), caractérisé en ce que les paramètres incluent des assignations de signal de référence de démodulation.
  2. Procédé selon la revendication 1, comprenant en outre :
    la réception (701, 801), avant la transmission des premières données de charge utile (B0), de données de charge utile (D1) provenant du deuxième noeud sans fil (322) et comprenant une indication d'une voie à plusieurs sauts (331) jusqu'au deuxième noeud sans fil (322), et
    la transmission (705, 805) des premières données de charge utile (B0), comprenant les deuxièmes données de charge utile (B1) destinées au deuxième noeud sans fil (322), à destination du noeud sans fil de relais (312), dans lequel l'indicateur de transfert de données (A1) est basé sur l'indication reçue indiquant la voie à plusieurs sauts incluant le noeud sans fil de relais (312) jusqu'au deuxième noeud sans fil (322).
  3. Premier noeud sans fil (311) pour permettre le relais, par un noeud sans fil de relais (312), de données destinées à être reçues par un deuxième noeud sans fil (322), chacun du premier noeud sans fil (311), du deuxième noeud sans fil (322) et du noeud sans fil de relais (312) étant configuré pour fonctionner dans un réseau de communication sans fil (300), le premier noeud sans fil (311) étant en outre configuré pour :
    la transmission de premières données de charge utile (B0) à destination du noeud sans fil de relais (312), les premières données de charge utile (B0) comprenant des deuxièmes données de charge utile (B1) destinées au deuxième noeud sans fil (322), et les premières données de charge utile (B0) comprenant en outre un indicateur (A1), l'indicateur (A1) indiquant, au noeud sans fil de relais (312), comment relayer les deuxièmes données de charge utile (B1), et l'indicateur (A1) comprenant des paramètres relatifs à une transmission radio des deuxièmes données de charge utile (B1), caractérisé en ce que les paramètres incluent des assignations de signal de référence de démodulation.
  4. Premier noeud sans fil (311) selon la revendication 3, dans lequel l'indicateur (A1) est compris dans un élément de commande d'accès au support, MAC.
  5. Premier noeud sans fil (311) selon la revendication 3 ou 4, configuré en outre pour le codage de l'indicateur (A1) séparément des deuxièmes données de charge utile (B1).
  6. Premier noeud sans fil (311) selon l'une quelconque des revendications 3 à 5, dans lequel les deuxièmes données de charge utile (B1) comprennent des troisièmes données de charge utile (B2) destinées à un troisième noeud sans fil (323), et un deuxième indicateur (A2) qui indique, au deuxième noeud sans fil (322), comment relayer les troisièmes données de charge utile (B2), le deuxième indicateur (A2) comprenant des paramètres relatifs à une transmission radio des troisièmes données de charge utile (B2).
  7. Premier noeud sans fil (311) selon l'une quelconque des revendications 3 à 6, configuré en outre pour :
    la réception, avant la transmission des premières données de charge utile (B0), de données de charge utile (D1) provenant du deuxième noeud sans fil (322) et comprenant une indication d'une voie à plusieurs sauts (331) jusqu'au deuxième noeud sans fil (322), et
    la transmission des premières données de charge utile (B0), comprenant les deuxièmes données de charge utile (B1) destinées au deuxième noeud sans fil (322), à destination du noeud sans fil de relais (312), dans lequel l'indicateur de transfert (A1) est basé sur l'indication reçue indiquant la voie à plusieurs sauts incluant le noeud sans fil de relais (312) jusqu'au deuxième noeud sans fil (322).
  8. Procédé effectué par un noeud sans fil de relais (312) pour relayer des données, provenant d'un premier noeud sans fil (311) et destinées à être reçues par un deuxième noeud sans fil (322), chacun du premier noeud sans fil (311), du deuxième noeud sans fil (322) et du noeud sans fil de relais (312) fonctionnant dans un réseau de communication sans fil (300), le procédé comprenant :
    la réception (705, 901) de premières données de charge utile (B0) en provenance du premier noeud sans fil (311), les premières données de charge utile (B0) comprenant des deuxièmes données de charge utile (B1) destinées au deuxième noeud sans fil (322), et les premières données de charge utile (B0) comprenant en outre un indicateur (A1), l'indicateur (A1) indiquant, au noeud sans fil de relais (312), comment relayer les deuxièmes données de charge utile (B1), et l'indicateur (A1) comprenant des paramètres relatifs à une transmission radio des deuxièmes données de charge utile (B1), caractérisé en ce que les paramètres incluent des assignations de signal de référence de démodulation, et
    le relais (707, 903) des deuxièmes données de charge utile (B1) sur la base de l'indicateur (A1).
  9. Procédé selon la revendication 8, dans lequel l'indicateur (A1) comprend une indication d'une voie à plusieurs sauts (331) jusqu'au deuxième noeud sans fil (322), et comprenant en outre le relais (707, 903) des deuxièmes données de charge utile (B1) par l'intermédiaire de la voie à plusieurs sauts (331) jusqu'au deuxième noeud sans fil (322).
  10. Noeud sans fil de relais (312) pour relayer des données, provenant d'un premier noeud sans fil (311) et destinées à être reçues par un deuxième noeud sans fil (322), chacun du premier noeud sans fil (311), du deuxième noeud sans fil (322) et du noeud sans fil de relais (312) étant configuré pour fonctionner dans un réseau de communication sans fil (300), le noeud sans fil de relais (312) étant configuré pour :
    la réception de premières données de charge utile (B0) en provenance du premier noeud sans fil (311), les premières données de charge utile (B0) comprenant des deuxièmes données de charge utile (B1) destinées au deuxième noeud sans fil (322), et les premières données de charge utile (B0) comprenant en outre un indicateur (A1), l'indicateur (A1) indiquant, au noeud sans fil de relais (312), comment relayer les deuxièmes données de charge utile (B1), et l'indicateur (A1) comprenant des paramètres relatifs à une transmission radio des deuxièmes données de charge utile (B1), caractérisé en ce que les paramètres incluent des assignations de signal de référence de démodulation, et
    le relais des deuxièmes données de charge utile (B1) sur la base de l'indicateur (A1).
  11. Noeud sans fil de relais (312) selon la revendication 10, dans lequel l'indicateur (A1) est compris dans un élément de commande d'accès au support, MAC.
  12. Noeud sans fil de relais (312) selon la revendication 10 ou 11, dans lequel les deuxièmes données de charge utile (B1) et l'indicateur (A1) sont codés, et dans lequel le noeud sans fil de relais (312) est configuré en outre pour le décodage de l'indicateur (A1) séparément des deuxièmes données de charge utile (B1).
  13. Noeud sans fil de relais (312) selon l'une quelconque des revendications 10 à 12, dans lequel les deuxièmes données de charge utile (B1) comprennent un deuxième indicateur (A2) et des troisièmes données de charge utile (B2) destinées à un troisième noeud sans fil (323), et un deuxième indicateur (A2) comprenant des instructions au deuxième noeud sans fil (322) précisant comment relayer les troisièmes données de charge utile (B2) .
  14. Noeud sans fil de relais (312) selon l'une quelconque des revendications 10 à 13, configuré en outre pour l'ajout d'une indication d'une voie à plusieurs sauts (332) jusqu'au premier noeud sans fil (311) aux deuxièmes données de charge utile (B1).
  15. Noeud sans fil de relais (312) selon l'une quelconque des revendications 10 à 14, dans lequel l'indicateur (A1) comprend une indication d'une voie à plusieurs sauts (331) jusqu'au deuxième noeud sans fil (322), et dans lequel le noeud sans fil de relais (312) est en outre configuré pour le relais des deuxièmes données de charge utile (B1) par l'intermédiaire de la voie à plusieurs sauts (331) jusqu'au deuxième noeud sans fil (322) .
EP15896483.3A 2015-06-26 2015-06-26 Appareils et procédés pour relayer des données dans un réseau de communication sans fil Active EP3314949B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/SE2015/050753 WO2016209136A1 (fr) 2015-06-26 2015-06-26 Appareils et procédés pour relayer des données dans un réseau de communication sans fil

Publications (3)

Publication Number Publication Date
EP3314949A1 EP3314949A1 (fr) 2018-05-02
EP3314949A4 EP3314949A4 (fr) 2018-07-04
EP3314949B1 true EP3314949B1 (fr) 2019-10-23

Family

ID=57586041

Family Applications (1)

Application Number Title Priority Date Filing Date
EP15896483.3A Active EP3314949B1 (fr) 2015-06-26 2015-06-26 Appareils et procédés pour relayer des données dans un réseau de communication sans fil

Country Status (4)

Country Link
US (1) US10512024B2 (fr)
EP (1) EP3314949B1 (fr)
CN (1) CN107710825B (fr)
WO (1) WO2016209136A1 (fr)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10469358B2 (en) * 2017-05-18 2019-11-05 Qualcomm Incorporated Wireless multihop relay
WO2019136933A1 (fr) * 2018-01-09 2019-07-18 Oppo广东移动通信有限公司 Procédé de transmission de données, et nœud relais
WO2019136606A1 (fr) * 2018-01-09 2019-07-18 Oppo广东移动通信有限公司 Procédé de transmission relais, et nœud relais
US11979478B2 (en) * 2020-05-19 2024-05-07 Qualcomm Incorporated Signaling for relaying prior to decoding
CN117063412A (zh) * 2021-04-03 2023-11-14 高通股份有限公司 用于基于多中继器的通信的基于控制信道的路由
US11757579B2 (en) * 2021-05-12 2023-09-12 Qualcomm Incorporated Efficient acknowledgment by relay node
WO2023282805A1 (fr) * 2021-07-08 2023-01-12 Telefonaktiebolaget Lm Ericsson (Publ) Premier nœud, second nœud et procédés réalisés par ceux-ci pour envoyer une attribution à un dispositif sans fil compris dans un trajet à sauts multiples comportant une pluralité de nœuds relais

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100918435B1 (ko) * 2005-01-31 2009-09-24 삼성전자주식회사 무선 통신 시스템에서 데이터 트래픽 제어 시스템 및 방법
US7933236B2 (en) * 2005-10-27 2011-04-26 Nortel Networks Limited Methods and systems for a wireless routing architecture and protocol
WO2007053954A1 (fr) * 2005-11-10 2007-05-18 Nortel Networks Limited Zones de reseaux sans fil comportant des relais
US8774182B2 (en) 2005-11-12 2014-07-08 Apple Inc. Media access control data plane system and method for wireless communication networks
KR100901137B1 (ko) * 2006-01-03 2009-06-04 삼성전자주식회사 다중 홉 릴레이 방식 무선 접속 통신시스템에서 연결식별자관리 방법 및 장치
BRPI0714168A2 (pt) * 2006-06-30 2012-12-25 Nokia Corp retransmissora
EP2059059B1 (fr) * 2006-10-13 2013-12-25 Fujitsu Limited Station de base radio et procédé de commande de communication
EP1921807A1 (fr) 2006-11-13 2008-05-14 Alcatel Lucent Procédé permettant la retransmission d'unités de données de protocole de MAC dans un réseau de communication radio-mobile, extrémité de communication et station relais correspondants
US20080219203A1 (en) 2007-03-09 2008-09-11 Industrial Technology Research Institute. Method for mac process and flexible connection in wireless multi-hop relaying network
CN101562557B (zh) * 2008-01-11 2011-09-21 中兴通讯股份有限公司 多跳中继网络中map和相应数据的关联方法
CN102113377A (zh) 2008-07-28 2011-06-29 皇家飞利浦电子股份有限公司 介质访问控制转发协议
US20100110972A1 (en) * 2008-11-04 2010-05-06 Samsung Electronics Co. Ltd. Apparatus and method for processing the relayed data in a multihop relay broadband wireless access communication system
WO2011077807A1 (fr) * 2009-12-25 2011-06-30 日本電気株式会社 Système de communication sans fil, station de base et procédé de commande de système de communication sans fil
US20110164577A1 (en) 2010-01-06 2011-07-07 Research In Motion Limited Intra-Donor Cell Coordinated Multi-Point Transmission with Type 1 Relay
US8538325B2 (en) * 2010-09-17 2013-09-17 Telefonaktiebolaget Lm Ericsson (Publ) Monitoring cellular radio access node performance
US9066287B2 (en) * 2012-01-24 2015-06-23 Qualcomm Incorporated Systems and methods of relay selection and setup
WO2015038949A1 (fr) * 2013-09-13 2015-03-19 Smg Holdings--Anova Technologies, Llc Système et relais de transmission de paquets de données à grande charge utile pour réduire le délai de transit

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
CN107710825B (zh) 2021-03-26
US10512024B2 (en) 2019-12-17
US20180184359A1 (en) 2018-06-28
EP3314949A4 (fr) 2018-07-04
WO2016209136A1 (fr) 2016-12-29
EP3314949A1 (fr) 2018-05-02
CN107710825A (zh) 2018-02-16

Similar Documents

Publication Publication Date Title
EP3314949B1 (fr) Appareils et procédés pour relayer des données dans un réseau de communication sans fil
JP5987897B2 (ja) 無線通信システム
US9143223B2 (en) Relay station, base station, and radio communication method
US10314068B2 (en) Communication control method and user terminal
WO2022068696A1 (fr) Sélection d'ue relais pour une transmission sur la liaison latérale
CN112425188A (zh) 使用网络编码来中继交通工具通信
JP2012525790A (ja) 通信ネットワークにおける干渉の緩和
JP6340653B2 (ja) 端末装置、基地局装置、および、通信方法
US20230370152A1 (en) Technique for Radio Resource Allocation in a Relayed Radio Communication
WO2015141727A1 (fr) Procédé de commande de communication et terminal utilisateur
US20230403626A1 (en) Method and apparatus for relay communication
CN112770338B (zh) 通信方法和通信装置
CN111316756B (zh) 用于混合自动重复请求肯定应答/否定应答捆绑的方法和设备
US20220417957A1 (en) Multi-receiver scheduling using sub-slot based physical sidelink shared channels
CN116997013A (zh) 多跳传输方法及通信装置
CN112689334B (zh) 一种数据传输方法、装置及相关设备
JP7031609B2 (ja) 基地局、無線端末、無線通信システム、及び無線通信方法
WO2021062925A1 (fr) Informations de contrôle de liaison descendante pour planifier un ou plusieurs blocs de transport
JP6288152B2 (ja) 無線通信システム、無線基地局、無線端末、および無線通信方法
CN116057972A (zh) 单播分组寻址和通信

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20171206

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

A4 Supplementary search report drawn up and despatched

Effective date: 20180604

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 40/22 20090101AFI20180528BHEP

Ipc: H04W 88/04 20090101ALI20180528BHEP

17Q First examination report despatched

Effective date: 20180615

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20190701

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602015040542

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1195101

Country of ref document: AT

Kind code of ref document: T

Effective date: 20191115

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20191023

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200224

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200123

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200123

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200124

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200224

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602015040542

Country of ref document: DE

PG2D Information on lapse in contracting state deleted

Ref country code: IS

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200223

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1195101

Country of ref document: AT

Kind code of ref document: T

Effective date: 20191023

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

26N No opposition filed

Effective date: 20200724

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200626

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20200630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200630

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200626

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191023

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20220627

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20220629

Year of fee payment: 8

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602015040542

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20240103

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230630

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20240627

Year of fee payment: 10