WO2010051828A1 - Émission relayée dans un système de communication - Google Patents

Émission relayée dans un système de communication Download PDF

Info

Publication number
WO2010051828A1
WO2010051828A1 PCT/EP2008/064909 EP2008064909W WO2010051828A1 WO 2010051828 A1 WO2010051828 A1 WO 2010051828A1 EP 2008064909 W EP2008064909 W EP 2008064909W WO 2010051828 A1 WO2010051828 A1 WO 2010051828A1
Authority
WO
WIPO (PCT)
Prior art keywords
terminal
relay
radio communication
terminal devices
candidate relay
Prior art date
Application number
PCT/EP2008/064909
Other languages
English (en)
Inventor
Haifeng Wang
Xia Chen
Xiaomei Xia
Original Assignee
Nokia Siemens Networks Oy
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 Nokia Siemens Networks Oy filed Critical Nokia Siemens Networks Oy
Priority to PCT/EP2008/064909 priority Critical patent/WO2010051828A1/fr
Publication of WO2010051828A1 publication Critical patent/WO2010051828A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • 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/42—Centralised routing
    • 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/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/16—Discovering, processing access restriction or access information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/22—Processing or transfer of terminal data, e.g. status or physical capabilities
    • H04W8/24—Transfer of terminal data
    • 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

