WO2014090104A1 - 无线通信系统及方法、动态关联控制装置及方法 - Google Patents

无线通信系统及方法、动态关联控制装置及方法 Download PDF

Info

Publication number
WO2014090104A1
WO2014090104A1 PCT/CN2013/088529 CN2013088529W WO2014090104A1 WO 2014090104 A1 WO2014090104 A1 WO 2014090104A1 CN 2013088529 W CN2013088529 W CN 2013088529W WO 2014090104 A1 WO2014090104 A1 WO 2014090104A1
Authority
WO
WIPO (PCT)
Prior art keywords
base station
relay node
blocking rate
relay
information
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2013/088529
Other languages
English (en)
French (fr)
Inventor
杨鹏
刘春光
杨泽曦
周盛
水谷美加
牛志升
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
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 Hitachi Ltd filed Critical Hitachi Ltd
Priority to US14/650,491 priority Critical patent/US9801093B2/en
Priority to JP2015544343A priority patent/JP6026005B2/ja
Publication of WO2014090104A1 publication Critical patent/WO2014090104A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H04W28/086—Load balancing or load distribution among access entities
    • H04W28/0861—Load balancing or load distribution among access entities between base stations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/155—Ground-based stations
    • H04B7/15507—Relay station based processing for cell extension or control of coverage area

