Routing apparatus and method in a multi-hop relay cellular network

US 20060285505A1
Filed: 06/19/2006
Published: 12/21/2006
Est. Priority Date: 06/18/2005
Status: Abandoned Application

First Claim

Patent Images

1. A routing method in a multi-hop relay cellular network including a mobile station (MS), a base station (BS), and at least one relay station (RS), the method comprising the steps of:

measuring, by at least one RS neighboring the MS, quality of a link to the BS, generating link quality information using the measured link quality, and transmitting the link quality information to the MS; and

receiving, by the MS, the link quality information from the RSs, selecting an optimal path depending on the received link quality information, and transmitting information on the selected optimal path to the BS.

View all claims

1 Assignment

Timeline View

Assignment View

0 Petitions

Accused Products

Abstract

Provided is a routing method in a multi-hop relay cellular network including a mobile station (MS), a base station (BS), and at least one relay station (RS). One of RSs neighboring the MS measures quality of a link to the BS, generates link quality information using the measured link quality, and transmits the link quality information to the MS. The MS receives the link quality information from the RSs, selects an optimal path depending on the received link quality information, and transmits information on the selected optimal path to the BS.

75 Citations

51 Claims

1. A routing method in a multi-hop relay cellular network including a mobile station (MS), a base station (BS), and at least one relay station (RS), the method comprising the steps of:
- measuring, by at least one RS neighboring the MS, quality of a link to the BS, generating link quality information using the measured link quality, and transmitting the link quality information to the MS; and
  
  receiving, by the MS, the link quality information from the RSs, selecting an optimal path depending on the received link quality information, and transmitting information on the selected optimal path to the BS.
- View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
- - 2. The routing method of claim 1, further comprising, upon receiving the optimal path information transmitted by the MS, determining, by the BS, an optimal BS-RS-MS path depending on the received optimal path information, and transmitting information on the determined optimal BS-RS-MS path to the MS.
  - 3. The routing method of claim 1, wherein the optimal path information includes information on at least one RS, having an optimal path predetermined based on the optimal path information.
  - 4. The routing method of claim 1, wherein the step of generating link quality information by the RS further comprises measuring a received signal strength using a preamble signal from one of the BS and at least one neighbor RS, estimating a channel quality value through the measurement of the received signal strength, and generating link quality information using the estimated channel quality value.
  - 5. The routing method of claim 1, wherein the step of generating link quality information by the RS further comprises measuring a received signal strength using a pilot signal from one of the BS and at least one neighbor RS, estimating a channel quality value through the measurement of the received signal strength, and generating link quality information using the estimated channel quality value.
  - 6. The routing method of claim 1, wherein the link quality information includes information on an optimal path from the RS to the BS.
  - 7. The routing method of claim 1, further comprising transmitting the link quality information from each of the RSs to the MS through a preamble signal.
  - 8. The routing method of claim 7, wherein the preamble signal further includes identifier information of a corresponding RS.
  - 9. The routing method of claim 1, further comprising transmitting the link quality information from each of the RSs to the MS through a pilot signal.
  - 10. The routing method of claim 1, further comprising measuring, by the MS, a signal-to-interference and noise ratio (SINR) depending on the received link quality information, and estimating a link quality between the MS and each of the RSs.
  - 11. The routing method of claim 1, further comprising measuring, by the MS, a received signal strength indicator (RSSI) depending on the received link quality information, and estimating a link quality between the MS and each of the RSs.
  - 12. The routing method of claim 1, wherein the MS acquires a channel quality value of a multi-hop path to each of the RSs connected thereto and the BS based on the received link quality information.
  - 13. The routing method of claim 1, wherein the RS determines a Modulation and Coding Scheme (MCS) level value mapped to a received signal strength, selects an index of a BS-RS link quality information value according to the determined MCS level value, and determines a BS-RS link quality information value according to the selected index of the link quality information value.
  - 14. The routing method of claim 13, wherein the MCS level value, the index of the BS-RS link quality information value, and the SINR are determined using a predetermined mapping table.
  - 15. The routing method of claim 1, wherein the step of selecting an optimal path by the MS further comprises:
    - calculating an optimal path'"'"'s effective data rate for each path from the MS to the BS according to the received link quality information; and
      
      selecting an optimal path among the paths from the RSs to the BS depending on the calculated optimal path'"'"'s effective data rate.
  - 16. The routing method of claim 15, wherein the effective data rate is calculated by $E = \frac{1}{1 / R_{1} + 1 / R_{2}}$ where R₁denotes a data rate of a BS-RS link, R₂denotes a data rate of an RS-MS link, and E denotes an effective data rate of a path connected from the BS to the MS via a first RS (RS1).
  - 17. The routing method of claim 15, wherein the effective data rate is calculated by $E_{3} = \frac{1}{1 / R_{3} + 1 / E_{2}} = \frac{1}{1 / R_{3} + 1 / R_{2} + 1 / R_{1}}$ where R₁denotes a data rate of a BS-RS1 link, R₂denotes a data rate of an RS1-RS2 link, R₃denotes a data rate of an RS2-MS link, E₃denotes an effective data rate of a BS-RS1-RS2-MS path, and E₂denotes an effective data rate in the second RS (RS2).
  - 18. The routing method of claim 15, wherein the effective data rate is calculated by $E_{N} = \frac{1}{\sum}$
    - n = 1 N ⁢
      
      1 / R n where R_ndenotes a data rate of an RS(n-1)-RS(n) link, and E_Ndenotes an effective data rate of a BS-RS(n-1)-MS path.

