Language selection

Search

Patent 2623988 Summary

Third-party information liability

Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.

Claims and Abstract availability

Any discrepancies in the text and image of the Claims and Abstract are due to differing posting times. Text of the Claims and Abstract are posted:

  • At the time the application is open to public inspection;
  • At the time of issue of the patent (grant).
(12) Patent: (11) CA 2623988
(54) English Title: METHOD, WIRELESS COMMUNICATION SYSTEM, COMMUNICATION APPARATUS, AND TANGIBLE MACHINE-READABLE MEDIUM FOR ESTABLISHING A ROUTING PATH DURING A NETWORK ENTRY PROCESS OF A SUBSCRIBERSTATION BASED ON A MULTI-HOP RELAY STANDARD
(54) French Title: METHODE, SYSTEME DE COMMUNICATION SANS FIL, APPAREIL DE COMMUNICATION, ET SUPPORT TANGIBLE LISIBLE PAR MACHINE PERMETTANT D'ETABLIR UN TRAJET DE ROUTAGE LORS D'UN PROCESSUS D'ACCESAU RESEAU D'UN POSTE D'ABONNE, EN FONCTION D'UNE NORME DE RELAIS A PLUSIEURS BONDS
Status: Deemed Expired
Bibliographic Data
(51) International Patent Classification (IPC):
  • H4B 7/15 (2006.01)
  • H4W 40/00 (2009.01)
(72) Inventors :
  • TSAI, YI-HSUEH (Taiwan, Province of China)
  • HSIEH, CHIH-CHIANG (Taiwan, Province of China)
  • LOA, KAN-CHEI (Taiwan, Province of China)
  • LEE, YUNG-TING (Taiwan, Province of China)
(73) Owners :
  • INSTITUTE FOR INFORMATION INDUSTRY
(71) Applicants :
  • INSTITUTE FOR INFORMATION INDUSTRY (Taiwan, Province of China)
(74) Agent: RICHES, MCKENZIE & HERBERT LLP
(74) Associate agent:
(45) Issued: 2012-04-10
(22) Filed Date: 2008-03-05
(41) Open to Public Inspection: 2008-09-06
Examination requested: 2008-03-05
Availability of licence: N/A
Dedicated to the Public: N/A
(25) Language of filing: English

Patent Cooperation Treaty (PCT): No

(30) Application Priority Data:
Application No. Country/Territory Date
11/954,972 (United States of America) 2007-12-12
60/893,131 (United States of America) 2007-03-06

Abstracts

English Abstract


A method, a wireless communication system, a communication apparatus, and a
tangible
machine-readable medium for establishing a routing path during a network entry
process of
an SS based on a multi-hop relay standard are provided. The wireless
communication
system comprises a base station (BS), a subscriber station (SS), and a relay
station (RS).
The SS transmits a ranging request (RNG-REQ) of the SS by a ranging connection
identification (CID) to the BS through the RS. The BS allocates an SS CID and
a routing
path for the SS, and transmits a ranging response (RNG-RSP) having the SS CID
and the
routing path by a path CID to the RS. The RS updates the SS CID and the
routing path into
a routing table of the RS after receiving the RNG-RSP, and transmits the RNG-
RSP having
the SS CID by the ranging CID to the SS.


French Abstract

La présente invention concerne un système de communication sans fil, un appareil de communication et un support tangible exploitable par machine permettant d'établir un trajet d'acheminement lors du processus d'entrée réseau d'un poste d'abonné en fonction d'une norme de relais à sauts multiples. Le système de communication sans fil comprend un poste de base (BS), un poste d'abonné (SS) et un poste de relais (RS). Le poste SS transmet une demande de télémétrie (RNG-REQ) du poste SS au moyen d'une identité de connexion de télémétrie (CID) au poste de base (BS) par le biais du poste de relais (RS). Le poste BS attribue une connexion CID au poste SS et un trajet d'acheminement pour ce dernier et transmet une réponse de télémétrie (RNG-RSP) comportant l'identité CID du poste SS, ainsi que le trajet d'acheminement par la connexion CID au poste RS. Ce dernier met à jour l'identité CID du poste SS et le trajet d'acheminement dans une table de routage du poste RS sur la réception de la réponse RNG-RSP et transmet cette dernière (RNG- RSP), qui comporte l'identité CID du poste SS par la télémétrie CID au poste SS.

Claims

Note: Claims are shown in the official language in which they were submitted.


