WO2008056939A1 - Procédé de gestion de chemin de relais dans un environnement de communication sans fil - Google Patents

Procédé de gestion de chemin de relais dans un environnement de communication sans fil Download PDF

Info

Publication number
WO2008056939A1
WO2008056939A1 PCT/KR2007/005598 KR2007005598W WO2008056939A1 WO 2008056939 A1 WO2008056939 A1 WO 2008056939A1 KR 2007005598 W KR2007005598 W KR 2007005598W WO 2008056939 A1 WO2008056939 A1 WO 2008056939A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
link quality
managing
rss
wireless communication
Prior art date
Application number
PCT/KR2007/005598
Other languages
English (en)
Inventor
Yong-Su Lee
Hyukjoon Lee
Hyun Park
Young-Il Kim
Yong-Hoon Choi
Original Assignee
Electronics And Telecommunications Research Institute
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Electronics And Telecommunications Research Institute filed Critical Electronics And Telecommunications Research Institute
Priority claimed from KR1020070113125A external-priority patent/KR101352981B1/ko
Publication of WO2008056939A1 publication Critical patent/WO2008056939A1/fr
Priority to US12/437,179 priority Critical patent/US20090285112A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/26—Route discovery packet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/42—Centralised routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/16—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H04W84/22—Self-organising networks, e.g. ad-hoc networks or sensor networks with access to wired networks