Definitions

  • the present invention relates to a wireless communication system in a cellular network in which a relay node is deployed, and more particularly to a wireless communication system, a dynamic association control device, and a dynamic association control method using a relay node for load transfer.
  • Patent Document 1 WO2010EP61368 20100804
  • DISTRIBUTED LOAD BALANCING IN CELLULAR WIRELESS NETWORKS a method of performing load transfer in a cellular network is described.
  • the method is a distributed algorithm that transfers the load by changing the base station serving the user.
  • relay technology in which a relay node is set up under a cell base station has become one of the widely accepted wireless communication technologies in recent years, and among several cellular network standards, relay technology is incorporated.
  • the term "relay node” refers to a device that is associated with a base station of a cell corresponding to the set range, is usually deployed at the edge of the cell, is used to enhance the edge user signal strength, and expand the coverage.
  • Patent Document 1 The distributed algorithm employed in Patent Document 1 (WO2010EP61368 20100804) involves only load transfer between the user and the base station, and there is no participation of the relay node.
  • Patent Document 2 (WO2010US43669 20100729) "SYSTEM AND METHOD FOR MOBILE ACCESS CONTROL AND LOAD BALANCING IN A RELAY NETWORK".
  • Patent Document 2 (WO2010US43669 20100729) "SYSTEM AND METHOD FOR MOBILE ACCESS CONTROL AND LOAD BALANCING IN A RELAY NETWORK”.
  • the present invention has been made in view of the above problems, and an object thereof is to provide a wireless communication system, a dynamic correlation control device, and a dynamic association control method that utilize a relay node for load transfer to achieve a balanced load and improve service quality.
  • the relay node In a network such as a cellular network in which a relay node exists, the relay node cooperates with the associated cell base station to operate, because the relay node is usually deployed in a location with a higher position and a better view, in hardware conditions and geographical conditions. It is said that it is possible to maintain a good channel state with several surrounding base stations, making it possible to use a relay node for load transfer.
  • the base station to which the relay node belongs is dynamically allocated by using the characteristics of the above relay node, so that the relay node is not associated with a fixed cell base station as in the prior art, but can be changed according to the situation of the wireless communication resource.
  • the base station associated with the relay node such that the load of the user terminal under the relay node service is indirectly transferred.
  • a technical solution of the present invention is a dynamic association control device, comprising: an information collection unit that collects information related to a target relay node and an associated candidate base station; and a blocking rate calculation unit that calculates the information in the object according to the collected information a candidate blocking rate when the node is associated with each of the associated candidate base stations; and an association control unit that selects an object blocking rate from the calculated candidate blocking rates, and uses the base station corresponding to the target blocking rate as the associated transfer target base station Translating the object relay node into association with the associated transfer target base station.
  • Another technical solution of the present invention is a dynamic association control method, including: an information collection step of collecting information related to an object relay node and an associated candidate base station; a blocking rate calculation step, respectively, calculating the object according to the collected information a candidate blocking rate when the relay node is associated with each associated candidate base station; and an association control step, selecting an object blocking rate from the calculated candidate blocking rate, and using the base station corresponding to the target blocking rate as an associated transfer target And a base station, configured to convert the target relay node into being associated with the associated transfer target base station.
  • Still another technical solution of the present invention is a wireless communication method in a wireless communication system
  • the wireless communication system includes a base station and a relay node associated with the base station, wherein the wireless communication method includes: the base station and the relay node respectively collect information related to respective communication environments; The collected message is sent to each relay node that can be associated with the relay node; the relay node selects the associated candidate base station from the base stations other than the currently associated base station, and calculates the local relay according to the information from the base station and the collected information.
  • a further technical solution of the present invention is a wireless communication method in a wireless communication system, the wireless communication system comprising a base station and a relay node associated with the base station, wherein the wireless communication method comprises: the base station And the relay node separately collect information related to the respective communication environment; the base station sends the collected message to each relay node that can be associated with the base station; the relay node sends the collected message to the current related
  • the base station is connected to the target relay node associated with the base station, and selects the associated candidate base station from the base stations other than the base station, and calculates the target relay node and each associated candidate according to the information from the relay node and the collected information.
  • the relay node selects an object blocking rate from the candidate blocking rate, and uses the base station corresponding to the target blocking rate as the associated transfer target
  • the base station is changed from being associated with the current base station to being associated with the associated transfer target base station Union.
  • the relay node and the base station can be dynamically associated, so that the relay node can transmit using the same frequency band as the original cellular network, saving frequency resources, and, without requiring a central node in the wireless communication system,
  • the blocking rate can be significantly reduced, so that the technical effect of balancing the load and improving the quality of service can be obtained.
  • FIG. 1 is a schematic diagram of a network topology of a wireless communication system according to the present invention.
  • FIG. 2 is a schematic diagram of a network topology after a transition relationship of a relay node according to the present invention.
  • 3 is a block diagram showing the internal structure of a base station in the wireless communication system according to the first embodiment.
  • Fig. 4 is a diagram showing an adjacent/correlated/associated relay record table in the base station according to the first embodiment.
  • FIG. 5 is a base station/relay channel and a load information recording table in a base station according to the first embodiment. Schematic diagram.
  • Fig. 6 is a block diagram showing the internal structure of a relay node in the wireless communication system according to the first embodiment.
  • Fig. 7 is a diagram showing a neighbor/correlation/association base station recording table in the relay node according to the first embodiment.
  • Fig. 8 is a view showing a format in which a relay node according to the first embodiment reports information to an associated base station.
  • Fig. 9 is a view showing a format in which a base station according to the first embodiment issues an information format to an associated relay node.
  • Figure 10 is a flow chart illustrating the process of calculating the network blocking rate.
  • FIG. 11 is a schematic diagram showing an information format in which a relay node according to the first embodiment reports a blocking rate drop value to a related base station.
  • Fig. 12 is a flowchart showing a relay selection process performed by the base station according to the first embodiment.
  • Fig. 13 is a diagram showing the manner in which the base station according to the first embodiment returns a confirmation information format to a selected relay node.
  • Fig. 14 is a flowchart showing a flow of base station-relay node information communication in the radio communication system according to the first embodiment.
  • Fig. 15 is a flowchart showing a modification of the relay selection processing performed by the base station according to the first embodiment.
  • Fig. 16 is a block diagram showing the internal configuration of a base station in the wireless communication system according to the second embodiment.
  • Fig. 17 is a block diagram showing the internal structure of a relay node in the wireless communication system according to the second embodiment.
  • Fig. 18 is a flowchart showing a flow of base station-relay node information communication in the radio communication system according to the second embodiment.
  • Fig. 19 is a block diagram showing the configuration of a dynamic correlation control device according to a third embodiment.
  • Fig. 20 is a flowchart showing dynamic association management executed by the dynamic association control device according to the third embodiment.
  • Figure 21 is a schematic diagram of a network topology of a specific embodiment of the wireless communication system according to the present invention.
  • Each relay node must be associated with a certain base station at a certain time, and the base station is referred to as an associated base station of the relay node. Conversely, the relay node is referred to as an associated relay node of the base station.
  • FIG. 1 is a schematic diagram of a network topology of a wireless communication system according to the present invention.
  • An example of a network topology with three cells is shown schematically in Figure 1.
  • the base station 1-1, the base station 1-2, and the base station 1-3 are respectively deployed at the central locations of the respective cells, and three relay nodes, such as the relay node 2-1, are respectively deployed in each cell.
  • each base station 1-1 ⁇ 1-3 manages a certain fixed area cell, and the relay node configured in the range of the cell belongs to the base station that manages the cell, that is, each The relay node is associated with the base station closest to itself.
  • a relay node is always associated with a fixed cell base station for enhancing the edge user signal strength of the particular cell.
  • a relay node can usually only select one of several surrounding base stations for correlation, but theoretically within a certain range, one relay node can transmit signals with several surrounding base stations.
  • this phenomenon is regarded as having an "adjacent relationship" between the relay node and several surrounding base stations.
  • a base station having a neighbor relationship and a relay node can also be associated, and a base station that can be associated with the relay node is referred to as a "neighboring base station" of the relay node.
  • a neighboring relationship between the base stations may be set, and a neighboring base station of the relay node may be preset for a certain relay node.
  • the relay node changes its association relationship with the associated base station, but associates with other neighboring base stations having an adjacent relationship other than the associated base station.
  • the blocking rate of several cells will change due to the change of the load. For a cell, the blocking rate is reduced. That is to say, when the association relationship of a certain relay node changes, the blocking rate of the base station of other cells in the system is also affected.
  • the cells corresponding to the affected base stations are referred to as related cells of the relay node, and the base stations corresponding to the relevant cells are referred to as related base stations of the relay node, and conversely, the relay node is referred to as a base station.
  • Related relay node In general, a neighboring base station is included in the associated base station, and when the relay node changes the associated base station, it must be associated with one of the neighboring base stations.
  • the relevant base station usually includes an associated base station, since the definition of the relevant base station is a base station whose blocking rate may be affected after the relay changes association.
  • the relevant base station may also be a collection of associated base stations and neighboring base stations.
  • the adjacency relationship and correlation between the base station and the relay node are preset according to the network topology, and do not change with time.
  • the relay node can change the association relationship with the base station
  • FIG. 2 is a schematic diagram of the network topology after the transition of the relay node association relationship in the state of FIG. 1 according to the present invention.
  • the relay node 2-1 As shown in FIG. 2, there is an adjacency relationship between the base station 1-2 and the relay node 2-1.
  • the relay node 2-1 associated with the base station 1-1 in FIG. The change becomes associated with neighboring base stations 1-2.
  • the coverage of each cell changes accordingly, and the coverage range of the cell managed by the base station 2-1 includes the range of the enhanced signal strength of the relay node 2-1, which is originally A part of the cell managed by the base station 1-1 is incorporated into the cell of the base station 1-2, so that the load of this part also becomes the load of the base station 1-2, thus achieving the purpose of load transfer.
  • the wireless communication system in the first embodiment includes a plurality of base stations 1A and a plurality of relay nodes 1B associated with a certain base station.
  • the internal structure of each base station 1A is the same, and each relay node 1B 3 is a block diagram showing an internal configuration of a base station 1A in the wireless communication system according to the first embodiment.
  • the base station 1A includes an information collector 101A, an information interactor 102A, a relay selector 103A, and a storage unit 104A.
  • the information collector 101A is for collecting channel information and load information of the base station 1A, and storing the information in the storage unit 104A.
  • the information interactor 102A is configured to exchange information with the relay node to deliver the information message and the instruction message.
  • the relay selector 103A is an optional component and is mainly used for a large-scale wireless communication network. Specifically, since there are multiple base stations and multiple relay nodes in the network, when multiple relay nodes change associations, there is a problem of overlapping cancellation for the influence of the blocking rate of a certain base station, and therefore, in the base station
  • the relay selector 103A is provided, and the relay selector 103A receives data indicating a change in the blocking rate, such as a maximum blocking rate decrease value, from the relevant relay node, so as to select the permission to perform the association transfer according to the data showing the change in the blocking rate.
  • the base station does not have to receive the data showing the change in the blocking rate and directly performs the association transfer of the relay node.
  • the information collector 101A, the information exchanger 102A, and the relay selector 103A can be implemented by a processor such as a CPU executing a predetermined program.
  • the information collector 101A and the information interactor 102A are equivalent to an "information acquisition unit", and the relay selection is performed.
  • the device 103A corresponds to a "relay selection unit”.
  • the storage unit 104A stores various kinds of information necessary for the relay selector 103A to perform relay selection.
  • the information may be obtained by the information collector 101A or the information interactor 102A, and the storage unit 104A may also be associated with the information collector 101A or The information interactor 102A is formed in one body.
  • the storage unit 104A stores: a neighboring relay list 114, a related relay list 124, an associated relay list 134, base station channel information 144, base station load information 154, associated relay channel information 164, and related Following the load information 174.
  • the neighboring relay list 114 and the related relay list 124 are static information
  • the associated relay list 134, the base station channel information 144, the base station load information 154, the related relay channel information 164, and the associated relay load information 174 are dynamic. information.
  • Static information is determined at the time of network initialization. It does not change over time. Dynamic information changes over time and needs to be updated periodically by collecting or interacting with relay nodes.
  • a list of relay nodes that can be associated with the base station 1A is stored in the adjacent relay list 114.
  • the related relay list 124 stores a relay node associated with the base station 1A, here, if a relay section If the base station 1A is included in the relevant base station, the relay node is regarded as the relevant relay node of the base station, and the information of the relay node is recorded in the related relay list 124, and the associated relay list 134 stores the current A list of relay nodes associated with the base station 1A.
  • the storage forms of the neighboring relay list 114, the related relay list 124, and the associated relay list 134 may be unified into the storage format of the adjacent/related/associated relay recording table shown in FIG.
  • Fig. 4 is a diagram showing an adjacent/correlated/associated relay record table in the base station according to the first embodiment.
  • the adjacent/related/associated relay record table collectively shows the neighboring relay list 114, the related relay list 124, and the associated relay list 134, wherein the entries included are: a relay number 401 indicating the recorded
  • the number of the relay node is an identifier for identifying the relay node; the channel state 402, showing the channel state of the relay node indicated by the relay number 401 to the base station 1A; whether or not the association is 403, shown by Whether the relay node indicated by the number 401 is currently associated with the base station 1A; whether it is adjacent 404, showing whether the relay node indicated by the relay number 401 can be associated with the base station; and whether or not the correlation 405 is shown by the relay Whether or not the base station 1A is included in the relevant base station of the relay node indicated by reference numeral 401.
  • the neighboring relay list 114, the related relay list 124, and the associated relay list 134 are integrated into one table.
  • the table indicates that the neighboring relay list 114, the associated relay list 124, and the associated relay list 134 are independently recorded.
  • the base station channel information 144 shows the channel information of the user associated with the base station 1A to the base station 1A.
  • the base station load information 154 shows the load information of the user associated with the base station 1A.
  • the associated relay channel information 164 shows the channel information of the associated user on the associated relay node of the base station 1A.
  • the associated relay load information 174 shows the load information of the associated user on the associated relay node of base station 1A.
  • the storage form of the base station channel information 144, the base station load information 154, the associated relay channel information 164, and the associated relay load information 174 can be unified into the storage format of the base station/relay channel and the load information record table shown in FIG.
  • FIG. 5 is a schematic diagram of a base station/relay channel and a load information recording table in the base station according to the first embodiment.
  • Base station channel information 144, base station load information 154, associated relay channel information 164, and associated relay load information 174 are collectively shown in the base station/relay channel and load information record table, wherein the entries included are: No.
  • an identifier for identifying a user, the user in the base station/relay channel and the load information record table includes a user associated with the base station 1A and a user associated with the associated relay node of the base station 1A; an arrival time 502, By user number 501 The time at which the indicated user arrives at the wireless communication system; the channel status 503, showing the channel status of the user represented by the user number 501 to the base station/relevant relay node; the service duration 504, showing the user receiving service represented by the user number 501 The length of time; and the arrival location 505, showing the location of the user represented by user number 501.
  • base station channel information 144, base station load information 154, associated relay channel information 164, and associated relay load information 174 are integrated into a table.
  • different tables may be used to represent base station channel information 144, respectively.
  • the form and the table of the table are not particularly limited, and the performance may be increased or decreased by referring to the existing form related to the load information and the channel information, as long as the information capable of facilitating the relay selection can be stored in the storage.
  • unit 104A In unit 104A.
  • each base station/relay node records its own channel information and load information.
  • the channel information and load information collected from other base stations or relay nodes are recorded, or the channel information and liability information of a plurality of base stations and relay nodes are recorded in a table, an additional base station/middle is required. Following the numbered entry, to identify which base station/relay node information is specific.
  • Fig. 6 is a block diagram showing the internal structure of the relay node 2A in the wireless communication system according to the first embodiment.
  • the relay node 2A includes an information collector 201A, an information interactor 202 A, a blocking rate calculator 205A, an association controller 206A, and a storage unit 204A.
  • the information collector 201A is for collecting channel information and load information of the relay node 2A, and storing the information in the storage unit 204A.
  • the information interactor 202A is configured to interact with the associated base station to communicate information messages and instruction messages.
  • the blocking rate calculator 205A is configured to select an associated candidate base station from other base stations than the currently associated base station according to the information collected by the information collector 201 A and the information acquired from the base station 1A by the information interleaver 202A, and simulate the associated candidate. In the case where the base station is associated with the present relay node 2A, the blocking rate drop value of the candidate blocking rate when the present relay node is associated with each associated candidate base station is compared with the current blocking rate. The specific calculation process will be described later.
  • the association controller 206A is configured to select a maximum blocking rate decrease value from each of the blocking rate reduction values calculated by the blocking rate calculator 205A, and use the neighboring base station corresponding to the blocking rate falling value as the associated transfer target base station, thereby The association between the present relay node 2A and the current associated base station is converted to be associated with the associated transfer target base station.
  • the controller 206A corresponds to an "association control unit".
  • the storage unit 204A stores various information required for the blocking rate calculation by the blocking rate calculator 205A, which can be obtained by the information collector 201A or the information interactor 202A, and the storage unit 204A can also be associated with the information collector 201A or The information interactor 202A is formed in one body.
  • the storage unit 204A stores: a neighbor base station list 214, a related base station list 224, an associated base station list 234, relay channel information 244, relay load information 254, related cell base station channel information 264, and related cell load information. 274.
  • the neighboring base station list 214 and the related base station list 224 are static information, the associated base station list 234, the relay channel information 244, the relay load information 254, the related cell base station channel information 264, the related cell load information 274, and the related cell relay.
  • Channel information 284, and associated cell relay load information 294 are dynamic information.
  • the neighbor base station list 214 stores a list of base stations that can be associated with the present relay node 2A.
  • the associated base station list 224 stores a list of base stations associated with the relay node.
  • the associated base station list 234 stores the base station currently associated with the relay node.
  • the storage forms of the neighboring base station list 214, the related base station list 224, and the associated base station list 234 may be unified into the storage format of the adjacent/related/associated base station record table shown in FIG.
  • Fig. 7 is a diagram showing a neighbor/correlation/association base station recording table in the relay node according to the first embodiment.
  • the adjacent/related/associated base station record table in the entirety shows the neighbor base station list 214, the related base station list 224, and the associated base station list 234, wherein the entries included are: base station number 701, showing the number of the recorded base station.
  • FIG. 7 The format of FIG. 7 is compared with the format of FIG. 4, and instead of the relay number 401 in FIG. 4, a base station number 701 as an identifier for identifying a base station is used, and the relationship between the relay node and the base station is recorded corresponding to the base station number 701. .
  • the relay channel information 244 refers to a channel letter between the user subordinate to the relay node and the relay.
  • the relay load information 254 refers to load information of a user subordinate to the relay node.
  • the related cell base station channel information 264, the related cell load information 274, the related cell relay channel information 284, and the related cell relay load information 294 also refer to the channel and load information of the user subordinate to the base station or the subordinate of the relay node, respectively. User's channel and load information.
  • the specific format is the same as that shown in FIG. 5, and thus detailed description is omitted.
  • the blocking rate calculator 205A selects the associated candidate base station according to the information collected by the information collector 201A and the information acquired by the information exchanger 202A from the base station 1A ( The neighboring base stations) and respectively calculate the blocking rate drop value in the case where each associated candidate base station is associated with the present relay node 2A.
  • the calculation flow of the blocking rate drop value will be described in detail with reference to Fig. 10 .
  • FIG. 10 is a flow chart illustrating the process by which the blocking rate calculator 205A calculates the network blocking rate.
  • the blocking rate calculator 205A refers to the neighboring base station list 214 to list all neighboring base stations as candidate associated base stations, and sets the first base station in the list to BS* (step S1002). ).
  • the range of adjacent base stations can be specified in advance.
  • the blocking rate calculator 205A assumes that the relay node is associated with the BS* (step S1003). In the case of this assumption, based on the information transmitted by the base station and the information transmitted by the relay node stored in the storage unit 204A ( For example, relay channel information 244, relay load information 254, associated cell base station channel information 264, associated cell load information 274, associated cell relay channel information 284, and associated cell relay load information 294), each cell in the ACC is calculated. The arrival rate and the average user occupy resources (step S1004).
  • each related base station blocking rate is calculated by using queuing theory (step S1005), and then the total blocking rate is calculated (step S1006), and the candidate blocking rate in the case where the relay node is associated with BS* is obtained.
  • the total blocking rate is a weighted sum obtained by the load ratio of each base station by the load ratio of the relevant base station, and can be calculated by referring to the prior art. Therefore, detailed description is omitted.
  • the blocking rate calculator 205A determines whether there are other unprocessed base stations in the list (step S1007). If the determination is YES, the process proceeds to step S1008, and the next unprocessed base station is set to BS*, thereby Step S1003 begins to repeat the calculation of the blocking rate for the next unprocessed base station. If the determination is "NO”, the flow proceeds to step S1009, and the blocking ratio having the smallest value and the relevant base station corresponding to the blocking rate are selected from the calculated candidate blocking ratios.
  • the candidate blocking rate with the smallest selected value corresponds to the base station actually associated with the current one.
  • the current blocking rate is compared, and the maximum blocking rate falling value is calculated (step S1010).
  • the calculation of the cell arrival rate and the calculation of the user's average occupied resources, the queuing theory method, and the like can all refer to the specific calculation method in the prior art, and thus detailed description is omitted here.
  • the present invention is not limited to the queuing-based calculation method, and any method capable of calculating the blocking rate can be used to implement the present invention.
  • the type and content of the information stored by the storage unit can be different according to the blocking rate method. .
  • step 1009 the difference between each blocking rate and the current blocking rate may be separately calculated, and then the maximum blocking rate falling value may be selected therefrom.
  • the relay node 2A selects the neighboring base station corresponding to the falling value of the maximum blocking rate as the associated transfer destination based on the calculated maximum blocking rate falling value. Base station.
  • the base station 1A receives the maximum blocking rate decrease value calculated by each related relay node from each relevant relay node (the relay node capable of establishing association with the base station 1A), and selects the permission transfer from among them. Associated relay node.
  • Fig. 12 is a flowchart showing a relay selection process performed by the base station according to the first embodiment.
  • the relay selector 103A selects the maximum maximum blocking rate decrease value from the received maximum blocking rate decrease values according to the related relay channel information 164 and the associated relay load information 174.
  • the corresponding relay node step S1201).
  • step S1202 it is judged whether or not the maximum maximum blocking rate drop value is greater than zero (step S1202).
  • the determination is "NO"
  • the blocking rate is not optimized, so the processing of the relay node is not performed and the processing is terminated.
  • step S1204 the confirmation information is transmitted to the relay node corresponding to the maximum blocking rate decrease value, and the processing is terminated.
  • the specific process of the dynamic relay base station association scheme in the wireless communication system includes the following steps:
  • Each base station and relay node collects channel information and load information of the statistical user through the information collector, and stores it in its own storage unit.
  • Each relay node transmits the channel information and load information collected in the first step to its own associated base station using the information exchange.
  • the base station aggregates its own channel information and negative
  • the information and the channel information and load information sent by the associated relay node are sent to the relevant relay node by using the information exchange.
  • Blocking rate calculation After receiving the information released by the relevant base station, the relay node calculates the blocking rate of the relevant base station when it is associated with different neighboring base stations, and selects the lowest blocking rate, and After comparing the current blocking rates, the maximum blocking rate drop is obtained. Among them, the calculation of the blocking rate is performed by the blocking rate calculator according to the flow shown in FIG.
  • Each relay node reports the maximum blocking rate drop value to all its associated base stations. After receiving the blocking rate drop value sent by the relevant relay node, the base station selects the relay node with the largest blocking rate drop value according to the flow shown in FIG. 12 by using the relay selector, and returns a relay node to the relay node. Confirmation information.
  • Association change When a relay node receives acknowledgment information from all base stations, it indicates that the association of the association is obtained by all relevant base stations, and therefore, the relay node changes the association relationship with the base station to implement The maximum drop in blocking rate.
  • a message interaction process shown in FIG. 14 is formed by taking a certain base station 1A existing in the wireless communication system and the relay base station 2A currently associated with the base station 1A as an example.
  • Fig. 14 is a flowchart showing a flow of base station-relay node information communication in the radio communication system according to the first embodiment.
  • the information collector 101A in the base station 1A and the information collector 201A of the relay node 2A respectively acquire channel information and load information (steps S1401, 1402), and the information interactor of the relay node 2A
  • the 202A transmits the collected information as report information to the currently associated base station (step S1403).
  • the format of the report information is as shown in Figure 8.
  • Fig. 8 is a view showing a format in which a relay node according to the first embodiment reports information to an associated base station.
  • the reporting information of the relay node to the associated base station includes: a source relay number 801, indicating a number of the relay node that sends the report information, so that the base station identifies the relay node; and the destination base station number 802, indicating that the The number of the reported base station; the source relay channel information 803, showing the channel information of the relay node that transmitted the report; and the source relay load information 804, showing the load information of the relay node that transmitted the report.
  • the base station 1A that has received the report from the relay node 2A also transmits its own collected information to the relevant relay node, so that the relay node 2A calculates the blocking rate (step S1404).
  • the format of the distribution information transmitted by the base station 1A to the relay node 2A is, for example, as shown in FIG.
  • FIG. 9 is a schematic diagram of a base station according to the first embodiment releasing an information format to an associated relay node.
  • the distribution information transmitted by the base station 1A to the relay node 2A includes: a source base station number 901, indicating a number of a base station that sends the release message, so that the relay node identifies the base station; and a destination relay number 902, indicating that the The number of the relay node that issued the message; the source base station channel information 903, showing the channel information of the base station transmitting the posted message; the source base station load information 904, showing the load information of the base station transmitting the posted message; the associated relay list 905 Same as the associated relay list 134 stored in the storage unit 104A, showing a list of relay nodes currently associated with the base station transmitting the posted message; associated relay channel information 906 showing the current association to the sending of the posted message Channel information of the relay node on the base station; associated relay load information 907, showing load information currently associated with the relay node on the base station transmitting the release message.
  • the relay node 2A that has received the release message from the base station 1A uses the content of the advertisement message and the channel information and load information of the relevant cell base station and the relay node stored in the storage unit 201A, according to the flow shown in FIG.
  • the blocking rate falling value is calculated (step S1405), and the calculated blocking rate falling value is transmitted to all relevant base stations (where 1A is not the associated base station, but the blocking rate is received as the relevant base station) (step S1406).
  • the format in which the relay node reports the blocking rate drop value to the relevant base station is as shown in FIG.
  • the blocking rate falling value report information includes: a source relay number 1101, showing a number of a relay node that sends the blocking rate falling value report information; and a destination base station number 1102, indicating receiving the blocking rate falling value report information.
  • the number of the base station; and the blocking rate drop value 1103, which shows the maximum blocking rate drop value when the relay node that transmits the blocking rate decrease value report information changes the association relationship.
  • the relay selector of the base station 1A receives the maximum blocking rate decrease value report information from each of the related relay nodes, and selects a relay node corresponding to the largest maximum blocking rate decrease value among the plurality of relay nodes as a license.
  • the relay node that performs the association conversion (step S1407) concurrently transmits the confirmation information to the corresponding relay node (step S1408).
  • the portion of the blocking rate decrease value 1103 in the report information shown in FIG. 11 is not the maximum blocking rate falling value, but other data showing the blocking rate situation, such as the direct transmission blocking rate, and the prediction is selected by the relay selector.
  • the relay node with the lowest blocking rate sends a confirmation message.
  • FIG. 13 is a schematic diagram showing an example of a format in which the base station according to the first embodiment returns a confirmation information to a selected relay node.
  • the base station is sent as a conversion command to the relay node.
  • the reply confirmation information includes, for example, a source base station number 1301 indicating the number of the base station transmitting the reply confirmation information, and a destination relay number 1302 indicating the number of the relay node receiving the reply confirmation information.
  • the format of the confirmation information is not fixed, and the format and content may be arbitrary as long as it is capable of expressing the message that the base station confirms that the relay node is performing the association conversion.
  • the associated controller of the relay node 2A that received the acknowledgment information establishes communication and association relationship with the base station of the transfer target, and disconnects the base station associated with the current one.
  • the information is exchanged to perform processing for changing the base station associated with the relay node (step S1409).
  • the current configuration of the wireless network is converted into a configuration capable of maximizing the congestion rate, thereby making more efficient use of the communication resources of the system and further reducing the service process. Blockage rate.
  • the flow of information interaction in the first embodiment is illustrated in FIG. 14 above.
  • the present invention is not limited to this flow, and various modifications can be made to the specific implementation flow as long as it conforms to the scheme of dynamically changing the relationship between the relay node and the base station in the wireless communication system.
  • the relay node calculates a maximum blocking rate drop value and sends it to the base station, and the base station performs relay selection according to the maximum blocking rate decrease value.
  • the blocking node calculator of the relay node may also calculate only Each candidate blocking rate is sent to the base station, and the base station selects a base station corresponding to a certain candidate blocking rate as the associated transfer target base station according to the candidate blocking rate. For example, the base station having the lowest value among the candidate blocking rates can be selected as the associated transfer target base station.
  • each base station selects the largest one from the received blocking rate drop values, and gives The corresponding relay node replies with a confirmation message.
  • the base station in the first embodiment performs relay selection, setting a threshold for setting the falling value of the blocking rate, and only when the selected blocking rate falling value exceeds the threshold, the blocking is performed.
  • the relay node corresponding to the rate decrease value transmits an acknowledgment message, otherwise, the base station does not send the acknowledgment message.
  • the content configuration of the base station and the relay node in the radio communication system according to the present modification is the same as that of the first embodiment, and only the operation of the relay selector in the base station is different, and the detailed description of the same portions will be omitted.
  • the relay selector in the base station performs the confirmation of the relay node in accordance with the flow shown in Fig. 15.
  • Fig. 15 is a flowchart showing a modification of the relay selection processing performed by the base station according to the first embodiment.
  • the relay selector 103A selects the largest maximum blocking rate decrease value from the received maximum blocking rate decrease values according to the related relay channel information 164 and the associated relay load information 174.
  • the corresponding relay node step S1501).
  • step S1502 it is judged whether or not the maximum blocking rate decrease value is larger than a preset threshold.
  • the determination is "NO"
  • step S1504 the confirmation information is transmitted to the relay node corresponding to the maximum blocking rate decrease value, and the processing ends.
  • the threshold of the falling value it is possible to prevent the decision to associate the base station with the relay node by making an erroneous change, and it is also possible to prevent a large burden on the system due to the too frequent change of the association of the relay base station.
  • the first embodiment it is characterized in that the calculation of the blocking ratio is performed in the relay node and the relay node that performs the association transfer or the base station to which the transfer is performed is determined.
  • the processing power and computing power of the relay node are limited compared to the base station. Therefore, calculating the blocking rate in the relay node may impose a large burden on it, and considering the calculation of the blocking rate. To the base station associated with it.
  • the second embodiment is completed based on the above considerations, and is different from the technical solution of the first embodiment in that the base station has means capable of calculating the blocking rate.
  • the base station has means capable of calculating the blocking rate.
  • it is necessary to store information related to the blocking rate and originally stored in the relay node in the storage unit of the base station, including the related base station list of the relay node, the channel information of the base station and the relay in the relevant cell, and Load information.
  • the relay node needs to retransmit the information collected by itself and the information transmitted by the relevant base station to the associated base station, and the associated base station calculates the blocking rate of each associated relay, and then transmits the calculation result to the corresponding relay node for the associated transfer target base station. Decide.
  • Fig. 16 is a block diagram showing the internal configuration of the base station 1B in the radio communication system according to the second embodiment.
  • the storage unit additionally stores information related to the blocking rate calculation, specifically including the related base station list of each associated relay, and the base station and the medium in the relevant cell.
  • the load information and channel information are followed, and a blocking rate calculator is added to calculate the maximum blocking rate drop of each associated relay node.
  • the base station 1B includes an information collector 101A, an information interactor 102A, a blocking rate calculator 105B, a relay selector 103A, and a storage unit 104B.
  • the information collector 101A is for collecting channel information and load information of the base station 1A, and storing the information in the storage unit 104B.
  • the information interactor 102A is configured to interact with the associated relay node to communicate information messages and instruction messages.
  • the blocking rate calculator 105B selects the associated candidate base station (neighboring base station) from the base stations other than the own base station for the target relay node associated with the base station 1B, and calculates the information in the object based on the information from the relay node and the collected information.
  • the calculation result is transmitted to the object relay node through the information interactor 102A.
  • the relay selector 103A is an optional component and is mainly used for a large-scale wireless communication network. Specifically, since there are multiple base stations and multiple relay nodes in the network, when multiple relay nodes change associations, there is a problem of overlapping cancellation for the influence of the blocking rate of a certain base station, and therefore, in the base station
  • the relay selector 103A is set, and the relay selector 103A receives data indicating a change in the blocking rate, such as a maximum blocking rate decrease value, from the relevant relay node, so as to change according to the blocking rate shown.
  • the data is selected from the relay node that is permitted to perform the association transfer, and the confirmation information is sent to the selected relay node.
  • the information collector 101A, the information exchanger 102A, the blocking rate calculator 105B, and the relay selector 103A can be realized by a processor such as a CPU executing a predetermined program.
  • the storage unit 104A stores various kinds of information necessary for the blocking rate calculator 105B and the relay selector 103A to perform processing. This information can be obtained by the information collector 101A or the information interactor 102A, and the storage unit 104A can also be formed integrally with the information collector 101 A or the information interactor 102A.
  • the storage unit 104A stores: a neighboring relay list 114, a related relay list 124, an associated relay list 134, base station channel information 144, base station load information 154, associated relay channel information 164, and associated relay.
  • Load information 174 and information 184 from the associated relay node corresponds to the information related to the blocking rate calculation in the storage unit 204A stored in the relay node 2A in the first embodiment, and is all the information collected by the associated relay node.
  • the channel information and load information of the relevant base station collected from the relevant base station of the relay node are included.
  • the information from the associated relay node can be obtained by the relay node periodically reporting to the associated base station.
  • Fig. 17 is a block diagram showing the internal structure of the relay node 2B in the wireless communication system according to the second embodiment. The difference from the relay node 2A in the first embodiment is that there is no blocking rate calculator.
  • the relay node 2B includes an information collector 201 A, an information interactor 202A, an association controller 206A, and a storage unit 204A.
  • the association controller 206A selects the base station as the association transfer target based on the information showing the blocking rate received from the base station 1B through the information interleaver 202A.
  • the storage unit 204A stores: a neighbor base station list 214, a related base station list 224, an associated base station list 234, relay channel information 244, relay load information 254, related cell base station channel information 264, related cell load information 274, and related cells. Relay channel information 284, and associated cell relay load information 294.
  • the base station-relay node information interaction flow in the dynamic relay base station association scheme in the wireless communication system according to the second embodiment is as shown in FIG. 18.
  • FIG. 18 is a flowchart of a base station-relay node information interaction flow in the wireless communication system according to the second embodiment.
  • the information collector 101A in the base station 1B and The information collector 201A of the relay node 2B separately collects channel information and load information (steps S1801, 1802), and the information exchanger 202A of the relay node 2B transmits the collected information as report information to the currently associated base station ( Step S1803).
  • the format of the report information is as shown in FIG. 8, for example.
  • the base station 1B that has received the report from the relay node 2B also transmits the information it has collected to the relevant relay node (step S1804).
  • This information interaction is a general information exchange between the base station and the associated relay node.
  • the format of the transmitted information can be arbitrary.
  • the relay node 2B also transmits information necessary for use in the blocking rate calculation to the base station (step S1805), including the related base station list of the relay node, the channel information of the base station and the relay in the relevant cell, and the load information.
  • the base station IB that has received the required information calculates the congestion rate decrease value according to the flow shown in FIG. 10 (step S1806), and transmits the calculated result (ie, the congestion rate decrease value and its corresponding base station) to the association.
  • the relay node 2B as the calculation target (step S11807).
  • the maximum blocking rate decrease value is selected from the calculation result of the relay node 2B, and the base station corresponding to the maximum blocking rate decrease value is the base station of the associated transfer destination.
  • the relay node 2B transmits the congestion rate decrease value to all the relevant base stations (step S11808).
  • the base station 1B serves as a related base station, wherein the selector selects a maximum maximum blocking rate decrease value from each of the received maximum blocking rate reduction values of the relevant relay node, and transmits the selected relay of the maximum blocking rate falling value.
  • the node serves as the selected relay node, and transmits confirmation information to the relay node (step S1810).
  • the associated controller of the relay node 2A that received the acknowledgment information establishes communication and association relationship with the base station of the transfer target, and disconnects the base station associated with the current one.
  • the information is exchanged to perform processing for changing the base station to which the relay node is associated (step S1811).
  • the base station transmits the virtual blocking rate when the calculated target relay node is associated with its neighboring base station to the target relay node, and the target relay node selects the base station corresponding to the associated transfer destination.
  • the virtual blocking rate may also be selected by the base station directly from the maximum blocking rate drop value, and only the maximum blocking rate falling value and its corresponding base station are sent to the target relay node.
  • steps S1808 to S1811 may also be omitted.
  • the same technical effects as those of the first embodiment can be obtained. Moreover, since the calculation function of the blocking rate is set in the base station in the second embodiment, the processing load of the relay node can be reduced, and the calculation of the blocking rate can be completed by the base station with higher processing capability, thereby improving the entire wireless communication system. Load transfer efficiency.
  • the relay selector in the base station can also make a determination as to whether or not to perform association transfer using a preset threshold.
  • the analog blocking value when the relay node is associated with the relevant base station is calculated in the relay node or the base station, respectively, so that the relay selector set in the base station calculates the simulation according to the calculation.
  • the blocking value determines which base station the relay node is associated with.
  • each component that performs dynamic association control is dispersed in the base station and the relay node to perform dynamic association control management.
  • the present invention is not limited to the above embodiments. It is also up to the relay node to decide which base station to associate with.
  • a comprehensive dynamic association control device capable of performing information interaction with each relay node and the base station may be additionally provided in the wireless communication system, and the wireless dynamic communication network is controlled by the dedicated dynamic association control device. The change of the dynamic association of the relay node.
  • Fig. 19 is a block diagram showing the configuration of the dynamic correlation control device 3 according to the third embodiment.
  • the dynamic association control device 3 includes an information collection unit 10, an occlusion rate calculation unit 20, and an association control unit 30.
  • the information collecting unit 10 collects information related to the target relay node and the associated candidate base station by transmitting and receiving information with the base station and the relay node.
  • the association candidate base station refers to a base station that is associated with a relay node and that can be associated with a relay node. Further, the information collecting unit 10 may select a plurality of base stations as base stations for selecting a base station associated with the relay node and reduce the amount of calculation. Or selecting a base station of several related cells as a candidate base station according to the distance of the relevant cell. Further, the information collecting unit 10 may collect information of each base station and relay node in the network by another device such as a server.
  • the blocking ratio calculating unit 20 calculates the candidate blocking ratio when the target relay node is associated with each associated candidate base station based on the information collected by the information collecting unit 10, respectively.
  • the calculation of the blocking rate is a dynamic simulation calculation to analyze the influence on the network blocking rate when the correlation is changed.
  • the specific calculation method is the same as the calculation method of the blocking rate calculator in the first embodiment.
  • the association control unit 30 selects the target blocking ratio from the calculated candidate blocking ratios, sets the base station corresponding to the target blocking ratio as the associated transfer target base station, and transmits the result to the corresponding target relay station to make the target relay node The transition becomes associated with the associated transfer target base station.
  • Fig. 20 is a flowchart showing dynamic association management executed by the dynamic association control device according to the third embodiment.
  • step S2001 the relay node association transfer process is started.
  • the information collecting unit 10 selects a certain relay node of the wireless communication system as the target relay node, and acquires the base station that is associated with the target relay node and is also associated with the target base station as the associated candidate base station.
  • the information related to the relay node and the associated candidate base station (step S2002).
  • the blocking ratio calculating unit 20 calculates a candidate blocking ratio when the target relay node is associated with each of the associated candidate base stations based on the collected information (step S2003).
  • the association control unit 30 selects the blocking ratio with the lowest blocking rate as the target blocking rate from the calculated candidate blocking ratios, or compares each candidate blocking rate with the current blocking rate, and selects the blocking rate with the largest blocking rate decreasing value as the target blocking rate.
  • Rate a base station corresponding to the target blocking rate is used as an associated transfer target base station of the target relay node (step S2004), and an instruction to convert the target relay node into an associated transfer target base station is generated according to the result of the selection,
  • the relay node, the currently associated base station, and the transfer target base station are transmitted to the target relay node to perform the transfer of the associated state (step S2005).
  • next relay node is taken as the new object relay node, and the same processing is repeated until all the relay nodes in the system are traversed (step S2006).
  • the dynamic association control device 3 can periodically perform the above dynamic association management to optimize the partition of the cell.
  • the association control unit may also determine whether the selected blocking ratio of the blocked blocking rate is greater than a preset threshold, which is greater than a predetermined value. In the case of the set threshold, the target relay node is caused to be associated with the associated transfer target base station. Further, the association control unit may use the candidate blocking ratio at which the blocking ratio is the lowest in the candidate blocking ratio and lower than the predetermined threshold as the target blocking ratio, regardless of the falling value of the blocking ratio.
  • the dynamic association control device described above may be separately configured with the base station and the relay node, or may be installed in the base station or the relay node, and the functional modules of the dynamic association control device may be separately split into different base stations and In the relay node, in a configuration combined with the base station and the relay node, data or information stored in the storage unit of the base station and the relay node can be shared.
  • the information acquisition unit is installed in a base station and a relay node in a wireless communication network including a base station and a relay node
  • the blocking rate calculation unit is installed in the base station
  • the association control unit is installed in the relay node.
  • the dynamic association control device may have a relay selection unit, and when the plurality of target relay nodes are plural, the relay selection unit selects from a plurality of target relay nodes.
  • the minimum selected object blocking rate is selected in the object blocking rate, and only the object relay node corresponding to the selected blocking target blocking rate is associated.
  • the relay selection unit may select the maximum maximum blocking rate decrease value from the maximum blocking rate decrease values of the plurality of target relay nodes. , only the object relay node corresponding to the selected maximum blocking rate drop value is associated with the transfer.
  • the same technical effects as those of the first embodiment can be obtained. Further, since the dynamic correlation control device that performs load transfer is provided independently from the first embodiment or the second embodiment, the processing load of the relay node and the base station is further reduced, and the entire wireless communication system can be passed through one device.
  • the network is configured to perform overall load management, and the dynamic association control device may be set or grouped into the base station and the relay node, so that the configuration of the wireless communication system is more flexible.
  • Figure 21 is a schematic diagram of a network topology of a specific embodiment of the wireless communication system according to the present invention.
  • each cell there are three cells in the network of the wireless communication system, and one base station is deployed in the center of each cell, which is respectively recorded as BS 68 2 and 68 3 , and three relay nodes are deployed in each cell, i The three relay nodes in each cell are respectively recorded as RS ⁇ , RS 2 (1) and RS 3 (1) , and the cell half
  • the diameter is 500 meters.
  • each of the current relay nodes is associated with the base station of the own cell as shown in FIG. And it is assumed that the neighboring base stations of each relay node are the same as the related base stations of the relay, and the adjacent/related base stations of each relay are specifically listed in Table 1.
  • Table 2 shows the load of each base station/relay in the current network and the load of each cell and the blocking rate of each cell.
  • the unit of the load is the number of users arriving per second.
  • the total blocking rate of the network can be calculated, which is shown in Table 2.
  • the method for calculating the network blocking rate is to weight the average blocking rate of each cell by using the load of each cell as a weight.
  • the dynamic correlation control method in which the maximum blocking rate drop value is a criterion is used in the third embodiment.
  • the relay node is currently associated with the BS ⁇ and its neighboring base stations have 68 2 and 68 3 in addition to the BSi, and therefore, the relay node is based on the base station (BS 68 2 and 68 3 )
  • the information sent and the information collected by itself are assumed to be associated with BS 88 2 and 88 3 respectively , and the blocking rate is calculated. The calculation results are shown in Table 3.
  • Each relay node transmits the maximum value of the virtual blocking rate reduction after assuming that the association is changed to its own relevant base station.
  • Table 5 shows the blocking rate drop value received by each base station from the relevant relay. Each base station selects a relay with the highest blocking rate drop value and greater than zero, and replies with the acknowledgment information. Table 5 also shows the relay for each base station to select the reply acknowledgment information.
  • BSi RSi (1) (0.043), RS 2 (1) (0), RS 3 (1) (0) , RS 3 ( 2 ) (0) , RS 2 ( 3 ) (0.015) RS 1 )
  • the RS "receives the acknowledgment information from all its associated base stations, so the relay RS" makes a decision to change the association, and changes the association to the base station BS 2 that can maximize the blocking rate drop value. After changing the association, the network The total blocking rate dropped by 0.043.