19. A routing method of a relay station (RS) in a multi-hop relay cellular network including a mobile station (MS), a base station (BS), and at least one RS, the method comprising the steps of:
- detecting a preamble of the BS, and determining a data rate of a BS-RS link from a signal-to-interference and noise ratio (SINR) of the BS preamble;
  
  detecting a preamble of each of neighbor RSs, and determining a data rate of an RS-RS link from an SINR of each of the neighbor RSs;
  
  calculating an optimal path'"'"'s effective data rate for each path from each of the RSs to the BS from information data included in the neighbor RSs'"'"' preambles;
  
  selecting an optimal path among the paths from the RSs to the BS depending on the optimal path'"'"'s effective data rate, and reporting information on the selected optimal path to the BS; and
  
  after reporting the optimal path information to the BS, generating its own preamble with a particular sequence and transmitting the preamble sequence.
- View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30)
- - 20. The routing method of claim 19, further comprising, after reporting the optimal path information to the BS, receiving a confirmation of the final optimal path information from the BS.
  - 21. The routing method of claim 19, wherein the step of generating and transmitting a preamble comprises determining an information data index of an RS preamble mapped to the optimal path'"'"'s effective data rate, generating an RS preamble according to the determined information data index, and transmitting the generated RS preamble.
  - 22. The routing method of claim 19, wherein the preamble sequence includes at least one of a pseudo noise (PN) code and an orthogonal code;
    - wherein each subcarrier used as the preamble includes therein one of a corresponding PN code value and an orthogonal code value, or a product of the PN code value and the corresponding orthogonal code value.
  - 23. The routing method of claim 19, wherein the step of determining a quality information value of a BS-RS link, included in the RS preamble, comprises:
    - measuring a signal strength received from the BS using the BS preamble;
      
      extracting a quality value of a channel to the BS using the measured signal strength, and reporting the extracted channel quality value to the BS;
      
      determining a Modulation and Coding Scheme (MCS) level value mapped to a received signal-to-interference and noise ratio (SINR) of the BS using a predetermined mapping table, and selecting an index of an BS-RS link quality information value mapped to the determined MCS level value; and
      
      determining a BS-RS link quality information value to be transmitted through its own RS preamble using the MCS level value and the index of the link quality information value.
  - 24. The routing method of claim 23, wherein the RS previously receives the mapping table from the BS.
  - 25. The routing method of claim 19, wherein the effective data rate is calculated by $E = \frac{1}{1 / R_{1} + 1 / R_{2}}$ where R₁denotes a data rate of a BS-RS1 link, R₂denotes a data rate of an RS1-RS2 link, and E denotes an effective data rate of a path connected from the BS to the second RS (RS2) via the first RS (RS1).
  - 26. The routing method of claim 19, wherein the effective data rate is calculated by $E_{3} = \frac{1}{1 / R_{3} + 1 / E_{2}} = \frac{1}{1 / R_{3} + 1 / R_{2} + 1 / R_{1}}$ where R₁denotes a data rate of a BS-RS1 link, R₂denotes a data rate of an RS1-RS2 link, R₃denotes a data rate of an RS2-RS3 link, E₃denotes an effective data rate of a BS-RS1-RS2-RS3 path, and E₂denotes an effective data rate in the second RS (RS2).
  - 27. The routing method of claim 19, wherein the effective data rate is calculated by $E_{N} = \frac{1}{\sum}$
    - n = 1 N ⁢
      
      1 / R n where R_ndenotes a data rate of an RS(n-1)-RS(n) link, and EN denotes an effective data rate of a BS-RS(n-1)-RS(n) path.
  - 28. The routing method of claim 19, wherein the RS reports to the BS an identifier of a neighbor RS selected through the calculation of the effective data rate, an RS preamble subchannel index mapped to the RS identifier, an orthogonal code index, and a received SINR of the RS.
  - 29. The routing method of claim 19, wherein the RS reports, to the BS, information on at least one predetermined neighbor RS having a high effective data rate based on the effective data rate.
  - 30. The routing method of claim 19, wherein the number of neighbor RSs reported to the BS is previously determined by the BS.

