IP Library Granted Patent US 7,962,091
Granted Patent B2
US 7,962,091 · App. 12/049,207 · Granted Jun 14, 2011

Resource management and interference mitigation techniques for relay-based wireless networks

Assignee: Intel Corporation
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,962,091
App. No.
12/049,207
Granted
Jun 14, 2011
Kind
B2
Abstract

Embodiments of a system and methods for “RESOURCE MANAGEMENT AND INTERFERENCE MITIGATION TECHNIQUES FOR RELAY-BASED WIRELESS NETWORKS” are generally described herein. Other embodiments may be described and claimed.

Claims (32)

1. A communications transmit node configured to communicate with a plurality of multiple-input multiple-output (MIMO) target nodes and one or more relay nodes using a hybrid scheduling scheme, wherein one or more of the plurality of target nodes are classified in a first group to be served cooperatively using centralized scheduling and one or more of the plurality of target nodes are classified in a second group to be served non-cooperatively using distributed scheduling, wherein the first group of target nodes are served using cooperative fractional frequency reuse (FFR) with a frequency reuse factor greater than one and the second group of target nodes are served with a frequency reuse factor of one, the communications transmit node comprising a scheduler to schedule time-frequency resources to the first group of target nodes and wherein the communications transmit node is configured to notify the one or more relay nodes to perform distributed scheduling for the second group of target nodes using time-frequency resources not assigned to the first group of target nodes and further comprising a medium access controller configured to randomize a plurality of transmissions from the communications transmit node to the first group of target nodes for co-channel interference avoidance of one or more other communication transmit nodes and relay nodes, based at least on an interference beyond a given channel threshold.

2. The node of claim 1 , wherein the communications transmit node transmits a data block comprising a fundamental channel, a downlink map, and a cooperator map.

3. The node of claim 2 , wherein the cooperator map comprises scheduling and modulation coding scheme information determined at the communications transmit node.

4. The node of claim 2 , wherein the downlink map comprises scheduling and modulation coding scheme information determined at the relay nodes.

5. The node of claim 1 , wherein the plurality of transmissions from the communications transmit node are centrally scheduled to serve a mobile station using cooperative relaying.

6. The node of claim 1 , wherein the communications transmit node communicates using a centralized scheduling scheme and a distributed scheduling scheme, wherein the distributed scheduling scheme further includes a scheduler at each relay node configured to serve the plurality of target nodes such that resource allocation for a first group of the plurality of target nodes is determined by the communications transmit node and resource allocation for a second group of the plurality of target nodes is determined by the plurality of relay nodes.

7. The node of claim 1 , wherein the transmission scheme includes cooperative relaying and successive interference cancellation techniques.

8. The node of claim 1 , wherein the transmission scheme includes cooperative transmission techniques used with fractional frequency reuse.

9. A method for mitigating interference in a wireless communications network, the method comprising:

identifying a plurality of target nodes with a communications transmit node, the plurality of target nodes being associated with a multi-hop path from the communications transmit node to the plurality of target nodes using a plurality of relay nodes;

selecting a neighbor node of the communications transmit node to operate as a cooperator node, the cooperator node and the communications node configured to operate cooperatively to communicate at a first frequency with the plurality of target nodes through the multi-hop path;

identifying a plurality of relay nodes with the communications transmit node, the relay nodes configured to communicate at a second frequency with the plurality of target nodes;

scheduling at the communications transmit node to classify the plurality of target nodes in a coverage zone into multiple groups, wherein each group of target nodes is served by a different transmission scheme;

scheduling at each relay node to serve the plurality of target nodes in the coverage zone such that resource allocation for a group of target nodes is determined by the communications transmit node and resource allocation for another group of target nodes is determined by the relay nodes; and

randomizing a plurality of transmissions based at least on a channel threshold to avoid co-channel interference received by the plurality of target nodes.

10. The method of claim 9 , wherein the communications transmit node transmits a data block comprising a fundamental channel, a downlink map, and a cooperator map.

11. The method of claim 10 , wherein the cooperator map comprises scheduling and modulation coding scheme information determined at the communications transmit node.

12. The method of claim 10 , wherein the downlink map comprises scheduling and modulation coding scheme information determined at the relay nodes.

13. The method of claim 9 , wherein the plurality of transmissions from the communications transmit node are centrally scheduled to serve a target node from the plurality of target nodes using cooperative relaying.

14. The method of claim 9 , wherein the plurality of transmissions from the communications transmit node are centrally scheduled to serve a target node from the plurality of target nodes using successive interference cancellation.

15. The method of claim 9 , wherein the communications transmit node communicates using a distributed scheduling scheme and a centralized scheduling scheme.

16. An article comprising a non-transitory machine-readable medium having stored thereon instructions that, when executed by a computing platform, results in:

identifying a plurality of target nodes with a communications transmit node, the plurality of target nodes being associated with a multi-hop path from the communications transmit node to the plurality of target nodes using a plurality of relay nodes;

selecting a neighbor node of the communications transmit node to operate as a cooperator node, the cooperator node and the communications node configured to operate cooperatively to communicate at a first frequency with the plurality of target nodes through the multi-hop path;

identifying a plurality of relay nodes with the communications transmit node, the relay nodes configured to communicate at a second frequency with the plurality of target nodes;

scheduling at the communications transmit node to classify the plurality of target nodes in a coverage zone into multiple groups, wherein each group of target nodes is served by a different transmission scheme;

scheduling at each relay node to serve the plurality of target nodes in the coverage zone such that resource allocation for a group of target nodes is determined by the communications transmit node and resource allocation for another group of target nodes is determined by the relay nodes; and

randomizing a plurality of transmissions based at least on a channel threshold to avoid co-channel interference received by the plurality of target nodes.

17. The article of claim 16 , wherein the communications transmit node transmits a data block comprising a fundamental channel, a downlink map, and a cooperator map.

18. The article of claim 17 , wherein the cooperator map comprises scheduling and modulation coding scheme information determined at the communications transmit node.

19. The article of claim 17 , wherein the downlink map comprises scheduling and modulation coding scheme information determined at the relay nodes.

20. The article of claim 16 , wherein the plurality of transmissions from the communications transmit node are centrally scheduled to serve a target node from the plurality of target nodes using cooperative relaying.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 14, 2020
From: INTEL CORPORATION
To: APPLE INC.
Reel/Frame 052414/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 18, 2009
From: OYMAN, OZGUR; LI, QINGHUA; HIMAYAT, NAGEEN; SYDIR, JAROSLAW J.
To: INTEL CORPORATION
Reel/Frame 022698/0918 →
Continuity (1)
Related Publication 20090233544A1 · Sep 17, 2009