Definitions

  • the present invention relates to a method of managing a relay path in a mobile multi-hop relay (MMR) environment, and more particularly, to a method of managing a multi-hop path, which has a tree-structure, between a base station (BS) and relay stations (RSs).
  • MMR mobile multi-hop relay
  • the present invention is derived from research which was supported by the 'Information Technology (IT) Research and Development Program' of the Ministry of Information and Communications (MIC) and the Institute for Information Technology Advancement (HTA), Republic of Korea.
  • the project management number is '2006-S-011-01, and the title is 'Development of relay/mesh communication system for multi-hop WiBm'.
  • a Mobile Multi-hop Relay (MMR) environment is configured with a base station (BS), a mobile station (MS), and a relay station (RS) which relays a signal between the BS and the MS. Since technology for path management and routing has not been defined in the MMR environment so far, path re-setting due to an entry of a new RS or quality deterioration of an existing link is difficult.
  • FIG. 1 is a diagram illustrating an example of a network topology having a tree-structure to which the present invention is applied;
  • FIG. 2 is a diagram illustrating a case in which a network topology is changed due to a new relay station (RS) entering an existing network
  • FIG. 3 is a diagram illustrating a case in which a network topology is changed due to a link quality of an existing network changing
  • FIG. 5 is a flowchart of a method of optimizing a path for managing a relay path according to another embodiment of the present invention
  • FIG. 6 is a diagram illustrating an example of a path setting message for informing an optimal path set by a base station (BS).
  • BS base station
  • RS relay station
  • BS base station
  • a method of managing a path in a wireless communication environment by a BS including the operations of obtaining a link quality of a RS; and selecting a path between the BS and the RS, based on the link quality.
  • the present invention in the case where a network topology is changed due to a new relay station (RS) entering an existing network having a tree-structure or a quality of an existing link deteriorating, the present invention can optimally change and manage a path of the tree-structure.
  • RS relay station
  • RS relay station
  • BS base station
  • a method of managing a path in a wireless communication environment by a BS including the operations of obtaining a link quality of a RS; and selecting a path between the BS and the RS, based on the link quality.
  • MMR mobile multi-hop relay
  • FIG. 1 is a diagram illustrating an example of network topology having a tree-structure to which the present invention is applied.
  • a method of managing a multi-hop path between each of wireless stations is widely divided into the centralized method and the distributed method.
  • a base station can calculate end-to-end route quality metric for a multi-hop path between the BS and a relay station (RS) in a cell of the BS.
  • Stability of link quality may be regarded as metric for selecting the multi-hop path.
  • Route quality metric may be derived from the BS, based on link measurements obtained from a channel quality Indicator fast-feedback channel (CQICH).
  • CQICH channel quality Indicator fast-feedback channel
  • a network having the tree-structure is gradually configured according to entries of new RSs. That is, a branch of the tree-structure is expanded when an RS newly enters the network.
  • the newly entered RS may be directly connected to the BS or indirectly connected to the BS via a superordinate RS, by using a network entry procedure.
  • the newly entered RS is connected to only one BS or only one superordinate RS which correspond to a parent node.
  • a tree update may be required like in the case illustrated in FIG. 2.
  • FIG. 2 is a diagram illustrating a case in which a network topology is changed due to a new RS entering an existing network.
  • a third RS 230 that newly enters (FIG. 2B) the existing network (FIG. 2A) which is configured with a BS 200, a first RS 210, and a second RS 220
  • a tree update is required.
  • the third RS 230 discovers neighboring RSs (such as the first RS 210 and the second RS 220), thereby obtaining data regarding identifications (IDs), link quality, and the like which are related to the neighboring RSs.
  • the data obtained by the third RS 230 is transmitted to the BS 200, thereby being used in a procedure for performing the tree update.
  • the BS 200 updates a data structure indicating an optimal routing tree by using a shortest path algorithm such as Dijkstra's algorithm. Based on information regarding the optimal routing, the BS 200 informs the first, second, and third RSs 210, 220, and 230 of information regarding a parent node for each of the first, second, and third RSs 210, 220, and 230. Each of the first, second, and third RSs 210, 220, and 230 re-sets connection to the parent node that is newly recognized (FIG. 2C). The data is routed through a tree which is configured between the BS 200 and the first, second, and third RSs 210, 220, and 230 according to resource allocation.
  • a shortest path algorithm such as Dijkstra's algorithm
  • FIG. 3 is a diagram illustrating a case in which a network topology is changed since a link quality of an existing network is changed.
  • the existing network is configured with a BS 300, a first RS 310, a second RS 320, a third RS 330, and a fourth RS 340 (FIG. 3A).
  • the BS 300 obtains information regarding such a link quality and re-configures an optimal tree excluding the link between the BS 300 and the fourth RS 340 (FIG. 3C).
  • the fourth RS 340 is connected in the form of a tree to the BS 300 via the second RS 320.
  • FIG. 4 is a flowchart of a method of reporting a link quality for managing a relay path according to an embodiment of the present invention.
  • the first RS 400 and the second RS 410 transmit not only channel information of a link but also a report message, which will be described later, to a BS 420 via the allocated CQICH.
  • a BS allocates the CQICH, for reporting a channel quality indicator (CQI) regarding a downlink transmission, to an RS in a cell of the BS.
  • CQI channel quality indicator
  • the BS and each of RSs allocate the CQICH to a downstream RS.
  • the second RS 410 sets a unique uplink channel in an uplink sub-frame zone by using a CQICH allocation message (e.g., CQICH_allocationJE()) received from the BS 420
  • the first RS 400 sets a unique uplink channel in an uplink sub-frame zone by using a CQICH allocation message (e.g., CQICH_allocation_IE()) received from the second RS 410.
  • CQICH allocation message e.g., CQICH_allocationJE()
  • Each of the first and second RSs 400 and 410 receives downlink preamble information transmitted by neighboring RSs, thereby recognizing identification information (e.g., an RS ID, an RS address, preamble index, etc) and link quality information (e.g., carrier to interference and noise ratio (CINR), received signal strength indicator (RSSI), signal strength, etc) (operations S460 and S465).
  • identification information e.g., an RS ID, an RS address, preamble index, etc
  • link quality information e.g., carrier to interference and noise ratio (CINR), received signal strength indicator (RSSI), signal strength, etc
  • Such operations S460 and S465 may be performed by an RS neighborhood discovery procedure of a Table of Contents (ToC) which is defined by the Institute of Electrical and Electronics Engineers (IEEE) 802.16 relay group.
  • ToC Table of Contents
  • the link quality information may be quality information regarding an uplink of an RS (R-UL), a downlink of an RS (R-DL), and a link between a BS and an RS or between RSs (R-Link).
  • the CINR (that is an example of the link quality information) has a physical CINR value and an effective CINR value.
  • Each of the first and second RSs 400 and 410 transmits the report message including the identification information and the link quality information, which are for the neighboring RSs and which are obtained from the RS neighborhood discovery procedure, to the BS 420 via the CQICH which was previously allocated (operations S470 and S475).
  • the report message is transmitted to the BS 420 respectively via the CQICH between the first RS 400 and the second RS 410 and via the CQICH between the second RS 410 and the BS 420.
  • the report message of the second RS 410 is transmitted to the BS 420 via the CQICH between the second RS 410 and the BS 420.
  • FIG. 5 is a flowchart of a method of optimizing a path for managing a relay path according to another embodiment of the present invention.
  • a BS 520 calculates an optimal tree based on link quality information included in report messages (related to FIG. 4) which are reported by each of a first RS 500 and a second RS 510 (operation S550).
  • the BS 520 newly sets a path between each of the first RS 500 and the second RS 510 so that a link cost, which is derived from a link quality value of each of the first RS 500 and the second RS 510, can be minimized, and updates an existing tree to the optimal tree having a shortest path.
  • the BS 520 may use a shortest path algorithm such as Dijkstra's algorithm.
  • the BS 520 recognizes a parent node of each of the first RS 500 and the second RS 510 by using the calculated optimal tree, and broadcasts a path setting message including information regarding the recognized parent node of each of the first RS 500 and the second RS 510 to each of the first RS 500 and the second RS 510 (operations S555 and S560).
  • a tree optimization message includes identification information regarding each of RSs whose parent node (that is, an RS or a BS) is changed, identification information regarding a parent node to be newly connected, and an optimal parameter indicating procedures which may be possibly omitted in an RS network re-entry procedure.
  • the first RS 500 and the second RS 510 which have received the tree optimization message, check whether their parent node has to be changed. Any one of the first RS 500 and the second RS 510 whose parent node has to be changed ends connection to a previous parent node and performs the RS network re-entry procedure, which comprises connecting to a new parent node (operations S565 and S570). At this time, in order to rapidly perform the RS network re-entry procedure, any one of the first RS 500 and the second RS 510 whose parent node has to be changed may omit some procedures from among the RS network re-entry procedure, based on the optimal parameter included in the tree optimization message. Examples of the procedures that can be omitted are an RS basic capability REG/RSP procedure, an RS registration REQ/RSP procedure, an address acquisition procedure, and the like.
  • any one of the first RS 500 and the second RS 510 whose parent node is to be changed may end the connection to the previous parent node and perform the RS network re-entry procedure after waiting a predetermined time.
  • the reason for waiting the predetermined time is that any one of the first RS 500 and the second RS 510 whose parent node is to be changed has to wait for all RSs to end connection to a parent node of all RSs. If any one of the first RS 500 and the second RS 510 whose parent node is to be changed does not wait the predetermined time until all RSs ends the connection to the parent node, the RS network re-entry procedure may be performed to a node which is connected in a downlink direction.
  • FIG. 6 is a diagram illustrating an example of a path setting message for informing an optimal path set by a BS.
  • the BS broadcasts the path setting message to a cell, thereby informing each of RSs of the optimal path about a tree-structure which is newly set.
  • the path setting message includes identification information 600 regarding an access station (that is, the BS or an RS) to which an RS has to be newly connected and information 610 regarding procedures that can be omitted from among an RS network re-entry procedure.
  • a preamble index of the access station may be used as the identification information 600 regarding an access station.
  • the invention can also be embodied as computer readable codes on a computer readable recording medium.
  • the computer readable recording medium is any data storage device that can store programs or data which can be thereafter read by a computer system. Examples of the computer readable recording medium include magnetic storage media (e.g., ROM, floppy disks, hard disks, etc.), optical recording media (e.g., CD-ROMs, or DVDs), and storage media such as carrier waves (e.g., transmission through the Internet).
  • the computer readable recording medium can also be distributed over network coupled computer systems so that the computer readable code is stored and executed in a distributed fashion.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé de gestion d'un chemin de relais dans un environnement de relais à bonds multiples (MMR). Une station de relais (RS) détermine la qualité de la liaison des stations de relais voisines (RS1) nécessaire à la gestion du chemin, et signale la qualité de la liaison à la station de base (BS). La station de base sélectionne un chemin optimal à structure arborescente sur la base de la qualité de la liaison signalée et informe la RS. Ce procédé permet d'exploiter efficacement les ressources sans fil.