What is claimed is:
1. A method for establishing a routing path during a network entry process of
a
subscriber station (SS) based on a multi-hop relay standard, comprising the
steps of:
transmitting a ranging request (RNG-REQ) of the SS by a ranging connection
identification (CID) from the SS to a base station (BS) through a first relay
station
(RS);
allocating an SS CID and a routing path for the SS by the BS;
transmitting a ranging response (RNG-RSP) having the SS CID and the routing
path by a
path CID from the BS to the first RS;
updating the SS CID and the routing path into a routing table of the first RS
after
receiving the RNG-RSP; and
transmitting the RNG-RSP having the SS CID by the ranging CID from the first
RS to
the SS.
2. The method as claimed in claim 1, wherein the step of transmitting the RNG-
REQ
further comprises the step of transmitting the RNG-REQ by a first RS CID from
the first RS
to the BS.
3. The method as claimed in claim 1, wherein the SS CID is one of an SS basic
CID
and an SS primary CID.
4. The method as claimed in claim 1, wherein the SS is one of a second RS and
a
mobile station (MS).
5. A method for an RS having an RS CID to establish a routing path during a
network
13

entry process of an SS based on a multi-hop relay standard, comprising the
steps of:
receiving an RNG-RSP having an SS CID and a routing path for the SS by a path
CID;
updating the SS CID and the routing path into a routing table of the RS after
receiving
the RNG-RSP; and
transmitting the RNG-RSP having the SS CID by a ranging CID to the SS.
6. The method as claimed in claim 5, further comprising the steps of:
starting a timeout period after the SS CID and the routing path are updated;
and
receiving a dynamic service addition request (DSA-REQ) having the SS CID by
the RS
CID;
wherein when the DSA-REQ is received in the timeout period, the SS CID and the
routing path are still kept in the routing table.
7. The method as claimed in claim 5, further comprising the steps of:
starting a timeout period after the SS CID and the routing path are updated;
and
receiving a dynamic service addition request (DSA-REQ) having the SS CID by
the RS
CID;
wherein when the DSA-REQ is received out of the timeout period, the SS CID and
the
routing path are removed from the routing table.
8. The method as claimed in claim 5, wherein the SS CID is one of an SS basic
CID
and an SS primary CID.
9. The method as claimed in claim 5, wherein the SS is one of another RS and
an MS.
10. A wireless communication system for establishing a routing path during a
network
14

entry process of an SS based on a multi-hop relay standard, comprising:
a first RS having a routing table;
a BS; and
an SS for transmitting an RNG-REQ of the SS by a ranging CID to the BS through
the
first RS;
wherein the BS allocates an SS CID and a routing path for the SS, and
transmits an
RNG-RSP having the SS CID and the routing path by a path CID to the first RS,
the first RS updates the SS CID and the routing path into the a routing table
of the
first RS after receiving the RNG-RSP, and transmits the RNG-RSP having the SS
CID by the ranging CID to the SS.
11. The wireless communication system as claimed in claim 10, wherein the
first RS
transmits the RNG-REQ by a first RS CID to the BS.
12. The wireless communication system as claimed in claim 10, wherein the SS
CID is
one of an SS basic CID and an SS primary CID.
13. The wireless communication system as claimed in claim 10, wherein the SS
is one
of a second RS and an MS.
14. A communication apparatus for establishing a routing path during a network
entry
process of an SS based on a multi-hop relay standard, comprising:
a receiving module for receiving an RNG-RSP having an SS CID and a routing
path for
the SS by a path CID;
a memory for storing a routing table;

a processor for updating the SS CID and the routing path into the routing
table of the RS
after receiving the RNG-RSP; and
a transmitting module for transmitting the RNG-RSP having the SS CID by a
ranging
CID to the SS;
15. The communication apparatus as claimed in claim 14, further comprising:
a timer for starting a timeout period after the SS CID and the routing path
are updated;
wherein when the receiving module receives a DSA-REQ having the SS CID by the
RS
CID in the timeout period, the SS CID and the routing path are still kept in
the
routing table.
16. The communication apparatus as claimed in claim 14, further comprising:
a timer for starting a timeout period after the SS CID and the routing path
are updated;
wherein when the receiving module receives a DSA-REQ having the SS CID by the
RS
CID out of the timeout period, the SS CID and the routing path are removed
from
the routing table.
17. The communication apparatus as claimed in claim 14, wherein the SS CID is
one of
an SS basic CID and an SS primary CID.
18. The communication apparatus as claimed in claim 14, wherein the SS is one
of
another RS and an MS.
19. A tangible machine-readable medium having executable code to perform a
method
for establishing a routing path during a network entry process of an SS based
on a multi-hop
relay standard, the method comprising steps of:
16

