IP Library Granted Patent US 8,509,089
Granted Patent B2
US 8,509,089 · App. 13/406,176 · Granted Aug 13, 2013

Path selection for a wireless system with relays

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 8,509,089
App. No.
13/406,176
Granted
Aug 13, 2013
Kind
B2
Abstract

A method selects a path for forwarding a data packet in a wireless communication system. A system capacity versus delay impact curve is calculated for a direct path to mobile station. The direct path has a capacity cost based on communication quality of a direct link between a base station and the mobile station. This curve is shifted by a predetermined time corresponding to an additional delay over a relay path to produce a projected capacity curve for the relay path having a second capacity cost determined according to a combined measure of signal quality of multiple links in the relay path. The second capacity cost is multiplied by a capacity cost ratio to produce a relay capacity curve. The direct path or the relay path is selected based on a comparison of the system capacity versus delay impact curve and the relay capacity curve according to a QoS requirement.

Claims (41)

1. A method of selecting a path for forwarding a data packet between a user station and a base station in a wireless communication system, the wireless communication system having at least two possible paths for forwarding the data packet between the user station and the base station, at least one of the possible paths being via at least one relay station, the method comprising:

determining a preferred path for forwarding the data packet based at least in part on a combination of anticipated delay at each station on each possible path and data rate for transmission between each pair of stations on each possible path; and

forwarding the data packet between the user station and the base station on the determined preferred path;

wherein determining the preferred path comprises determining the preferred path for the user station and maintaining that preferred path for that user station.

2. The method of claim 1 , wherein determining the preferred path includes determining a preferred path having a greatest effective system capacity for the data packet based at least in part on the combination of the anticipated delay at each station on each possible path and data rate for transmission between each pair of stations on each possible path.

3. The method of claim 2 , wherein determining the path having the greatest effective system capacity comprises comparing effective system capacities for two possible paths by:

determining an effective transmission data rate gain for one possible path relative to the other possible path;

determining an effective delay penalty for the one possible path relative to the other possible path;

preferring the one possible path to the other possible path when the product of the effective transmission data rate gain and the effective delay penalty is greater than one; and

preferring the other possible path to the one possible path when the product of the effective transmission data rate gain and the effective delay penalty is not greater than one.

4. The method of claim 3 , wherein the effective data rate gain is a ratio of an effective transmission data rate for the one possible path to an effective transmission data rate for the other possible path.

5. The method of claim 4 , wherein the effective transmission data rate for each path is a transmission data rate for each hop on that path divided by the number of hops on that path.

6. The method of claim 3 , wherein the effective delay penalty is a ratio of an effective data rate for the packet for the one possible path taking into account the anticipated delay at each station on the one possible path to an effective data rate for the packet for other possible path taking into account the anticipated delay at each station on the other possible path.

7. The method of claim 1 , wherein determining the preferred path comprises determining the preferred path dynamically, packet by packet.

8. The method of claim 1 , wherein determining the preferred path comprises determining a preferred path for a data stream of the user station based on service requirements of that data stream, and maintaining that preferred path for that data stream.

9. The method of claim 8 , wherein determining the preferred path further comprises determining the preferred path dynamically, data stream by data stream.

10. The method of claim 1 , wherein determining the preferred path is further based on at least one of a required data rate, a type of service, a user priority, user mobility, system loading, fairness and an effective data rate.

11. The method of claim 1 , wherein determining the preferred path is further based at least in part on a modified combined index, the modified combined index being based at least in part on at least one of a required data rate, a type of service, a user priority, user mobility, system loading, fairness and an effective data rate, the modified combined index being created by biasing path selection in consideration of additional capacity cost and delay impact.

12. The method of claim 1 , wherein:

determining the preferred path comprises determining the preferred path from the user station to the base station; and

the preferred path is determined at the user station.

13. The method of claim 1 , wherein:

determining the preferred path comprises determining a preferred path from the base station to the user station; and

the preferred path is determined at the base station.

14. A method of selecting a path for forwarding a data packet between a user station and a base station in a wireless communication system, the wireless communication station having at least two possible paths for forwarding the data packet between the user station and the base station, at least one of the possible paths being via at least one relay station, the method

comprising:

when the data packet is associated with a delay-sensitive service:

determining a preferred path for forwarding the data packet based at least in part on a combination of anticipated delay at each station on each possible path and data rates for transmission between each pair of stations on each possible path; and

forwarding the data packet between the user station and the base station on the preferred path; and

when the data packet is associated with a delay-insensitive service:

determining a preferred path for forwarding the data packet based at least in part on data rates for transmission between each pair of stations on each possible path without accounting for anticipated delay at each station on each possible path;

wherein determining the preferred path comprises determining the preferred path for the user station and maintaining that preferred path for that user station.

15. The method of claim 14 , wherein determining the preferred path when the data packet is associated with a delay-sensitive service comprises determining the preferred path having a greatest effective system capacity for the data packet based at least in part on the combination of the anticipated delay at each station on each possible path and data rates for transmission between each pair of stations on each possible path.

16. The method of claim 15 , wherein determining the path having the greatest effective system capacity comprises comparing effective system capacities for two possible paths by:

determining an effective transmission data rate gain for one possible path relative to the other possible path;

determining an effective delay penalty for the one possible path relative to the other possible path;

preferring the one possible path to the other possible path when the product of the effective transmission data rate gain and the effective delay penalty is greater than one; and

preferring the other possible path to the one possible path when the product of the effective transmission data rate gain and the effective delay penalty is not greater than one.

17. The method of claim 16 , wherein the effective data rate gain is a ratio of an effective transmission data rate for the one possible path to an effective transmission data rate for the other possible path.

18. The method of claim 17 , wherein the effective transmission data rate for each path is a transmission data rate for each hop on the path divided by the number of hops on the path.

19. The method of claim 16 , wherein the effective delay penalty is a ratio of an effective data rate for the packet for the one possible path taking into account the anticipated delays at each station on the possible path to an effective data rate for the packet for other possible path taking into account the anticipated delays at each station on the other possible path.

Assignments (7)
NUNC PRO TUNC ASSIGNMENT Recorded Jun 19, 2023
From: BLACKBERRY LIMITED
To: MALIKIE INNOVATIONS LIMITED
Reel/Frame 064271/0199 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 16, 2023
From: BLACKBERRY LIMITED
To: MALIKIE INNOVATIONS LIMITED
Reel/Frame 064104/0103 →
CHANGE OF NAME Recorded Mar 15, 2016
From: RESEARCH IN MOTION LIMITED
To: BLACKBERRY LIMITED
Reel/Frame 038087/0963 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 28, 2013
From: NORTEL NETWORKS LIMITED
To: ROCKSTAR BIDCO, LP
Reel/Frame 030714/0129 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 15, 2012
From: SENARATH, NIMAL GAMINI; YU, DEREK; ZHANG, HANG; BAHCECI, ISRAFIL; ZHU, PEIYING; TONG, WEN
To: NORTEL NETWORKS LIMITED
Reel/Frame 028793/0098 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 10, 2012
From: ROCKSTAR BIDCO, LP
To: 2256355 ONTARIO LIMITED
Reel/Frame 028019/0808 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 10, 2012
From: 2256355 ONTARIO LIMITED
To: RESEARCH IN MOTION LIMITED
Reel/Frame 028020/0001 →