PCT/KR2007/005598 2006-11-07 2007-11-07 Procédé de gestion de chemin de relais dans un environnement de communication sans fil WO2008056939A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/437,179 US20090285112A1 (en) 2006-11-07 2009-05-07 Method for managing a relay path in wireless communication environment

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20060109528 2006-11-07
KR10-2006-0109528 2006-11-07
KR1020070113125A KR101352981B1 (ko) 2006-11-07 2007-11-07 무선 통신 환경에서의 중계 경로 관리 방법
KR10-2007-0113125 2007-11-07

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/437,179 Continuation US20090285112A1 (en) 2006-11-07 2009-05-07 Method for managing a relay path in wireless communication environment

Publications (1)

Publication Number Publication Date
WO2008056939A1 true WO2008056939A1 (fr) 2008-05-15

Family

ID=39364713

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2007/005598 WO2008056939A1 (fr) 2006-11-07 2007-11-07 Procédé de gestion de chemin de relais dans un environnement de communication sans fil

Country Status (1)

Country Link
WO (1) WO2008056939A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005064872A1 (fr) * 2003-12-30 2005-07-14 Telefonaktiebolaget Lm Ericsson (Publ) Procede et systeme pour des reseaux de communication sans fil utilisant les relais de cooperation
US7076274B2 (en) * 2001-05-02 2006-07-11 Strix Systems, Inc. Method and system for indicating link quality among neighboring wireless base station

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7076274B2 (en) * 2001-05-02 2006-07-11 Strix Systems, Inc. Method and system for indicating link quality among neighboring wireless base station
WO2005064872A1 (fr) * 2003-12-30 2005-07-14 Telefonaktiebolaget Lm Ericsson (Publ) Procede et systeme pour des reseaux de communication sans fil utilisant les relais de cooperation