transmitting an RNG-REQ of the SS by a ranging CID from the SS to a BS through
a
first RS;
allocating an SS CID and a routing path for the SS by the BS;
transmitting an RNG-RSP having the SS CID and the routing path by a path CID
from
the BS to the first RS;
updating the SS CID and the routing path into a routing table of the first RS
after
receiving the RNG-RSP; and
transmitting the RNG-RSP having the SS CID by the ranging CID from the first
RS to
the SS.
20. The tangible machine-readable medium as claimed in claim 19, wherein the
step of
transmitting the RNG-REQ further comprises the step of transmitting the RNG-
REQ by a first
RS CID from the first RS to the BS.
21. The tangible machine-readable medium as claimed in claim 19, wherein the
SS CID
is one of an SS basic CID and an SS primary CID.
22. The tangible machine-readable medium as claimed in claim 19, wherein the
SS is
one of a second RS and an MS.
23. A tangible machine-readable medium having executable code to cause a
machine to
perform a method for an RS having an RS CID to establish a routing path during
a network
entry process of an SS based on a multi-hop relay standard, the method
comprising steps of.
receiving an RNG-RSP having an SS CID and a routing path for the SS by a path
CID;
updating the SS CID and the routing path into a routing table of the RS after
receiving
17

the RNG-RSP; and
transmitting the RNG-RSP having the SS CID by a ranging CID to the SS.
24. The tangible machine-readable medium as claimed in claim 23, wherein the
method
further comprises the steps of:
starting a timeout period after the SS CID and the routing path are updated;
and
receiving a DSA-REQ having the SS CID by the RS CID;
wherein when the DSA-REQ is received in the timeout period, the SS CID and the
routing path are still kept in the routing table.
25. The tangible machine-readable medium as claimed in claim 23, wherein the
method
further comprises the steps of:
starting a timeout period after the SS CID and the routing path are updated;
and
receiving a dynamic service addition request (DSA-REQ) having the SS CID by
the RS
CID;
wherein when the DSA-REQ is received out of the timeout period, the SS CID and
the
routing path are removed from the routing table.
26. The tangible machine-readable medium as claimed in claim 23, wherein the
SS CID
is one of an SS basic CID and an SS primary CID.
27. The tangible machine-readable medium as claimed in claim 23, wherein the
SS is
one of another RS and an MS.
18

Description

Note: Descriptions are shown in the official language in which they were submitted.


CA 02623988 2011-09-27
METHOD, WIRELESS COMMUNICAITON SYSTEM,
COMMUNICATION APPARATUS, AND TANGIBLE
MACHINE-READABLE MEDIUM FOR ESTABLISHING A ROUTING
PATH DURING A NETWORK ENTRY PROCESS OF A SUBSCRIBER
STATION BASED ON A MULTI-HOP RELAY STANDARD
BACKGROUND OF THE INVENTION
Field of the Invention
The present invention relates to a method, a wireless communication system, a
communication apparatus, and a tangible machine-readable medium for
establishing a routing
path. More specifically, the present invention relates to a method, a wireless
communication
system, a communication apparatus, and a tangible machine-readable medium for
establishing
a routing path during a network entry process of a subscriber station (SS)
based on a
multi-hop relay standard.
Descriptions of the Related Art
1

CA 02623988 2011-09-27
Although the IEEE 802.16 standard already provides greater bandwidths, lower
building
cost, better service quality and expansibility, there still exist some defects
of coverage and
signal quality of the IEEE 802.16 standard. Therefore, the IEEE 802.16j
standard working
group established a multi-hop relay study group in July, 2005 for building a
multi-hop relay
standard.
In conventional IEEE 802.16 standard, network entry process is easily to
execute
because a base station (BS) and a plurality of subscriber stations (SSs)
transmit data to each
other directly. But in the multi-hop relay standard, such as the IEEE 802.16j
standard, there
are relay stations (RSs) to relay data between the BS and the SSs.
Accordingly, the routing
paths between the BS and the SSs are more complicated because of data's relay,
so that the
network entry process will be more difficult between the BS and the SSs.
When an SS, such as a mobile station (MS), enters into a multi-hop relay
stations
(MR-RSs) network under the IEEE 802.16j during a network entry process, a
solution to
choosing and/or managing relay paths of the MR-RSs network under the IEEE
802.16j
standard which transmit data from a BS to the SS is desired.
SUMMARY OF THE INVENTION
One objective of this invention is to provide a method for establishing a
routing path
during a network entry process of a subscriber stations (SS) based on a multi-
hop relay
standard. The method comprises the following steps: transmitting a ranging
request (RNG-REQ) of the SS by a ranging connection identification (CID)
from the SS to abase station (BS) through an relay station (RS); allocating SS
2