Definitions

  • the invention relates to the field of radio telecommunications and, particularly, to relayed transmissions in a radio telecommunication system.
  • Next-generation wireless communication systems support significantly higher data rates than current systems.
  • the need for high data rates imposes power implications particularly in the uplink, wherein limited battery power resources are used for the transmission. Therefore, it is envisaged that the next-generation wireless communication systems utilize relay-based multi-hop networks in the uplink, wherein a transmission of a given user terminal (a source terminal) is relayed to a serving base station through another user terminal (a relay terminal).
  • an apparatus as specified in claim 21.
  • a computer program product embodied on a computer readable distribution medium as specified in claim 22.
  • Figure 1 illustrates relayed communication in a cell of a cellular telecommunication system
  • Figure 2 illustrates a generalized process for assigning relay terminals to source terminals requesting a relayed connection
  • Figure 3 illustrates the structure of an apparatus carrying out the assignment process of Figure 2;
  • Figure 4 illustrates a relay utilization optimization procedure according to an embodiment of the invention;
  • Figure 5 illustrates an embodiment of the optimization procedure based on the process of Figure 4.
  • Figure 6 illustrates another embodiment of the optimization procedure based on the process of Figure 4.
  • Figure 7 illustrates another embodiment of the relay utilization optimization procedure
  • Figure 8 illustrates yet another embodiment of the relay utilization optimization procedure. Description of embodiments
  • Figure 1 illustrates a general concept of communications according to embodiments of the invention, wherein relayed communication connections are provided between a base station 100 and terminal devices in poor channel conditions in a cell 102 where the base station 100 serves the terminal devices with wireless communication connections.
  • the relayed connections are established via relay terminals having a good channel environment with both the base station 100 and one or more terminal devices for which the relayed connection is established.
  • solid lines indicate direct communication connections with the base station 100
  • dashed lines indicate relayed connections
  • dotted lines indicate relayed connections that are not established for a reason.
  • terminal devices 112, 116, and 120 are relay terminals providing other terminal devices 110, 114, 122, 118 (referred to as source terminals from now on) with a relayed communication connection to the base station.
  • the establishment of the relayed connection may start with the source terminal broadcasting a request for a relayed connection and a quality- of-service (QoS) requirement for the connection.
  • QoS quality- of-service
  • Candidate relay terminals detecting the request then determine whether or not they are capable of serving the source terminal by determining whether or not they are able to meet the QoS requirement for the connection.
  • the relay terminal may report to the base station 100 the identity of the source terminal and information that it is capable of providing the source terminal with the relayed connection. Then, the base station may pair the source terminal with a relay terminal capable of providing the relayed connection and configure the source terminal and the selected relay terminal to establish the relayed connection.
  • the source terminals 110, 114, 122, 118 have broadcasted the request for a relayed connection and the QoS requirements for their connection requests.
  • a first candidate relay terminal 112 detects the requests broadcasted by the source terminals 110, 114, and 122. Upon detecting the QoS requirements from the received requests, the first candidate relay terminal 112 estimates its capabilities of providing the relayed connections. The estimation may comprise estimation of channel state information of a communication channel between the base station and the first candidate relay terminal 112 and a communication channel between the first candidate relay terminal 112 and each source terminal 110, 114, 122. From the estimated channel state information, the first candidate relay terminal 112 may estimate its capacity to support the relayed connections. Then, the first candidate relay terminal 112 sends capacity information to the base station 100 and receives assignment information indicating the source terminals to which it should provide the relayed connection.
  • a second candidate relay terminal 116 detects the request broadcasted by the source terminals 122, 118 and sends its capacity information to the base station.
  • a third candidate relay terminal 120 also detects the request broadcasted by the source terminal 118 and sends its capacity information to the base station 100.
  • source terminals 110 and 114 are assigned to the first candidate relay terminal 112 and the source terminal 122 is assigned to the second candidate relay terminal 116.
  • the first candidate relay terminal 112 may have determined that it is not capable of meeting the QoS requirement of the source terminal 122 or all source terminals 110, 114, 122, and the base station may have decided to assign the source terminal 122 to the second candidate relay terminal 1 16.
  • Neither the second nor third candidate source terminal is able to provide the source terminal 1 18 with the relayed connection, for example, because of a high QoS requirement and/or poor channel conditions associated with the source terminal 1 18.
  • a candidate relay terminal refers to a relay terminal before the assignment or pairing of the relay terminal and a source terminal.
  • the relay terminals are assigned to source terminals with a primary criterion that a maximum number of source terminals requesting the relayed connection is served.
  • Figure 2 illustrates a flow diagram of a process for assigning relay terminals. The process may be implemented in a centralized manner in a network element controlling the relayed connections, for example the base station or a controller of the base station. To be precise, the process may be executed in a control unit of such a network element.
  • the control unit receives relay status information from each candidate relay terminal.
  • the relay status information comprises identifiers of the source terminals the relay terminal has detected requesting for a relayed connection and radio communication resources available for the relayed connection with each terminal device the candidate relay terminal device is capable of serving.
  • the control unit assigns a relay terminal and radio communication resources for each terminal device according to a criterion that maximizes the number of terminal devices served with the relayed connection.
  • a terminal device is primarily assigned with a relay terminal and radio communication resources, wherein the assigned radio communication resources do not pre-empt the radio communication resources available for a relayed connection of one or more terminal devices, for which the assignment has not yet been carried out.
  • a relay terminal and radio resources are assigned to a given source terminal amongst one or more candidate relay terminals indicating in the relay status information that they are capable of serving the first terminal device.
  • a relay terminal and radio communication resources are assigned to each subsequent source terminal from radio resources not yet assigned, wherein the assigned relay terminal is associated with the non-assigned radio communication resources and with the terminal device in the relay status information. This is carried out by not pre-empting radio resources of another non-assigned source terminal, unless it is the only option to assign a relay terminal and radio resource to the source terminal.
  • the control unit configures the assigned relay terminals to establish a relayed connection with the source terminal(s) assigned to each relay terminal.
  • the establishment of the relayed connection may comprise establishment of a device-to-device communication connection between the relay terminal and a given source terminal and linking the device-to-device connection to a connection between the relay terminal and the base station to provide the relayed connection between the source terminal and the base station through the relay terminal.
  • the establishment of the device-to-device connection also comprises negotiation of the radio resources allocated to the device-to-device connection. The process ends in block 208.
  • Figure 3 illustrates the structure of an apparatus for carrying out the method of Figure 2.
  • the apparatus may be realized by a processing unit in the network element controlling the relayed connections in a radio access network of a mobile communication system.
  • the processing unit may be implemented by a digital signal processor executing the method under the instructions contained in a computer program executed in the processor.
  • the processing unit may be realized by an application-specific integrated circuit.
  • the steps of the process may be distributed to multiple processing units withinin the apparatus.
  • the apparatus may comprise an interface 306 to enable a communication connection with other elements of the network controller and with terminal devices controlled by the network controller.
  • the interface 306 may be understood as a physical interface transferring signals in and out of the apparatus, but it may also be seen as an interface between computer program processing modules.
  • the apparatus carries out the assignment of relay terminals, so it may output, through the interface 306, control information related to the assignment to another processing module configured to process the control information for transmission to the terminal devices.
  • the apparatus receives, through the interface 306, the relay status information from the candidate relay terminals to facilitate the assignment.
  • the relay status information is stored in a memory unit 304.
  • the memory unit may also store a computer program configuring the apparatus to carry out the assignment process.
  • the apparatus further comprises a relay utilization optimizer 300 which carries out the assignment process, i.e. block 204 of Figure 2.
  • the relay utilization optimizer 300 receives the relay status information from the memory unit 304 and executes the assignment optimization procedure with the relay status information as parameters for the procedure. Embodiments of the optimization procedure are described in more detail below.
  • the relay utilization optimizer obtains relay assignment information indicating the selected relay terminals among the candidate relay terminals and source terminals to be served by each selected relay terminal.
  • the relay utilization optimizer outputs the relay assignment information to a relay link controller 302.
  • the relay link controller 302 controls the execution of the assignment with respect to the terminal devices.
  • the relay link controller 302 receives the assignment information from the relay utilization optimizer 300 and configures the selected relay terminals to establish the relayed connections to source terminals according to the assignment information, i.e. carries out block 206 of Figure 2. With respect to a given selected relay terminal, the relay link controller 302 communicates to the relay terminal one or more source terminals the relay terminal is assigned to serve and instructs the relay terminal to establish a relayed connection between the source terminals and the base station currently communicating with the relay terminal. The communication between the relay link controller 302 and the relay terminal may be carried out through the base station.
  • Figures 4 to 8 disclose embodiments for carrying out the relay optimization procedure of block 204 of Figure 2.
  • candidate relay terminals monitor relay connection requests broadcasted by the source terminals in need of a relayed connection and determine whether or not they are able to meet the requested QoS requirements. Let us assume that a total of N f radio resources, for example frequency bands, are available for N s source nodes and N R candidate relay nodes.
  • a candidate relay terminal may determine channel status information (CSI) related to a radio channel between the candidate relay terminal and the source terminal (h SRf ) and a radio channel between the candidate relay terminal and a destination node (the base station) (h RBf ).
  • CSI channel status information
  • the candidate relay terminal may judge independently for each source node whether it can meet the QoS requirements of the source node and on which radio resources the QoS requirements are met.
  • the candidate relay node may estimate channel gain, signal-to-noise ratio (SNR), capacity, etc. of the radio resource f m .
  • SNR signal-to-noise ratio
  • the candidate relay terminal R j may estimate achievable capacity C for a given radio resource f m and source node S 1 from the CSI, i.e. from hs Rf and h RB f as:
  • C(i, j, m) Io d 1 + mini p s h ' S 1 R 1 L ⁇ PR, h R 1 Bf,,, (1) where p S ⁇ and p Rj are the transmitting powers of the source node and the candidate relay node, respectively.
  • the candidate relay terminal may estimate the achievable capacity as:
  • the candidate relay node may compare the estimated achievable capacity with the QoS requirements of the source node and determine, whether or not the achievable capacity is equal to or greater than the QoS requirement. If it is either equal to or greater than the QoS requirement, the candidate relay terminal determines that it is able to serve the source terminal with the corresponding radio resource. Otherwise, the candidate relay terminal determines that it is not able to serve the source terminal in the corresponding radio resource.
  • the same estimation may be carried out for all the radio resources available to find out the radio resources with which the candidate relay terminal is capable of serving the source terminals. This procedure may be carried out for all source terminals whose relay connection request the candidate relay terminal receives.
  • Each candidate relay terminal reports to the serving base station (or another network element carrying out the assignment of the relay terminals) their relay status information comprising an indication which source terminals each candidate relay terminal is capable of serving and with which radio resources.
  • Each candidate relay terminal may simply indicate with a simple 'yes' or 'no' for each pair of a radio resource and a source terminal which pairings it can support.
  • each candidate relay terminal may provide an achievable capacity value for each pair of a radio resource and a source terminal so the base station may know which pairings are the most optimal for each candidate relay terminal. Tables 1 and 2 illustrate these two embodiments of the relay status information.
  • a first candidate relay terminal Ri transmits to the base station the leftmost part of the relay status information, i.e. the matrix below Ri, a second candidate relay terminal the second leftmost part of the matrix, etc.
  • T indicates that the candidate relay terminal is capable of serving the source terminal on that row with a radio resource in that column.
  • O' denotes that the candidate relay terminal is incapable of serving the source terminal on that row with a radio resource in that column.
  • the first candidate relay terminal is capable of meeting the QoS requirements of a source terminal S 2 with radio resources fi and f 2 .
  • the serving base station then constructs an allocation matrix of Table 1 from the relay status information received from the candidate relay terminals.
  • the allocation matrix of Table 1 is actually a three-dimensional matrix, wherein the dimensions are defined by the source terminals S 1 , the candidate relay terminals R j and the radio resources f ⁇ rm, -
  • each candidate relay terminal now transmits achievable capacity for a given pair of source terminal and radio resource it can serve, i.e. the QoS requirements it can meet.
  • the achievable capacity may be quantized to a specified word length.
  • another channel quality indicator may be used.
  • the relay status information may also comprise information on a traffic type requested by each source terminal, e.g. voice, streaming data, messaging, e-mail.
  • the traffic type may be indicated as QoS classes known in the art: conversational, streaming, interactive, background. This may also be taken into account in the assignment of relay terminals by assigning to a source terminal requesting a high priority service, e.g. voice service, a relay terminal and radio resource having the highest achievable capacity.
  • Figure 4 illustrates a relay optimization procedure which optimizes the number of served source terminals.
  • the procedure may be carried out by the relay utilization optimizer 300 on the basis of relay status information received from the memory unit 304.
  • the procedure starts in block 400.
  • the allocation matrix is constructed from the received relay status information.
  • the constructed allocation matrix may have the form of Table 1 or 2 depending on the specifications of the system for reporting and processing the relay status information.
  • the procedure checks the allocation matrix for radio resources that can be allocated to only one source-relay terminal pair.
  • only candidate relay terminal Ri is able to utilize radio resource f 3 , and it may use that radio resource to provide source terminal S 4 with a relayed connection.
  • candidate relay terminal R 1 is selected as a relay terminal to provide source terminal S 4 with the relayed connection by using the radio resource f 3 .
  • other radio resources are checked whether they can also be used by a single source-relay pair. Thereby, it is ensured that these pairs having exclusive possibility to use a certain radio resource are not allocated to other radio resources that may be allocated to other pairs.
  • a relay terminal is allocated to the rest of the source terminals as possible. This is carried out by assigning a source-relay pair and radio resource from the allocation matrix in such manner that the radio resources of any other non-assigned source terminal is not pre-empted, unless that is the only option. Multiple source terminals may be assigned to a single relay terminal. When all the source terminals are assigned with a relay terminal and radio resource, or when there are no radio resources (satisfying the QoS requirement) to be allocated to non-assigned source terminal(s), the process ends in block 408.
  • Figure 5 illustrates the embodiment of Figure 4 in more detail in a case where the allocation matrix is in the form of Table 1. The process starts in block 500. Block 402 is similar to that of Figure 4.
  • the procedure checks the allocation matrix for rows with p non-zero elements, p is initialized as 1. In other words, the procedure checks the allocation matrix for rows with one non-zero element in the first iteration. The idea is to find source terminals that can only be allocated to a singe radio resource. In block 504, it is checked if the elements found in 502 are in the same column. If not, the process moves to block 508, wherein it is determined that each source terminal associated with the elements found in 502 may be assigned with a relay terminal. As a consequence, each source terminal is assigned with the radio resource and relay terminal associated with the found element.
  • the process moves to block 506, where it is determined that all the source terminals cannot be served, and one of the rows is selected. As a consequence, the source terminal of the selected row is assigned with the radio resource and relay terminal associated with the found element of the source terminal.
  • the process proceeds to block 510, where the indices of the selected elements, i.e. source-relay terminal pairs and assigned radio resources, are memorized. Additionally, the columns of the selected rows are nulled, because the corresponding source terminal has already been assigned with a relay terminal. Moreover, columns of the selected elements are also nulled, because that radio resource has already been assigned.
  • the indices of the selected elements i.e. source-relay terminal pairs and assigned radio resources
  • block 512 it is determined whether or not there is at most one element left in each row. If yes, the remaining source-relay pairs and radio resources may be allocated as in blocks 504 to 508, and the process ends in block 516, because all the source terminals are assigned with a relay terminal. If there are one or more rows with a higher number of elements than one, p is incremented in block 514, and the process returns to block 502 to search for rows with two non-zero elements. If at least part of the found non-zero elements is in the same column, each row may keep a random non-zero element from a different column such that no two rows keep the element in the same column to avoid a collision in the radio resource.
  • each row may keep one of the elements, and the elements may be selected in such manner that radio resources of a non-assigned source terminal are not pre-empted, unless necessary. In this manner, the procedure assigns the radio resources and relay terminals to the source terminals.
  • Figure 6 illustrates an embodiment in which the allocation matrix of Table 2 is used.
  • the procedure itself is very similar to that of Figure 5, and the only difference is in the selection of the found elements.
  • the process starts in block 600, and blocks 402, 502, and 504 are the same as described above.
  • the process moves to block 604, where each row may keep its element, as in Figure 5.
  • the process moves to block 602, where a row having the highest value of the element (the best achievable capacity) keeps its element. This optimizes the capacity of the system.
  • each row keeps its biggest non-zero element in block 604.
  • a non-zero element is selected for each row such that no rows have the element in the same column and the sum of the selected non-zero element values is maximized.
  • the radio resources of other non-assigned source terminals are not pre-empted.
  • the maximization of the sum is secondary to that.
  • Figure 7 illustrates another embodiment of the optimization procedure. This embodiment maximizes the number of served source terminals, but also minimizes the number of relay terminals. As a consequence, relay terminals most suitable for relaying, e.g.
  • the process starts in block 700.
  • the number of source terminals each candidate relay terminal can serve is calculated.
  • the allocation matrix has been constructed from the received relay status information.
  • the number of source terminals each candidate relay terminal can serve may be calculated from the amount of rows having at least one non-zero element in different columns in the allocation matrix with respect to the candidate relay terminal in question.
  • the calculation of the number of servable source terminals is determined by taking into account the radio resource allocation, i.e. that no servable source terminal is assigned with the same radio resource as another servable source terminal.
  • a candidate relay terminal capable of serving the highest number of source terminals is selected for assignment.
  • the source terminals which the relay terminal selected in block 704 is capable of serving are assigned to the selected relay terminal.
  • Radio resources are also allocated to the source terminals.
  • the assigned source terminals are deleted from the allocation matrix, and the radio resources already allocated to the source terminals are also disabled for all the remaining source/relay terminals so that the same radio resource will not be allocated to two links.
  • the process moves to block 708, where it is checks whether or not there are source terminals and candidate relay terminals still unassigned. If there are no source terminals unassigned, the process assumes that all the relay requests have been handled, and the process ends in block 710. If there are no unassigned candidate relay terminals, the process assumes that all the relay link capacity is already in use and no more relay links can be assigned even if there were unassigned source terminals. However, if there are unassigned source terminals and relay terminals, the process returns to block 702, where the number of unassigned source terminals each unassigned relay terminal can serve is calculated by taking into account only the available (unassigned) radio resources. In this manner the process continues, until all the source terminals and/or relay terminals are assigned and the process ends in block 710.
  • the candidate relay terminals are assigned as relay terminals in the descending order of the number of terminal devices each candidate relay terminal is able to serve simultaneously until a maximum number of terminal devices that can be served simultaneously by all candidate relay terminals is reached.
  • the process of Figure 7 may use either form of the allocation matrix, i.e. that of Table 1 or 2.
  • the use of the allocation matrix of Table 1 results in less uplink signaling because of the short word length for the indication service capability, i.e. the elements of the matrix.
  • Figure 8 illustrates another embodiment of the relay utilization optimization process.
  • the process starts in block 800.
  • This process preferably utilizes the allocation matrix of Table 2 to effectively optimize the capacity as well as the number of served source terminals.
  • the allocation matrix may be constructed before proceeding to block 802.
  • all combinations of k candidate relay terminals are processed so as to find out the maximum number of servable source terminals.
  • k is initialized as 1.
  • the candidate relay terminal capable of serving the highest number of source terminals is selected.
  • the calculation of the number of servable source terminals is determined by taking into account the radio resource allocation, i.e. that no servable source terminal is assigned with the same radio resource as another servable source terminal.
  • sub-matrices of the allocation matrix associated with the selected relay terminals are combined into one sub-matrix. In the first iteration, this step is omitted, because only the sub-matrix of one relay terminal is in use.
  • the sub- matrix refers to a matrix constructed from the relay status information received from the relay terminal(s) selected in block 802 (see Tables 1 and 2 for a sub- matrix below each R-i, R2, ... RN ⁇ )- The combination of multiple sub-matrices is described later in connection with the next iteration.
  • block 806 it is determined whether or not the selected relay terminal can serve all the source terminals. This is carried out by analyzing the combined sub-matrix to find out if a radio resource can be allocated to each source terminal, i.e. whether there is a non-zero element in different columns of the combined sub-matrix for every source terminal. If the relay terminal can serve every source terminal, the process proceeds to block 810 where the source terminals and radio resources are assigned to the relay terminal, and the process ends in block 814, because all the source terminals have been allocated. If the relay terminal cannot serve all the source terminals, the process moves from block 806 to block 808 where it is checked whether or not k is at maximum. The maximum value for k is N R , i.e.
  • all combinations of 2 candidate relay terminals are processed to find out the maximum number of source terminals, that two relay terminals can serve.
  • the two candidate relay terminals that together can serve the highest number of source terminals are selected.
  • the sub-matrices of the selected relay terminals are combined into one sub-matrix.
  • the combination of the sub-matrices is carried out by selecting for each element of the combined sub-matrix the corresponding element from the two sub-matrices that has the highest value.
  • the relay terminal providing the highest achievable capacity for a given source terminal and radio resource is selected for that pair of source terminal and radio resource.
  • the size of the combined sub-matrix is naturally the same as the size of the sub-matrix of each relay terminal, that is SN S rows and f Nf columns.
  • the combination of the sub-matrices is carried out so as to optimize the achievable capacity.
  • it is determined whether the selected relay terminals can serve all the source terminals and the process moves either to block 808 or 810 on the basis of the result.
  • the source terminals are assigned to the relay terminals on the basis of the combined sub-matrix. In this manner, the procedure continues until all the source terminals can be assigned or the available relay terminals run out (k reaches its maximum value). As can be seen, this process optimizes the number of served source terminals, minimizes the number of relay terminals, and optimizes the achievable capacity. In the embodiment described above, k was initialized as 1.
  • k may be initialized as two, if it is determined that no single candidate relay terminal can serve all the source terminals or a sufficient number of source terminals.
  • the sufficient number of source terminals may be predetermined by setting a threshold number.
  • k may be initialized as a higher number, if it is determined that no two (or three, four, etc.) candidate relay terminals together can serve all or a sufficient number of source terminals.
  • the processes or methods described in Figures 2 and 4 to 8 may also be carried out in the form of a computer process defined by a computer program.
  • the computer program may be in source code form, object code form, or in some intermediate form, and it may be stored in some sort of carrier, which may be any entity or device capable of carrying the program.
  • Such carriers include a record medium, computer memory, read-only memory, electrical carrier signal, telecommunications signal, and software distribution package, for example.
  • the computer program may be executed in a single electronic digital processing unit or it may be distributed amongst a number of processing units.
  • the optimization procedure may be carried out in a mobile telecommunication system for source and relay terminals located in a geographically limited area, e.g. in a cell of the system.
  • the present invention is not dependent on the radio interface technology. Accordingly, the present invention is applicable to current mobile communication systems, e.g. UMTS (Universal Mobile Telecommunication System) or any of its evolution versions and WiMAX (Worldwide Interoperability for Microwave Access).
  • the present invention is also applicable to all types of duplexing scehemes, e.g. time-division duplexing, frequency-division duplexing, and code division duplexing.