Similar Documents

Publication Publication Date Title
US8126470B2 (en) Topology and route discovery and management for relay networks
US7933236B2 (en) Methods and systems for a wireless routing architecture and protocol
US7113495B2 (en) Data transmission method and apparatus in relay transmission type radio network
US7554936B2 (en) Radio network, relay node, core node, relay transmission method used in the same and program thereof
EP1698106B1 (fr) Reattribution des ressources distribuee rapide/opportuniste destinee a des connexions etablies dans un reseau a sauts multiples
US8401562B2 (en) Apparatus and method employing scheduler behavior aware predictive resource selection in a communication system
US8000657B2 (en) Method and system for relaying data in a mobile communication system
US20090285112A1 (en) Method for managing a relay path in wireless communication environment
KR101447441B1 (ko) 멀티-홉 셀룰러 네트워크에서의 경로 관리를 위한 방법 및모바일 시스템 그리고 상기 방법 및 상기 모바일시스템에서 이용되는 데이터 프레임
WO2014196295A1 (fr) Dispositif de régulation de communications, procédé de régulation de communications, système de communications sans fil, station de base, et dispositif de terminal
US7386314B2 (en) Data transmitting method for opportunity driven multiple access (ODMA) system
US20100039981A1 (en) Handover method using relay station having handover control function and multi-hop relay system
Ann et al. A path selection method in IEEE 802.16 j mobile multi-hop relay networks
KR20140088375A (ko) 무선 통신 시스템에서 기지국 간 무선 링크 복구를 위한 방법 및 장치
KR20050104409A (ko) 애드-훅 접속에 의해 확장되는 셀룰러 무선 통신시스템에서 정보를 전송하기 위한 방법 및 기지국
JP6074330B2 (ja) バックホールの通信品質に応じてネットワーク識別子毎の接続上限数を制御するアクセスポイント、プログラム及び方法
JP4476985B2 (ja) Ｉｅｅｅ８０２．１６を適用した中継局の接続先選択方法、中継局及びプログラム
RU2378801C2 (ru) Способ связи в беспроводной локальной сети с группой, состоящей из ретрансляторов и узлов радиодоступа
CN115665860B (zh) 一种基于候鸟群特性的无人机自组网的资源分配方法
CN102630097B (zh) 分组数据发送方法、基站和终端
WO2008056939A1 (fr) Procédé de gestion de chemin de relais dans un environnement de communication sans fil
CN115174466B (zh) 一种多模配电场域网控制类业务高可靠路由优化方法
Laurindo et al. Multi-criteria Analysis to Select Relay Nodes in the ORST Technique
US20240114429A1 (en) Downlink routing solution for wireless communication networks
CN116962420A (zh) 代理节点选取方法、系统、电子设备及可读存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07833906

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 07833906

Country of ref document: EP

Kind code of ref document: A1