CA 02623988 2008-03-05
CIDs and a routing path for the SS; transmitting a ranging response (RNG-RSP)
having the
SS CIDs and the routing path by a path CID (such as a tunnel management CID or
an RS
basic CID) from the BS to the RS; updating the SS CIDs and the routing path
into a routing
table of the RS after receiving the RNG-RSP; and transmitting the RNG-RSP
having the SS
CIDs by the ranging CID from the RS to the SS.
Another objective of this invention is to provide a method for an RS having an
RS CID
to establish a routing path during a network entry process of an SS based on a
multi-hop relay
standard. The method comprises the following steps: receiving an RNG-RSP
having SS
CIDs and a routing path for the SS by a path CID (such as a tunnel management
CID or an RS
basic CID); updating the SS CIDs and the routing path into a routing table of
the RS after
receiving the RNG-RSP; and transmitting the RNG-RSP having the SS CIDs by a
ranging
CID to the SS.
Another objective of this invention is to provide a wireless communication
system for
establishing a routing path during a network entry process of an SS based on a
multi-hop relay
standard. The wireless communication system comprises a BS, an SS, and an RS.
The SS
transmits an RNG-REQ of the SS by a ranging CID to the BS through the RS. The
BS
allocates an SS CIDs and a routing path for the SS, and transmits an RNG-RSP
having the SS
CIDs and the routing path by a path CID (such as a tunnel management CID or an
RS basic
CID) to the RS. The RS updates the SS CIDs and the routing path into a routing
table of the
RS after receiving the RNG-RSP, and transmits the RNG-RSP having the SS CIDs
by the
ranging CID to the SS.
3

CA 02623988 2011-09-27
Another objective of this invention is to provide a communication apparatus
for
establishing a routing path during a network entry process of an SS based on a
multi-hop relay
standard. The communication apparatus comprises a receiving module, a memory,
a
processor, and a transmitting module. The receiving module receives an RNG-RSP
having
SS CIDs and a routing path for the SS by a path CID (such as RS basic CID or
tunnel
management CID). The memory stores a routing table. The processor updates the
SS
CIDs and the routing path into the routing table after receiving the RNG-RSP.
The
transmitting module transmits the RNG-RSP having the SS CIDs by a ranging CID
to the SS.
Another objective of this invention is to provide a tangible machine-readable
medium
having executable code to perform a method for establishing a routing path
during a network
entry process of an SS based on a multi-hop relay standard. The method
comprises the
following steps: transmitting an RNG-REQ of the SS by a ranging CID from the
SS to a BS
through an RS; allocating an SS CIDs and a routing path for the SS;
transmitting an
RNG-RSP having the SS CIDs and the routing path by a path CID (such as a
tunnel
management CID or an RS basic CID) from the BS to the RS; updating the SS CIDs
and the
routing path into a routing table of the RS after receiving the RNG-RSP; and
transmitting the
RNG-RSP having the SS CIDs by the ranging CID from the RS to the SS.
Yet a further objective of this invention is to provide a tangible machine-
readable
medium having executable code to cause a machine to perform a method for an RS
having an
RS CID to establish a routing path during a network entry process of an SS
based on a
multi-hop relay standard. The method comprises the following steps: receiving
an
4