Landscapes

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

Abstract

L’invention concerne un procédé, un appareil et un programme informatique pour commander les communications relayées dans un système de communication sans fil. L’affectation de terminaux relais aux terminaux sources qui demandent une connexion relayée vers un nœud destinataire est effectuée de manière centralisée en se basant sur les informations d’état de relais reçues de la part de terminaux relais candidats. Les informations d’état de relais reçues de la part d’un terminal relais candidat donné indiquent les terminaux sources que le terminal relais candidat est en mesure de desservir et dans quelles ressources de radiocommunication. L’affectation d’une paire terminal relais – terminal source est effectuée avec pour principal critère qu’il n’existe aucune préemption sur les ressources de radiocommunication disponibles pour une connexion relayée d’un ou plusieurs terminaux pour lesquels l’affectation n’a pas encore eu lieu.
PCT/EP2008/064909 2008-11-04 2008-11-04 Émission relayée dans un système de communication WO2010051828A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2008/064909 WO2010051828A1 (fr) 2008-11-04 2008-11-04 Émission relayée dans un système de communication

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2008/064909 WO2010051828A1 (fr) 2008-11-04 2008-11-04 Émission relayée dans un système de communication

Publications (1)

Publication Number Publication Date
WO2010051828A1 true WO2010051828A1 (fr) 2010-05-14

