Association and resource partitioning in a wireless network with relays

• US 9,635,558 B2
• Filed: 10/07/2013
• Issued: 04/25/2017
• Est. Priority Date: 03/19/2009
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Borran, Jaber Mohammad, Khandekar, Aamod Dinkar
• Primary Examiner(s): Pham, Chi H
• Assistant Examiner(s): Huang, Weibin
• Application Number:
  US14/047,788
• Publication Number:
  US 20140036763A1
• Time in Patent Office: 1,296 Days
• CPC Class Codes: H04B 7/15 Active relay systems
• CPC Class Codes: H04B 7/2606 Arrangements for base station coverage control, e.g. by using relays in tunnels
• CPC Class Codes: H04W 16/02 Resource partitioning among network components, e.g. reuse partitioning
• CPC Class Codes: H04W 16/26 Cell enhancers or enhancement, e.g. for tunnels, building shadow
• CPC Class Codes: H04W 84/047 using dedicated repeater stations

Abstract

Techniques for performing association and resource partitioning in a wireless network with relays are described. In an aspect, resource partitioning may be performed to allocate available resources to nodes and access/backhaul links of relays. In one design, a node computes local metrics for a plurality of possible actions related to resource partitioning. The node receives local metrics for the possible actions from at least one neighbor node and determines overall metrics for the possible actions based on the computed and received local metrics. The node determines resources allocated to a set of nodes and resources allocated to the access and backhaul links of at least one relay based on the overall metrics for the possible actions. In another aspect, association involving relays may be performed by taking into account the performance of the relays. In yet another aspect, association and resource partitioning may be performed jointly.

Claims

1. A method for wireless communication, comprising:

obtaining, using at least one network entity, loading information corresponding to at least one neighbor node;

obtaining, using the at least one network entity, metrics for a plurality of possible actions related to association involving at least one relay;

determining, using the at least one network entity, at least one serving node for at least one station based on said loading information and the metrics for the plurality of possible actions;

communicating, using the at least one serving node, with the at least one station;

wherein the at least one serving node is one of a base station or the at least one relay;

wherein the metrics for the at least one relay are based on at least one of;

resources allocated to access and backhaul links of the at least one relay,

an access capacity of the at least one relay, or

a backhaul capacity of the at least one relay; and

wherein said network entity is one of said base station or said at least one relay, said at least one relay operating as a network node capable of communicating with said at least one station on an access link.

2. The method of claim 1, wherein the plurality of possible actions comprise possible actions for handing out one or more stations from a node to neighbor nodes, or possible actions for handing in one or more stations from the neighbor nodes to the node, or both.

3. The method of claim 1, wherein the at least one serving node comprises a base station and the at least one station comprises a relay, or the at least one serving node comprises a relay and the at least one station comprises a user equipment (UE), or both.

4. The method of claim 1, wherein the metrics for the at least one relay are based on resources allocated to access and backhaul links of the at least one relay.

5. The method of claim 1, wherein the metrics for the at least one relay are based on an access capacity of the at least one relay.

6. The method of claim 1, wherein said loading information indicates a number of stations currently served by the at least one neighbor node.

7. An apparatus for wireless communication, comprising:

means for obtaining loading information corresponding to at least one neighbor node and for obtaining metrics for a plurality of possible actions related to association involving at least one relay;

means for determining at least one serving node for at least one station based on said loading information and the metrics for the plurality of possible actions;

means for communicating with the at least one station;

wherein the at least one serving node is one of a base station or the at least one relay;

wherein the metrics for the at least one relay are based on at least one of;

resources allocated to access and backhaul links of the at least one relay,

an access capacity of the at least one relay, or

a backhaul capacity of the at least one relay; and

wherein said apparatus is a network entity and is one of said base station or said at least one relay, said at least one relay operating as a network node capable of communicating with said at least one station on an access link.

8. The apparatus of claim 7, wherein the plurality of possible actions comprise possible actions for handing out one or more stations from a node to neighbor nodes, or possible actions for handing in one or more stations from the neighbor nodes to the node, or both.

9. An apparatus for wireless communication, comprising:

a memory;

at least one processor coupled to the memory, said at least one processor being configured to;

obtain loading information corresponding to at least one neighbor node;

obtain metrics for a plurality of possible actions related to association involving at least one relay, to store the metrics in the memory;

determine at least one serving node for at least one station based on said loading information and the metrics for the plurality of possible actions;

wherein the at least one serving node is one of a base station or the at least one relay;

wherein the metrics for the at least one relay are based on at least one of;

resources allocated to access and backhaul links of the at least one relay,

an access capacity of the at least one relay, or

a backhaul capacity of the at least one relay; and

wherein said apparatus is a network entity and is one of said base station or said at least one relay, said at least one relay operating as a network node capable of communicating with said at least one station on an access link.

10. A non-transitory computer-readable medium of an apparatus, the non-transitory computer-readable medium storing computer executable code, comprising:

code for causing at least one computer to obtain loading information corresponding to at least one neighbor node;

code for causing the at least one computer to obtain metrics for a plurality of possible actions related to association involving at least one relay;

code for causing the at least one computer to determine at least one serving node for at least one station based on said loading information and the metrics for the plurality of possible actions;

code for causing the at least one computer to communicate with the at least one station;

wherein the at least one serving node is one of a base station or the at least one relay;

wherein the metrics for the at least one relay are based on at least one of;

resources allocated to access and backhaul links of the at least one relay,

an access capacity of the at least one relay, or

a backhaul capacity of the at least one relay; and

wherein said apparatus is a network entity and is one of said base station or said at least one relay, said at least one relay operating as a network node capable of communicating with said at least one station on an access link.