CA 02623988 2008-03-05
RNG-RSP having SS CIDs and a routing path for the SS by a path CID (such as a
tunnel
management CID or an RS basic CID); updating the SS CIDs and the routing path
into a
routing table of the RS after receiving the RNG-RSP; and transmitting the RNG-
RSP having
the SS CIDs by a ranging CID to the SS.
The aforesaid method can be executed by wireless communication apparatus, such
as a
BS or an RS in the wireless communication system. By receiving an RNG-RSP
which has
an SS CIDs and a routing path for an SS form the BS, and updating the SS CIDs
and the
routing path into a routing table which is stored in the RS, this invention
can choose and/or
manage relay paths of the RS of the wireless communication system. Thus, data
of the
wireless communication system based on a multi-hop relay standard can be
transmitted
successfully among the BS, RSs, and SSs.
The detailed technology and preferred embodiments implemented for the subject
invention are described in the following paragraphs accompanying the appended
drawings for
people skilled in this field to well appreciate the features of the claimed
invention.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG 1 illustrates a multi-hop relay wireless communication system of a first
embodiment of the present invention;
FIG 2 illustrates a block diagram of an RS of the first embodiment;
FIG 3 illustrates diagrams of data transmission of network entry process of an
SS of the
first embodiment;
5

CA 02623988 2011-09-27
FIG. 4 is a flow chart illustrating a second embodiment of the present
invention; and
FIG 5 is a flow chart illustrating a third embodiment of the present
invention.
DESCRIPTION OF THE PREFERRED EMBODIMENT
As illustrated in FIG 1, a first embodiment of the present invention is a
multi-hop relay
wireless communication system 1 based on a multi-hop relay standard, such as
IEEE 802.16j
standard. The multi-hop relay wireless communication system I comprises a base
station
(BS) 101, a plurality of relay stations (RSs) 103, 105, and a subscriber
station (SS) 107. For
the sake of simplification, two RSs (RS1 103, and RS2 105) are illustrated.
The SS 107 can
be an MS or another RS which can provide functions based on the multi-hop
relay standard.
The RSs 103, 105 of the multi-hop relay wireless communication system I is
illustrated in
FIG 2, which comprises a receiving module 201, a processor 203, a transmitting
module 205,
a memory 207, and a timer 209. Data transmission of network entry process of
the SS 107
based on the multi-hop relay wireless communication system 1 is illustrated in
FIG 3.
In FIG. 3, because the RS1 103 and the RS2 105 have entered into the multi-hop
relay
stations system 1, the SS 107 can execute the network entry process to enter
into the
multi-hop relay stations system 1 via the RS1 103 and the RS2 105. When
starting the
network entry process, the SS 107 transmits a ranging request (RNG-REQ)
RNGM_r2 which
comprises an SS MAC address of the SS 107 by a ranging connection
identification
(CID) to the RS2. The ranging CID is used in the network entry process.
After the receiving module 201 of the RS2 105 receives the RNG-REQ
RNGM_r2 and the processor 203 of the RS2 105 processes the RNG-REQ RNGM-r2,
6

CA 02623988 2011-09-27
the transmitting module 205 of the RS2 105 transmits an RNG-REQ RNGr2-ri which
comprises the SS MAC address with hashed message authentication code and/or
cipher-based
message authentication code (HMAC/CMAC) by the RS2 basic CID/tunnel management
CID
to the RS1 103. And after receiving the RNG-REQ RNGr2-,I, the RS1 103
transmits an
RNG-REQ RNGrI-B which comprises the SS MAC address with HMAC/CMAC by the RS2
basic CID to the BS 101.
After the BS 101 receives the RNG-REQ RNGrI-B, the BS 101 will allocate an SS
basic
CID, an SS primary CID, and a routing path for the SS 107. Then the BS 101
transmits a
ranging response (RNG-RSP) RNGB_rl which comprises the SS basic CID, the SS
primary
CID, and the routing path of the SS 107 with HMAC/CMAC by a path CID to the
RS1 103.
The RS1 103 updates the SS basic CID, the SS primary CID, the RS2 basic
CID/tunnel
management CID, and the routing path of the SS 107 into a routing table which
is stored in
the memory 207 of the RS1 103. After that, the RS1 103 transmits an RNG-RSP
RNGr1-r2
which comprises the SS basic CID and the SS primary CID with HMAC/CMAC by the
path
CID to the RS2 105. Then, the RS2 105 will update the SS basic CID, the SS
primary CID,
and the routing path of the SS 107 into a routing table which is stored in the
memory 207 of
the RS2 105. Finally, the RS2 105 transmits an RNG-RSP RNGr2-M which comprises
the SS
basic CID and the SS primary CID by the ranging CID to the SS 107 so that the
SS 107 will
be assigned the SS basic CID and the SS primary CID.
After the routing table of the RS1 103 is updated, a timer 209 of the RS1 103
starts a
timeout period to wait the BS 101 to transmit a dynamic service addition
request (DSA-REQ).
7