Family

ID=40377562

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2008/064909 WO2010051828A1 (fr) 2008-11-04 2008-11-04 Émission relayée dans un système de communication

Country Status (1)

Country Link
WO (1) WO2010051828A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013086324A1 (fr) * 2011-12-08 2013-06-13 Interdigital Patent Holdings, Inc. Procédé et appareil de commande d'établissement de liaison transversale
WO2015017187A1 (fr) * 2013-07-30 2015-02-05 Qualcomm Incorporated Découverte énergétiquement économe de relais lte direct pour dispositifs hors zone de couverture
WO2022033545A1 (fr) * 2020-08-14 2022-02-17 展讯半导体(南京)有限公司 Procédé et appareil de configuration de multiples cellules, support de stockage, terminal et station de base

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006138122A2 (fr) * 2005-06-14 2006-12-28 Interdigital Technology Corporation Procede et systeme de transport d'information de liaison terrestre pour une selection intelligente d'un point d'acces au reseau maille

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006138122A2 (fr) * 2005-06-14 2006-12-28 Interdigital Technology Corporation Procede et systeme de transport d'information de liaison terrestre pour une selection intelligente d'un point d'acces au reseau maille

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013086324A1 (fr) * 2011-12-08 2013-06-13 Interdigital Patent Holdings, Inc. Procédé et appareil de commande d'établissement de liaison transversale
EP3211960A1 (fr) * 2011-12-08 2017-08-30 Interdigital Patent Holdings, Inc. Station de base pour séléctionner une unité d'aide de transmission/reception sans fil
WO2015017187A1 (fr) * 2013-07-30 2015-02-05 Qualcomm Incorporated Découverte énergétiquement économe de relais lte direct pour dispositifs hors zone de couverture
US9445352B2 (en) 2013-07-30 2016-09-13 Qualcomm Incorporated Power efficient discovery of LTE-direct relay for out-of-coverage devices
WO2022033545A1 (fr) * 2020-08-14 2022-02-17 展讯半导体(南京)有限公司 Procédé et appareil de configuration de multiples cellules, support de stockage, terminal et station de base

