Patent Grant
8971956
This application claims the benefit under 35 U.S.C. §119(a) of Korean Patent Application No. 10-2006-0101446, filed on Oct. 18, 2006, and Korean Patent Application No. 10-2007-0054054, filed on Jun. 1, 2007 in the Korean Intellectual Property Office, the entire disclosures of which are hereby incorporated by reference.
1. Field of the Invention
The present invention relates to a wireless communication system. More particularly, the present invention relates to a multi-hop wireless communication system which performs multi-hop communication via a relay station.
2. Description of Related Art
Multi-hop communication is used to improve communication coverage and system capacity. Specifically, a relay station is a basic component for multi-hop communication in a cellular system. However, there is more neighbor information in multi-hop communication systems having relay stations than in communication networks having only base stations since multi-hop communication systems having relay stations include more neighbors than communication networks having only base stations. Specifically, the number of neighbors associated with a particular node increases since the relay stations in the communication network are included in the number of neighbors. Also, neighbor information increases since the number of neighbors increases. Accordingly, the number of neighbors in a neighbor list increases.
The increase in the number of neighbors causes a huge increase in overhead when distributing the neighbor information. Also, the increase in the number of neighbors increases the time spent in performing a scan process for the hand-off in a mobile station.
Accordingly, it is important to decrease the number of neighbors included in a neighbor list of a multi-hop communication system where the relay stations are added. However, when the number of neighbors included in the neighbor list is not efficiently reduced, necessary neighbors may be deleted from the neighbor list.
Accordingly, there is a need for a new method of providing neighbor information. In the new method of providing neighbor information, from a mobile station's point of view, electric power and effort required to scan for neighbors, as well as handover delay, is reduced. Also, from a system's point of view, the overhead, which is necessary for distributing neighbor information, is reduced and necessary neighbors are prevented from being deleted.
Exemplary embodiments of the present invention address at least the above problems and/or disadvantages and provide at least the advantages described below. Accordingly, an aspect of exemplary embodiments of the present invention is to provide a method of providing neighbor information efficiently. Another aspect of the present invention is to generate neighbor location information which is utilized to reduce neighbor information of unnecessary neighbors by using location information.
An aspect of the present invention also provides a method of providing neighbor information and a method of generating neighbor location information which reduces the electric power and time required to scan for neighbors in a mobile station, as well as handover delay.
An aspect of the present invention also provides a method of providing neighbor information and a method of generating neighbor location information which reduces the overhead which is necessary when transmitting neighbor information in a multi-hop communication system.
An aspect of the present invention also provides a method of providing neighbor information and a method of generating neighbor location information which selects and provides only neighbor information suitable for a particular node.
According to an aspect of the present invention, a method of providing neighbor information is provided, the method including a base station broadcasting a neighbor advertisement message; and the base station transmitting a neighbor information message to a relay station connected to the base station, the generated neighbor information message being customized for the receiving relay station. Preferably, customization is done by considering a location of the relay station.
In this embodiment, the method of providing neighbor information further includes the relay station generating a new neighbor advertisement message including only a portion of a neighbor list by using the neighbor information message, the neighbor list being included in the neighbor advertisement message; and broadcasting the new neighbor advertisement message to downstream of the relay station including the mobile stations in the cell.
In this embodiment, the method of providing neighbor information further includes the base station transmitting a location request message to neighbor nodes; the base station receiving a location response message which is transmitted from the neighbor nodes in response to the location request message; forming a neighbor location information table by using the location response message; and the base station generating the neighbor advertisement message by using the neighbor location information table.
According to an aspect of the present invention, a method of generating neighbor location information is provided, the method including any one of a base station and a relay station transmitting a location request message to neighbor nodes; any one of the base station and the relay station receiving a location response message which is transmitted from the neighbor nodes in response to the location request message; and forming a neighbor location information table by using the location response message.
In this embodiment, in the transmitting of the location request message, the location request message from the base station to the relay station, the location request message from the relay station to another relay station, and the location request message from the relay station to the base station may be transmitted.
In this embodiment, the location request message includes a report type field which indicates whether to receive the location response message regularly or irregularly, or indicates whether to receive the location response message when a particular event is triggered.
In this embodiment, the location response message comprises location information of a node included in the location request message.
In this embodiment, the neighbor location information table stores a distance and an angle between one of the base station or the relay station, and the neighbor nodes.
Other aspects, advantages, and salient features of the invention will become apparent to those skilled in the art from the following detailed description, which, taken in conjunction with the annexed drawings, discloses exemplary embodiments of the invention.
The above and other aspects, features, and advantages of certain exemplary embodiments of the present invention will be more apparent from the following detailed description, taken in conjunction with the accompanying drawings in which:
Throughout the drawings, the same drawing reference numerals will be understood to refer to the same elements, features, and structures.
The matters defined in the description such as a detailed construction and elements are provided to assist in a comprehensive understanding of the embodiments of the invention and are merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted for clarity and conciseness.
Referring to
In this embodiment, the location request message may include a report type field which indicates whether to receive the location response message regularly or irregularly, or indicates whether to receive the location response message when a particular event is triggered.
In this embodiment, the location response message may include location information of a node included in the location request message. The location information may be global positioning system (GPS) coordinates, three-dimensional Cartesian coordinates, and the like.
Also, the base station may regularly receive the location response message from the neighbor node (130).
Although it is not illustrated in
In this embodiment, the neighbor node may be a relay station RS around the base station, or another base station.
The base station which receives the location response message from neighbor nodes may store a location of each of the neighbor nodes in a neighbor location information table. The location of each of the neighbor nodes includes a distance and an angle between the base station and the neighbor nodes.
For example, when (x0, y0, z0) designates a location of the base station, and (x1, y1, z1) designates a location of the relay station, the base station calculates location information of the relay station, as shown in Equation 1.
In this embodiment, the relay station may also store the location of each of the neighbor nodes in the neighbor location information table according to a capability of the relay station. The location of each of the neighbor nodes includes the distance and the angle between the base station and the neighbor nodes.
In the neighbor location information table, the distance and the angle between the base station and the neighbor nodes may be stored.
Not only the base station, but also mobile station and the relay station may receive the location response message.
In
Referring to
In operation S330, as a result of the determination in operation S320, when the coordinate of the node corresponding to the increased index is changed, a distance and an angle between the node and a reference point is calculated.
As a result of the determination in operation S320, when the coordinate of the node corresponding to the increased index is not changed, the base station or the relay station returns to operation S310 and increments an index by one.
In operation S340, the base station or the relay station updates the calculated distance and angle in a neighbor location information table.
In operation S350, it is determined whether generating of neighbor location information with respect to all neighbor nodes is completed.
As a result of the determination in operation S350, when the generating of neighbor location information with respect to all neighbor nodes is completed, all operations end.
As a result of the determination in operation S350, when the generating of neighbor location information with respect to all neighbor nodes is not completed, the base station or the relay station returns to operation S310 and increments an index by one.
In the method of providing neighbor information according to an exemplary embodiment of the present invention, the base station or the relay station generates a neighbor advertisement message by using a neighbor location information table.
The neighbor advertisement message corresponds to a message which is broadcasted from the base station or the relay station to another relay station.
Also, in the method of providing neighbor information according to an exemplary embodiment of the present invention, the base station or the relay station generates the neighbor information message. In this embodiment, the relay station provides a relay service downstream.
In this embodiment, the neighbor information message corresponds to a unicast message, and is generated by considering location information of a node which receives the neighbor information message.
Accordingly, a node which receives both the neighbor advertisement message and the neighbor information message does not retransmit the received neighbor advertisement message downstream. Also, the node generates and broadcasts a new neighbor advertisement message including only a portion of a neighbor list based on the received neighbor information message. The neighbor list is included in the received neighbor advertisement message.
Referring to
In this embodiment, a range where the mobile station may move corresponds to a zone 410 within a dotted line. Accordingly, with respect to the mobile station, neighbor information corresponding to nodes included in the zone 410 within the dotted line is required to be provided.
According to an exemplary embodiment of the present invention, the base station BS1 includes location information of neighboring base stations BS2 and BS3, and location information of relay stations RS21, RS22, RS23, RS31, RS32, and RS33. The relay stations RS21, RS22, RS23, RS31, RS32, and RS33 are serviced by the neighboring base stations BS2 and BS3. Accordingly, the base station BS1 transmits location information to the relay station RS13, that is the serving station of the mobile station. In the location information, location information of neighbor nodes, which are located relatively far from the serving station, such as RS33 or RS22, is deleted. Thus, the mobile station may be prevented from performing an unnecessary calculation.
In this embodiment, when the relay stations are not uniformly distributed, it may not be easy to determine a neighbor list by simply considering a distance. Thus, according to an exemplary embodiment of the present invention, the neighbor list may be determined by setting a predetermined number of zones according to a θ value based on a reference point, and selecting neighbors corresponding to a local policy for each zone. In this embodiment, the neighbors are located within a predetermined distance. For example, a neighbor which is the most adjacent to each zone or neighbors which are located within a predetermined distance d may be selected. The reference point may correspond to the base station or the relay station. In
Referring to
In the exemplary embodiment of the present invention illustrated in
In the zone θ1, a neighbor node, which is located within the distance d based on the reference point, is a relay station RS22.
In the zone θ2, a neighbor node, which is located within the distance d based on the reference point, is a relay station RS11.
In the zone θ3, the zone θ4, and the zone θ5, a neighbor node, which is located within the distance d based on the reference point, is non-existent. Specifically, in zone θ3, relay station RS12 is located outside the distance d based on the reference point, and in zone θ4, base station BS1 is located outside the distance d based on the reference point.
In the zone θ6, a neighbor node, which is located within the distance d based on the reference point, is a relay station RS14.
Accordingly, in the example illustrated in
Depending on the system, a zone including many nodes may be segmented, and the distance d may be differently set for each zone.
Referring to
In this embodiment, the location request message MMR_LOC-REQ includes the report type field. The report type field indicates whether to receive the location response message MMR_LOC-RSP regularly or irregularly, or indicates whether to receive the location response message MMR_LOC-RSP when a particular event is triggered.
In this embodiment, the report metric field may indicate a metric which triggers the particular event in response to the particular event when receiving the location response message MMR_LOC-RSP.
In this embodiment, the location request message MMR_LOC-REQ may request location information of other nodes as well as a node which receives the location request message MMR_LOC-REQ.
In this embodiment, the node index may be an index indicating nodes in which ascertaining of the location information is required.
In this embodiment, the coordinate type field may indicate a coordinate type of the location information.
The location response message MMR_LOC-RSP may include location information of a node included in the location request message MMR_LOC-REQ.
Referring to
Referring to
In this embodiment, the relay station RS2 is connected to a base station BS1 via the relay station RS1.
Referring to
In operation 915, the base station BS1 generates a neighbor location information table by using the received location response message, and broadcasts a neighbor advertisement message by using the neighbor location information table. In this case, L designates a number of neighbors included in the broadcasted neighbor advertisement message. L is a natural number.
In operation 916, the base station BS1 generates a neighbor information message by considering a location of the relay station RS1, and transmits the neighbor information message to the relay station RS1 in a unicast method.
In operations 917 and 918, the relay station RS1 generates and broadcasts a new neighbor advertisement message by using the neighbor advertisement message and neighbor information message which are received from the base station BS1. In this embodiment, M designates a number of neighbors included in the new neighbor advertisement message. M is a natural number, and may be less than L.
Also, in operation 919, the relay station RS1 generates the neighbor information message by considering a location of the relay station RS2, and transmits the neighbor information message to the relay station RS2.
In operations 920, 921, 922, 923, 924 and 925, a mobile station MS, which receives the broadcasted neighbor advertisement message, performs a scan process. In operation 926, the base station BS1 determines whether a handover process is required. When required, the handover process is performed in operation 927. In
In operation 928, the relay station RS2 generates and broadcasts a new neighbor advertisement message by using the neighbor advertisement message and neighbor information message which are received from the relay station RS1. In this embodiment, N designates a number of neighbors included in the new neighbor advertisement message. N is a natural number, and may be less than M.
In operation 929, the mobile station MS performs a new scan process based on the new broadcasted neighbor advertisement message from relay station RS2.
As described above, the neighbor information message includes a neighbor list which is customized for a node receiving the neighbor information message. Also, the relay station generates the neighbor advertisement message by using the received neighbor information message. The base station BS1 and the relay stations RS1 and RS2 broadcast the neighbor advertisement message to nodes within a coverage area of respective base station BS1 and the relay stations RS1 and RS2.
Referring to
In this embodiment, the relay station RS1 and the relay station RS2 are connected to a base station BS1, and the base station BS1 is connected to a base station BS2.
Referring to
In operation 1103, the base station BS1 generates a neighbor information message which is customized for the relay station RS1 by considering a location of the relay station RS1, and transmits the neighbor information message to the relay station RS1.
In operation 1104, the base station BS1 generates a neighbor information message which is customized for the relay station RS2 by considering a location of the relay station RS2, and transmits the neighbor information message to the relay station RS2.
In operation 1105, the relay station RS1 generates and broadcasts a new neighbor advertisement message by using the neighbor advertisement message and the neighbor information message which are received from the base station BS1. In this embodiment, Y designates a number of neighbors included in the new neighbor advertisement message. Y is a natural number and may be less than X.
In operation 1106, the mobile station which receives the broadcasted neighbor advertisement message performs a scan process. As a result of the scan process, when a handover process is required, the handover process is performed in operation 1107.
As a result of the handover process, when a serving station of the mobile station changes to the relay station RS2, the mobile station acquires neighbor information by receiving the neighbor advertisement message which is broadcasted from the relay station RS2. In this embodiment, the neighbor advertisement message is a new neighbor advertisement message which is generated by using the neighbor advertisement message and the neighbor information message in operation 1108. The neighbor advertisement message and the neighbor information message are received from the base station BS1. Z designates a number of neighbors included in the new neighbor advertisement message. Z is a natural number, and may be less than X.
The base station BS1 provides the customized neighbor information message to the relay station RS1 and the relay station RS2, respectively. Accordingly, the neighbor advertisement message and the messages are associated with the scan process and handover process may have a neighbor list reduced by location information.
Referring to
In this embodiment, the neighbor advertisement message may include a neighbor list. The neighbor list is generated by referring to a location of neighbors and a reference point. Also, the neighbor list may be generated by setting a predetermined number of zones based on the reference point, and selecting neighbors corresponding to a local policy for each zone or selecting neighbors located within a predetermined distance. The predetermined number of zones may be non-uniformly set according to a distribution of the neighbors. Also, the local policy may correspond to selecting the neighbors within a distance, and the distance may be non-uniformly set according to a distribution of the neighbors.
In operation S1220, the base station transmits a neighbor information message to a relay station which is connected to the base station. The neighbor information message is generated by considering a location of the relay station.
In this embodiment, the neighbor information message may include a neighbor list. The neighbor list is generated by referring to a location of the neighbors and the relay station. The neighbor list may be generated by setting a predetermined number of zones based on the relay station, and selecting the neighbors located within the predetermined distance corresponding to the local policy for each zone. The predetermined number of zones may be non-uniformly set according to the distribution of the neighbors. Also, the local policy corresponds to selecting the neighbors within a distance, and the distance may be non-uniformly set according to the according to the distribution of the neighbors by local policy.
In this embodiment, the neighbor information message corresponds to a unicast message.
The neighbor information message may include a neighbor station type field.
In operation S1230, the relay station generates a new neighbor advertisement message including only a portion of neighbor list by using the neighbor information message. In this embodiment, the neighbor list is included in the neighbor advertisement message.
In operation S1240, the new neighbor advertisement message is broadcasted downstream of the relay station.
In this embodiment, the relay station may transmit a neighbor information message, which is custom generated for the base station by considering a location of other relay stations, to the other relay station, when the other relay station exists downstream of the relay station.
Also, the method of providing neighbor information may further include determining a neighbor to be scanned by using neighbors in the neighbor list included in a message, and performing a scan process with respect to the neighbor to be scanned. In the determining of the neighbor to be scanned, a mobile station receives the message which is generated by using a message corresponding to the new neighbor advertisement message.
Also, the method of providing neighbor information may further include the following operations: the base station transmitting a location request message to neighbor nodes; the base station receiving a location response message which is transmitted from the neighbor nodes in response to the location request message; forming a neighbor location information table by using the location response message; and the base station generating the neighbor advertisement message by using the neighbor location information table.
The method of providing neighbor information may be performed by relay stations which serve other relay stations downstream of the relay station, excluding the base station.
Referring to
In operation S1320, any one of the base station and the relay station receives a location response message which is transmitted from the neighbor nodes in response to the location request message.
In operation S1330, a neighbor location information table is formed by using the location response message.
In this embodiment, the location request message includes a report type field. The report type field indicates whether to receive the location response message periodically or non-periodically, or indicates whether to receive the location response message when a particular event is triggered.
In this embodiment, the location response message includes location information of the node which receives the location request message and location information of nodes included in the location request message.
The neighbor location information table may store a distance and an angle between one of the base station or the relay station, and the neighbor nodes.
The method of providing neighbor information and the method of generating neighbor location information according to the above-described exemplary embodiments of the present invention may be recorded in computer-readable media including program instructions to implement various operations embodied by a computer. The media may also include, alone or in combination with the program instructions, data files, data structures, and the like. The media and program instructions may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts. Examples of computer-readable media include magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD ROM disks and DVD; magneto-optical media such as optical disks; and hardware devices that are specially configured to store and perform program instructions, such as read-only memory (ROM), random access memory (RAM), flash memory, and the like. Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter. The described hardware devices may be configured to act as one or more software modules in order to perform the operations of the above-described embodiments of the present invention.
According to an aspect of the present invention, a method of providing neighbor information and a method of generating neighbor location information reduces neighbor information of unnecessary neighbors by using location information.
Also, according to an aspect of the present invention, a method of providing neighbor information and a method of generating neighbor location information reduces the electric power and time required to scan for a neighbor in a mobile station, as well as handover delay.
Also, according to an aspect of the present invention, a method of providing neighbor information and a method of generating neighbor location information reduces the overhead which is necessary when transmitting neighbor information in a multi-hop communication system.
Also, according to an aspect of the present invention, a method of providing neighbor information and a method of generating neighbor location information selects and provides only neighbor information suitable for a particular node.
While certain exemplary embodiments of the invention have been shown and described with reference to certain preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims and their equivalents.
| Number | Date | Country | Kind |
|---|---|---|---|
| 10-2006-0101446 | Oct 2006 | KR | national |
| 10-2007-0054054 | Jun 2007 | KR | national |
| Number | Name | Date | Kind |
|---|---|---|---|
| 4829554 | Barnes et al. | May 1989 | A |
| 5265150 | Helmkamp et al. | Nov 1993 | A |
| 5675629 | Raffel et al. | Oct 1997 | A |
| 5911120 | Jarett et al. | Jun 1999 | A |
| 6236365 | LeBlanc et al. | May 2001 | B1 |
| 6463055 | Lupien et al. | Oct 2002 | B1 |
| 6611692 | Raffel et al. | Aug 2003 | B2 |
| 6681118 | Raffel et al. | Jan 2004 | B2 |
| 6735432 | Jarett et al. | May 2004 | B1 |
| 7206294 | Garahi et al. | Apr 2007 | B2 |
| 7366111 | Thubert et al. | Apr 2008 | B2 |
| 7428221 | Thubert et al. | Sep 2008 | B2 |
| 7689215 | Kwon et al. | Mar 2010 | B2 |
| 20030043857 | Takagi et al. | Mar 2003 | A1 |
| 20050265259 | Thubert et al. | Dec 2005 | A1 |
| 20050282562 | Lee et al. | Dec 2005 | A1 |
| 20060039371 | Castro et al. | Feb 2006 | A1 |
| 20060068823 | Kwon et al. | Mar 2006 | A1 |
| 20060227724 | Thubert et al. | Oct 2006 | A1 |
| 20070060049 | Lee et al. | Mar 2007 | A1 |
| 20070123292 | Kang et al. | May 2007 | A1 |
| 20080096581 | Do et al. | Apr 2008 | A1 |
| 20080108326 | Park et al. | May 2008 | A1 |
| 20080291875 | Kang et al. | Nov 2008 | A1 |
| 20090219832 | Velev et al. | Sep 2009 | A1 |
| 20100316019 | Liu et al. | Dec 2010 | A1 |
| 20110051826 | Jung et al. | Mar 2011 | A1 |
| Number | Date | Country |
|---|---|---|
| 1786231 | May 2007 | EP |
| 09-093639 | Apr 1997 | JP |
| 2001-209891 | Aug 2001 | JP |
| 2001-309421 | Nov 2001 | JP |
| 2002-142242 | May 2002 | JP |
| 2006279950 | Oct 2006 | JP |
| 1020000039907 | Jul 2000 | KR |
| 10-2004-0019622 | Mar 2004 | KR |
| 10-2005-0102570 | Oct 2005 | KR |
| 10-2005-0103012 | Oct 2005 | KR |
| 1020050097107 | Oct 2005 | KR |
| 1020060049401 | May 2006 | KR |
| 10-2006-0076640 | Jul 2006 | KR |
| 1020060121137 | Nov 2006 | KR |
| 1020070030635 | Mar 2007 | KR |
| WO2006046824 | May 2006 | WO |
| WO2006107701 | Oct 2006 | WO |
| Entry |
|---|
| Abraham George, M3HN: An Adaptive Protocol for Mobility Management in Multi-Hop Heterogeneous Networks, Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), Louisville, KY, U.S.A. |
| European Search Report issued Oct. 28, 2013 in corresponding EP Patent Application No. 07833026.3 (15 pages). |
| M. Asa et al. “Comments on the Proposed Technical Requirements for IEEE 802.16 Relay TG” IEEE C802.16j-06/105 (Sep. 19, 2006) 12 pages. |
| R. Taori et al. “Reduced Neighbor Information Generation and Customized Delivery” IEEE S80216j-07/139 (Jan. 16, 2007) 8 pages. |
| Chie Ming Chou et al. “Network Topology Advertisement for IEEE 802.16j” IEEE C802.16j-06/166 (Nov. 7, 2006) 10 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20080096581 A1 | Apr 2008 | US |