CA 02623988 2011-09-27
Similarly, a timer 209 of the RS2 105 starts another timeout period to wait
the BS 101 to
transmit a DSA-REQ.
Second, the SS 107 transmits an SS basic capability request (SBC-REQ) SBCM-r2
by the
SS basic CID to the RS2 105, the RS2 105 transmits an SBC-REQ SBCr2-r1 by the
SS basic
CID to the RS1 103, and the RS1 103 transmits an SBC-REQ SBCr1_B by the SS
basic CID to
the BS 101. After processing the SBC-REQ SBCr1-B, the BS 101 transmits an SS
basic
capability response (SBC-RSP) SBCB-r1 by the SS basic CID to the RS, 103, the
RS, 103
transmits an SBC-RSP SBCr1-r2 by the SS basic CID to the RS2 105, and the RS2
105
transmits an SBC-RSP SBCr2-M by the SS basic CID to the SS 107.
Third, the SS 107 transmits a privacy key management request (PKM-REQ) PKMM-r2
by the SS primary CID to the RS2 105, the RS2 105 transmits a PKM-REQ PKMr2-ri
by the
SS primary CID to the RS1 103, and the RS, 103 transmits a PKM-REQ PKMr1-B by
the SS
primary CID to the BS 101. After processing the PKM-REQ PKMr1.B, the BS 101
transmits
a privacy key management response (PKM-RSP) PKMB-r1 by the SS primary CID to
the RS,
103, the RS1 103 transmits a PKM-RSP PKMr1_r2 by the SS primary CID to the RS2
105, and
the RS2 105 transmits a PKM-RSP PKMr2_M by the SS primary CID to the SS 107.
Fourth, the SS 107 transmits a registration request (REG-REQ) REGM-r2 with
HMAC/CMAC by the SS primary CID to the RS2 105, the RS2 105 transmits an REG-
REQ
REGr2.r1 with HMAC/CMAC by the SS primary CID to the RS, 103, and the RS, 103
transmits an REG-REQ REGr1-B with HMAC/CMAC by the SS primary CID to the BS
101.
After processing the REG-REQ REGr1-B, the BS 101 transmits a registration
response
8

CA 02623988 2011-09-27
(REG-RSP) REGB_E1 with HMAC/CMAC by the SS primary CID to the RS, 103, the RS,
103 transmits an REG-RSP REGr1_r2 with HMAC/CMAC by the SS primary CID to the
RS2
105, and the RS2 105 transmits an REG-RSP REGr2_M with HMAC/CMAC by the SS
primary CID to the SS 107.
Finally, the BS 101 transmits a DSA-REQ DSAB_rl which comprises the SS basic
CID
with HMAC/CMAC by the RS2 primary CID to the RS, 103 and the RS, 103 transmits
a
DSA-REQ DSAr,_r2 which comprises the SS basic CID with HMAC/CMAC by the RS2
primary CID to the RS2 105. If the RS1 103 receives the DSA-REQ DSAB_r1 in the
timeout
period which is started by the timer 209 of the RS1 103, the SS basic CID, the
SS primary
CID, the RS2 basic CID/tunnel management CID, and the routing path of the SS
107 stored in
the routing table of the RS1 103 will be kept. Otherwise, if the RS1 103
receives the
DSA-REQ DSAB_rl out of the timeout period which is started by the timer 209 of
the RS1 103,
the SS basic CID, the SS primary CID, the RS2 basic CID/tunnel management CID,
and the
routing path of the SS 107 stored in the routing table of the RS1 103 will be
removed.
Similarly, if the RS2 105 receives the DSA-REQ DSAr1_r2 in the timeout period
which is
started by the timer 209 of the RS2 105, the SS basic CID, the SS primary CID,
and the
routing path of the SS 107 stored in the routing table of the RS2 105 will be
kept. Otherwise,
if the RS2 105 receives the DSA-REQ DSAr1_r2 out of the timeout period which
is started by
the timer 209 of the RS2 105, the SS basic CID, the SS primary CID, and the
routing path of
the SS 107 stored in the routing table of the RS2 105 will be removed.
A second embodiment of this invention is a method for establishing a routing
path during
9