31. A routing method of a mobile station (MS) in a multi-hop relay cellular network including the MS, a base station (BS), and at least one relay station (RS), the method comprising the steps of:
- detecting a preamble of the BS, and determining a data rate of a BS-RS link from a signal-to-interference and noise ratio (SINR) of the BS preamble;
  
  detecting a preamble of each of the RSs, and determining a data rate of an RS-MS link to each of RSs from an SINR of each of the RSs;
  
  calculating an optimal path'"'"'s effective data rate for each path from each of the RSs to the BS from information data included in the RS preamble; and
  
  selecting an optimal path among the paths from the RSs to the BS depending on the optimal path'"'"'s effective data rate, and reporting information on the selected optimal path to the BS.
- View Dependent Claims (32, 33, 34, 35, 36, 37)
- - 32. The routing method of claim 31, further comprising receiving a confirmation of final optimal path information from the BS, after reporting the optimal path information to the BS.
  - 33. The routing method of claim 31, wherein the MS reports, to the BS, information on at least one predetermined RS having a high effective data rate based on the effective data rate.
  - 34. The routing method of claim 31, wherein the number of RSs reported by the MS is previously determined by the BS.
  - 35. The routing method of claim 31, wherein the effective data rate is calculated by $E = \frac{1}{1 / R_{1} + 1 / R_{2}}$ where R₁denotes a data rate of a BS-RS link, R₂denotes a data rate of an RS-MS link, and E denotes an effective data rate of a path connected from the BS to the MS via a first RS (RS1).
  - 36. The routing method of claim 31, wherein the effective data rate is calculated by $E_{3} = \frac{1}{1 / R_{3} + 1 / E_{2}} = \frac{1}{1 / R_{3} + 1 / R_{2} + 1 / R_{1}}$ where R₁denotes a data rate of a BS-RS1 link, R₂denotes a data rate of an RS1-RS2 link, R₃denotes a data rate of an RS2-MS link, E₃denotes an effective data rate of a BS-RS1-RS2-MS path, and E₂denotes an effective data rate in the second RS (RS2).
  - 37. The routing method of claim 31, wherein the effective data rate is calculated by $E_{N} = \frac{1}{\sum}$
    - n = 1 N ⁢
      
      1 / R n where R_ndenotes a data rate of an RS(n-1)-RS(n) link, and E_Ndenotes an effective data rate of a BS-RS(n-1)-MS path.

38. A routing apparatus in a multi-hop relay cellular network including a mobile station (MS), a base station (BS), and at least one relay station (RS), the apparatus comprising:
- at least one RS for measuring quality of a link to the BS, generating link quality information using the measured link quality, and transmitting the link quality information to the MS.
- View Dependent Claims (39, 40, 41, 42, 43, 44)
- - 39. The routing apparatus of claim 38, wherein the RS measures a received signal strength using a preamble signal of one of the BS and each of neighbor RSs, estimates a channel quality value through the measurement of the received signal strength, and generates link quality information using the estimated channel quality value.
  - 40. The routing apparatus of claim 39, wherein the RS measures a received signal strength using a pilot signal of one of the BS and each of neighbor RSs, estimates a channel quality value through the measurement of the received signal strength, and generates link quality information using the estimated channel quality value.
  - 41. The routing apparatus of claim 39, wherein the link quality information includes information on an optimal path to the BS.
  - 42. The routing apparatus of claim 39, wherein the RS transmits the link quality information to the MS using at least one of a preamble signal and a pilot signal.
  - 43. The routing apparatus of claim 39, wherein the RS determines a Modulation and Coding Scheme (MCS) level value mapped to the received signal strength, selects an index of a BS-RS link quality information value according to the determined MCS level value, and determines a BS-RS link quality information value according to the selected index of the link quality information value.
  - 44. The routing apparatus of claim 43, wherein the MCS level value, the index of the BS-RS link quality information value, and the SINR are determined using a predetermined mapping table.