Landscapes

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

Abstract

本发明的目的在于提供一种利用中继节点进行负载转移，从而实现均衡负载和提高服务质量的无线通信系统、动态关联控制装置及动态关联控制方法。本发明的动态关联控制装置包括：信息采集部，采集与对象中继节点和关联候选基站相关的信息；阻塞率计算部，根据所采集的信息，分别计算在对象中继节点与各个关联候选基站相关联时的候选阻塞率；以及关联控制部，从所计算出的所述候选阻塞率中选择对象阻塞率，将与该对象阻塞率对应的基站作为关联转移对象基站，使所述对象中继节点转变成与所述关联转移对象基站相关联。

Description

无线通信系统及方法、 动态关联控制装置及方法 技术领域
本发明涉及在部署有中继节点的蜂窝网络中的无线通信系统， 特别涉 及利用中继节点进行负载转移的无线通信系统、 动态关联控制装置及动态 关联控制方法。 背景技术
近年来， 无线通讯技术迅猛发展， 蜂窝网中的小区面积逐渐缩小， 网 络中负载快速上升， 造成小区负载随着时间和空间剧烈变化。 这种负载不 均匀性一方面使得热点小区中的用户服务质量下降， 另一方面， 非热点小 区内资源没有被充分利用。为了解决热点小区内用户服务质量下降的问题， 需要将热点小区内的负载转移到周围的非热点小区， 即在网络中进行负载 转移的操作。
例如， 在专利文献 1 (WO2010EP61368 20100804 ) "DISTRIBUTED LOAD BALANCING IN CELLULAR WIRELESS NETWORKS "中， 描述了 一种蜂窝网内进行负载转移的方法。 该方法是分布式算法， 通过改变为用 户服务的基站来转移负载，
此外， 在小区基站属下设置中继节点的中继技术近年来成为被广泛接 受的无线通讯技术之一， 在若干蜂窝网标准中， 中继技术都被纳入其中。 所谓中继节点， 是指与设置范围所对应的小区的基站相关联、 通常被部署 在小区的边缘、 用来增强边缘用户信号强度以及扩大覆盖范围的设备。
在专利文献 1 (WO2010EP61368 20100804)中采用的分布式算法仅涉 及用户和基站之间的负载转移， 并没有中继节点的参与。
此外， 在专利文献 2 (WO2010US43669 20100729) "SYSTEM AND METHOD FOR MOBILE ACCESS CONTROL AND LOAD BALANCING IN A RELAY NETWORK"中。描述了一种包含中继节点的单小区内利用中 继进行负载转移的方法。
但是， 该方法不能够应用到多小区下不同小区之间负载转移的场景。 在蜂窝网的环境下无法解决资源分配不均及阻塞的问题。
另夕卜，在专利文献 3 (US20020213058 20020806) "Integrated cellular and ad hoc relaying system" 中描述了一种部署有中继节点的蜂窝网络， 并且指 出部署的中继节点能够协助在多小区之间转移负载。 但是并没有给出具体 的中继节点转移负载的算法。 发明内容
本发明就是鉴于以上问题而完成的， 目的在于提供一种利用中继节点 进行负载转移， 从而实现均衡负载和提高服务质量的无线通信系统、 动态 关联控制装置及动态关联控制方法。
在存在中继节点的蜂窝网等网络中， 中继节点与所属的小区基站相配 合进行动作， 由于中继节点通常被部署在位置较高、 视野较好的地点， 在 硬件条件和地理条件来说能够和周围若干个基站保持较好的信道状态， 使 得利用中继节点进行负载转移成为可能。
本发明中， 利用以上中继节点的特性， 动态地分配中继节点所属的基 站， 使得中继节点并不如现有技术那样与固定的小区基站相关联， 而是能 够根据无线通信资源的情况改变与中继节点相关联的基站， 从而使得中继 节点服务下的用户终端的负载间接地转移。
本发明的一个技术方案是一种动态关联控制装置，包括：信息采集部， 采集与对象中继节点和关联候选基站相关的信息； 阻塞率计算部， 根据所 采集的信息， 分别计算在对象中继节点与各个关联候选基站相关联时的候 选阻塞率； 以及关联控制部， 从所计算出的所述候选阻塞率中选择对象阻 塞率， 将与该对象阻塞率对应的基站作为关联转移对象基站， 使所述对象 中继节点转变成与所述关联转移对象基站相关联。
本发明的另一个技术方案是一种动态关联控制方法， 包括： 信息采集 步骤， 采集与对象中继节点和关联候选基站相关的信息； 阻塞率计算步骤， 根据所采集的信息， 分别计算在对象中继节点与各个关联候选基站相关联 时的候选阻塞率； 以及关联控制步骤， 从所计算出的所述候选阻塞率中选 择对象阻塞率， 将与该对象阻塞率对应的基站作为关联转移对象基站， 使 所述对象中继节点转变成与所述关联转移对象基站相关联。
本发明的再一个技术方案是一种无线通信系统中的无线通信方法， 所 述无线通信系统包括基站和与基站相关联的中继节点， 其特征在于， 所述 无线通信方法包括： 所述基站和中继节点分别采集与各自的通信环境有关 的信息； 所述基站将所采集的消息发送给能够与其建立关联的各个中继节 点； 所述中继节点从除了当前所关联的基站以外的基站中选择关联候选基 站， 根据来自基站及采集的信息， 分别计算在本中继节点与各个关联候选 基站相关联时的候选阻塞率， 从本中继节点所计算出的所述候选阻塞率中 选择对象阻塞率， 将与该对象阻塞率对应的基站作为关联转移对象基站， 从与当前基站相关联转变成与关联转移对象基站相关联。
本发明的再一个技术方案是一种无线通信系统中的无线通信方法， 所 述无线通信系统包括基站和与基站相关联的中继节点， 其特征在于， 所述 无线通信方法包括： 所述基站和中继节点分别采集与各自的通信环境有关 的信息； 所述基站将所采集的消息发送给能够与其建立关联的各个中继节 点； 所述中继节点将所采集的消息发送给当前与其相关联的基站； 所述基 站针对与其关联的对象中继节点， 从除了本基站以外的基站中选择关联候 选基站， 根据来自中继节点及采集的信息， 分别计算在对象中继节点与各 个关联候选基站相关联时的候选阻塞率， 并将计算结果发送给对象中继节 点； 所述中继节点从所述候选阻塞率中选择对象阻塞率， 将与该对象阻塞 率对应的基站作为关联转移对象基站， 从与当前基站相关联转变成与关联 转移对象基站相关联。
根据本发明， 中继节点与基站能够动态地相关联， 从而中继节点能够 使用和原蜂窝网同样的频段进行传输， 节省了频率资源， 并且， 在本无线 通信系统中不需要中心节点， 就能够使阻塞率显著下降， 从而能够得到均 衡负载和提高服务质量的技术效果。 附图说明
图 1是本发明涉及的无线通信系统的网络拓扑的示意图。
图 2是本发明涉及的中继节点关联关系转移后的网络拓扑的示意图。 图 3是第一实施方式涉及的无线通信系统中的基站内部结构的框图。 图 4 是第一实施方式涉及的基站中的相邻 /相关 /关联中继记录表的示 意图。
图 5是第一实施方式涉及的基站中的基站 /中继信道及负载信息记录表 的示意图。
图 6是第一实施方式涉及的无线通信系统中的中继节点内部结构的框 图。
图 7 是第一实施方式涉及的中继节点中的相邻 /相关 /关联基站记录表 的示意图。
图 8是第一实施方式涉及的中继节点向关联基站汇报信息格式的示意 图。
图 9是第一实施方式涉及的基站向相关中继节点发布信息格式的示意 图。
图 10是说明计算网络阻塞率的处理的流程图。
图 11 是第一实施方式涉及的中继节点向相关基站汇报阻塞率下降值 的信息格式的示意图。
图 12是第一实施方式涉及的基站进行中继选择处理的流程图。
图 13 是第一实施方式涉及的基站向选定的中继节点回复确认信息格 式的示意图。
图 14是第一实施方式涉及的无线通信系统中的基站-中继节点信息交 互流程的流程图。
图 15 是第一实施方式涉及的基站进行中继选择处理的变形例的流程 图。
图 16是第二实施方式涉及的无线通信系统中的基站内部结构的框图。 图 17 是第二实施方式涉及的无线通信系统中的中继节点内部结构的 框图。
图 18是第二实施方式涉及的无线通信系统中的基站-中继节点信息交 互流程的流程图。
图 19是第三实施方式涉及的动态关联控制装置的结构框图。
图 20 是第三实施方式涉及的动态关联控制装置所执行的动态关联管 理的流程图。
图 21 是本发明涉及的无线通信系统中的具体实施例的网络拓扑示意 图。
符号说明：
1A、 IB 基站 2A、 2B 中继节点
101A 信息收集器
102 A 信息交互器
103A 中继选择器
104A、 104B、 204A 存储单
205A 阻塞率计算器
206A 关联控制器
3 动态关联控制装置
10 信息采集部
20 阻塞率计算部
30 关联控制部 具体实施方式
首先， 对基站和中继节点之间的关系进行定义和解释。 每个中继节点 在某一时刻必然与某个基站相关联，将该基站称为该中继节点的关联基站。 反之， 将该中继节点称为该基站的关联中继节点。
图 1是本发明涉及的无线通信系统的网络拓扑的示意图。 在图 1中示 意性地给出了一个含有三个小区的网络拓扑示例。 如图 1所示， 基站 1-1、 基站 1-2、 基站 1-3分别部署在各自的小区中央位置， 每个小区中分别部署 有三个中继节点，例如中继节点 2-1。现有的默认情况下，各个基站 1-1~1-3 分别管理某个固定区域的小区， 在该小区的范围内配置的中继节点隶属于 管理该小区的基站， 也就是说， 每个中继节点与距离自己最近的基站相关 联到。
在现有技术中， 中继节点始终与固定的小区基站相关联， 用于增强该 特定小区的边缘用户信号强度。
虽然受到信号强度的限制， 一个中继节点通常只能从周围若干个基站 中选择一个进行关联， 但是， 理论上在一定范围内， 一个中继节点与周围 若干个基站之间都能进行信号传送， 这里将这种现象视为中继节点和周围 若干个基站之间具有 "相邻关系"。具有相邻关系的基站与中继节点之间也 能够进行关联， 将能够与中继节点进行关联的基站称为该中继节点的 "相 邻基站"。 此外， 也可以根据预先设定的规则条件来判断某个中继节点与周 围哪些基站之间存在相邻关系， 也可以针对某个中继节点预先设定该中继 节点的相邻基站。
基于以上的相邻关系理论， 在本发明中， 设想如果中继节点改变其和 关联基站之间的关联关系， 而是与除了关联基站之外的其他存在相邻关系 的相邻基站建立关联， 为改变关联后的基站服务时， 由于负载发生变化， 周围会有若干个小区的阻塞率发生变化。 对于某个小区来说， 会使阻塞率 降低。 也就是说， 在某个中继节点的关联关系发生变化时， 系统中的其他 小区的基站的阻塞率也会受到影响。 这里， 将这些受到影响的基站所对应 的小区称为该中继节点的相关小区， 将这些相关小区所对应的基站称为中 继节点的相关基站， 反之， 将这个中继节点称为基站的相关中继节点。 一 般来说， 相邻基站被包含在相关基站中， 在中继节点改变相关联的基站时， 必须关联到相邻基站中的一个。 此外， 相关基站通常包含关联基站， 由于 相关基站的定义是该中继改变关联后阻塞率可能受到影响的基站。 因此， 相邻基站之外的网络中其他基站也可能由于该中继改变关联导致干扰环境 变化， 进而阻塞率变化。 但是， 对于覆盖范围较小或者包含的小区数较小 的网络来说， 相关基站也可能是关联基站与相邻基站的集合。
为说明方便， 基站和中继节点之间的相邻关系和相关关系都是根据网 络拓扑预先设定好的， 不会随着时间而变化。
在本发明中， 中继节点可以改变和基站之间的关联关系， 图 2是本发 明涉及的从图 1的状态下中继节点关联关系转移后的网络拓扑的示意图。
如图 2所示， 基站 1-2与中继节点 2-1之间存在相邻关系， 与图 1的 状态相比，在图 1中与基站 1-1相关联的中继节点 2-1改变成为与相邻基站 1-2相关联。通过这种中继基站关联关系的变化， 每个小区的覆盖范围随之 发生变化，基站 2-1管理的小区所覆盖的范围包含进了中继节点 2-1强化信 号强度的范围，原本由基站 1-1管理的小区的一部分并入了基站 1-2的小区， 从而这部分的负载也成为基站 1-2的负载， 这样就达到了负载转移的目的。
为了实现以上这种本发明的负载转移， 以下， 参照附图说明本发明的 各个实施方式。
(第一实施方式）
设第一实施方式中的无线通信系统包括多个基站 1A和与某个基站相 关联的多个中继节点 1B。各个基站 1A的内部构成相同， 各个中继节点 1B 图 3是第一实施方式涉及的无线通信系统中的基站 1A的内部结构的 框图。 如图 3所示， 基站 1A包括信息收集器 101A、 信息交互器 102A、 中 继选择器 103A以及存储单元 104A。
信息收集器 101A用于收集基站 1A的信道信息和负载信息，并将这些 信息存储到存储单元 104A中。信息交互器 102A用于与中继节点进行信息 交互， 来传递信息消息和指令消息。
中继选择器 103A为可选部件， 主要用于规模较大的无线通信网络。 具体来说， 由于在网络中存在多个基站和多个中继节点， 当多个中继节点 都改变关联时， 针对某个基站的阻塞率的影响存在叠加抵消的问题， 因此， 在基站中设置中继选择器 103A, 由中继选择器 103A从相关中继节点接收 示出阻塞率变化的数据例如最大阻塞率下降值， 以便依据该示出阻塞率变 化的数据从中选择许可进行关联转移的中继节点， 并给所选择的中继节点 发送确认信息。 具体的中继选择流程后述。
另外， 在不存在中继选择器 103A 的情况， 基站不必接收示出阻塞率 变化的数据而直接进行中继节点的关联转移。
其中， 信息收集器 101A、 信息交互器 102A、 中继选择器 103A可以 由 CPU等处理器执行规定的程序来实现， 信息收集器 101A和信息交互器 102A相当于 "信息采集部"， 中继选择器 103A相当于 "中继选择部"。
存储单元 104A中存储有中继选择器 103A进行中继选择时所需的各种 信息， 这些信息可以通过信息收集器 101A或信息交互器 102A来获得， 存 储单元 104A也可以与信息收集器 101A或信息交互器 102A形成为一体。
具体来说， 存储单元 104A中存储有： 相邻中继列表 114、 相关中继列 表 124、 关联中继列表 134、 基站信道信息 144、 基站负载信息 154、 相关 中继信道信息 164、 以及相关中继负载信息 174。 其中， 相邻中继列表 114 和相关中继列表 124是静态信息， 关联中继列表 134、 基站信道信息 144、 基站负载信息 154、相关中继信道信息 164、 以及相关中继负载信息 174是 动态信息。 静态信息是在网络初始化时确定的， 不会随着时间变化， 动态 信息会随时间而变化，需要定期通过收集或者和中继节点交互的方式更新。
相邻中继列表 114中存储有能够关联到该基站 1A的中继节点的列表。 相关中继列表 124存储有与基站 1A相关的中继节点，这里，若一个中继节 点的相关基站中包含该基站 1A, 则视为该中继节点是该基站的相关中继节 点， 将该中继节点的信息记载到该相关中继列表 124， 关联中继列表 134 存储有当前与该基站 1A相关联的中继节点的列表。 相邻中继列表 114、 相 关中继列表 124以及关联中继列表 134的存储形式可以统一为图 4所示的 相邻 /相关 /关联中继记录表的存储格式。
图 4 是第一实施方式涉及的基站中的相邻 /相关 /关联中继记录表的示 意图。 在相邻 /相关 /关联中继记录表统合示出了相邻中继列表 114、 相关中 继列表 124以及关联中继列表 134， 其中所包含的表项有： 中继编号 401， 示出所记录的中继节点的编号， 是用来识别中继节点的标识符； 信道状态 402， 示出由中继编号 401表示的中继节点到该基站 1A的信道状态； 是否 关联 403，示出由中继编号 401表示的中继节点当前是否关联到该基站 1A; 是否相邻 404， 示出由中继编号 401表示的中继节点是否能够关联到该基 站； 以及是否相关 405，示出由中继编号 401表示的中继节点的相关基站中 是否包含该基站 1A。
图 4的示例中将相邻中继列表 114、 相关中继列表 124以及关联中继 列表 134统合在一个表格中， 当然也可以将是否关联 403、 是否相邻 404、 是否相关 405分在不同的表格中表示，从而独立记载相邻中继列表 114、相 关中继列表 124以及关联中继列表 134。
基站信道信息 144示出关联到该基站 1A的用户到该基站 1A的信道信 息。基站负载信息 154示出关联到该基站 1A的用户的负载信息。相关中继 信道信息 164示出基站 1A的相关中继节点上关联的用户的信道信息。相关 中继负载信息 174示出基站 1A的相关中继节点上关联的用户的负载信息。
基站信道信息 144、 基站负载信息 154、 相关中继信道信息 164、 以及 相关中继负载信息 174的存储形式可以统一为图 5所示的基站 /中继信道及 负载信息记录表的存储格式。
图 5是第一实施方式涉及的基站中的基站 /中继信道及负载信息记录表 的示意图。 在基站 /中继信道及负载信息记录表中统合示出了基站信道信息 144、 基站负载信息 154、 相关中继信道信息 164、 以及相关中继负载信息 174， 其中所包含的表项有： 用户编号 501， 用于识别用户的标识符， 基站 / 中继信道及负载信息记录表中的用户包括关联到该基站 1A 的用户以及基 站 1A的相关中继节点上关联的用户； 到达时间 502， 示出由用户编号 501 表示的用户到达无线通信系统的时间； 信道状态 503， 示出由用户编号 501 表示的用户到该基站 /相关中继节点的信道状态； 服务时长 504， 示出由用 户编号 501表示的用户接受服务的时间长度； 以及到达地点 505，示出由用 户编号 501表示的用户的位置。
图 5的示例中将基站信道信息 144、基站负载信息 154、相关中继信道 信息 164、以及相关中继负载信息 174统合在一个表格中， 当然也可以用不 同表格来分别表示基站信道信息 144、 基站负载信息 154、相关中继信道信 息 164、 以及相关中继负载信息 174。 并且， 表格的形式和表项并不特别限 定， 也可以参照现有的与负载信息和信道信息有关的形式来增减表现， 只 要是能够有助于进行中继选择的信息都可以存储到存储单元 104A中。
此外， 图 5所示的例子中相当于是每个基站 /中继节点记录自身信道信 息和负载信息的一个格式。 但是， 如果记录的是从其他基站或者中继节点 收集来的信道信息及负载信息， 或者将多个基站和中继节点的信道信息和 负债信息记录在一个表格中， 则需要追加项基站 /中继编号的表项， 来识别 具体是哪个基站 /中继节点的信息。
图 6是第一实施方式涉及的无线通信系统中的中继节点 2A的内部结 构的框图。 如图 6所示， 中继节点 2A包括信息收集器 201A、 信息交互器 202 A , 阻塞率计算器 205A、 关联控制器 206A以及存储单元 204A。
信息收集器 201A用于收集中继节点 2A的信道信息和负载信息，并将 这些信息存储到存储单元 204A中。信息交互器 202A用于与相关的基站进 行信息交互， 来传递信息消息和指令消息。
阻塞率计算器 205A用于根据信息收集器 201 A收集到的信息以及通过 信息交互器 202A从基站 1A获取的信息， 从除了当前所关联的基站以外的 其他基站中选择关联候选基站，模拟关联候选基站与本中继节点 2A相关联 的情形， 分别计算本中继节点与各个关联候选基站相关联时的候选阻塞率 与当前阻塞率相比的阻塞率下降值。 具体的计算过程后述。
关联控制器 206A用于从阻塞率计算器 205A所计算出的各个阻塞率下 降值中选择最大的阻塞率下降值， 将该阻塞率下降值所对应的相邻基站作 为关联转移对象基站，从而将本中继节点 2A与当前关联基站之间的关联转 换为与关联转移对象基站相关联。
其中， 信息收集器 201A、 信息交互器 202A、 阻塞率计算器 205A以 及关联控制器 206A可以由 CPU等处理器执行规定的程序来实现， 信息收 集器 201A和信息交互器 202A相当于 "信息采集部"， 阻塞率计算器 205A 相当于 "阻塞率计算部"， 关联控制器 206A相当于 "关联控制部"。
存储单元 204A中存储由阻塞率计算器 205A进行阻塞率计算时所需的 各种信息，这些信息可以通过信息收集器 201A或信息交互器 202A来获得， 存储单元 204A也可以与信息收集器 201A或信息交互器 202A形成为一体。
具体来说， 存储单元 204A中存储有： 相邻基站列表 214、相关基站列 表 224、 关联基站列表 234、 中继信道信息 244、 中继负载信息 254、 相关 小区基站信道信息 264、 相关小区负载信息 274、 相关小区中继信道信息 284、 以及相关小区中继负载信息 294。 其中， 相邻基站列表 214及相关基 站列表 224是静态信息， 关联基站列表 234、 中继信道信息 244、 中继负载 信息 254、 相关小区基站信道信息 264、 相关小区负载信息 274、 相关小区 中继信道信息 284、 以及相关小区中继负载信息 294是动态信息。
相邻基站列表 214中存储有能够与本中继节点 2A关联的基站列表。 相关基站列表 224存储有与该中继节点相关的基站列表。关联基站列表 234 存储有当前与该中继节点相关联的基站。相邻基站列表 214、相关基站列表 224、 关联基站列表 234的存储形式可以统一为图 7所示的相邻 /相关 /关联 基站记录表的存储格式。
图 7 是第一实施方式涉及的中继节点中的相邻 /相关 /关联基站记录表 的示意图。 在的相邻 /相关 /关联基站记录表统合示出了相邻基站列表 214、 相关基站列表 224、关联基站列表 234，其中所包含的表项有：基站编号 701， 示出所记录的基站的编号， 是用来识别基站的标识符； 信道状态 702， 示出 由基站编号 701表示的基站到该中继节点 2A的信道状态； 是否关联 703， 示出该中继节点 2A当前是否关联到由基站编号 701表示的基站；是否相邻 704， 示出该中继节点 2A是否能够关联到由基站编号 701表示的基站； 以 及是否相关 705，示出该中继节点 2A的相关基站中是否包含由基站编号 701 表示的基站。
图 7的格式与图 4的格式相比较， 代替图 4中的中继编号 401而使用 作为识别基站的标识符的基站编号 701，对应于该基站编号 701记录中继节 点和基站之间的关系。
中继信道信息 244是指该中继节点下属的用户和该中继之间的信道信 息， 中继负载信息 254是指该中继节点下属的用户的负载信息。 相关小区 基站信道信息 264、 相关小区负载信息 274、 相关小区中继信道信息 284、 以及相关小区中继负载信息 294也分别是指的是该基站下属的用户的信道 和负载信息或者中继节点下属的用户的信道和负载信息。具体的格式与图 5 所示的格式相同， 因此， 省略详细的说明。
在本实施方式中， 中继节点 2A收到相关基站发布的信息后， 阻塞率 计算器 205A 根据信息收集器 201A 收集到的信息以及通过信息交互器 202A从基站 1A获取的信息选择关联候选基站 （相邻基站） 并分别计算各 个关联候选基站与本中继节点 2A相关联的情形下的阻塞率下降值。 其中， 参照图 10来详细说明阻塞率下降值的计算流程。
图 10是说明阻塞率计算器 205A计算网络阻塞率的处理的流程图。如 图 10所示， 首先， 在步骤 S1001中， 阻塞率计算器 205A参照相邻基站列 表 214列出所有相邻基站作为候选关联基站， 将列表中的第一个基站设为 BS* (步骤 S1002)。 此外， 相邻基站的范围可以预先指定。
接着， 阻塞率计算器 205A 假设所在的中继节点关联到 BS* (步骤 S1003 ) , 在这种假设的情况下， 根据存储单元 204A 中存储的、 基站传递 的信息和中继节点传递的信息（例如中继信道信息 244、中继负载信息 254、 相关小区基站信道信息 264、相关小区负载信息 274、相关小区中继信道信 息 284、 以及相关小区中继负载信息 294)， 计算 ACC中每个小区的到达率 和用户平均占用资源 （步骤 S1004)。
接着， 基于步骤 1004的计算结果， 利用排队论计算每个相关基站阻塞 率（步骤 S1005 ) , 进而计算总的阻塞率（步骤 S1006) , 得到中继节点关联 到 BS*的情况下的候选阻塞率。 其中， 总的阻塞率是相关基站的阻塞率以 每个基站的负载加权求得的加权和， 可以参照现有技术进行计算， 因此， 省略详细的说明。
接着，阻塞率计算器 205A判断列表中是否存在其他未处理的基站（步 骤 S1007 ) , 在判断为 "是" 的情况下， 进入步骤 S1008, 将下一个未处理 的基站设为 BS*， 从而从步骤 S1003开始重复对下一个未处理基站进行阻 塞率的计算。 在判断为 "否" 的情况下， 进入步骤 S1009, 从计算出的候 选阻塞率中选择值最小的阻塞率以及该阻塞率所对应的相关基站。
最后， 将所选的值最小的候选阻塞率与当前所实际关联的基站所对应 当前阻塞率相比较， 计算出最大阻塞率下降值 （步骤 S1010)。
在图 10所示的阻塞率的计算中，小区的到达率和用户平均占用资源的 计算以及排队论方法等都可以援引现有技术中的具体计算方法， 因此在此 省略详细的说明。 当然， 本发明也不仅限于基于排队论的计算方法， 只要 是能够计算出阻塞率的方法都可以用于实施本发明， 存储单元存储的信息 种类和内容可以根据阻塞率的方法不同而相应地不同。
此外， 在步骤 1009， 当然也可以分别计算出各个阻塞率与当前阻塞率 之差， 再从中选出最大的阻塞率下降值。
这样， 基于如图 10所示的阻塞率计算器 205A的处理， 中继节点 2A 根据所计算出的最大阻塞率下降值， 选择与该最大阻塞率下降值对应的相 邻基站作为关联转移目的地的基站。
此外， 如上所述， 基站 1A会从各个相关中继节点（能够与基站 1A建 立关联的中继节点） 接收到各个相关中继节点所计算出的最大阻塞率下降 值， 并从中选择出许可转移关联的中继节点。
图 12是第一实施方式涉及的基站进行中继选择处理的流程图。
如图 12所示， 首先， 中继选择器 103A根据相关中继信道信息 164以 及相关中继负载信息 174，从所接收到的各个最大阻塞率下降值中选择其中 最大的最大阻塞率下降值及对应的中继节点 （步骤 S1201 )。
接着， 判断该最大的最大阻塞率下降值是否大于零（步骤 S1202)。 在 判断为 "否" 的情况下， 说明如果即使转变发送该最大阻塞率下降值的中 继节点的当前关联基站， 也不会优化阻塞率， 因此不进行该中继节点的关 联转移而结束处理 （步骤 S1203 )。
在判断为 "是" 的情况下， 进入步骤 S1204, 作为确认信息向该最大 阻塞率下降值所对应的中继节点发送确认， 并结束处理。
结合无线通信系统中的基站及中继节点之间的交互关系， 可知第一实 施方式涉及的无线通信系统中的动态中继基站关联方案的具体流程包括以 下若干个步骤：
( 1 )信息收集： 每个基站和中继节点通过信息收集器收集统计用户的 信道信息和负载信息， 并存储于自身的存储单元中。
(2)信息扩散： 每个中继节点将第一步中收集到的信道信息和负载信 息利用信息交互器发送给自己的关联基站。 基站汇总自身的信道信息和负 载信息， 以及关联中继节点发送来的信道信息和负载信息， 利用信息交互 器发送给自己的相关中继节点。
(3 )阻塞率计算： 中继节点收到相关基站发布的信息后， 计算在自己 分别关联到不同的相邻基站的情况下的相关基站的阻塞率， 并且从中选出 最低的阻塞率， 和当前的阻塞率相比较后， 得出最大的阻塞率下降值。 其 中， 阻塞率的计算是由阻塞率计算器按照图 10所示流程进行。
(4)阻塞率汇报及中继算则： 每个中继节点将最大阻塞率下降值汇报 给自己的所有相关基站。 基站收到相关中继节点发送的阻塞率下降值后， 利用中继选择器， 按照图 12所示的流程， 从中选出阻塞率下降值最大的中 继节点， 并向该中继节点回复一个确认信息。
(5 )关联改变： 当一个中继节点从所有基站都收到了确认信息时， 表 示该关联的转移得到所有相关基站的许可， 因此， 该中继节点改变和基站 之间的关联关系， 以实现阻塞率的最大下降。
基于以上动态中继基站关联方案的具体流程， 以无线通信系统中存在 的某个基站 1A以及当前与基站 1A相关联的中继基站 2A为例， 形成如图 14所示的消息交互流程。
图 14是第一实施方式涉及的无线通信系统中的基站-中继节点信息交 互流程的流程图。 如图 14所示， 首先， 基站 1A中的信息收集器 101A和 中继节点 2A 的信息收集器 201A 分别采集信道信息和负载信息 （步骤 S1401、 1402)， 并且， 中继节点 2A的信息交互器 202A将所采集的信息作 为汇报信息发送给当前所关联的基站 （步骤 S1403 )。 汇报信息的格式例如 如图 8所示。
图 8是第一实施方式涉及的中继节点向关联基站汇报信息格式的示意 图。其中， 中继节点向关联基站的汇报信息中包括： 源中继编号 801， 示出 发送该汇报信息的中继节点的编号， 以便基站识别该中继节点； 目的基站 编号 802， 示出接收该报告的基站的编号； 源中继信道信息 803， 示出发送 该报告的中继节点的信道信息； 以及源中继负载信息 804，示出发送该报告 的中继节点的负载信息。
接收到来自中继节点 2A的报告的基站 1A也将自己所采集的信息发送 给相关中继节点， 以便中继节点 2A计算阻塞率 （步骤 S1404)。 基站 1A 向中继节点 2A传送的发布信息的格式例如如图 9所示。 图 9是第一实施方式涉及的基站向相关中继节点发布信息格式的示意 图。其中，基站 1A向中继节点 2A传送的发布信息中包括:源基站编号 901， 示出发送该发布消息的基站的编号， 以便中继节点识别该基站； 目的中继 编号 902， 示出接收该发布消息的中继节点的编号； 源基站信道信息 903， 示出发送该发布消息的基站的信道信息；源基站负载信息 904，示出发送该 发布消息的基站的负载信息； 关联中继列表 905， 与存储单元 104A中存储 的关联中继列表 134相同， 示出当前关联到发送该发布消息的基站的中继 节点的列表；关联中继信道信息 906，示出当前关联到发送该发布消息的基 站上的中继节点的信道信息；关联中继负载信息 907，示出当前关联到发送 该发布消息的基站上的中继节点的负载信息。
从基站 1A接收到该发布消息后的中继节点 2A, 利用该发布消息的内 容以及存储单元 201A 中存储的相关小区基站与中继节点的信道信息和负 载信息， 按照图 10所示的流程， 计算阻塞率下降值 （步骤 S1405 ), 并将 所计算出的阻塞率下降值传递给所有相关基站 （这里 1A 不是作为关联基 站， 而是作为相关基站接收该阻塞率下降值） （步骤 S1406)。 中继节点向 相关基站汇报阻塞率下降值的信息的格式例如如图 11所示。
图 11 是第一实施方式涉及的中继节点向相关基站汇报阻塞率下降值 的信息格式的示意图。 其中， 阻塞率下降值汇报信息中包括： 源中继编号 1101， 示出发送该阻塞率下降值汇报信息的中继节点的编号； 目的基站编 号 1102， 示出接收该阻塞率下降值汇报信息的基站的编号； 以及阻塞率下 降值 1103， 示出发送该阻塞率下降值汇报信息的中继节点通过改变关联关 系时的最大阻塞率下降值。
基站 1A 的中继选择器从各个相关中继节点分别接收该最大阻塞率下 降值汇报信息， 从中选择多个中继节点之间相比较最大的最大阻塞率下降 值对应的中继节点， 作为许可进行关联转换的中继节点 （步骤 S1407), 并 发确认信息给相应的中继节点 （步骤 S1408)。
此外， 图 11所示的汇报信息中的阻塞率下降值 1103的部分中不是最 大阻塞率下降值， 而是其他示出阻塞率情况的数据， 例如直接传送阻塞率， 由中继选择器选择预计阻塞率最小的中继节点发送确认信息。
图 13 是第一实施方式涉及的基站向选定的中继节点回复确认信息格 式的一个例子的示意图。如图 13所示， 基站作为转换指令发送给中继节点 的回复确认信息中例如包括： 源基站编号 1301， 示出发送该回复确认信息 的基站的编号； 以及目的中继编号 1302， 示出接收该回复确认信息的中继 节点的编号。
确认信息的格式并不固定， 只要是能够表达基站确认许可中继节点进 行关联转换的消息， 格式和内容可以任意。
这样， 如果从所有相关基站都接收到了确认信息， 则接收到这些确认 信息的中继节点 2A 的关联控制器通过与转移对象的基站建立通信和关联 关系， 并断开与当前所关联的基站之间的信息交互， 来进行改变本中继节 点所关联的基站的处理 （步骤 S1409)。
在以上的说明中可知， 通过转变中继节点的关联基站， 从而将无线网 络当前的构成转变成能够使阻塞率下降最大的构成， 从而更加有效地利用 系统的通信资源， 进一步减少服务过程中的阻塞率。
以上图 14中说明了第一实施方式中的一种信息交互的流程。但是， 本 发明不仅限于该流程， 只要符合在无线通信系统中的动态变更中继节点与 基站之间的关联的方案， 具体的实施流程可以进行各种变更。
例如， 在本实施方式中， 中继节点计算最大阻塞率下降值， 并发送给 基站， 由基站根据最大阻塞率下降值进行中继选择， 但是， 也可以中继节 点的阻塞率计算器仅计算出各个候选阻塞率发送给基站， 由基站依据候选 阻塞率， 来选择与某个候选阻塞率对应的基站作为关联转移对象基站。 例 如， 可以从候选阻塞率中选择值最低的基站作为关联转移对象基站。
通过直接选择阻塞率， 能够减少计算量以及计算所需的时间， 并且将 特定小区或中继节点的阻塞率降低到最低。
(其他变形例）
在第一实施方式中， 如图 12所示， 当中继节点将阻塞率下降最大值发 送给所有的相关基站后， 每个基站会从收到的阻塞率下降值中选择最大的 一个， 并且给对应的中继节点回复一个确认信息。
但是， 在实际系统中， 由于信息的收集存在一定的误差， 导致阻塞率 的计算和实际阻塞率之间存在一定的偏差。 因此， 特别是当阻塞率下降值 较小时， 这种偏差可能导致原方案做出错误的改变基站与中继节点关联的 决策。 另一方面， 中继节点与基站之间的关联改变本身也需要付出一定的 代价， 包括切换的延时等， 若阻塞率下降值很小时就做出改变关联的决策， 可能导致中继基站的关联过于频繁改变， 给系统带来较大的负担。
因此， 作为变形例， 在第一实施方式中的基站进行中继选择时， 设定 对阻塞率的下降值设定阈值， 只有当选出的阻塞率下降值超过该阈值时， 才向与该阻塞率下降值对应的中继节点发送确认信息， 否则， 该基站不发 送确认信息。
本变形例中的无线通信系统中的基站与中继节点的内容构成与第一实 施方式相同， 仅基站中的中继选择器的动作不同， 对于相同的部分省略详 细的说明。
具体来说，基站中的中继选择器按照图 15所示的流程进行中继节点的 确认。
图 15 是第一实施方式涉及的基站进行中继选择处理的变形例的流程 图。 如图 15所示， 首先， 中继选择器 103A根据相关中继信道信息 164以 及相关中继负载信息 174，从所接收到的各个最大阻塞率下降值中选择其中 最大的最大阻塞率下降值及对应的中继节点 （步骤 S1501 )。
接着， 判断该最大阻塞率下降值是否大于预先设定的阈值 （步骤 S1502)。 在判断为 "否" 的情况下， 判断为即使转变发送该最大阻塞率下 降值的中继节点的当前关联基站， 也不会优化阻塞率， 因此不进行该中继 节点的关联转移而结束处理 （步骤 S1503 )。
在判断为 "是" 的情况下， 进入步骤 S1504, 向该最大阻塞率下降值 所对应的中继节点发送确认信息， 并结束处理。
根据该变形例， 也能够得到与第一实施方式相同的技术效果。
并且， 通过设置下降值的阈值， 能够防止做出错误的改变基站与中继 节点关联的决策， 也能够防止由于中继基站的关联过于频繁改变而给系统 带来较大的负担。
此外， 第一实施方式中所进行的各种变形以及优先方案的变更也适用 于本变形例。
(第二实施方式）
在第一实施方式中， 特征在于在中继节点中进行阻塞率的计算并决定 进行关联转移的中继节点或转移对象的基站。 但是， 在实际系统中， 相比于基站， 中继节点的处理能力和计算能力 有限， 因此在中继节点中计算阻塞率有可能为其带来较大的负担， 考虑将 阻塞率的计算移至与其关联的基站中进行。
本第二实施方式就是基于以上考虑而完成的， 与第一实施方式的技术 方案相比， 不同点在于， 基站具有能够计算阻塞率的部件。 为了实现这一 改变， 需要在基站的存储单元中存储与阻塞率相关的、 原本存储在中继节 点中的信息， 包括中继节点的相关基站列表、 相关小区中基站和中继的信 道信息和负载信息。 中继节点需要将自身收集以及相关基站传递的信息再 传递给关联基站， 关联基站计算完每一个关联中继的阻塞率后， 再将计算 结果传递给对应的中继节点进行关联转移对象基站的决定。
除了上述区别点， 第二实施方式中的其他部分与第一实施方式中的相 同， 针对相同的部件利用同一标号表示， 并省略详细的说明。
图 16是第二实施方式涉及的无线通信系统中的基站 1B的内部结构的 框图。与第一实施方式中的基站 1A相比的不同点在于，存储单元中追加存 储有与阻塞率计算有关的信息， 具体包括每个关联中继的相关基站列表、 以及其相关小区中基站和中继的负载信息和信道信息， 并且， 增加了阻塞 率计算器， 用来计算每个关联中继节点的阻塞率下降最大值。
具体来说， 基站 1B包括信息收集器 101A、 信息交互器 102A、 阻塞 率计算器 105B、 中继选择器 103A以及存储单元 104B。
信息收集器 101A用于收集基站 1A的信道信息和负载信息，并将这些 信息存储到存储单元 104B中。信息交互器 102A用于与相关的中继节点进 行信息交互， 来传递信息消息和指令消息。
阻塞率计算器 105B针对与基站 1B相关联的对象中继节点，从除了本 基站以外的基站中选择关联候选基站（相邻基站）， 根据来自中继节点及采 集的信息， 分别计算在对象中继节点与各个关联候选基站相关联时的候选 阻塞率下降值。 并通过信息交互器 102A将计算结果发送给对象中继节点。
中继选择器 103A为可选部件， 主要用于规模较大的无线通信网络。 具体来说， 由于在网络中存在多个基站和多个中继节点， 当多个中继节点 都改变关联时， 针对某个基站的阻塞率的影响存在叠加抵消的问题， 因此， 在基站中设置中继选择器 103A, 由中继选择器 103A从相关中继节点接收 示出阻塞率变化的数据例如最大阻塞率下降值， 以便依据该示出阻塞率变 化的数据从中选择许可进行关联转移的中继节点， 并给所选择的中继节点 发送确认信息。
其中， 信息收集器 101A、 信息交互器 102A、 阻塞率计算器 105B 以 及中继选择器 103A可以由 CPU等处理器执行规定的程序来实现。
存储单元 104A中存储阻塞率计算器 105B以及中继选择器 103A进行 处理时所需的各种信息。这些信息可以通过信息收集器 101A或信息交互器 102A来获得，存储单元 104A也可以与信息收集器 101 A或信息交互器 102A 形成为一体。
具体来说， 存储单元 104A中存储有： 相邻中继列表 114、 相关中继列 表 124、 关联中继列表 134、 基站信道信息 144、 基站负载信息 154、 相关 中继信道信息 164、 相关中继负载信息 174 以及来自关联中继节点的信息 184。其中， 来自关联中继节点的信息 184对应于第一实施方式中存储在中 继节点 2A中的存储单元 204A中的、 与阻塞率计算有关信息， 是关联中继 节点所收集到的所有信息， 包括从该中继节点的相关基站收集到的相关基 站的信道信息和负载信息。 可以通过中继节点定期向关联基站汇报来获得 来自关联中继节点的信息。
图 17是第二实施方式涉及的无线通信系统中的中继节点 2B的内部结 构的框图。与第一实施方式中的中继节点 2A相比的不同点在于，不具有阻 塞率计算器。
具体来说， 中继节点 2B包括信息收集器 201 A、 信息交互器 202A、 关联控制器 206A以及存储单元 204A。
其中， 关联控制器 206A根据通过信息交互器 202A从基站 1B接收到 的示出阻塞率的信息来选择作为关联转移对象的基站。
存储单元 204A中存储有： 相邻基站列表 214、 相关基站列表 224、 关 联基站列表 234、 中继信道信息 244、 中继负载信息 254、 相关小区基站信 道信息 264、 相关小区负载信息 274、 相关小区中继信道信息 284、 以及相 关小区中继负载信息 294。
第二实施方式涉及的无线通信系统中的动态中继基站关联方案中的基 站-中继节点信息交互流程如图 18所示。
图 18是第二实施方式涉及的无线通信系统中的基站-中继节点信息交 互流程的流程图。 如图 18所示， 首先， 基站 1B中的信息收集器 101A和 中继节点 2B 的信息收集器 201A 分别采集信道信息和负载信息 （步骤 S1801、 1802)， 并且， 中继节点 2B的信息交互器 202A将所采集的信息作 为汇报信息发送给当前所关联的基站 （步骤 S1803 )。 汇报信息的格式例如 如图 8所示。
接收到来自中继节点 2B的报告的基站 1B也将自己所采集的信息发送 给相关中继节点 （步骤 S1804)。 这种信息交互是基站与关联中继节点一般 的信息交互。 传送信息的格式可以任意。
并且，中继节点 2B还向基站传送在阻塞率计算中需要使用的信息（步 骤 S1805 ), 包括中继节点的相关基站列表、 相关小区中基站和中继的信道 信息和负载信息。
接收到所需信息的基站 IB, 按照图 10所示的流程等， 计算阻塞率下 降值 （步骤 S1806), 并将所计算出的结果 （即阻塞率下降值及其对应的基 站） 传递给关联的作为计算对象的中继节点 2B (步骤 S11807)。 由中继节 点 2B计算结果中选择最大阻塞率下降值，将该最大阻塞率下降值对应的基 站为关联转移目的地的基站。
接着， 为了取得相关基站的许可， 中继节点 2B 向所有相关基站传递 阻塞率下降值 （步骤 S11808)。
基站 1B 作为相关基站， 其中继选择器从所接收到的相关中继节点的 各个最大阻塞率下降值中选择最大的最大阻塞率下降值， 将发送所选择的 该最大阻塞率下降值的中继节点作为选中的中继节点， 向该中继节点发送 确认信息 （步骤 S1810)。
这样， 如果从所有相关基站都接收到了确认信息， 则接收到这些确认 信息的中继节点 2A 的关联控制器通过与转移对象的基站建立通信和关联 关系， 并断开与当前所关联的基站之间的信息交互， 来进行改变本中继节 点所关联的基站的处理 （步骤 S1811 )。
在第二实施方式中， 基站将所计算出的对象中继节点与其相邻基站关 联时的虚拟阻塞率发送给对象中继节点， 由对象中继节点从中选择作为关 联转移目的地的基站所对应的虚拟阻塞率， 但是， 也可以由基站直接从中 选择最大的阻塞率下降值， 仅将该最大阻塞率下降值及其对应的基站发送 给对象中继节点。
此外， 在第二实施方式中， 对于小区数量很少或者关联转移效率要求 较低的无线通信系统， 也可以省略步骤 S1808〜S1811。
根据该第二实施方式， 能够得到与第一实施方式相同的技术效果。 并且， 由于在第二实施方式中将阻塞率的计算功能设置在基站中， 可 以减少中继节点的处理负担， 由处理能力较高的基站来完成阻塞率的计算， 从而提高整个无线通信系统的负载转移效率。
此外， 第一实施方式中所进行的各种变形以及优先方案的变更也适用 于第二实施方式。
并且， 第一实施方式的变形例也适用于第二实施方式。 也就是说， 在 第二实施方式中， 基站中的中继选择器也可以利用预设的阈值进行是否进 行关联转移的判断。
(第三实施方式）
在第一实施方式和第二实施方式中， 分别在中继节点中或者基站中计 算中继节点与相关基站关联时的模拟阻塞值， 从而设置在基站中的中继选 择器根据所计算出模拟阻塞值来决定中继节点与哪个基站相关联。
这相当于进行动态关联控制的各个部件分散在基站和中继节点中来协 同进行动态关联控制管理。 但是， 本发明并不仅限于以上实施方式。 也可 以由中继节点自行决定与哪个基站相关联。
并且， 在第三实施方式中， 还可以在无线通信系统中另外设置能够与 各个中继节点和基站进行信息交互的综合的动态关联控制装置， 通过专用 的动态关联控制装置控制无线通信网络中的中继节点动态关联的变化。
图 19是第三实施方式涉及的动态关联控制装置 3 的结构框图。 如图 19所示， 动态关联控制装置 3包括信息采集部 10、 阻塞率计算部 20以及 关联控制部 30。
其中，信息采集部 10通过与基站及中继节点之间收发信息， 来采集与 对象中继节点和关联候选基站相关的信息。 所谓关联候选基站是指， 与中 继节点有关且能够实现与中继节点关联的基站。 并且， 信息采集部 10也可 以与中继节点有关且能够实现与中继节点关联的基站中选择若干基站作为 候选基站， 以减少计算量。 或者依据相关小区的远近选择若干相关小区的 基站作为候选基站。 并且， 信息采集部 10也可以通过服务器等其他设备收 集网络中的各个基站和中继节点的信息。 阻塞率计算部 20根据信息采集部 10所采集的信息， 分别计算在对象 中继节点与各个关联候选基站相关联时的候选阻塞率。 这种阻塞率的计算 是动态模拟计算， 以便分析在关联改变时对网络阻塞率的影响， 具体的计 算方法与第一实施方式中阻塞率计算器的计算方法相同。
关联控制部 30从所计算出的候选阻塞率中选择对象阻塞率，将与该对 象阻塞率对应的基站作为关联转移对象基站， 并将结果发送相应的对象中 继接站， 以使对象中继节点转变成与关联转移对象基站相关联。
以下说明这种动态管理的具体步骤。
图 20 是第三实施方式涉及的动态关联控制装置所执行的动态关联管 理的流程图。 在步骤 S2001 , 开始中继节点关联转移处理。
首先，信息采集部 10选择无线通信系统的某个中继节点作为对象中继 节点， 将除了当前关联基站而与该对象中继节点相关且也能够关联的基站 作为关联候选基站，采集与该对象中继节点和关联候选基站相关的信息（步 骤 S2002)。
接着， 阻塞率计算部 20根据所采集的信息， 计算在对象中继节点与各 个关联候选基站相关联时的候选阻塞率 （步骤 S2003 )。
关联控制部 30 从所计算出的候选阻塞率中选择阻塞率最小的阻塞率 作为对象阻塞率， 或者将各个候选阻塞率与当前阻塞率进行比较， 选择阻 塞率下降值最大的阻塞率作为对象阻塞率， 将与该对象阻塞率对应的基站 作为该对象中继节点的关联转移对象基站 （步骤 S2004) , 并且按照选择的 结果生成使对象中继节点转变成与关联转移对象基站相关联的指令， 发送 给中继节点、 当前关联的基站以及转移对象基站， 以便对象中继节点进行 关联状态的转移 （步骤 S2005 )。
最后， 将下一个中继节点作为新的对象中继节点， 重复相同的处理， 直到遍历系统中的所有中继节点为止 （步骤 S2006)。
动态关联控制装置 3可以定期执行以上动态关联管理， 来优化小区的 分区。
此外， 在从候选阻塞率中选择对象阻塞率时， 关联控制部也可以判断 所选定的对象阻塞率与当前阻塞率相比的阻塞率下降值是否大于预先设定 的阈值， 仅在大于预先设定的阈值的情况下， 使所述对象中继节点转变成 与所述关联转移对象基站相关联。 此外， 关联控制部也可以不考虑阻塞率的下降值， 而将候选阻塞率中 阻塞率最低且低于规定阈值的候选阻塞率作为所述对象阻塞率。
以上说明的动态关联控制装置可以独立与基站与中继节点设置， 也可 以安装在基站或中继节点之中， 并且， 还可以将该动态关联控制装置的功 能模块分别拆分到不同基站和中继节点中， 在与基站和中继节点相结合的 构成中， 可以共享基站和中继节点的存储单元中存储的数据或信息。
例如将信息采集部安装在由基站和中继节点构成的无线通信网络中的 基站和中继节点中， 将阻塞率计算部安装在基站中， 将关联控制部安装在 所述中继节点中。
此外， 虽然图中未示出， 但是在动态关联控制装置中也可以具有中继 选择部， 在所述对象中继节点为多个时， 该中继选择部从多个对象中继节 点的选择对象阻塞率中选定最小的选择对象阻塞率， 仅使所选定的选择对 象阻塞率所对应的对象中继节点进行关联转移。
或者，在利用最大阻塞率下降值来判断关联对象转移目的地的基站时， 该中继选择部也可以从多个对象中继节点的最大阻塞率下降值中选定最大 的最大阻塞率下降值， 仅使所选定的最大阻塞率下降值所对应的对象中继 节点进行关联转移。
根据该第三实施方式， 能够得到与第一实施方式相同的技术效果。 并且， 由于与第一实施方式或第二实施方式相比独立地设置进行负载 转移的动态关联控制装置， 进一步减少中继节点和基站的处理负担， 并且 即能够通过一个装置对无线通信系统的整个网络构成进行整体的负载管 理， 也可以将该动态关联控制装置设置多个或者组入基站和中继节点中， 使得无线通信系统的构成更加灵活。
(具体实施例）
为了便于理解， 以下例举出具体的实施例来进行说明。
图 21 是本发明涉及的无线通信系统中的具体实施例的网络拓扑示意 图。
如图 21所示， 设无线通信系统的网络中有三个小区， 每个小区的中心 部署有一个基站， 分别记为 BS 682和683， 每个小区内部署有三个中继 节点， 第 i个小区中的三个中继节点分别记为 RS^, RS2 (1)和 RS3 (1)， 小区半 径为 500米。
假设当前每个中继节点都如图 21所示关联到本小区的基站。并且假设 每个中继节点的相邻基站和该中继的相关基站相同， 表 1 中具体列出了各 个中继的相邻 /相关基站。
表 1 :
Figure imgf000025_0002
此外， 表 2给出了当前网络中各个基站 /中继的负载以及各个小区的负 载和各个小区的阻塞率。 其中， 负载的单位为每秒钟到达的用户数量， 根 据各个小区的总负载和阻塞率，又可以计算出网络总的阻塞率，显示在表 2 中。 其中， 网络阻塞率的计算方法是以各个小区的负载为权重对各个小区 的阻塞率求加权平均。
表 2:
Figure imgf000025_0001
RS3 (3) 0.92
设执行第三实施方式中以最大阻塞率下降值为判断标准的动态关联控 制方法。 这样， 以中继节点 为例， 该中继节点当前关联到 BS^ 其相 邻基站除了 BSi以外， 还有 682和683， 因此， 该中继节点根据从其相关基 站 （BS 682和 683) 发送来的信息以及自身收集的信息， 假设自己分别 关联到 BS 882和883， 并且计算阻塞率， 计算结果如表 3所示。
表 3:
Figure imgf000026_0001
从表 3可知， 中继节点 RS^关联到 BS2， 相比较于当前的阻塞率， 阻 塞率下降值最大， 为 0.043。其余各中继节点分别计算自己改变关联后阻塞 率下降的最大值， 结果如表 4所示。
表 4:
Figure imgf000026_0002
各个中继节点将假设自己改变关联后的虚拟阻塞率下降的最大值发送 给自己的相关基站， 表 5显示了各个基站收到的来自相关中继发送的阻塞 率下降值。 每个基站从中选择阻塞率下降值最大并且大于零的中继， 并回 复确认信息， 表 5同时显示了每个基站选择回复确认信息的中继。
表 5: 基站 中继 (该中继阻塞率下降值） 选择中继
BSi RSi(1) (0.043)， RS2 (1) (0)， RS3 (1) (0) ， RS3(2) (0) ， RS2(3) (0.015) RS 1)
BS2 RS 1)
BS3 RSi(3) (0)， RS2(3) (0.015)， RS3(3) (0) ， RSi(1) (0.043) ， RS3(2) (0) RS 1) 由于中继 RS "从其所有的相关基站都收到了确认信息， 因此中继 RS "做出了改变关联的决定， 并且将关联关系改变到了能够使阻塞率下降 值最大的基站 BS2， 改变关联之后， 网络中总的阻塞率下降了 0.043。
通过以上这样使中继 RS " 改变， 能够使阻塞率显著下降， 从而能够 得到均衡负载和提高服务质量的技术效果。
虽然已经说明了本发明的几个实施方式， 但是这些实施方式是作为例 子而提出的， 并不用于限定发明范围。 这些 o新的实施方式可以以其他各种 各样的方式进行实施， 可以在不脱离发明主旨的范围内进行各种各样的省 略、 置换和变更。 这些实施方式或其变形包含在发明范围或主旨内， 并且 也包含在权利要求书记载的发明及其等价的范围内。 o