CA 02623988 2011-09-27
a network entry process of an SS based on a multi-hop relay standard, which is
a method
applied to the multi-hop relay wireless communication system 1 described in
the first
embodiment. More specifically, the method of the second embodiment which is
illustrated
in FIG 4 can be implemented by an application program controlling various
modules of a
wireless communication apparatus in the multi-hop relay wireless communication
system 1.
This application program may be stored in a tangible machine-readable medium,
such as a
read only memory (ROM), a flash memory, a floppy disk, a hard disk, a compact
disk, a
mobile disk, a magnetic tape, a database accessible to networks, or any other
storage media
with the same function and well known to those skilled in the art.
In step 401, an RNG-REQ of an SS, such as the SS 107, is transmitted by a
ranging CID
from the SS to an RS. Next in step 403, the RNG-REQ of the SS is transmitted
by an RS
basic CID/tunnel management CID of the RS from the RS to a BS, such as the BS
101. In
step 405, an SS CIDs and a routing path for the SS are allocated by the BS. In
step 407, an
RNG-RSP having the SS CIDs and the routing path is transmitted by a path CID
(such as an
RS basic CID or a tunnel management CID) from the BS to the RS. In step 409,
the SS
CIDs and the routing path are updated into a routing table of the RS after the
RS receives the
RNG-RSP. Finally, in step 411, the RNG-RSP having the SS CIDs is transmitted
by the
ranging CID from the RS to the SS.
In addition to the steps revealed in FIG 4, the second embodiment can also
execute all
the operations of the first embodiment, in which those skilled in the art can
understand the
corresponding steps and operations of the second embodiment by the explanation
of the first

CA 02623988 2011-09-27
embodiment, and thus no necessary detail is given.
A third embodiment of this invention is a method for an RS having an RS basic
CID/tunnel management CID to establish a routing path during a network entry
process of an
SS based on a multi-hop relay standard, which is a method applied to the RS1
103 or RS2 105
of the multi-hop relay wireless communication system 1 described in the first
embodiment.
More specifically, the method of the third embodiment which is illustrated in
FIG. 5 can be
implemented by an application program controlling various modules of an RS in
the
multi-hop relay wireless communication system 1. This application program may
be stored
in a tangible machine-readable medium, such as a read only memory (ROM), a
flash memory,
a floppy disk, a hard disk, a compact disk, a mobile disk, a magnetic tape, a
database
accessible to networks, or any other storage media with the same function and
well known to
those skilled in the art.
In step 501, an RNG-RSP having SS CIDs and a routing path for an SS, such as
the SS
107 is received by a path CID (such as an RS basic CID or a tunnel management
CID). Next
in step 503, the SS CIDs and the routing path are updated into a routing table
of the RS after
the RS receives the RNG-RSP. In step 505, the RNG-RSP having the SS CIDs is
transmitted
by a ranging CID to the SS. In step 507, a timeout period is started after the
SS CIDs and
the routing path are updated. In step 509, a DSA-REQ having the SS CID is
received by the
RS CIDs. In step 511, the RS determines whether the DSA-REQ is received in the
timeout
period. If yes, step 513 is executed for keeping the SS CIDs and the routing
path in the
routing table. If no, step 515 is executed for removing the SS CIDs and the
routing path
11

CA 02623988 2011-09-27
from the routing table.
In addition to the steps revealed in FIG 5, the third embodiment can also
execute all the
operations of the first embodiment, in which those skilled in the art can
understand the
corresponding steps and operations of the third embodiment by the explanation
of the first
embodiment, and thus no necessary detail is given.
Accordingly, by receiving an RNG-RSP which has SS CIDs and a routing path for
an SS
form the BS, and updating the SS CIDs and the routing path into a routing
table which is
stored in the RS, this invention can choose and/or manage relay paths of the
RS of the
wireless communication system. Thus, data of the wireless communication system
based on
a multi-hop relay standard can be transmitted successfully among the BS, RSs,
and SSs.
12

Representative Drawing
A single figure which represents the drawing illustrating the invention.
Administrative Status

2024-08-01:As part of the Next Generation Patents (NGP) transition, the Canadian Patents Database (CPD) now contains a more detailed Event History, which replicates the Event Log of our new back-office solution.

Please note that "Inactive:" events refers to events no longer in use in our new back-office solution.

For a clearer understanding of the status of the application/patent presented on this page, the site Disclaimer , as well as the definitions for Patent , Event History , Maintenance Fee  and Payment History  should be consulted.