Similar Documents

Publication Publication Date Title
CN109845376B (zh) 无线通信方法、装置和系统
KR102412327B1 (ko) 전이중 다운링크 및 업링크 디렉션
US9992784B2 (en) Base station frequency resource allocation method and network device
US7917149B2 (en) System and method for reusing wireless resources in a wireless network
US11509391B2 (en) Adaptive multiple access scheme in integrated access and backhaul networks
US8787922B2 (en) System and method for cooperative inter-cell interference control
KR102489728B1 (ko) 통신 단말의 릴레이 통신 방법 및 그 통신 단말
US8670357B2 (en) Methods and apparatus for controlling peer to peer communications
KR20190067835A (ko) 무선 이동 통신 시스템에서 단말의 신호 전송 방법 및 장치
US9756482B2 (en) Selective use of single-link communication and group communication
KR101756574B1 (ko) 셀룰러 무선 통신 네트워크에서 공동 수신을 수행하기 위한 방법들 및 네트워크 노드들
US11375342B2 (en) Apparatuses, methods and computer programs for grouping users in a non-orthogonal multiple access (NOMA) network
CN107431587B (zh) 用于蜂窝mimo系统的导频信号资源分配方法、基站及mimo系统
US11411689B2 (en) Dynamic user grouping in non-orthogonal multiple access (NOMA)—networks
WO2010051828A1 (fr) Émission relayée dans un système de communication
WO2021028616A1 (fr) Configurations pour la disponibilité d'interfaces utilisées dans des communications v2x
KR20190062213A (ko) 무허가 다중 접속을 위한 스케줄링 방법 및 이를 위한 사용자 단말
EP2317793A1 (fr) Procédé d'opération d'un terminal de communications et terminal de communications
KR20220017172A (ko) 무선 통신시스템에서 네트워크 운영 장치 및 방법
US11463904B2 (en) Method and apparatus for selecting carrier in mobile communication system
KR101717921B1 (ko) 무선통신 시스템에서 자원할당 스케줄링 장치 및 방법
CN112751593A (zh) 一种资源分配方法、装置、通信系统以及存储介质
KR20190118067A (ko) 5g 네트워크 환경에서 lte 및 nr 액세스간 트래픽 경로 제어를 위한 기구 및 방법
US20240121649A1 (en) Method and apparatus for measuring of ue-to-ue crosslink interference in wireless communication system
KR101212843B1 (ko) 기회적 단말 선택 기법을 이용한 다중 단말 협력 방법 및 다중 단말 협력 시스템

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08875268

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08875268

Country of ref document: EP

Kind code of ref document: A1