Claims

权 利 要 求 书
1. 一种动态关联控制装置， 其特征在于， 包括：
信息采集部， 采集与对象中继节点和关联候选基站相关的信息； 阻塞率计算部， 根据所采集的信息， 分别计算在对象中继节点与各个 关联候选基站相关联时的候选阻塞率； 以及
关联控制部， 从所计算出的所述候选阻塞率中选择对象阻塞率， 将与 该对象阻塞率对应的基站作为关联转移对象基站， 使所述对象中继节点转 变成与所述关联转移对象基站相关联。
2. 根据权利要求 1所述的动态关联控制装置， 其特征在于， 关联控制部对各个候选阻塞率与当前阻塞率分别进行比较， 将与所述 当前阻塞率相比阻塞率下降值最大的候选阻塞率作为所述对象阻塞率。
3. 根据权利要求 1所述的动态关联控制装置， 其特征在于， 关联控制部还判断所选定的对象阻塞率与当前阻塞率相比的阻塞率下 降值是否大于预先设定的阈值， 仅在大于预先设定的阈值的情况下， 使所 述对象中继节点转变成与所述关联转移对象基站相关联。
4. 根据权利要求 1所述的动态关联控制装置， 其特征在于， 关联控制部将所述候选阻塞率中阻塞率最低且低于规定阈值的候选阻 塞率作为所述对象阻塞率。
5. 根据权利要求 1所述的动态关联控制装置， 其特征在于， 所述动态关联控制装置安装在由基站和中继节点构成的无线通信网络 中的基站中。
6. 根据权利要求 1所述的动态关联控制装置， 其特征在于， 所述动态关联控制装置安装在由基站和中继节点构成的无线通信网络 中的中继节点中。
7. 根据权利要求 1所述的动态关联控制装置， 其特征在于， 所述信息采集部安装在由基站和中继节点构成的无线通信网络中的基 站和中继节点中，
所述阻塞率计算部安装在所述基站中，
所述关联控制部安装在所述中继节点中。
8. 根据权利要求 1所述的动态关联控制装置， 其特征在于， 还具有中继选择部， 在所述对象中继节点为多个时， 该中继选择部从 多个对象中继节点的选择对象阻塞率中选定最小的选择对象阻塞率， 仅使 所选定的选择对象阻塞率所对应的对象中继节点进行关联转移。
9. 根据权利要求 2所述的动态关联控制装置， 其特征在于， 还具有中继选择部， 在所述对象中继节点为多个时， 该中继选择部从 多个对象中继节点的最大阻塞率下降值中选定最大的最大阻塞率下降值， 仅使所选定的最大阻塞率下降值所对应的对象中继节点进行关联转移。
10. 一种动态关联控制方法， 其特征在于， 包括：
信息采集步骤， 采集与对象中继节点和关联候选基站相关的信息； 阻塞率计算步骤， 根据所采集的信息， 分别计算在对象中继节点与各 个关联候选基站相关联时的候选阻塞率； 以及
关联控制步骤， 从所计算出的所述候选阻塞率中选择对象阻塞率， 将 与该对象阻塞率对应的基站作为关联转移对象基站， 使所述对象中继节点 转变成与所述关联转移对象基站相关联。
11. 根据权利要求 10所述的动态关联控制方法， 其特征在于， 在关联控制步骤中， 对各个候选阻塞率与当前阻塞率分别进行比较， 将与所述当前阻塞率相比阻塞率下降值最大的候选阻塞率作为所述对象阻 塞率。
12. 根据权利要求 10所述的动态关联控制方法， 其特征在于， 在关联控制步骤中， 还判断所选定的对象阻塞率与当前阻塞率相比的 阻塞率下降值是否大于预先设定的阈值， 仅在大于预先设定的阈值的情况 下， 使所述对象中继节点转变成与所述关联转移对象基站相关联。
13. 根据权利要求 10所述的动态关联控制方法， 其特征在于， 在关联控制步骤中， 将所述候选阻塞率中阻塞率最低且低于规定阈值 的候选阻塞率作为所述对象阻塞率。
14. 根据权利要求 10所述的动态关联控制方法， 其特征在于， 还具有中继选择步骤， 在所述对象中继节点为多个时， 从多个对象中 继节点的选择对象阻塞率中选定最小的选择对象阻塞率， 仅使所选定的选 择对象阻塞率所对应的对象中继节点进行关联转移。
15. 根据权利要求 11所述的动态关联控制方法， 其特征在于， 还具有中继选择步骤， 在所述对象中继节点为多个时， 从多个对象中 继节点的最大阻塞率下降值中选定最大的最大阻塞率下降值， 仅使所选定 的最大阻塞率下降值所对应的对象中继节点进行关联转移。
16. 一种无线通信系统中的无线通信方法， 所述无线通信系统包括基 站和与基站相关联的中继节点， 其特征在于， 所述无线通信方法包括： 所述基站和中继节点分别采集与各自的通信环境有关的信息； 所述基站将所采集的消息发送给能够与其建立关联的各个中继节点； 所述中继节点从除了当前所关联的基站以外的基站中选择关联候选基 站， 根据来自基站及采集的信息， 分别计算在本中继节点与各个关联候选 基站相关联时的候选阻塞率， 从本中继节点所计算出的所述候选阻塞率中 选择对象阻塞率， 将与该对象阻塞率对应的基站作为关联转移对象基站， 从与当前基站相关联转变成与关联转移对象基站相关联。
17. 一种无线通信系统中的无线通信方法， 所述无线通信系统包括基 站和与基站相关联的中继节点， 其特征在于， 所述无线通信方法包括： 所述基站和中继节点分别采集与各自的通信环境有关的信息； 所述基站将所采集的消息发送给能够与其建立关联的各个中继节点； 所述中继节点将所采集的消息发送给当前与其相关联的基站； 所述基站针对与其关联的对象中继节点， 从除了本基站以外的基站中 选择关联候选基站， 根据来自中继节点及采集的信息， 分别计算在对象中 继节点与各个关联候选基站相关联时的候选阻塞率， 并将计算结果发送给 对象中继节点；
所述中继节点从所述候选阻塞率中选择对象阻塞率， 将与该对象阻塞 率对应的基站作为关联转移对象基站， 从与当前基站相关联转变成与关联 转移对象基站相关联。
18. 根据权利要求 16和权利要求 17所述的无线通信方法， 其特征在 于，
所述当前基站对各个候选阻塞率与当前阻塞率分别进行比较， 将与所 述当前阻塞率相比阻塞率下降值最大的候选阻塞率作为所述对象阻塞率。
19. 根据权利要求 16和权利要求 17所述的无线通信方法， 其特征在 于，
所述对象中继节点将选定的对象阻塞率发送给所有相关基站， 所述相 关基站是指在该对象中继节点的关联基站改变时自身阻塞率会受到影响的 基站；
所述相关基站从多个对象中继节点发来的阻塞率中选择许可转移关联 的对象中继节点， 向该对象中继节点发送确认信息；
所述对象中继节点仅在从所有相关基站接收到确认信息的情况下才从 与当前基站相关联转变成与关联转移对象基站相关联。
20. 根据权利要求 18所述的无线通信方法， 其特征在于，
所述对象中继节点将选定的最大阻塞率下降值发送给所有相关基站， 所述相关基站是指在该对象中继节点的关联基站改变时自身阻塞率会受到 影响的基站；
所述相关基站从多个对象中继节点发来的最大阻塞率下降值中选择许 可转移关联的对象中继节点， 向该对象中继节点发送确认信息；
所述对象中继节点仅在从所有相关基站接收到确认信息的情况下才从 与当前基站相关联转变成与关联转移对象基站相关联。
21. 根据权利要求 16和权利要求 17所述的无线通信方法， 其特征在 于，
所述对象中继节点还判断所选定的对象阻塞率与当前阻塞率相比的阻 塞率下降值是否大于预先设定的阈值，仅在大于预先设定的阈值的情况下， 转变成与所述关联转移对象基站相关联。
22. 一种无线通信系统， 其特征在于， 包括：
基站， 与当前相关联的中继节点之间进行通信， 根据来自作为对象的 中继节点及采集的信息， 分别计算在作为对象的中继节点不与本基站相关 联而与预先选择的关联候选基站相关联时的候选阻塞率， 进而计算候选阻 塞率与当前阻塞率相比的阻塞率下降值， 将所计算出的各个阻塞率下降值 发送给该作为对象的中继节点；
中继节点， 在从所关联的基站接收到阻塞率下降值时， 从所述候选阻 塞率中选择最大的阻塞率下降值， 将与所选择的阻塞率下降值对应的基站 作为关联转移对象基站， 从与当前基站相关联转变成与关联转移对象基站 相关联。
PCT/CN2013/088529 2012-12-10 2013-12-04 无线通信系统及方法、动态关联控制装置及方法 Ceased WO2014090104A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US14/650,491 US9801093B2 (en) 2012-12-10 2013-12-04 Wireless communication system and method, and dynamic association control apparatus and method
JP2015544343A JP6026005B2 (ja) 2012-12-10 2013-12-04 動的関連制御装置、動的関連制御方法及び無線通信方法

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210528202.4A CN103874130B (zh) 2012-12-10 2012-12-10 无线通信系统及方法、动态关联控制装置及方法
CN201210528202.4 2012-12-10