Event History

Description Date
Letter Sent 2024-03-05
Letter Sent 2023-09-06
Letter Sent 2023-03-06
Common Representative Appointed 2019-10-30
Common Representative Appointed 2019-10-30
Inactive: Cover page published 2013-09-25
Inactive: Acknowledgment of s.8 Act correction 2013-09-19
Correction Request for a Granted Patent 2013-09-09
Grant by Issuance 2012-04-10
Inactive: Cover page published 2012-04-09
Inactive: Reply to s.37 Rules - Non-PCT 2012-01-16
Pre-grant 2012-01-16
Inactive: Final fee received 2012-01-16
Notice of Allowance is Issued 2011-12-13
Notice of Allowance is Issued 2011-12-13
4 2011-12-13
Letter Sent 2011-12-13
Inactive: Approved for allowance (AFA) 2011-12-05
Amendment Received - Voluntary Amendment 2011-09-27
Inactive: IPC deactivated 2011-07-29
Inactive: S.30(2) Rules - Examiner requisition 2011-04-06
Inactive: IPC from MCD 2009-01-01
Inactive: IPC expired 2009-01-01
Application Published (Open to Public Inspection) 2008-09-06
Inactive: Cover page published 2008-09-05
Inactive: IPC assigned 2008-08-26
Inactive: First IPC assigned 2008-08-26
Inactive: IPC assigned 2008-08-26
Inactive: Filing certificate - RFE (English) 2008-04-15
Letter Sent 2008-04-15
Letter Sent 2008-04-15
Application Received - Regular National 2008-04-15
All Requirements for Examination Determined Compliant 2008-03-05
Request for Examination Requirements Determined Compliant 2008-03-05

Abandonment History

There is no abandonment history.

Maintenance Fee

The last payment was received on 2012-01-16

Note : If the full payment has not been received on or before the date indicated, a further fee may be required which may be one of the following

  • the reinstatement fee;
  • the late payment fee; or
  • additional fee to reverse deemed expiry.

Patent fees are adjusted on the 1st of January every year. The amounts above are the current amounts if received by December 31 of the current year.
Please refer to the CIPO Patent Fees web page to see all current fee amounts.

Owners on Record

Note: Records showing the ownership history in alphabetical order.

Current Owners on Record
INSTITUTE FOR INFORMATION INDUSTRY
Past Owners on Record
CHIH-CHIANG HSIEH
KAN-CHEI LOA
YI-HSUEH TSAI
YUNG-TING LEE
Past Owners that do not appear in the "Owners on Record" listing will appear in other documentation within the application.
Documents

To view selected files, please enter reCAPTCHA code :



To view images, click a link in the Document Description column (Temporarily unavailable). To download the documents, select one or more checkboxes in the first column and then click the "Download Selected in PDF format (Zip Archive)" or the "Download Selected as Single PDF" button.

List of published and non-published patent-specific documents on the CPD .

If you have any difficulty accessing content, you can call the Client Service Centre at 1-866-997-1936 or send them an e-mail at CIPO Client Service Centre.


Document
Description 
Date
(yyyy-mm-dd) 
Number of pages   Size of Image (KB) 
Description 2008-03-04 12 425
Abstract 2008-03-04 1 17
Claims 2008-03-04 6 174
Drawings 2008-03-04 5 64
Representative drawing 2008-08-14 1 3
Cover Page 2008-08-26 1 42
Description 2011-09-26 12 463
Abstract 2011-09-26 1 22
Claims 2011-09-26 6 184
Cover Page 2012-03-13 2 47
Cover Page 2013-09-18 3 73
Acknowledgement of Request for Examination 2008-04-14 1 177
Courtesy - Certificate of registration (related document(s)) 2008-04-14 1 105
Filing Certificate (English) 2008-04-14 1 158
Reminder of maintenance fee due 2009-11-08 1 112
Commissioner's Notice - Application Found Allowable 2011-12-12 1 163
Commissioner's Notice - Maintenance Fee for a Patent Not Paid 2024-04-15 1 557
Commissioner's Notice - Maintenance Fee for a Patent Not Paid 2023-04-16 1 550
Courtesy - Patent Term Deemed Expired 2023-10-17 1 537
Fees 2010-01-13 1 54
Fees 2011-01-17 1 55
Correspondence 2012-01-15 1 55
Fees 2012-01-15 1 56
Correspondence 2013-09-08 1 46