45. A routing apparatus in a multi-hop relay cellular network including a mobile station (MS), a base station (BS), and at least one relay station (RS), the apparatus comprising:
- the MS for receiving link quality information generated through measurement of quality of a link from each of the RSs to the BS, selecting an optimal path to the BS using the link quality information, and transmitting information on the selected optimal path to the BS.
- View Dependent Claims (46, 47, 48, 49, 50, 51)
- - 46. The routing apparatus of claim 45, wherein the MS measures one of a signal-to-interference and noise ratio (SINR) and a received signal strength indicator (RSSI) depending on the received link quality information, and estimates quality of a link between the MS and each of the RSs.
  - 47. The routing apparatus of claim 45, wherein the MS acquires a channel quality value of a multi-hop path connected from the MS itself to the RSs and the BS based on the received link quality information.
  - 48. The routing apparatus of claim 45, wherein the MS calculates an optimal path'"'"'s effective data rate for each path from the MS to the BS based on the received link quality information, and selects an optimal path among the paths from the RSs to the BS based on the optimal path'"'"'s effective data rate.
  - 49. The routing apparatus of claim 48, wherein the effective data rate is calculated by $E = \frac{1}{1 / R_{1} + 1 / R_{2}}$ where R₁denotes a data rate of a BS-RS link, R₂denotes a data rate of an RS-MS link, and E denotes an effective data rate of a path connected from the BS to the MS via a first RS (RS1).
  - 50. The routing apparatus of claim 48, wherein the effective data rate is calculated by $E_{3} = \frac{1}{1 / R_{3} + 1 / E_{2}} = \frac{1}{1 / R_{3} + 1 / R_{2} + 1 / R_{1}}$ where R₁denotes a data rate of a BS-RS1 link, R₂denotes a data rate of an RS1-RS2 link, R₃denotes a data rate of an RS2-MS link, E₃denotes an effective data rate of a BS-RS1-RS2-MS path, and E₂denotes an effective data rate in the second RS (RS2).
  - 51. The routing apparatus of claim 48, wherein the effective data rate is calculated by $E_{N} = \frac{1}{\sum}$
    - n = 1 N ⁢
      
      1 / R n where R_ndenotes a data rate of an RS(n-1)-RS(n) link, and EN denotes an effective data rate of a BS-RS(n-1)-MS path.

Specification

Resources

Litigation Campaign Assessment

Current Assignee
Samsung Electronics Co. Ltd.
Original Assignee
Samsung Electronics Co. Ltd.
Inventors
Cho, Jae-Weon, Lee, Mi-Hyun, Lee, Geun-Ho, Lee, Sung-Jin, Son, Yeong-Moon, Kang, Hyun-Jeong, Son, Jung-Je, Lim, Hyoung-Kyu, Joo, Pan-Yuh

Application Number

US11/455,892
Publication Number

US 20060285505A1
Time in Patent Office

Days
Field of Search
US Class Current

370/254
CPC Class Codes

H04L 45/00   Routing or path finding of ...

H04L 47/10   Flow control; Congestion co...

H04L 47/26   using explicit feedback to ...

H04W 8/04   Registration at HLR or HSS ...

Routing apparatus and method in a multi-hop relay cellular network

First Claim

1 Assignment

0 Petitions

Accused Products

Abstract

75 Citations

51 Claims

Specification

Solutions

Use Cases

Quick Links

Routing apparatus and method in a multi-hop relay cellular network

First Claim

1 Assignment

Subscription Required

Subscription Required

0 Petitions

Subscription Required

Accused Products

Subscription Required

Abstract

75 Citations

51 Claims

Specification

Subscription Required

Solutions

Use Cases

Quick Links