Publications (1)

Publication Number Publication Date
WO2014090104A1 true WO2014090104A1 (zh) 2014-06-19

Family

ID=50912171

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/088529 Ceased WO2014090104A1 (zh) 2012-12-10 2013-12-04 无线通信系统及方法、动态关联控制装置及方法

Country Status (4)

Country Link
US (1) US9801093B2 (zh)
JP (1) JP6026005B2 (zh)
CN (1) CN103874130B (zh)
WO (1) WO2014090104A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2017059866A (ja) * 2015-09-14 2017-03-23 京セラ株式会社 基地局、中継局、および無線通信システム

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105873127B (zh) * 2016-04-27 2019-08-20 东南大学 基于随机决定的启发式用户连接的负载均衡方法
CN107689921B (zh) * 2017-09-15 2020-11-13 深圳市盛路物联通讯技术有限公司 一种转发节点的选择方法及系统
CN110839270B (zh) * 2018-08-16 2021-08-06 成都鼎桥通信技术有限公司 一种中继节点选择方法
US20240196321A1 (en) * 2022-12-13 2024-06-13 Qualcomm Incorporated Relay network device for transitioning between energy states of a network device

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004004287A1 (en) * 2002-06-28 2004-01-08 Nokia Corporation Signaling and routing protocols for an integrated cellular and relaying system
CN101415207A (zh) * 2008-12-04 2009-04-22 北京邮电大学 一种蜂窝协作中继网络中的负载均衡方法、装置和基站
CN102714540A (zh) * 2010-01-19 2012-10-03 高通股份有限公司 无线通信中用于对中继站进行关联的方法和装置

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000138627A (ja) * 1998-10-29 2000-05-16 Hitachi Ltd 無線電話中継装置
JP2000299886A (ja) * 1999-04-14 2000-10-24 Hitachi Ltd 無線加入者アクセス通信システム
US7024186B1 (en) * 2000-08-15 2006-04-04 Ntt Docomo, Inc. Communication performance calculation method and communication performance calculation apparatus in mobile communication system, and blocking probability calculation method and blocking probability calculation apparatus in communication system, and recording medium
JP2001285932A (ja) * 2000-04-03 2001-10-12 Ntt Docomo Inc 無線通信システム、通信チャネル確立方法、無線端末及び無線中継装置
US20030068975A1 (en) * 2001-08-06 2003-04-10 The Research Foundation Of Suny Integrated cellular and ad hoc relaying system
US6788930B2 (en) * 2001-10-02 2004-09-07 Qualcomm Incorporated Method and system for depleting backlog in a communication system
EP3855673B1 (en) * 2009-10-30 2022-09-07 BlackBerry Limited Downlink control information set switching when using carrier aggregation
CL2010000027A1 (es) * 2010-01-15 2011-04-25 Univ Tecnica Federico Santa Maria Utfsm Método para dimensionar una red de comunicaciones móviles celular con usuarios de diferentes categorías para optimizar el uso de los canales disponibles en dicha red con acceso priorizado.
CN103026762B (zh) 2010-07-29 2016-04-20 黑莓有限公司 用于中继网络中的移动接入控制和负荷均衡的系统和方法
US20130225174A1 (en) * 2010-08-04 2013-08-29 Fujitsu Limited Distributed load balancing in cellular wireless networks
JP5468506B2 (ja) * 2010-09-28 2014-04-09 京セラ株式会社 基地局及び無線通信システム並びに基地局での通信エリアの制御方法
WO2012042889A1 (ja) * 2010-09-30 2012-04-05 パナソニック株式会社 送信装置及び送信方法
US9220017B2 (en) 2010-12-17 2015-12-22 Nec Corporation Radio parameter control apparatus, base station apparatus, radio parameter control method, and non-transitory computer readable medium
WO2013113405A1 (en) * 2012-06-15 2013-08-08 Nec Europe Ltd. Method and system for handover of a user equipment in cell based networks
US9100863B2 (en) * 2012-12-20 2015-08-04 T-Mobile Usa, Inc. Cellular backhaul load distribution

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004004287A1 (en) * 2002-06-28 2004-01-08 Nokia Corporation Signaling and routing protocols for an integrated cellular and relaying system
CN101415207A (zh) * 2008-12-04 2009-04-22 北京邮电大学 一种蜂窝协作中继网络中的负载均衡方法、装置和基站
CN102714540A (zh) * 2010-01-19 2012-10-03 高通股份有限公司 无线通信中用于对中继站进行关联的方法和装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2017059866A (ja) * 2015-09-14 2017-03-23 京セラ株式会社 基地局、中継局、および無線通信システム
US10356659B2 (en) 2015-09-14 2019-07-16 Kyocera Corporation Base station, relay station, and wireless communication system

Also Published As

Publication number Publication date
JP2016502810A (ja) 2016-01-28
JP6026005B2 (ja) 2016-11-16
CN103874130B (zh) 2018-01-26
US9801093B2 (en) 2017-10-24
CN103874130A (zh) 2014-06-18
US20150312799A1 (en) 2015-10-29

Similar Documents

Publication Publication Date Title
US9451476B2 (en) Various routing architectures for dynamic multi-hop backhauling cellular network and various methods useful in conjunction therewith
CN112789898B (zh) 无线通信网络及其内的通信控制方法、基础设施设备
CN106941700B (zh) 一种数据传输方法及装置和基站及ue
KR20070073626A (ko) 다중 홉 릴레이 방식을 사용하는 광대역 무선 접속 통신시스템에서 상향대역폭 요청 및 할당 방법
CN107710826B (zh) 一种无线回程连接的建立方法及装置
CN101529756B (zh) 在多跳中继宽带无线接入网络中设计与移动台(ms)切换有关的新mac消息交换过程的框架
WO2016145751A1 (zh) 物联网中的数据传输方法、系统、物联网设备、终端
US12302216B2 (en) Methods, wireless communications networks and infrastructure equipment
CN101577940B (zh) 分布式天线系统的用户设备调度方法
WO2014090104A1 (zh) 无线通信系统及方法、动态关联控制装置及方法
CN101521909B (zh) 用于基站间通信中基于多个终端中继的信息转发方法
JP2005236632A (ja) 無線ネットワーク装置、無線ネットワークシステム及び経路選択方法
Zhao et al. Admission control with load balancing in IEEE 802.11-based ESS mesh networks
WO2015127598A1 (zh) 网络设备和一种实现数据回传的系统及方法
CN102045148B (zh) 基于中继移动通信系统的数据传输方法及其装置
CN108882307B (zh) 一种控制与业务分离的方法及装置
KR20090114042A (ko) 무선 메쉬 네트워크에서의 패킷 스케쥴링 방법
CN101449528B (zh) 在多跳通信系统中提供服务质量支持的方法和节点
CN107071911B (zh) 一种基于最大snr的虚拟小区载波分配方法
CN105610732A (zh) 车辆自组织网络转发节点选择与协作通信方法
CN106921975A (zh) 一种基于230m无线通信专网的中继传输方法和装置
CN100450079C (zh) 一种无线网状网络数据处理方法及无线网状网络
WO2008079470A2 (en) Method and apparatus for distributed bandwidth assignment in mesh backhaul networks
CN103731835B (zh) 一种实现单播及广播的mimo mac协议方法
JP4851511B2 (ja) ルーティング方法並びに前記方法を実行するトランシーバ基地局及びコンピュータプログラム

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: 13861745

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2015544343

Country of ref document: JP

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 14650491

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13861745

Country of ref document: EP

Kind code of ref document: A1