WO2011060704A1 - 資源管理方法和系統 - Google Patents

資源管理方法和系統 Download PDF

Info

Publication number
WO2011060704A1
WO2011060704A1 PCT/CN2010/078767 CN2010078767W WO2011060704A1 WO 2011060704 A1 WO2011060704 A1 WO 2011060704A1 CN 2010078767 W CN2010078767 W CN 2010078767W WO 2011060704 A1 WO2011060704 A1 WO 2011060704A1
Authority
WO
WIPO (PCT)
Prior art keywords
resource allocation
communication system
information
resource management
resource
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/CN2010/078767
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.)
Sony Corp
Original Assignee
Sony Corp
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
Priority to US13/509,137 priority Critical patent/US9654275B2/en
Priority to JP2012539170A priority patent/JP5704174B2/ja
Priority to EP21193277.7A priority patent/EP3944651A1/en
Priority to EP10831119.2A priority patent/EP2503739B1/en
Application filed by Sony Corp filed Critical Sony Corp
Publication of WO2011060704A1 publication Critical patent/WO2011060704A1/zh
Anticipated expiration legal-status Critical
Priority to ZA2012/04186A priority patent/ZA201204186B/en
Priority to US14/062,640 priority patent/US9130732B2/en
Priority to US14/806,005 priority patent/US9419773B2/en
Priority to US15/220,553 priority patent/US9762373B2/en
Priority to US15/669,011 priority patent/US10333684B2/en
Priority to US16/408,491 priority patent/US11088810B2/en
Priority to US17/364,916 priority patent/US11848895B2/en
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0091—Signalling for the administration of the divided path, e.g. signalling of configuration information
    • H04L5/0096—Indication of changes in allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14—Spectrum sharing arrangements between different networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/22—Traffic simulation tools or models
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria

Definitions

  • the present invention relates to the field of communications, and in particular to a resource management method and system in a communication system.
  • the resources described herein may include resources of a time domain resource, a frequency domain resource, a code domain resource, and the like of the communication system.
  • the spectrum resources are divided into multiple frequency bands and assigned to each operator for exclusiveness. Use, which makes the utilization of spectrum resources very inefficient.
  • Open Spectrum Access was created to address the inefficiencies of fixed spectrum resource usage.
  • unlicensed users can use the idle resources in the band resources for data transmission without affecting the users with licenses, so as to improve the utilization of spectrum resources. .
  • Chinese Patent Application Publication No. CN101141771A discloses a radio resource management system and method for implementing spectrum sharing.
  • the resource management system disclosed in the patent application is centralized, and includes: a cooperative control unit, configured to determine, according to a frequency sharing request of the access network, and/or statistical information of each access network operation and frequency transmission usage, a spectrum sharing processing strategy; an inter-network inter-frequency sharing control unit, connected to the cooperative control unit, configured to coordinate local radio resource management of different access networks according to a spectrum sharing processing policy determined by the cooperative control unit, so as to enable access Sharing frequency resources between networks.
  • This patent application provides a method of achieving spectrum sharing between different radio access technologies and radio access networks.
  • a resource management method in a communication system may include: determining whether a degree of change of an operating state of the communication system causes a change in resource management information of the communication system, and if yes, re-collecting the resource management information, where the resource management The information includes information about a state of each node in the communication system, an interference state between the links, and service flow information; and determining a resource allocation policy of the communication system according to the resource management information.
  • a resource management system in a communication system including a status inquiry device, an information collection device, and an allocation policy decision device.
  • the status querying device is configured to determine whether the degree of change of the working state of the communication system causes a change in resource management information of the communication system, and if yes, instruct the information collecting device to re-collect the resource management information.
  • the information collection device is configured to re-collect the resource management information according to an indication of the status query device, where the resource management information includes a status of each node in the communication system, and an interference status between links.
  • business flow information is configured to determine a resource allocation policy of the communication system based on the resource management information.
  • a method for determining a resource allocation policy of the communication system according to resource management information of a communication system comprising: establishing the resource management information and a quantitative relationship between resource allocation goals of the communication system; and determining the resource allocation policy based on the established quantitative relationship.
  • the step of establishing a quantitative relationship between the resource management information and the resource allocation target comprises: establishing a resource allocation model according to the resource management information, the model reflecting between the links in the communication system Adjacency relationship, mutually exclusive relationship between the chains, and bandwidth requirements and priority levels of each link; and establishing resource allocation constraints according to the resource allocation model, and quantifying resource allocation targets.
  • the step of determining the resource allocation policy according to the established quantization relationship comprises: selecting each link in the resource allocation model, selecting a link that can be simultaneously allocated resources; A resource allocation constraint and a quantized resource allocation target allocate resources for each selected link.
  • a method of determining a resource allocation mechanism of a communication system comprising: counting a load of the communication system; and selecting for execution based on the counted load amount A resource allocation mechanism of the resource allocation policy.
  • the step of selecting a resource allocation mechanism according to the calculated load quantity includes: determining whether the communication system is light load or heavy load according to the load quantity, and selecting a centralized resource allocation mechanism if it is a light load ; If it is heavy load, choose a distributed resource allocation mechanism.
  • resources of the communication system are collectively allocated by a master node in the communication system; in the distributed resource allocation mechanism, multiple nodes in the communication system As a local decision node, each local decision node allocates resources of its corresponding local area.
  • an allocation policy decision device for determining a resource allocation policy in a communication system.
  • the apparatus includes: an information conversion unit configured to establish a quantitative relationship between resource management information and a resource allocation target of the communication system; and a determining unit configured to determine the resource allocation policy according to the established quantization relationship.
  • the information conversion unit may be further configured to: establish a resource allocation model according to the resource management information, the model reflecting an adjacent relationship between the links in the communication system, between the links Mutual exclusion relationship and bandwidth requirement and priority level of each link; and establishing resource allocation constraints according to the resource allocation model, and quantifying resource allocation targets.
  • the determining unit may be further configured to: select each link in the resource allocation model, select a link that can be allocated resources at the same time; according to the resource allocation constraint and the quantized resource allocation Target, allocating resources for each link selected.
  • an allocation mechanism control apparatus for determining a resource allocation mechanism in a communication system.
  • the distribution mechanism control device includes a statistical unit and a selection unit.
  • the statistic unit is configured to count the load of the communication system, and the selecting unit is configured to select a resource allocation mechanism for executing the resource allocation policy according to the statistic load.
  • the selecting unit is further configured to: determine, according to the load quantity, whether the communication system is a light load or a heavy load, and if it is a light load, select a centralized resource allocation mechanism; For the load, choose a distributed resource allocation mechanism.
  • resources of the communication system are collectively allocated by a master node in the communication system; in the distributed resource allocation mechanism, multiple nodes in the communication system As a local decision node, each local decision node allocates resources of its corresponding local area.
  • embodiments of the present invention also provide a computer program for implementing the above method.
  • embodiments of the present invention also provide for calculations in the form of at least computer readable media A serial product on which is recorded computer program code for implementing the above method.
  • FIG. 1 is a schematic diagram showing one example of a scenario to which an embodiment of the present invention is applicable;
  • FIG. 2 is a schematic diagram showing another example of a scenario to which an embodiment of the present invention is applicable.
  • FIG. 3 is a schematic flow chart showing a resource management method according to an embodiment of the present invention.
  • FIG. 4 is a schematic flow chart showing a resource management method according to another embodiment of the present invention.
  • FIG. 5 is a schematic flowchart showing a resource management method according to another embodiment of the present invention.
  • FIG. 6 is a schematic flowchart showing a method of determining a resource allocation policy according to resource management information of a communication system according to an embodiment of the present invention
  • FIG. 7 is a schematic flowchart showing a method of determining a resource allocation policy according to resource management information of a communication system according to another embodiment of the present invention.
  • FIG. 8 is a schematic flowchart showing a method of determining a resource allocation policy according to resource management information of a communication system according to another embodiment of the present invention.
  • FIG. 9 is a schematic flow chart showing a resource management method according to another embodiment of the present invention.
  • FIG. 10 is a schematic flowchart showing a resource management method according to another embodiment of the present invention.
  • FIG. 11 is a schematic flowchart showing a method of selecting a resource allocation mechanism of a communication system according to an embodiment of the present invention
  • FIG. 12 is a schematic flowchart showing a method of selecting a resource allocation mechanism of a communication system according to another embodiment of the present invention
  • FIG. 11 is a schematic flowchart showing a method of selecting a resource allocation mechanism of a communication system according to an embodiment of the present invention
  • FIG. 12 is a schematic flowchart showing a method of selecting a resource allocation mechanism of a communication system according to another embodiment of the present invention
  • FIG. 12 is a schematic flowchart showing a method of selecting a resource allocation mechanism of a communication system according to another embodiment of the present invention
  • FIG. 13 is a schematic flowchart showing a resource management method according to another embodiment of the present invention.
  • FIG. 14 is a schematic diagram showing an information collection object for collecting resource management information for the communication system shown in FIG. 2;
  • 15 is a schematic flow chart showing interference state information for collecting links between links in a communication system
  • 16 is a schematic flow chart showing information for collecting related traffic flows in a communication system
  • FIG. 17 shows an example of performing link clustering on a communication system having the configuration shown in FIG.
  • Figures 18(a), 18(b) and 18(c) illustrate an exemplary process for establishing a resource allocation model based on resource management information using a graph theory approach
  • FIG. 19 shows an example of a flow of determining a resource allocation policy according to a quantitative relationship between resource management information and a resource allocation target of a communication system
  • FIG. 20 is a schematic block diagram showing a resource management system in accordance with one embodiment of the present invention.
  • 21 is a schematic block diagram showing a resource management system in accordance with another embodiment of the present invention.
  • FIG. 22 is a schematic block diagram showing a resource management system in accordance with another embodiment of the present invention.
  • FIG. 23 is a schematic block diagram showing an allocation policy decision device according to an embodiment of the present invention.
  • 24 is a schematic block diagram showing an allocation policy decision device according to another embodiment of the present invention.
  • 25 is a schematic block diagram showing a distribution mechanism control device according to an embodiment of the present invention.
  • FIG. 26 is a schematic block diagram showing a resource management system according to another embodiment of the present invention.
  • FIG. 27 is a schematic block diagram showing a resource management system according to another embodiment of the present invention.
  • FIG. 28 is a schematic block diagram showing a resource management system according to another embodiment of the present invention.
  • 29 is a schematic block diagram showing a resource management system in accordance with another embodiment of the present invention.
  • Embodiments of the present invention provide methods and systems, devices, and the like for sharing management of resources in a communication system to ensure efficient use of system resources such as spectrum.
  • the resources may include time domain resources, frequency domain resources, code domain resources, and any combination thereof of the communication system.
  • a method and system in accordance with an embodiment of the present invention can be applied to a communication system having the features of an open frequency access system.
  • An example of such a communication system is shown in Figures 1 and 2, respectively.
  • the communication system shown in Figure 1 is an open frequency access system, including two types of network systems: The first type is the Primary System network 101, which has absolute priority for resources such as its operating frequency band. Permissions, whose users are called Primary Users (PUs); The second type is Secondary System Network 102, whose signal range covers part or all of the main system, and its users are called Secondary Users. SU). When the secondary system 102 uses the same wireless resources simultaneously with the primary system 101, it will cause interference to the primary system 101.
  • the first type is the Primary System network 101, which has absolute priority for resources such as its operating frequency band. Permissions, whose users are called Primary Users (PUs);
  • the second type is Secondary System Network 102, whose signal range covers part or all of the main system, and its users are called Secondary Users. SU).
  • PUs Primary Users
  • Secondary System Network 102 whose signal range covers part or all of the main system, and its users are called Secondary Users.
  • SU Secondary Users
  • the secondary system 102 can only use the idle resources in the resources such as the frequency band of the primary system 101 for data transmission without affecting the primary system 101.
  • the main system 101 includes two types of nodes: a base station (BS) and a primary user (PU).
  • the base station is connected to the backbone network (Backbone) to provide access cores for the primary users.
  • the secondary system 102 can be various types of communication networks, such as: an ad hoc network including a secondary user (Ad Hoc), a mesh network including a router and a secondary user, or an access point (Access). Point, AP) and any suitable communication network such as the secondary user's wireless local area network, there are no restrictions here.
  • one or more secondary systems may also be included in the communication system.
  • the number, type, and number of secondary systems are not limited in the embodiments of the present invention. In other words, there may be one or more different types, different gauge sub-systems 102 coexisting within the scope of influencing the main system 101.
  • FIG. 2 shows another example of a communication system to which the method and apparatus of an embodiment of the present invention may be applied.
  • the communication system shown in Figure 2 is also an open frequency access system, including the primary system and the secondary system.
  • the main system 201 of FIG. 2 is a relay network (for example, a multihop wireless relay network).
  • the relay network 201 is shown. It includes three types of nodes: base station, + relay station (RS) and primary user.
  • the base station is connected to the backbone network to provide access to the core network for the primary user.
  • the relay station can include one or more levels, and is wirelessly Signal forwarding between the base station and the primary user.
  • Embodiments of the present invention can be applied to an open frequency transmission network system as shown in FIG.
  • the secondary system 202 can also be any suitable network such as an Ad Hoc network, a Mesh network, or various wireless local area networks, and is not limited herein.
  • FIG. 1 and 2 illustrate examples of communication systems having the features of an open spectrum network capable of implementing methods and systems, apparatus in accordance with embodiments of the present invention. It should be understood that these examples are merely illustrative and not exhaustive. The present invention should not be considered to be applicable only to the above communication system. The method and apparatus according to embodiments of the present invention are also applicable to other communication systems that require dynamic allocation management of system resources, which are not enumerated herein.
  • FIG. 3 illustrates a resource management method in a communication system in accordance with one embodiment of the present invention.
  • the resource management method includes the following steps S302, S304, and S306.
  • step S302 it is determined whether the degree of change of the working state of the communication system causes the resource management information of the communication system to change, that is, whether the communication needs to be re-acquired according to the degree of change of the working state of the communication system.
  • System resource management information If yes, the resource management information is re-acquired in step S304; otherwise, the resource management information is not re-acquired, that is, the previously collected or saved resource management information is utilized.
  • the resource allocation policy of the communication system is determined according to the resource management information.
  • the resource management information refers to information that can influence the resource management of the communication system and the decision of the allocation policy.
  • the information in the process of collecting information (such as analysis/statistics/measurement, etc.) required for resource allocation, the information can be adaptively adjusted according to the degree of change of the working state of the communication system.
  • the collected strategy can effectively reduce the system overhead required for information collection.
  • resource management information can be classified into three categories: system basic architecture and its state information (ie, the state of each node); mutual exclusion relationship between wireless links (ie, interference relationship between links) and User traffic flow information.
  • the resource management information may include, but is not limited to, information about the status of each node in the communication system, the interference status between the links, and the traffic flow.
  • Table 1 shows an example of resource management information for the communication system shown in Fig. 2.
  • the resource management information of the communication system may include information such as the network status of the primary system, the status of the primary user, the network status of the secondary system, and the status of the secondary user.
  • Table 1 An example of resource management information for a communication system
  • the moving state of the RS (moving speed / direction, etc.);
  • the working state of the RS (work/idle/hibernate, etc.).
  • the status of the primary user The direct user's direct service BS, RS number;
  • the movement status of the main user (moving speed / direction, etc.);
  • the working status of the primary user (work/idle/hibernate, etc.);
  • the service connection status of the primary user (connection type and QoS parameters, etc.).
  • the network status of the secondary system is for the Ad Hoc network: the number of secondary users and the secondary user interconnection status; for the mesh network: including the link state of the backbone network of the router, the number of secondary users, and the connection status of the secondary user and the backbone network; For wireless LAN: number of users, etc.
  • the movement status of the secondary user (moving speed / direction, etc.);
  • resource management information given in Table 1 is exemplary and should not be construed as limiting the invention thereto.
  • a person of ordinary skill in the art can understand that the specific content of the resource management information affecting the resource management and the allocation policy can be determined according to the specific application scenario and actual needs, and is not enumerated here.
  • a variety of methods can be used to determine whether the degree of change in the operational state of the communication system affects the information needed to make resource management decisions (ie, whether resource management information needs to be re-acquired).
  • resource management decisions ie, whether resource management information needs to be re-acquired.
  • the change of the working state of the communication system involves only the local area
  • only the resource management information related to the local area may be re-acquired
  • the resource management information related to other areas adopts the previously collected or saved information.
  • a change in the communication system involves only a portion of the operational state (e.g., interference state between links or traffic flow state)
  • only information related to the changed operational state may be reacquired.
  • the service flow information related to the node may use information previously collected or saved.
  • the service flow between a primary user node and other nodes changes and the interference relationship between the links does not change
  • only the information of the service flow related to the primary user node may be collected, without re-acquiring Information about the mutually exclusive relationship between the related links of the node.
  • FIG. 4 shows an exemplary flow chart of a resource management method in accordance with another embodiment of the present invention.
  • the resource management method shown in Fig. 4 includes steps S402, S404-1, S404-2, and S406.
  • step S404-1 If the change in the operating state of the communication system affects the interference state between the links in the communication system, it is determined that the information about the interference state between the links needs to be re-acquired, and then in step S404-1, the relevant information is re-acquired. Information about the interference status between links.
  • step S404-2 If the change in the working state of the communication system causes the traffic of the communication system to change Then, it is determined that the information about the service flow needs to be re-acquired, and then information about the service flow is re-acquired in step S404-2.
  • the system management information does not need to be reacquired.
  • the resource management information may not be re-acquired, but the resource management information previously collected or saved may be utilized.
  • Step SS406 is similar to step S306 shown in Fig. 3 and will not be described here.
  • the information collection strategy can be adaptively adjusted according to the degree of change of the working state of the communication system, thereby effectively reducing the cost of information collection.
  • System overhead Specifically, whether the re-acquisition needs to be re-acquired may be determined according to the degree of change of various working states of each area of the communication system (mutual exclusion relationship between links between certain nodes and changes of traffic of some nodes, etc.) Resource management information and which resource management information needs to be re-acquired (in the example of FIG. 21, information about mutually exclusive relationships between links, information about traffic flows, or both) is collected.
  • Fig. 14 schematically shows an information collection object for the communication system shown in Fig. 2.
  • the symbols B, R, P, and S respectively represent respective nodes in the communication system, where B, R, and P represent base stations, relay stations, and primary user nodes of the primary system network, respectively; S represents a secondary system network. Secondary user node in .
  • the lower corner of the base station/relay node B/P indicates its number; the lower corner of the primary user node P indicates the number of the base station/relay station directly serving it, and the upper symbol indicates that the primary user node P is directly at the base station/relay station.
  • the number in all primary user nodes of the service indicates the number of the secondary system to which it belongs, and the upper corner indicates the number of the secondary user node S among all secondary users of the secondary system.
  • the directional solid line segment between the nodes represents the wireless link (for simplicity of illustration, only the link in either direction of the uplink and the secondary system of the primary system network is used as the identification).
  • the dotted line in Figure 14 indicates the interference state between links, that is, the mutual exclusion relationship between links.
  • Two radio links that are mutually exclusive that is, mutually exclusive cannot use the same radio resource at the same time.
  • the mutual exclusion relationship between links can be divided into three categories.
  • these three types of mutually exclusive relationships are represented by numbers 1, 2 and 3, respectively.
  • Type 1 mutual exclusion relationship representation A node cannot receive different signals from multiple sources at the same time, or cannot simultaneously send different signals to multiple targets. This limitation does not hold for some nodes with multiple antennas configured.
  • the second type of mutual exclusion relationship means that a node cannot receive and transmit at the same time. This limitation does not hold for nodes that are configured with multiple sets of transceivers.
  • the third type of mutual exclusion relationship represents the same-frequency interference between two wireless links, which means that the same frequency interference occurs when the source and destination nodes of the two links are different.
  • the main system network (such as the relay network) and the architecture of each type of secondary system network and its link status are established, maintained and managed by each system network itself.
  • the primary system network and the secondary system network such as the base station shown in Figures 1 and 2, users in the self-organizing network, routers or users in the mesh network, and access points in the wireless local area network (AP). ), etc., which are not listed here), obtain the corresponding architecture and link state information, and obtain some resource management information by analyzing and counting the information (for example, the first and second types of mutual exclusion relationship information, etc., as the following example Said).
  • Figures 15 and 16 show examples of methods for collecting resource management information, respectively. Among them, Fig. 15 shows an exemplary method for collecting interference state information between links.
  • the exemplary method may include the following steps S1504-l, S1504-3, and S1504-5.
  • the method may further include step S1504-2.
  • step S1504-1 the selection of the measurement mechanism is performed according to the degree of change in the inter-link interference state of the communication system.
  • a proprietary time measurement mechanism can be employed when a change in the overall architecture of the communication system results in a change in most of the links or when a communication system is established.
  • a data transmission process measurement mechanism may be employed when only a local change in the communication system results in a change in the interference state between only the local links.
  • the communication system allocates dedicated time for the measurement of mutually exclusive relationships (ie, interference relationships) between links. During this special time, no valid data transfer takes place.
  • the relevant node in the communication system occurs in the local area.
  • the measured links that are undergoing data transmission are measured, and the relevant nodes may be nodes that may overlap with the signal coverage between the links in the local area, for example, the local area may be selected in addition to the positive One or more idle nodes outside the node of the communication act as a related node for conducting the policy.
  • the data transmission process measurement mechanism can be seen as a supplement to the proprietary time measurement mechanism.
  • step S1504-2 If the exclusive time measurement mechanism is selected, the following steps S1504-2, S1504-3 and S1504-5 are performed. If the data transmission process measurement mechanism is selected, step S1504-5 can be directly performed.
  • step S1504-2 the wireless link in the communication system is clustered (also referred to as “clustering") to form one or more link clusters.
  • Clustering links can have multiple strategies depending on the distribution and performance requirements of the communication system.
  • the simplest clustering method is to divide the base station/relay station (BS/RS) and its directly served users into a cluster, which is called a natural cluster; and then further according to load balancing, etc. Requirements, you can crack a natural cluster into multiple clusters, or aggregate multiple natural clusters into one cluster.
  • BS/RS base station/relay station
  • the cell area may also be equally divided, and the wireless link belonging to one area unit is taken as one cluster.
  • link clustering can also be performed in any other suitable manner, not enumerated here.
  • each link can be used as a cluster.
  • Fig. 17 shows an exemplary result after link clustering of a communication system including the acquisition object shown in Fig. 14.
  • the primary system network of the communication system is a relay network, and the clustering is performed by a natural clustering method; and the secondary system adopts a clustering method using a user link as a cluster.
  • a natural cluster is represented by a link between a base station or a relay station and any user directly serving it.
  • the user of the BS or RS direct service is represented by the same node P with only one lower corner.
  • a cluster formed by B0 and its directly serving users is represented by a link of P0 to B0.
  • the mutual exclusion relationship analysis and measurement can be performed in units of link clusters in subsequent measurements. Further, in the subsequent resource allocation, coarse-grained resource allocation may also be performed in units of link clusters, and fine-grained resource allocation is performed in units of links in each link cluster. With link clustering, the amount of computational measurement of resource management information can be reduced, and the balance between complexity and final system performance can be balanced when resource allocation is performed. [80] Of course, the clustering step S1504-2 is optional.
  • step S1504-5 can be directly performed to perform the third type of mutual exclusion relationship measurement.
  • step 1504-3 the antenna configuration of each node in the communication system, the configuration of the transceiver device, and the like are obtained (the information can be obtained, for example, from the master node of the primary system and the master device of the secondary system, It is not described in detail here), and the analysis and measurement of the mutual exclusion relationship of the first and second classes are performed.
  • the analysis and measurement of the mutual exclusion relationship of the first and second classes are performed.
  • a node is only configured with a single receiving or transmitting antenna, it cannot receive different signals from multiple sources at the same time, or can not send different signals to multiple targets at the same time, so there is a first type of mutual relationship between the corresponding chains. Reject the relationship.
  • FIG 14 at Node B. Node B is only configured with a single set of devices.
  • the link Ri ⁇ B With link R 2 ⁇ B. There is a type 1 mutual exclusion relationship between them.
  • the second type of mutually exclusive relationship indicates that one node cannot receive and transmit at the same time.
  • the relay station node R 3 of FIG. 14 (assuming that the node is only configured with a single set of transceivers) cannot simultaneously receive the primary user node P3 1
  • the signal sends a signal to the relay node, so there is a second type of mutual exclusion relationship between the link P ⁇ Rs and the link.
  • each node illustrated in FIG. 14 is configured with only a single set of devices.
  • each node in the communication system can be configured with multiple transceivers.
  • the model shown in Figure 14 can be from that Node B. Lead more 3 ⁇ 4 way.
  • These links can be used at Node B. Signal transmission with other nodes without mutual interference. The mutually exclusive relationship between these links and other links can be analyzed and measured by the method in the above example, and details are not described herein again.
  • the first and second types of mutually exclusive relationships between them can be defined according to the relationship between the link clusters.
  • the configuration of the antennas and transceivers of the nodes of each link cluster it can be analyzed and judged whether there are first and second types of mutually exclusive relationships between the clusters, thereby obtaining the mutual exclusion relationship between the links and the clusters. information.
  • the type 1 and type 2 mutual exclusion relationship information between the links in the cluster is obtained.
  • whether the first and second nodes exist between the nodes may be analyzed and determined according to the configuration of the antennas and the transceivers of the nodes in the communication system. Class mutually exclusive relationship, thus obtaining 1, 2 types of mutual exclusion between the chains Relationship information.
  • step 1504-5 analysis and measurement of the third type of mutually exclusive relationship between the links is performed according to whether there is overlap of signal coverage between the links.
  • step S1504-5 may include two sub-steps S1504-51 and S1504-52.
  • step S1504-51 the measured link is selected, and the measurement time slot is allocated and distributed.
  • the system state is only partially changed
  • allocate a time slot for the link to be tested and notify the allocated time slot to participate in the measurement.
  • the node participating in the measurement may be a related node that may be affected by the above-mentioned local change, such as one or more idle nodes in the local area involved in the above partial change. For example, it is assumed that the communication system newly joins.
  • a user node P x whose direct relay station is R x then the link between the two nodes is a new link R x P x , several relay stations adjacent to R x and below the user may interfere with each other as a potential link associated with the node during mutually exclusive relationship measurement category 3, a node can select a link between the relevant nodes P x and the like as a test node
  • a measurement time slot is allocated for the link ! ⁇ , and when the measurement time slot is reached, it can be measured by one or more idle nodes of the relevant nodes.
  • the measured node performs measurements in the assigned time slots. Specifically, in the assigned time slot, the signal transmitted through the tested link, the node participating in the measurement listens to the signal.
  • the detected link may be considered to interfere with the data reception of the node, so that it can be determined that there is a third type of mutual interaction between the tested link and the corresponding link of the node participating in the measurement. It should be understood that the above method of collecting the third type of mutually exclusive relationship is exemplary and should not be construed as limiting the present invention. According to actual needs, any other suitable method may be used to collect the information, here No - enumeration.
  • the above step S1504-l can be omitted.
  • the exclusive time measurement mechanism can be used as a default measurement mechanism to analyze and/or measure the mutually exclusive relationships of categories 1, 2, and 3 in the communication system.
  • the data transmission process measurement mechanism can be used as a default mechanism to analyze and/or measure the mutually exclusive relationships of categories 1, 2, and 3.
  • FIG. 16 shows an exemplary method of collecting traffic flow information in the case where radio link clustering is performed. As shown in FIG. 16, the method includes steps S1604-2 and S1604-4. In step S1604-2, clustered link traffic flow statistics are performed, that is, traffic of each relevant link cluster is counted.
  • the total bandwidth requirement of each link cluster can be calculated according to the bandwidth requirement information of the related user (the information can be obtained from, for example, the master node of the primary system and the master device of the secondary system, which is not described in detail herein). , thereby obtaining service flow information of the link cluster.
  • the sum of the bandwidth requirements of each link within each link cluster is the total bandwidth requirement of the link cluster.
  • other link traffic flow statistics are performed, that is, the bandwidth requirement of the non-clustered link is calculated.
  • Non-clustered links are typically used for data forwarding, and their bandwidth requirements are the total amount of bandwidth required to be forwarded by them. For example, the link-B shown in FIG. Bandwidth is required for forwarding from the link 3 ⁇ Ri R, the sum of the required data link bandwidth and link 3 ⁇ 4-.
  • the bandwidth requirement of each link can be separately calculated according to the bandwidth requirement information of the relevant user, thereby collecting the traffic flow information of the communication system.
  • the resource management information of the collected communication system can be stored in a master node of the communication system (e.g., a base station in the primary system).
  • the collected resource management information may also be distributedly stored in other nodes of the communication system, such as in one or more relay stations or user nodes with strong computing power, specifically, each A relay station or a user node with strong computing capability can save resource management information of the local area in which it is located.
  • the storage of resource management information of the system can be implemented according to actual needs and by any appropriate technology, and will not be described in detail herein.
  • FIG. 5 shows a schematic flow chart of a resource management method according to another embodiment of the present invention.
  • the method illustrated in Figure 5 is similar to the embodiment of Figure 4, except that the method illustrated in Figure 5 further includes the step of clustering the wireless links in the communication system.
  • the resource management method includes steps S502, S504-1, S504-2, and S506, and further includes step S501.
  • step S501 the links in the communication system are clustered to obtain one or more link clusters.
  • subsequent processing steps can be performed in units of link clusters.
  • the links can be clustered in a similar manner to that in the above example/embodiment, and will not be repeated here.
  • the step S504-1 of reacquiring information about the interference state between the links may include: acquiring interference state information between each link cluster and each Interference status information between links within a cluster.
  • the step S504-2 of re-collecting the information of the service flows may include: acquiring traffic flow information of each link cluster.
  • the link clustering step S501 is shown to be performed before step S502. In another example, the link clustering step may also be performed after step S502 or at other appropriate timing, not enumerated here.
  • FIG. 6, FIG. 7, and FIG. 8 respectively illustrate an exemplary flow chart of a method for determining a resource allocation policy in accordance with an embodiment of the present invention.
  • the method illustrated in Figure 6, Figure 7, or Figure 8 is for determining a resource allocation policy for the communication system based on resource management information of the communication system.
  • the resource management information described herein is the same as the resource management information in the above embodiment/example, and can be collected by using the related method in the above embodiment/example, and is not repeated here.
  • the method shown in FIG. 6 includes steps S606 and S608. Specifically, in step S606, a quantitative relationship between the resource management information and a resource allocation target of the communication system is established. In step S606, a resource allocation policy of the communication system is determined based on the established quantization relationship.
  • the steps of establishing the quantization relationship shown in FIG. 6 are further refined.
  • the step of determining a resource allocation policy of the communication system based on the resource management information may include two sub-steps S706-1 and S706-2.
  • step S706-1 a resource allocation model is established based on the resource management information.
  • the resource allocation model can reflect the neighboring relationships between the links in the communication system, the mutually exclusive relationship between the links, and the bandwidth requirements and priority levels of each link.
  • step S706-2 a resource allocation constraint condition is established according to the resource allocation model, and the resource allocation target is quantized.
  • Step S708 is similar to step S608 shown in FIG. 6, and is not repeated here.
  • the step of clustering the wireless link of the communication system may also be included (as in the foregoing embodiment) Said, no longer repeated here).
  • the resource allocation model established in step S706-1 may reflect the adjacency relationship between the link clusters, the mutually exclusive relationship between the link clusters, and the bandwidth requirement of each link cluster. Priority level and other information. Through link clustering, the computational complexity of establishing a resource allocation model can be reduced.
  • FIG. 18 exemplarily shows a process of how to establish a resource allocation model based on the resource management information using a method of graph theory.
  • the process of establishing a resource allocation model for a communication system may include three steps S1801, S1802, and S1803.
  • step S1801 a line graph is constructed according to the adjacent relationship of each link in the communication system.
  • the network structure shown in FIG. 17 is taken as an example.
  • the letter T is used to represent FIG. Fig. 18(a) is a line diagram constructed according to the diagram shown in Fig. 17, denoted by T'.
  • the vertex (Vertex) in T' corresponds to T.
  • the arrow of the directed arc points to the apex of the head, and the tail of the arrow points to the apex of the tail.
  • the link in the main system network is hollow. Point to indicate that the link in the secondary system network is represented by a solid point.
  • the two vertices in T' are connected to each other and only if the two vertices correspond to two adjacent arcs in ⁇ (one arc)
  • the head vertex is the tail vertex of another arc)
  • the direction of the arc in T' coincides with the direction of the arc corresponding to its vertex in T to indicate the flow of data.
  • Fig. 18(a) it is converted into two vertices and RxBo, respectively, and is connected by the pointing from .
  • step S1802 the mutual exclusion relationship between the links is loaded. Any two vertices in T' are connected by an edgeless edge (Edge) if and only if the two vertices have the first, second or third type of mutually exclusive relationship between the two corresponding arcs in T, Figure T" shown in Figure 18(b).
  • Edgeless edge Edge
  • step S1803 the actual bandwidth requirement is loaded.
  • the vertices assigned to ⁇ are weighted to form the graph G shown in Figure 18(c).
  • the weight of one vertex corresponds to the bandwidth requirement of the corresponding arc of the vertex in T, as shown in Figure 18(c).
  • the value inside is shown. If actual The bandwidth requirement is not an integer value, and the integer value can be obtained by normalization for use in subsequent operations.
  • Figure G can be referred to as a Hierarchically Weighted Mixed Graph.
  • the so-called “grading” means that each vertex in the graph G has a different priority level.
  • this example contains two priority levels (primary and secondary), distinguished by hollow and solid points, respectively.
  • the so-called “weighted” means that each vertex in the graph G has a weight.
  • the so-called “hybrid map” means that there are two types of connection modes: a directed arc and an undirected edge between the vertices in the graph G.
  • a resource allocation model of the communication system can be established.
  • Some examples of establishing resource allocation constraints and quantifying resource allocation goals based on the established resource allocation model are given below.
  • the resource sharing allocation problem of the communication system can be mapped to the multicoloring problem for the graph G, also referred to as hierarchical weighted mixed graph multi-staining (Hierarchically Weighted Mixed).
  • Graph Multicoloring hereinafter referred to as H Li 2 ).
  • N represents a set of natural numbers
  • [w] represents a natural number interval ⁇ "+1,..., ⁇ , where i, jeN i ⁇ j. 1X 1 represents the cardinality of the set X, that is, the number of elements in the set X.
  • the graph G can be specifically expressed as a quad 0/, A, E, «), where, represents a set of vertices, and A represents a directed arc
  • the set, E represents the set of undirected edges
  • w represents the set of weights.
  • the set of vertices V can be represented by a vector ( ... ), where V represents a set of vertices of priority class, e [l. .m], m represents the number of priority levels of the vertices.
  • nv (ie, when ⁇ , the intersection of ⁇ and is an empty set).
  • the vertices whose vertices have a higher priority are if and only if i ⁇ j.
  • the vertex priority level corresponding to the vertex V can be expressed as r(v)e[l..m], that is, ve ( v ). If the tail item of the ! ⁇ is ⁇ ey, the head vertex is vey, then the directed ⁇ can also be called the predecessor vertex (the vertex V), and V can also be called the vertices of the vertex w .
  • the multi-staining ⁇ for the hierarchical weighted mixed graph G is a mapping from the vertex set V of the graph G to the power set 2 W of the natural number set N, ie
  • Color collections are ordered collections like natural collections, with color numbers and natural numbers one-to-one. In this example, the color and the natural number are not distinguished, and the reference to the color refers to its corresponding natural number.
  • the dyeing process will be distributed from small to large in color. In multiple dyes, the set of all the vertices to which the color is assigned can be written as
  • ⁇ ⁇ ( ⁇ ) ⁇ ⁇
  • [119] can be classified according to the constraint problem H Li 2 from two aspects.
  • the H 2 problem can be divided into two categories: non-preemptive and preemptive.
  • Non-preemptive H Li 2 any one vertex
  • the color is continuous.
  • the meaning of the corresponding resource allocation is that the resource blocks allocated by one link are continuous on the ordered set of resource blocks.
  • the meaning of the corresponding machine scheduling is that a machine node must work continuously to the node task once it starts scheduling. Finished to end the schedule.
  • the color of any vertex is allowed to be discontinuous.
  • the meaning of the corresponding resource allocation is that the resource block allocated by one link can be discontinuous.
  • the meaning of the corresponding machine scheduling is that a machine node is in it. You can pause at any time during the scheduling process and restart the schedule at a later time.
  • the H 2 problem can be divided into two categories: non-interleaving and interleaving.
  • the minimum color of any vertex is greater than the maximum color of its predecessor.
  • the meaning of the corresponding resource allocation is that the resource blocks allocated by one link are on the ordered set of resource blocks.
  • a resource block that lags behind its predecessor link in the case of a relay network, the link responsible for relay forwarding may only forward after receiving data from its predecessor link;
  • corresponding job scheduling (such as pipeline)
  • job scheduling is that a processing link can start the processing of the next link after acquiring all the objects processed by its predecessor, which may be due to the conflict of tools or resources required by these two adjacent links.
  • the number of colors assigned by any one vertex does not exceed the sum of the number of colors assigned to all of its predecessors.
  • the meaning of the corresponding resource allocation is that the resource block has The number of resource blocks allocated by any link in the previous resource blocks of the sequence set does not exceed the sum of the number of resource blocks allocated by the predecessor link (for example, the relay network is used, and the link forwarding is responsible for relay forwarding at any time.
  • the data may only be a subset of the data it receives from the predecessor link);
  • the meaning of the corresponding job scheduling (such as pipeline job scheduling) is that a processing link can be processed immediately after obtaining the processing object from the predecessor, because The tools or resources used in the link do not conflict.
  • Table 2 shows the Hli 2 problem classified from the above two aspects according to the constraints: Table 1 H Li 2 problem is classified according to the constraint ⁇
  • the first category "Li 2 problem can be called non-preemptive - non-interleaved HM 2 , ie in Table 2
  • the non-preemptive-non-crossing multi-staining of the G-mixed graph G can be recorded as follows: ⁇ 2 Each vertex ve is assigned ⁇ » ⁇ a different color, and
  • condition (1) indicates that the maximum color assigned by the arbitrary vertex v / ⁇ ( ⁇ ) is equal to the sum of the assigned minimum color ra W and the number of the divided colors minus 1, that is, the arbitrary vertex V distribution The color is continuous.
  • Condition (2) has the apex end of the arc A "share of the maximum color / ⁇ ( ⁇ ) is smaller than the apex of the arc of the V share of the minimum color W, that is, any vertex v beginning of staining can not advance its The predecessor apex "end of dyeing.
  • the condition (3) indicates that any vertex V connected by the side and "the assigned color do not intersect.
  • condition (4) indicates that the coloring of the arbitrary vertex V cannot take precedence over the vertex having a higher priority.
  • the second class ⁇ yM 2 problem can be called preemptive-non-crossing H Li 2 , which is the Gu 2 in Table 2 .
  • the third category "Li 2 problem can be called preemption-crossing H Li 2 , that is, H Li in Table 2.
  • Preemption of the hierarchical weighted mixed graph G - cross multi-staining H Li can be recorded do
  • condition (8) indicates that the number of colors of any one of the previous available colors v does not exceed the sum of the number of colors of all of its predecessors " eP ( v ).
  • Condition (9) indicates Arbitrary vertices connected by directed arcs do not intersect the colors assigned to V.
  • the condition (10) means that any vertices connected by undirected edges "do not intersect with the color assigned to V.
  • Condition (11) indicates that the coloring of an arbitrary vertex V cannot take precedence over a vertex higher than its priority.
  • the optimization goal for dyeing is usually: Finishing with a minimum number of colors.
  • different coefficients A can be set. In other words, different coefficients A can reflect no The same optimization goal. By setting different coefficients A, the goal of quantifying the optimization goal can be achieved.
  • the coefficient A is set using the following formula (1-1):
  • ⁇ ( ⁇ ) takes the optimization goal of the minimum value, that is, the minimum total number of colors required to obtain the multiple coloring of the graph G. This color number is called the Weighted Chromatic Number and is denoted as Z (G).
  • the weighted chromatic numbers corresponding to the three types of multi-staining problems shown in Table 2 can be written as: (G), (G) and ; (G).
  • the resource allocation scheme corresponding to the optimization target can maximize the system throughput (throughput). In other words, if the optimization goal of the resource allocation of the communication system is to maximize the throughput of the system, the coefficient A can be set by the formula (1-1).
  • the coefficient A is set using the following formula (1-2):
  • the coefficient A is set using the following formula (1-3):
  • the target is the minimum total number of colors required to complete the vertex dyeing of the first priority class.
  • the optimization target corresponds to the minimum resources required to complete all user services in the primary system.
  • the above-described hierarchical weighted mixed graph multi-staining method can be applied to multi-priority system resource sharing management with similar constraint conditions.
  • it can also be applied to machine scheduling, such as pipeline machine scheduling.
  • FIG. 8 shows an exemplary flow chart of a method for determining a resource allocation policy based on resource management information of a communication system in accordance with another embodiment of the present invention.
  • the steps of determining the resource allocation policy of the communication system based on the established quantization relationship are further refined.
  • the step of determining the resource allocation policy based on the established quantization relationship may include two sub-steps S808-1 and S808-2.
  • sub-step S808-1 each chain in the resource allocation model is selected to select a link that can be simultaneously allocated resources.
  • sub-step S808-2 resources are allocated for each of the selected links based on the resource allocation constraints and the quantized resource allocation targets.
  • the step of clustering the wireless link in the communication system may also be included (as described in the foregoing embodiment) , not repeated here).
  • the established resource allocation model may reflect information such as adjacency relationship between link clusters, mutual exclusion relationship between link clusters, and bandwidth requirements and priority levels of each link cluster.
  • Step S808-1 may include: sorting each link cluster in the resource allocation model, and selecting a link cluster that can be allocated resources at the same time;
  • Step S808-2 may include: determining resource constraints and quantized resources according to the resource allocation The allocation target allocates resources for each selected link cluster.
  • the process of determining a resource allocation policy of a communication system may further include the step of further allocating resources allocated to each link cluster to respective links in the link cluster. Through link clustering, the complexity of the decision process of the resource allocation strategy can be reduced.
  • FIG. 19 shows a specific example of determining a resource allocation policy of a communication system based on a quantitative relationship between resource management information and a resource allocation target of a communication system.
  • the method includes two steps of inter-cluster resource allocation and intra-cluster resource allocation, that is, steps S1908 and S1910 in FIG.
  • step S1908 inter-cluster resource allocation is performed.
  • the various optimization goals of the problem are NP-hard problems (that is, optimal solutions that cannot be found in polynomial time)
  • resource allocation in communication systems such as open frequency access systems
  • the grounding is performed, so some approximation algorithms can be used to obtain a suboptimal allocation strategy to balance the system performance and computational complexity.
  • the example of Figure 19 gives an approximate solution.
  • the respective steps in the method shown in Fig. 19 are described by taking the diagrams T and G shown in Figs. 17 and 18 as an example.
  • This exemplary method is suitable for multi-staining problems based on the three types of constraints in Table 2, the example of which is to obtain a weighted color number.
  • the inter-cluster resource allocation step includes five sub-steps.
  • step S1908-1 the map T is initialized.
  • the only difference is that the weight of the vertex with the leading vertex in the graph is zero.
  • the vertices in the graph G are mutually constrained, so there is a difference in the order of the vertices in the graph G. If the vertex in Figure ⁇ meets the condition that the weight is not zero, it indicates that the vertex can currently be dyed, that is, the vertex can obtain resources.
  • step S1908-2 the dyeable vertices are selected and the selected vertices are sorted. Specifically, the current dyeable vertex in the graph is first selected, that is, the vertex in the graph that the weight is not zero. These selected dyeable vertices are then sorted.
  • the optimal solution Li 2 problem is dyed the color of choice for each vertex from a certain ordered sequence in order to obtain, but the approximate solution of a sort target is as much as possible so that more The vertices simultaneously acquire resources to approximate the optimal solution.
  • one possible rule for sorting vertices is: (1) vertices of different priority levels are sorted from highest to lowest, (2) vertices with the same priority are pressed by the vertices The length of the directed path of the end point is sorted from small to large (the length of the directed path is the number of directed arcs on the directed path), (3) the vertex with the same directional path length starts from the vertex The sum of the weights of the vertices on the path is from large to large Small sorts, and (4) the remaining vertices can be sorted randomly. This results in an ordered set of dyeable vertices, which can be written as z.
  • each vertex in the set of dyeable vertices is colored. Specifically, select the vertices that are simultaneously dyed from the set z and assign colors to them. As an example, one possible way to select the vertices at the same time is to: examine each vertex in the set z in order, and obtain a Maximal Independent Set, which can be recorded as a very large independent set. In a maximal independent set, no arcs are connected between any two vertices. The difference in the number of colors simultaneously assigned (“1 ⁇ " ⁇ the maximum value of the vertices of the maximal independent set) affects the amount of calculation of resource allocation. The larger the value (that is, the more colors are assigned at the same time), the fewer the number of algorithm cycles, and the smaller the amount of calculation. However, the total number of colors eventually allocated will increase.
  • step S1908-4 the weights of the vertices in the graph T are modified. Specifically, the weight of each vertex is subtracted from the number of colors assigned to the vertex. If the sum of the colors assigned to a vertex has reached its weight in graph G, the vertex state is marked as dyed. (Colored).
  • step S1908-5 it is judged whether all the vertices in the picture T have been marked as dyed completion. If so, the entire dyeing process ends. Otherwise, go to step S1908-2, the new one leaks.
  • step S1910 intra-cluster resource allocation is performed.
  • the resources allocated to each cluster in step S1908 are further allocated to each of the wireless links in each cluster.
  • each natural cluster can be treated as a vertex to form a new WWW 2 problem, and solved according to the above method.
  • any appropriate resource allocation method can be used for intra-cluster allocation, such as various resource allocations of a communication network that can utilize a point-to-multipoint architecture. The method is assigned and will not be detailed here. This provides the amount of resources allocated for each link in the communication system.
  • FIG. 9 shows a schematic flow chart of a resource management method in accordance with one embodiment of the present invention.
  • the resource management method shown in Fig. 9 is based on the embodiment shown in Fig. 3, and the method for determining the resource allocation strategy shown in Figs. 6-8 is utilized.
  • the resource management method includes steps S902, S904, S906, and S908.
  • Step S902 is similar to step S302 of FIG. 3 or step S402 of FIG. 4;
  • step S904 is similar to step S304 of FIG. 3 or steps S404-1 and S404-2 of FIG. 4;
  • Step S906 is similar to step S806 of FIG. 6, or steps S706-1 and S706-2 of FIG. 7, or steps S806-1 and S806-2 of FIG. 8, etc.; step S908 and step S808 of FIG. 6, or the steps of FIG. S708 or steps S808-1 and S808-2 of FIG. 8 are similar. It is not repeated here.
  • FIG. 10 shows a schematic flow chart of a resource management method according to another embodiment of the present invention.
  • the resource management method shown in Fig. 10 is similar to the embodiment shown in Fig. 9, except that the method shown in Fig. 10 further includes a link clustering step.
  • the resource management method includes steps S1001, S1002, S1004, S1006, and S1008.
  • step S1001 the wireless links in the communication system are clustered to obtain one or more link clusters.
  • link clustering the workload in the process of collecting resource management information can be reduced, and the complexity of the decision process of the resource allocation strategy can be reduced.
  • the link clustering method in the above embodiments and/or examples may be employed, and will not be described again here.
  • the link clustering step 1001 is not limited to being performed before step S1002. In another example, the step 1001 may also be performed at any suitable time in the resource management method according to actual needs, for example, before step S1004, before step S1006, etc., where not enumerated.
  • Steps S1002, S1004, S1006, and S1008 are similar to steps S902, S904, S906, and S908 of FIG. 9, and are not repeated here.
  • the resource allocation mechanism refers to which nodes in a communication system (such as an open frequency access system) perform resource allocation.
  • the method of Fig. 11 can adaptively adjust the resource allocation mechanism of the communication system in accordance with changes in the amount of load of the communication system.
  • the method includes steps S1110 and S1112.
  • step S1110 the load amount of the communication system is counted.
  • the amount of load can be calculated based on the ratio of the system average throughput over a period of time to the system capacity.
  • any other suitable method can be used to count the load of the communication system, which is not described in detail herein.
  • step S1112 a resource allocation mechanism for executing a resource allocation policy is selected according to the calculated load amount, that is, which nodes in the communication system are used to execute resources of the communication system according to the counted load amount. Assignment strategy.
  • FIG. 12 shows an example of the above method.
  • step S1210 After the load amount of the communication system is counted, in step S1212-1, it is judged whether the communication system is in a light load state or a heavy load state based on the counted load amount. If it is a light load, in step S1212-2, a centralized resource allocation mechanism is selected; if it is a heavy load, in step S1212-3, a distributed resource allocation mechanism is selected.
  • the communication system can be judged whether the communication system is light or heavy by judging whether the counted load is greater than a predetermined threshold. For example, when the load is greater than the threshold, it can be determined as a heavy load, otherwise it is a light load.
  • the threshold can be set according to the actual application, and no limitation is imposed here.
  • resources of a communication system are collectively allocated by a master node (e.g., a base station or a base station of a host system network) in a communication system.
  • a master node e.g., a base station or a base station of a host system network
  • resource management information and resource allocation optimization goals need to be aggregated to the base station, and the base station determines the resource allocation policy, and then distributes the resource allocation result to the corresponding node in the communication system.
  • a plurality of nodes in a communication system can be used as local decision nodes, and each local decision node allocates resources of its corresponding local regions. Thereafter, the results of the local decision are coordinated by the master node (e.g., the base station) (in the case where the communication system includes a plurality of system networks, coordinated by the base station of the primary system network), thereby obtaining a final resource allocation strategy.
  • the master node e.g., the base station
  • the local decision node analyzes and quantifies these local information to obtain a local allocation strategy.
  • These local allocation policies are further aggregated to the base station (or the base station of the primary system network), and coordinated to obtain the global resource allocation strategy of the communication system.
  • the resource allocation mechanism adapted to the load amount can be adaptively selected according to the change in the load amount of the communication system. In this way, the computing and communication capabilities of each node can be fully utilized to balance the effective performance of the system with the system overhead, and the resource utilization of the system can be improved as much as possible. For example, when the load of the communication system is heavy, the base station of the primary system, which is the destination of all data aggregation, is inevitably heavily loaded.
  • some nodes in the communication system are in an idle state, and using them to perform local resource allocation decisions can reduce the computational burden of the base station and also reduce the information required for resource allocation to the base station.
  • the load of the communication system is lightened, all resources can be reselected.
  • the management information is aggregated to the base station, and the base station makes a global optimal allocation decision, thereby optimizing the performance of the system.
  • Fig. 13 shows an embodiment of a resource management method to which a selection method of the resource allocation mechanism shown in Fig. 11 is applied.
  • the resource management method includes steps S1302, S1304, S1306, and S1310, S1312. wherein steps S1302, S1304, and S1306 are similar to steps S302, S304, and S306 shown in FIG. 3, and steps S1310 and S1312 are performed. Similar to steps S1110 and S1112 shown in FIG. 11, it is not repeated here.
  • the embodiment can also be based on the load of the communication system.
  • the change is to adaptively select a resource allocation mechanism that is compatible with the amount of load.
  • the embodiment shown in Figure 13 is exemplary and not exhaustive.
  • the steps shown in Figures 11 and 12 may also be in the figure. 4 - After or before each step in Figure 10 or during the process shown in Figures 4 - 10.
  • the steps shown in Figures 11 and 12 can be compared to the one shown in Figures 3 - 10. Do it in parallel. Not listed here.
  • the above embodiments and examples describe a method of sharing management of resources in a communication system.
  • the above resource management method can be applied to an open frequency transmission architecture, and in particular, can be applied to a communication system in which multiple networks coexist.
  • the above management resource method can be adaptively adjusted according to changes in the system structure (including the number/position/signal coverage/mobility of the primary system nodes, the type of the secondary system/mo/number, etc.). While ensuring that the user resource requirements of the primary system are met, resources are reused as much as possible to provide resource utilization opportunities for users of the secondary system, thereby improving the resource utilization efficiency of the entire system.
  • the resources herein may include time domain resources, frequency domain resources, code domain resources, and any combination thereof of the communication system, and the communication system described herein may be any need to dynamically update system resources.
  • a managed communication system such as a communication system having the characteristics of an open frequency access system (such as the systems shown in Figures 1 and 2).
  • the resource management system may include a status inquiry device 2001, an information collection device 2003, and an allocation policy decision device 2005.
  • the status querying device 2001 can determine whether the degree of change of the working state of the communication system causes the resource management information of the communication system to change, in other words, the state query loading
  • the setting 2001 can determine whether the resource management information of the communication system needs to be re-acquired according to the degree of change of the working state of the communication system. If yes, the status querying device 2001 instructs the information collecting device 2003 to re-collect the resource management information. Otherwise, the resource management information is not re-acquired, that is, the resource management information previously collected or stored is utilized.
  • the resource management information of the communication system refers to information that can affect the resource management of the communication system, the decision of the allocation policy, including but not limited to the status of each node in the communication system, Interference status and traffic flow information between links.
  • a number of examples of resource management information have been given above and will not be repeated here.
  • the information collecting device 2003 can re-collect the resource management information of the communication system according to the indication of the status inquiry device 2001.
  • the collected resource management information may be stored in a storage device, which may be located in a resource management system or in a node (such as a base station) of the communication system.
  • the resource management information of the collected communication system can be stored in a primary node of the communication system (e.g., a base station in the primary system).
  • the collected resource management information may also be stored in a distributed manner in other nodes of the communication system, such as in one or more relay stations, and specifically, each relay station may save a local area in which it is located. Management information.
  • the storage of resource management information of the system can be implemented according to actual needs and using appropriate technologies, and will not be described in detail here.
  • the storage device may be any suitable storage medium, including but not limited to floppy disks, optical disks, magneto-optical disks, memory cards, memory sticks, and the like, which are not enumerated here.
  • the allocation policy decision device 2005 can determine a resource allocation policy for the communication system based on the resource management information.
  • the resource management system shown in FIG. 20 can adaptively adjust information collection according to the degree of change of the working state of the communication system. Strategy, which can effectively reduce the system overhead required for information collection.
  • the state query device 2001 can use a variety of methods to determine whether the degree of change in the operational state of the communication system affects the information required to make resource management decisions (i.e., whether resource management information needs to be re-acquired).
  • FIG. 21 shows a resource management system in accordance with another embodiment of the present invention.
  • the resource management system shown in FIG. 21 is similar to FIG. 20, and includes a status inquiry device 2101, an information collection device 2103, and an allocation policy decision device 2105.
  • the information collecting device 2103 includes an interference state collecting unit 2103-1 for collecting information on the interference state between links and a traffic stream collecting unit 2103- for collecting information about the traffic flow.
  • the status querying device 2101 may be configured to determine whether a change in the operating state of the communication system affects an interference state between links in the communication system, and if so, instruct the interference state collecting unit 2103-1 to re-collect the relevant inter-link Information on the interference status.
  • the status querying means 2101 can also determine whether the change in the operational status of the communication system causes a change in the traffic of the communication system, and if so, instruct the traffic flow collecting unit 2103-2 to re-collect information about the service flow. If the change in the operational state of the communication system affects neither the interference state between the links in the communication system nor the traffic flow to the communication system, it is determined that the system management information does not need to be reacquired. In other words, in this case, the resource management information may not be re-acquired, but the resource management information previously collected or saved may be utilized.
  • the allocation policy decision means 2105 is similar to the allocation policy decision means 2005 shown in Fig. 20 and will not be repeated here.
  • the resource management system shown in FIG. 21 can perform work according to the communication system in the process of collecting information (such as analysis/statistics/measurement, etc.) required for resource allocation.
  • the degree of change of state to adaptively adjust the strategy of information collection, thereby effectively reducing the system overhead required for information collection.
  • whether the re-acquisition needs to be re-acquired may be determined according to the degree of change of various working states of each area of the communication system (mutual exclusion relationship between links between certain nodes and changes of traffic of some nodes, etc.) Resource management information and which resource management information needs to be re-acquired (in the example of Figure 21, information about the mutual exclusion relationship between links is collected, and a letter about the service flow is collected) Interest or collect both).
  • the information collecting device 2003 or 2103 can collect resource management information of the communication system according to the method described above (for example, various embodiments/examples described with reference to Figs. 14-16), and will not be repeated here.
  • FIG. 22 shows a resource management system in accordance with another embodiment of the present invention.
  • the links of the communication system are also clustered prior to collecting the resource management information of the communication system.
  • the resource management system includes a status querying device 2201, an information collecting device 2203, and an allocation policy decision device 2205, and further includes a link clustering device 2207.
  • the status inquiry means 2201, the information collection means 2203 and the allocation policy decision means 2205 are similar to the corresponding means in Fig. 20 or 21.
  • Link clustering means 2207 can be used to cluster links in a communication system to obtain one or more link clusters.
  • the link clustering means 2207 can cluster the links using the methods described in the examples/embodiments above, and will not be repeated here.
  • the information collection device 2203 can utilize the results of the clustering to collect resource management information. Specifically, the information collection device 2203 may collect the resource management by acquiring an interference state between clusters of each link, an interference state between links in each link cluster, and service flow information of each link cluster. Information o
  • the information collecting device 2203 may acquire the interference state information between the clusters and the interference state information between the links in each cluster.
  • the service flow information may also be collected by acquiring service flow information of each link cluster.
  • the allocation policy may be included in the process of determining the resource allocation policy according to the resource management information, and may further include first allocating resources to each link cluster, and then assigning each link cluster to each link cluster. The resources are further allocated to the various links in the link cluster (e.g., the example described with reference to Figure 19).
  • the resource management system shown in FIG. 22 clusters the links of the communication system, which can reduce the workload in the process of re-collecting resource management information, and can reduce the complexity of the decision process of the resource allocation strategy, thereby reducing The load of the system.
  • the allocation policy decision means 2305 shown in FIG. 23 includes an information conversion unit 2305-1 and a determination unit 2305-2.
  • the information conversion unit 2305-1 may establish a quantization relationship between the resource management information of the communication system and the resource allocation target, and the determining unit 2305-2 may determine the resource allocation policy of the communication system according to the established quantization relationship.
  • the information conversion unit 2305-1 may establish the quantization relationship by: first, establishing a resource allocation model according to the resource management information, and then establishing a resource allocation constraint according to the resource allocation model, and Quantify resource allocation goals.
  • the resource allocation model described herein reflects the neighbor relationship between the chains in the communication system, the mutual exclusion relationship between the links, and the bandwidth requirement and priority level of each link.
  • the information conversion unit 2305-1 may employ the method described above (such as the method in the embodiment/example described with reference to FIGS. 7 and 18) to establish a resource allocation model of the communication system, and may employ the method described above (Examples of methods described in the multi-staining problem with reference to the hierarchical weighted mixed graph, etc.) to establish various constraints and quantify resource allocation targets, which are not repeated here.
  • the determining unit 2305-2 may determine a resource allocation policy by: sorting each link in the resource allocation model, selecting a link that can be allocated resources at the same time; A resource allocation constraint and a quantized resource allocation target are allocated resources for each selected link.
  • the determining unit 2305-2 may determine the resource allocation policy using the method in the embodiment/example described above (such as the embodiment/example described with reference to Figs. 8 and 19, etc.), and is not repeated here.
  • FIG. 24 shows an allocation policy decision device 2405 in accordance with another embodiment of the present invention. Similar to the device 2305 shown in FIG. 23, the device 2405 shown in FIG. 24 includes an information conversion unit 2405-1 and a determination unit 2405-2. The difference is that the device 2405 shown in FIG. 24 further includes a link clustering device 2405-3.
  • Link clustering means 2405-3 can be used to cluster the links in the communication system to obtain one or more link clusters.
  • the link clustering means 2405-3 may cluster the links using the methods described in the examples/embodiments above, and will not be repeated here.
  • the resource allocation model established by the information conversion unit 2405-1 may reflect the adjacent relationship between the link clusters, the mutually exclusive relationship between the link clusters, and each Information such as bandwidth requirements and priority levels of link clusters.
  • the determining unit 2405-2 may sort each link cluster in the resource allocation model, select a link cluster that can be allocated resources at the same time, and select each link according to the resource allocation constraint condition and the quantized resource allocation target. Clusters allocate resources.
  • the determining unit 2405-2 may further allocate resources allocated to each link cluster to each of the link clusters. Link. It can be seen that the clustering of links reduces the complexity of the decision-making process of the resource allocation strategy.
  • the allocation policy decision means 230 or 2405 shown in Fig. 23 or 24 can be applied to the resource management system described above (e.g., the resource management system described with reference to Figs. 20-22), which is not described in detail herein.
  • Figure 25 illustrates an allocation mechanism control device 2508 for determining a resource allocation mechanism of a communication system in accordance with one embodiment of the present invention.
  • the resource allocation mechanism refers to which nodes in the communication system (such as the open frequency access access system) perform resource allocation.
  • the control device 2508 of Fig. 25 can adaptively adjust the resource allocation mechanism of the communication system in accordance with the change in the amount of load of the communication system.
  • the distribution mechanism control means 2508 includes a statistical unit 2508-1 and a selection unit 2508-2.
  • the statistical unit 2508-1 can be used to count the load of the communication system, and the selecting unit 2508-2 can select a resource allocation mechanism for executing the resource allocation policy of the communication system based on the counted load.
  • the load can be calculated based on the ratio of the system average throughput over a period of time to the system capacity.
  • the statistical unit 2508-1 can use any other suitable method to count the load of the communication system, which is not described in detail herein.
  • the selection unit 2508-2 may also determine whether the communication system is light or heavy depending on the amount of load of the communication system. In the case of a light load, selection unit 2508-2 selects a centralized resource allocation mechanism for the communication system. In the case of heavy load, selection unit 2508-2 selects a distributed resource allocation mechanism for the communication system. As a specific example, the selection unit may determine whether the communication system is light or heavy by determining whether the counted load is greater than a predetermined threshold. For example, when the amount of load is greater than the threshold, the selection unit can determine that the communication system is under heavy load, otherwise it is lightly loaded.
  • the threshold can be set according to the actual application, and there is no limitation here.
  • the distribution mechanism control device shown in FIG. 25 can be applied to the resource management system shown in FIGS. 20-22.
  • Fig. 26 shows an example of a resource management system including an allocation mechanism control means.
  • the resource management system includes: an information querying device 2601, an information collecting device 2603, and an allocation policy decision device 2605, and an allocation mechanism control device 2608.
  • the distribution mechanism control device 2608 is similar to the device 2508 shown in FIG.
  • the information inquiry means 2601, the information collection means 2603 and the distribution policy decision means 2605 are similar to the corresponding means shown in Fig. 20 and will not be repeated here.
  • the allocation mechanism control means 2608 can feed back the resource allocation mechanism to the allocation policy decision means 2605, so that the communication system can perform the resource allocation policy determined by the decision means 2605 according to the resource allocation mechanism.
  • the allocation of resources can be selected.
  • Figure 27 illustrates a resource management system in accordance with another embodiment of the present invention. Similar to the embodiment shown in FIG. 20, the resource management system shown in FIG. 27 includes an information querying device 2701, an information collecting device 2703, and an allocation policy decision device 2705; the difference is that the resource management system shown in FIG. 27 can also be An information management device 2709 is included.
  • the information inquiry device 2701, the information collection device 2703, and the distribution policy decision device 2705 are similar to the corresponding devices shown in FIG. 20 and will not be repeated here.
  • the information management device 2709 is for managing and saving the operating state of the communication system.
  • the information management device 2709 can be driven by various state change events of the communication system (such as movement of the relay station RS, power variation of the relay station RS, change of coverage, addition/departure of the user, etc.), and corresponding state information according to the changes Update.
  • the status querying device 2701 can query the information management device 2709 to determine the degree of change in the operating state of the communication system, thereby determining whether resource management information needs to be re-acquired and which operating state information of which region of the system needs to be collected.
  • the status inquiry device 2701 can be notified by, for example, transmitting a control signal.
  • the information management device 2709 may change the corresponding state change position in the control signal transmitted to the state inquiry device 2701 so as to change the corresponding change.
  • the status inquiry device 2701 is notified.
  • the interference measurement status bit in the control signal is set to 1 (True); and when the working state change of the communication system involves the change of the user service flow, The traffic flow statistics status bit in the control signal is 1 (True).
  • the status querying device 2701 may also issue a request to the information management device 2709, and the information management device 2709 feeds the change back to the status query. Apparatus 2701 (e.g., by transmitting the control signal described above).
  • status inquiry means 2701 may also read information about changes in the operational status of the communication system from information management apparatus 2709. For example, the interference measurement status or traffic flow The statistical status can be stored in the information management device 2709 and continuously updated by the information management device 2709.
  • the status query module 2701 can learn the working status of the communication system by reading these statuses. Change the degree.
  • the resource management system shown in Fig. 28 includes an information inquiry means 2801, an information collection means 2803, an allocation policy decision means 2805, and an information management means 2809; the difference is that
  • the resource management system may also include a link clustering device 2807 and an allocation mechanism control device 2808.
  • the information inquiry means 2801, the information collection means 2803, the distribution policy decision means 2805 and the information management means 2809 are similar to the corresponding means shown in Fig. 27 and will not be repeated here.
  • the link clustering device 2807 is similar to the link clustering device 2207 shown in FIG. 22, and the distribution mechanism control device 2808 is similar to the distribution mechanism control device 2508 or 2608 shown in FIG. 25 or 26, and is no longer here. repeat.
  • Fig. 29 shows a specific example of a resource management system for sharing management of resources of a communication system.
  • the resource management system shown in FIG. 29 includes an information inquiry device 2901, an information collection device 2903, an allocation policy decision device 2905, an information management device 2909, and an allocation mechanism control device 2908.
  • the communication system to which the example is directed is an open frequency transmission system, such as a communication system including a primary system network and at least one secondary system network.
  • the resource management information of such a communication system includes, but is limited to, the state of each node in the primary system network and the secondary system network, the interference state between the links, and the service flow information.
  • the information management device 2909 may include a main information management unit 2909-1 for storing resource management information of the primary system network, and may further include a secondary information management unit 2909-2 for storing resource management information of the secondary system network.
  • the main information management unit 2909-1 may further include a main user information subunit 2909-11 for storing related information of the main user of the main system network (as shown in Table 1) and for storing the main system network.
  • the secondary information management unit 2909-2 may further include a secondary user information subunit 2909-21 for storing related information of the secondary user of the secondary system network (as shown in Table 1) and for storing the secondary system.
  • Secondary network information sub-unit 2909-22 of network related information (as shown in Table 1).
  • These units/subunits may be driven by various state change events of the communication system (such as the movement of the relay station RS, the power variation of the relay station RS, the coverage change, the joining/departing of the primary or secondary users, etc.), and according to these changes Update the corresponding status information.
  • state change events of the communication system such as the movement of the relay station RS, the power variation of the relay station RS, the coverage change, the joining/departing of the primary or secondary users, etc.
  • the status inquiring device 2901 is configured to query the information management device 2909 whether the working status of the communication system has changed since the last status inquiry to determine whether resource management information needs to be re-acquired.
  • the status inquiry means 2901 can obtain information on the state change of the communication system from the information management means 2909 by the method described in the above embodiment, and will not be repeated here.
  • the information collecting device 2903 includes an interference state collecting unit 2903-1 and a traffic stream collecting unit 2903-2. Units 2903-1 and 2903-2 are similar to the corresponding units shown in Fig. 21 and will not be repeated here. If the status querying device 2901 determines that the resource management information needs to be re-acquired, an excitation signal may be sent from the corresponding unit of 2903 after the information is collected to stimulate the unit to perform information collection. For example, if the inter-link interference state of the communication system changes, the interference state acquisition unit 2903-1 is activated; if the traffic flow state of the communication system changes, the service flow collection unit 2903-2 is activated.
  • the information collecting device 2903 may further include a first information collecting subunit 2903-3.
  • the first information distribution sub-unit 2903-3 can perform information interaction with other devices in the resource management system.
  • the information collected by the units 2903-1 and 2903-2 can be sent to the information management device 2909 and the allocation policy decision device. 2905 and the like, it is also possible to receive information from the distribution mechanism control device 2908.
  • the status querying means 2901 may instruct the allocation policy decision means 2905 to use the resource management information of the last query to determine the resource allocation policy.
  • the resource management information of the last query can be saved in the information management device 2909.
  • the allocation policy decision means 2905 includes an information conversion unit 2905-1 and a determination unit 2905-2. Units 2905-1 and 2905-2 are similar to the corresponding units shown in Figures 23 or 24 and will not be repeated here.
  • the allocation policy decision device 2905 can also include a second information collection sub-unit 2905-3.
  • the second information collection sub-unit 2905-3 may perform information interaction with other devices in the resource management system, for example, may receive information from the information collection device 2903 and/or the information management device 2909 and/or the status query device 2901.
  • the information about the load amount and the resource allocation mechanism is obtained from the distribution mechanism control means 2908, and the determined resource allocation policy can also be sent out, for example, to a corresponding policy enforcement device (not shown).
  • the policy enforcement device first converts the amount of resources allocated by each link into actual wireless resources (such as time domain resources, frequency domain resources, code domain resources, various combinations thereof, etc.).
  • the resource allocation strategy information packets are formed by combining the resources required for the communication system management (such as the resources required for user information interaction in the communication system), and finally these information packets are released.
  • information dissemination can be published by carrying information in the frame; for secondary system networks, it can be distributed through primary/secondary system interaction information. Then, each node of the primary/secondary system network can perform data transmission on the allocated wireless resources.
  • the policy enforcement device may be implemented in a master node (such as a base station or a base station of a primary system network) in the communication system.
  • the dispensing mechanism control device 2908 is similar to the device 2508 or 2608 shown in Figures 25 or 26.
  • the distribution mechanism control device 2908 can adaptively change the appropriate information interaction content according to the change of the load state in the operation process of the communication system, and can control the behavior of the information collection and distribution unit in each device to form a flexible open frequency.
  • Access system resource allocation mechanism to effectively utilize the computing and communication capabilities of each node in the system to improve system performance.
  • a centralized resource allocation mechanism also referred to as a centrally controlled resource allocation mechanism
  • resource management decisions are uniformly made by base stations of the primary system network. Therefore, the second information collection unit needs to summarize the information required for resource allocation and the optimization target obtained by the information conversion device to the base station. Once the base station determines the resource allocation policy, the second information collection unit issues the allocation policy to the corresponding node. .
  • the resource management system uses part of the nodes as local decision nodes to process the resource management decisions of the local area in which it is located; and then the base station of the main system network coordinates the local decision results to obtain the final resource allocation strategy.
  • the resource management information collection results of each node will be aggregated to the local decision nodes in the region where the local decision nodes convert and calculate the local information, and the local decision results are obtained;
  • the base station further aggregated to the primary system network is coordinated to obtain the global resource allocation result of the system, and then the information collection unit issues the allocation result to the corresponding node.
  • the distribution mechanism control device 2908 may include a statistical unit and a selection unit (not shown). This statistical unit is used to count the load status of the communication system. If it is light load, the selection unit selects the resource allocation mechanism of the central control; if it is heavy load, the selection unit selects the distributed resource allocation mechanism. As an example, the degree of weight of the load may be calculated according to the ratio of the system average throughput to the system capacity over a period of time. If a certain threshold is exceeded, the communication system may be considered to be under heavy load, otherwise the communication system is considered to be under light load. Similar to the above example/embodiment, the threshold may be determined according to actual needs, and there is no limitation here.
  • the selection unit may further determine the category, quantity, object, and timing of the information that needs to be exchanged. For example, the information required for resource allocation obtained by the information conversion device and the optimization target may be summarized to the base station. Once the base station determines the resource allocation policy, the second information collection unit issues the allocation policy to the corresponding node.
  • the local decision control node can be selected by the base station of the primary system network. For example, the local decision control node can be selected based on the computing power of each node, the location distribution, the communication situation, and the like. As an example, if the primary system network is a relay network, you can select a relay station, and you can also select a router, an access point (AP), or a user node with strong computing power. After the local decision control node is selected, the selection unit can further determine the type, quantity, object, and timing of the interaction information.
  • AP access point
  • each local decision node is responsible for an average of 10 nodes for information collection and allocation strategy decision tasks. If five local decision nodes are selected, each local decision node is responsible for the information collection and allocation strategy decision tasks of 20 nodes.
  • These local decision nodes may summarize only the collected information to obtain a local resource allocation model, and then send it to a central decision node (such as a base station) to make a decision on the resource allocation strategy.
  • the selection unit may determine the category, quantity, object, and transmission timing of the interaction information according to the number of selected local decision nodes, the distribution in the communication system, the local area and function that each local decision node is responsible for, and the like. It will not be detailed here.
  • the information exchange between devices in the resource management system and between the nodes of the communication system also requires system resources, and therefore, corresponding resource allocation is required.
  • these interaction information can be considered as system information and can be implemented by assigning a dedicated domain in the frame structure.
  • these interaction information can also be considered as data information, distributed along with the resources required by the user.
  • the appropriate resource blocks are allocated for the interaction information according to the resource and timing requirements of the interaction. This resource allocation can be performed by the distribution mechanism control device.
  • the distribution mechanism control device can also drive each information collection unit to update the interaction information.
  • the content for example, can activate various information collection units to update various settings of the next (or next stage) interaction information, such as the category, quantity, objects, and allocated resources of the interaction information.
  • the various steps of the above resource management method and the respective devices, component modules and/or units of the above resource management system may be implemented as software, firmware, hardware or the like in a master node (eg, a base station) of the communication system or Combined, and as part of the base station's resource management equipment.
  • a master node eg, a base station
  • the specific means or manner in which the various devices, component modules, and units in the above system are configured by software, firmware, hardware, or a combination thereof are well known to those skilled in the art, and are not described herein again.
  • the resource management method and/or system according to the above-described embodiments of the present invention may be implemented in a resource management device of an existing base station, wherein certain components of the resource management device of the existing base station may be modified.
  • the resource management system described above may also be distributed.
  • the information management device may be located at the base station or distributedly located in the base station and various local decision nodes.
  • the information conversion unit may be implemented in the base station, or may be distributed in the base station and each local decision node, and the information converted by each local decision node may be collected into the base station.
  • the allocation policy decision device may be implemented in the base station, or may be distributedly located in the base station and each local decision node, and each local decision node determines the local policy, and then aggregates it into the base station, and is determined by the allocation policy decision device in the base station. Global strategy.
  • the status inquiry device or the information collection device may be implemented in the base station or may be implemented in other nodes.
  • the resource management system and method of the present invention can be adaptively adjusted according to the actual situation of the communication system, and can effectively utilize the capabilities of each node in the communication system. While ensuring that the primary user's resource requirements are met, the secondary users are provided with resource utilization opportunities as much as possible, thereby improving the resource utilization efficiency of the entire system.
  • the present invention also proposes a program product for storing a machine readable instruction code.
  • the above-described method according to an embodiment of the present invention can be performed when the instruction code is read and executed by a machine.
  • a storage medium for carrying a program product storing the above-described storage machine readable instruction code is also included in the disclosure of the present invention.
  • the storage medium includes, but is not limited to, a floppy disk, an optical disk, a magneto-optical disk, a memory card, a memory stick, and the like.
  • the methods according to the embodiments of the present invention are not limited to being performed in the time sequence described in the specification, and may be performed in other time series, in parallel, or independently. Therefore, the order of execution of the methods described in this specification does not constitute a technical scope of the present invention.
  • the link clustering step S501 shown in Fig. 5 can also be applied to the embodiment shown in Fig. 3.
  • a link clustering step similar to step S501 may be included to cluster the links in the communication system.
  • the resource management information can be obtained by acquiring the interference relationship between the respective link clusters, the interference relationship between the links in each link cluster, and the service flow information of each link cluster.
  • the link clustering step S501 shown in Fig. 5 can also be applied to the embodiment shown in Figs. 6-8 to reduce the amount of calculation in the resource allocation policy decision process. It will not be detailed here.

Landscapes

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

Description

资源管理方法和系统
技术领域
[01] 本发明涉及通信领域， 具体地， 涉及一种通信系统中的资源管理 方法和系统。
背景技术
[02] 通信系统中的资源管理和共享是业界非常关注的一个问题。这里 所述的资源可以包括通信系统的时域资源、 频域资源、码域资源等资 源。 在美国联邦通信委员会 ( Federal Communications Commission, 简称 FCC )等组织制定的传统的、 固定的 （Stationary )频讲资源分 配和使用规则中， 将频谱资源划分为多个频段， 分配给各个运营商进 行排他性使用， 这使得频谱资源的利用非常低效。
[03] 开放式频谱访问 ( Open Spectrum Access )的产生就是为了解决 固定频谱资源使用的低效问题。 在开放式频傳访问体系中， 无许可证 的 （ Unlicensed )用户在不影响有许可证 ( Licensed ) 的用户的前提 下可以利用频段资源中的空闲资源进行数据传输，以提高频谱资源的 利用率。
[04] 公开号为 CN101141771A 的中国专利申请公开了一种实现频谱 共享的无线资源管理系统和方法。该专利申请所公开的资源管理系统 是集中式的， 包括：协同控制单元，用于根据接入网的频傳共享请求， 和 /或各接入网运行的统计信息及频傳使用情况，确定频谱共享处理 策略； 接入网间频讲共享控制单元， 与所述协同控制单元相连， 用于 根据协同控制单元确定的频谱共享处理策略，协调不同接入网的本地 无线资源管理， 使接入网间共享频傳资源。 该专利申请提供了一种在 不同无线接入技术和无线接入网络之间实现频谱共享的方法。
发明内容
[05] 在下文中给出关于本发明的简要概述，以便提供关于本发明的某 些方面的基本理解。应当理解， 这个概述并不是关于本发明的穷举性 概述。 它并不是意图确定本发明的关键或重要部分， 也不是意图限定 本发明的范围。 其目的仅仅是以简化的形式给出某些概念， 以此作为 稍后论述的更详细描述的前序。
[06] 根据本发明的一个方面， 提供了一种通信系统中的资源管理方 法。 该资源管理方法可以包括： 判断所述通信系统的工作状态的变化 程度是否会导致所述通信系统的资源管理信息发生变化， 如果是， 则 重新采集所述资源管理信息， 其中， 所述资源管理信息包括有关所述 通信系统中各节点的状态、各链路间的干扰状态及业务流信息； 以及 根据所述资源管理信息来确定所述通信系统的资源分配策略。
[07] 根据本发明的另一方面， 提供了一种通信系统中的资源管理系 统， 该资源管理系统包括状态查询装置、信息采集装置和分配策略决 策装置。所述状态查询装置用于判断所述通信系统的工作状态的变化 程度是否会导致所述通信系统的资源管理信息发生变化， 如果是， 则 指示所述信息采集装置重新采集所述资源管理信息。所述信息采集装 置用于根据所述状态查询装置的指示来重新采集所述资源管理信息， 其中， 所述资源管理信息包括有关所述通信系统中各节点的状态、各 链路间的干扰状态及业务流信息。所述分配策略决策装置用于根据所 述资源管理信息来确定所述通信系统的资源分配策略。
[08] 才艮据本发明的另一方面，提供了一种用于根据通信系统的资源管 理信息来确定所述通信系统的资源分配策略的方法， 该方法包括： 建 立所述资源管理信息与通信系统的资源分配目标之间的量化关系； 以 及根据所建立的量化关系来确定所述资源分配策略。 根据一个实施 例，建立所述资源管理信息与资源分配目标之间的量化关系的步骤包 括： 根据所述资源管理信息来建立资源分配模型， 所述模型反映所述 通信系统中各链 之间的相邻关系、各链 之间的互斥关系以及每个 链路的带宽需求和优先等级； 以及根据所述资源分配模型来建立资源 分配约束条件， 并量化资源分配目标。 根据一个实施例， 根据所建立 的量化关系来确定所述资源分配策略的步骤包括：将所述资源分配模 型中的各链^ #序， 选择可同时被分配资源的链路； 以及根据所述资 源分配约束条件和量化的资源分配目标，为所选择的每个链路分配资 源。
[09] 根据本发明的另一方面，提供了一种确定通信系统的资源分配机 制的方法， 该方法包括： 统计所述通信系统的负载量； 以及根据所统 计的负载量来选择用于执行所述资源分配策略的资源分配机制。根据 一个实施例， 根据所统计的负载量来选择资源分配机制的步骤包括： 根据所述负载量来判断所述通信系统为轻负载还是重负载，若为轻负 载， 则选择集中式的资源分配机制； 若为重负载， 则选择分布式的资 源分配机制。 在所述集中式的资源分配机制中， 由所述通信系统中的 主控节点来集中分配所述通信系统的资源；在所述分布式资源分配机 制中， 所述通信系统中的多个节点作为局部决策节点， 由每个局部决 策节点对其相应的局部区域的资源进行分配。
[10] 才艮据本发明的一个方面，提供了一种用于确定通信系统中的资源 分配策略的分配策略决策装置。 该装置包括： 信息转化单元， 用于建 立所述通信系统的资源管理信息与资源分配目标之间的量化关系； 以 及确定单元， 用于根据所建立的量化关系来确定所述资源分配策略。 根据一个实施例， 信息转化单元还可被配置用于： 根据所述资源管理 信息来建立资源分配模型 ,所述模型反映所述通信系统中各链路之间 的相邻关系、各链 之间的互斥关系以及每个链路的带宽需求和优先 等级； 以及根据所述资源分配模型来建立资源分配约束条件， 并量化 资源分配目标。 根据一个实施例， 所述确定单元还可被配置用于： 将 所述资源分配模型中的各链 序， 选择可同时被分配资源的链路； 根据所述资源分配约束条件和量化的资源分配目标，为所选择的每个 链路分配资源。
[11] 才艮据本发明的另一方面，提供了一种用于确定通信系统中的资源 分配机制的分配机制控制装置。所述分配机制控制装置包括统计单元 和选择单元。 所述统计单元用于统计所述通信系统的负载量， 所述选 择单元用于根据所统计的负载量来选择用于执行所述资源分配策略 的资源分配机制。 根据一个实施例， 所述选择单元还被配置用于： 根 据所述负载量来判断所述通信系统为轻负载还是重负载， 若为轻负 载， 则选择集中式的资源分配机制； 若为重负载， 则选择分布式的资 源分配机制，。 在所述集中式的资源分配机制中， 由所述通信系统中 的主控节点来集中分配所述通信系统的资源；在所述分布式资源分配 机制中， 所述通信系统中的多个节点作为局部决策节点， 由每个局部 决策节点对其相应的局部区域的资源进行分配。
[12] 另外， 本发明的实施例还提供了用于实现上述方法的计算机程 序。
[13] 此外，本发明的实施例还提供了至少计算机可读介质形式的计算 序产品， 其上记录有用于实现上述方法的计算机程序代码。
附图说明
[14] 参照下面结合附图对本发明实施例的说明，会更加容易地理解本 发明的以上和其它目的、 特点和优点。 附图中的部件只是为了示出本 发明的原理。 在附图中， 相同的或类似的技术特征或部件将采用相同 或类似的附图标记来表示。
[15] 图 1 是示出了本发明的实施例可应用的场景的一个示例的示意 图；
[16] 图 2是示出了本发明的实施例可应用的场景的另一示例的示意 图；
[17] 图 3是示出了根据本发明的一个实施例的资源管理方法的示意 性流程图；
[18] 图 4是示出了根据本发明的另一实施例的资源管理方法的示意 性流程图；
[19] 图 5是示出了根据本发明的另一实施例的资源管理方法的示意 性流程图；
[20] 图 6是示出了根据本发明的一个实施例的根据通信系统的资源 管理信息来确定资源分配策略的方法的示意性流程图；
[21] 图 7是示出了根据本发明的另一实施例的根据通信系统的资源 管理信息来确定资源分配策略的方法的示意性流程图；
[22] 图 8是示出了根据本发明的另一实施例的根据通信系统的资源 管理信息来确定资源分配策略的方法的示意性流程图；
[23] 图 9是示出了根据本发明的另一实施例的资源管理方法的示意 性流程图；
[24] 图 10是示出了根据本发明的另一实施例的资源管理方法的示意 性流程图；
[25] 图 11是示出了根据本发明的一个实施例的选择通信系统的资源 分配机制的方法的示意性流程图； [26] 图 12是示出了根据本发明的另一实施例的选择通信系统的资源 分配机制的方法的示意性流程图；
[27] 图 13是示出了根据本发明的另一实施例的资源管理方法的示意 性流程图；
[28] 图 14是示出了针对图 2所示的通信系统的用于采集资源管理信 息的信息采集对象的示意图；
[29] 图 15是示出了用于采集通信系统中的链路间的干扰状态信息的 示意性流程图；
[30] 图 16是示出了用于采集通信系统中的有关业务流的信息的示意 性流程图；
[31] 图 17示出了对具有图 14所示的结构的通信系统进行链路分簇的 一个示例；
[32] 图 18(a)、 18(b)和 18(c)示出了利用图论的方法、根据资源管理信 息来建立资源分配模型的示例性过程；
[33] 图 19示出了根据通信系统的资源管理信息与资源分配目标之间 的量化关系来确定资源分配策略的流程的一个示例；
[34] 图 20是示出了根据本发明的一个实施例的资源管理系统的示意 性框图；
[35] 图 21是示出了根据本发明的另一实施例的资源管理系统的示意 性框图；
[36] 图 22是示出了根据本发明的另一实施例的资源管理系统的示意 性框图；
[37] 图 23是示出了根据本发明的一个实施例的分配策略决策装置的 示意性框图；
[38] 图 24是示出了根据本发明的另一实施例的分配策略决策装置的 示意性框图；
[39] 图 25是示出了根据本发明的一个实施例的分配机制控制装置的 示意性框图；
[40] 图 26是示出了根据本发明的另一实施例的资源管理系统的示意 性框图； [41] 图 27是示出了根据本发明的另一实施例的资源管理系统的示意 性框图；
[42] 图 28是示出了根据本发明的另一实施例的资源管理系统的示意 性框图； 以及
[43] 图 29是示出了根据本发明的另一实施例的资源管理系统的示意 性框图。
具体实施方式
[44] 下面参照附图来说明本发明的实施例。在本发明的一个附图或一 种实施方式中描述的元素和特征可以与一个或更多个其它附图或实 施方式中示出的元素和特征相结合。 应当注意， 为了清楚的目的， 附 图和说明中省略了与本发明无关的、本领域普通技术人员已知的部件 和处理的表示和描述。
[45] 本发明的实施例提供了对通信系统中的资源进行共享管理的方 法和系统、 装置等， 以保证系统资源 （如频谱） 的高效使用。 这里， 所述资源可包括通信系统的时域资源、 频域资源、码域资源及其任何 组合。
[46] 根据本发明实施例的方法和系统可以应用于具有开放式频傳访 问体系特点的通信系统。图 1和图 2分别给出了这种通信系统的示例。
[47] 图 1 示出了可以应用本发明的实施例的方法和装置的通信系统 的一个示例。 图 1所示的通信系统为开放式频傳访问体系， 包括两类 网络系统： 第一类为主系统（Primary System ) 网络 101， 该主系统 网络 101拥有对于其运营频段等资源的绝对优先使用权限，其用户称 为主用户 （ Primary User, 简称 PU ); 第二类为次系统（ Secondary System ) 网络 102, 其信号范围覆盖主系统的部分或全部， 其用户称 为次用户 （ Secondary User, SU )。 当次系统 102与主系统 101同时 使用相同的无线资源时会对主系统 101产生干扰。 因此， 该开放式频 傳访问体系的资源共享原则是： 次系统 102只能在不影响主系统 101 的前提下才可以利用主系统 101的频段等资源中的空闲资源进行数据 传输。 主系统 101包括 2类节点： 基站 ( Base Station, BS )和主用 户 （PU )。 基站与骨干网 （ Backbone )连接， 为主用户提供接入核心 网的 Ji艮务。 次系统 102可以是各种类型的通信网络， 例如： 包括次用 户的自组织网络（Ad Hoc )、 包括路由器（Router )和次用户的网状 网 （Mesh Network )、 或者包括接入点（Access Point, AP )和次用 户的无线局域网等任何适当的通信网络， 这里不作任何限制。 另外， 通信系统中还可以包括一个或更多个次系统。本发明的实施例中对次 系统的数量、 类型和 不作任何限制。 换言之， 在影响主系统 101 的范围内可以有一个或更多个不同类型、不同规 的次系统 102共存。
[48] 图 2 示出了可以应用本发明的实施例的方法和装置的通信系统 的另一示例。 图 2所示的通信系统也为开放式频讲访问体系， 包括主 系统和次系统。 与图 1所示的主系统不同的是， 图 2的主系统 201为 中继网络 （例如为多跳无线中继网络， Multihop Wireless Relay Network )„ 如图 2中所示， 该中继网络 201包括三类节点： 基站、 + 继站（Relay Station, RS )和主用户。 基站与骨干网连接， 为主用户 提供接入核心网的服务。 中继站可以包括一级或多级， 通过无线方式 在基站与主用户之间进行信号转发。本发明的实施例可以应用于如图 2所示的开放式频傳网络体系， 并且对主系统中的中继站的级数、 个 数、 分布位置、 是否具有可移动性等不加任何限制。 与图 1所示的次 系统 102相似， 次系统 202也可以是 Ad Hoc网络、 Mesh网络或者 各种无线局域网等任何适当的网络， 这里不作限制。
[49] 图 1和图 2给出了能够实施根据本发明的实施例的方法和系统、 装置的、 具有开放式频谱网^^系特点的通信系统的示例。 应理解， 这些示例仅仅是说明性的， 并非穷举性的。 本发明不应被视为仅可应 用于上述通信系统。根据本发明的实施例的方法和装置还可应用于其 他需要对系统资源进行动态分配管理的通信系统， 这里不 列举。
[50] 图 3 示出了根据本发明的一个实施例的通信系统中的资源管理 方法。
[51] 如图 3所示，该资源管理方法包括如下步骤 S302、 S304和 S306。
[52] 在步骤 S302中， 判断通信系统的工作状态的变化程度是否会导 致所述通信系统的资源管理信息发生变化， 即根据通信系统的工作状 态的变化程度来判断是否需要重新采集所述通信系统的资源管理信 息。 如果是， 则在步骤 S304中重新采集资源管理信息； 否则不重新 采集资源管理信息， 即利用之前采集或保存的资源管理信息。 在步骤 S306中， 才艮据所述资源管理信息来确定通信系统的资源分配策略。
[53] 这里， 所述资源管理信息是指能够影响通信系统的资源管理、分 配策略的决策的信息。
[54] 利用图 3所示的实施例， 在进行资源分配所需的信息的采集（如 分析 /统计 /测量等）过程中， 可以根据通信系统的工作状态的变化程 度来适应性地调整信息采集的策略，从而能够有效地降低信息采集所 需花费的系统开销。
[55] 作为一个示例， 资源管理信息可以归为三类： 系统基本架构及其 状态信息（即各节点的状态）； 无线链路间的互斥关系 （即链路间的 干扰关系）信息以及用户业务流信息。 换言之， 资源管理信息可以包 括（但不限于）有关通信系统中各节点的状态、 各链路间的干扰状态 及业务流等信息。
[56] 表 1示出了针对图 2所示的通信系统的资源管理信息的一个示 例。 如表 1所示， 通信系统的资源管理信息可以包括主系统的网络状 态、 主用户的状态、 次系统的网络状态以及次用户的状态等信息。
表 1 通信系统的资源管理信息的一个示例
资源管理信息
主系统的网络状态 BS、 RS互连的链路及其链路状况；
BS、 RS采用的功耗控制状态；
RS的移动状态 (移动速度 /方向等)；
RS的工作状态 (工作 /空闲 /休眠等)。
主用户的状态 主用户的直接 ϋ良务 BS、 RS的编号；
主用户的移动状态 (移动速度 /方向等)；
主用户的工作状态 (工作 /空闲 /休眠等)；
主用户的业务连接状态 (连接类型及 QoS参数等)。 次系统的网络状态 针对 Ad Hoc网络： 次用户个数及次用户互连状态； 针对 Mesh网络： 包括路由器的骨干网的链路状态、次 用户个数及次用户与骨干网的连接状态等； 针对无线局域网： 用户个数等。
次用户的状态 次用户的移动状态 (移动速度 /方向等)；
次用户的工作状态 (工作 /空闲 /休眠等)；
次用户的业务连接状态 (连接类型及 QoS参数等)。
[57] 应该理解， 表 1给出的资源管理信息是示例性的， 而不应被视为 将本发明局限于此。 本领域的普通技术人员可以理解， 可以根据具体 的应用情境和实际需要来确定影响到资源管理、分配策略的资源管理 信息的具体内容， 这里不——列举。
[58] 可以利用多种方法来判断通信系统的工作状态的变化程度是否 影响到了进行资源管理决策所需的信息（即是否需要重新采集资源管 理信息）。 作为一个示例， 当通信系统的工作状态的变化仅涉及到局 部区域时， 可以仅重新采集与该局部区域相关的资源管理信息， 与其 他区域相关的资源管理信息则采用之前采集或保存的信息。作为另一 示例， 当通信系统的变化仅涉及到部分工作状态（如链路间的干扰状 态或业务流状态）时， 可以仅重新采集与该变化的工作状态相关的信 息。 例如， 当某个主用户节点移动， 导致其与其他节点的链路之间的 互斥关系等发生变化而业务流未发生变化时，可以仅采集与相关链路 间的互斥关系有关的信息，与该节点有关的业务流信息则可以采用之 前采集或保存的信息。 又如， 当某个主用户节点与其他节点之间的业 务流发生变化而链路间的干扰关系不变时，可以仅采集与该主用户节 点相关的业务流的信息， 而不必重新采集与该节点的相关链路之间的 互斥关系有关的信息。
[59] 图 4 示出了根据本发明的另一实施例的资源管理方法的示例性 流程图。 图 4所示的资源管理方法包括步骤 S402、 S404-l、 S404-2 和 S406。
[60] 在 S402中， 当通信系统的工作状态发生变化时， 判断该变化是 否影响到了通信系统中各链路间的干扰状态和业务流量。
[61] 如果通信系统的工作状态的变化影响到通信系统中各链路间的 干扰状态， 则确定需要重新采集有关链路间的干扰状态的信息， 然后 在步骤 S404-1中， 重新采集有关链路间的干扰状态的信息。
[62] 如果通信系统的工作状态的变化导致通信系统的业务流量的变 化， 则确定需要重新采集有关业务流的信息， 然后在步骤 S404-2中， 重新采集有关业务流的信息。
[63] 如果通信系统的工作状态的变化既没有影响到通信系统中各链 路间的干扰状态也没有影响到通信系统的业务流量，则确定不需要重 新采集系统管理信息。 换言之， 在这种情况下， 可以不重新采集资源 管理信息， 而可以利用之前采集或保存的资源管理信息。
[64] 步骤 SS406与图 3所示的步骤 S306相似， 这里不作赞述。
[65] 与图 3所示的实施例相似， 利用图 4的实施例， 可以根据通信系 统的工作状态的变化程度来适应性地调整信息采集的策略，从而能够 有效地降低信息采集所需花费的系统开销。 具体而言， 可以根据通信 系统的各区域的各种工作状态（某些节点之间的链路间的互斥关系和 某些节点的业务流的变化等）的变化程度来确定是否需要重新采集资 源管理信息以及需要重新采集哪些资源管理信息（在图 21的示例中 采集有关链路间的互斥关系的信息、采集有关业务流的信息或者采集 二者)。
[66] 为了进一步说明资源管理信息的采集， 图 14示意性地示出了针 对图 2所示的通信系统的信息采集对象。
[67] 在图 14中， 符号 B、 R、 P、 S分别表示通信系统中的各个节点， 其中 B、 R和 P分别表示主系统网络的基站、 中继站和主用户节点； S表示次系统网络中的次用户节点。基站 /中继站节点 B/P的下角标表 示其编号； 主用户节点 P的下角标表示直接为其服务的基站 /中继站 的编号， 其上角标表示该主用户节点 P在该基站 /中继站所直接服务 的所有主用户节点中的编号；次用户节点 S的下角标表示其所属次系 统的编号，其上角标表示该次用户节点 S在其次系统的所有次用户中 的编号。 各节点间的有向实线段表示无线链路（为简化图示， 这里仅 以主系统网络的上行链路和次系统的任意一个方向的链路作为标 识）。 这些节点及其之间的无线链路就构成通信系统的基本架构。
[68] 图 14中的虚线表示链路间的干扰状态， 即链路间的互斥关系。 存在互斥关系的（即互斥的）两条无线链路不能同时使用相同的无线 资源。
[69] 作为一个示例， 可以将链路间的互斥关系分为三类。在图 14中， 这三类互斥关系分别用数字 1、 2和 3来表示。 第 1类互斥关系表示 一个节点不能同时从多个源接收不同信号、或者不能同时向多个目标 发送不同信号。 该限制对于某些配置多天线的节点不成立。 第 2类互 斥关系表示一个节点不能同时进行接收和发送。该限制对配置多套收 发装置的节点不成立。第 3类互斥关系表示两条无线链路间的同频干 扰，是指两条链路的源和目的节点都不相同时由于信号覆盖范围发生 重叠而发生同频干扰的现象。
[70] 主系统网络（如中继网络）及各类型的次系统网络的架构及其链 路状态等是由各个系统网络本身自行建立、 维护和管理的， 具体过程 可参见描述相关机制的文献， 在此不赘述。 因此， 可以从主系统网络 和次系统网络的相关设备（如图 1和图 2所示的基站、 自组织网络中 的用户、 网状网中路由器或者用户、 无线局域网中的接入点 （AP ) 等， 这里不一一列举）中获取相应架构及链路状态信息， 通过对这些 信息进行分析和统计来获得一些资源管理信息（例如第 1、 2类互斥 关系信息等， 如下面的示例所述）。
[71] 图 15和图 16分别给出了用于采集资源管理信息的方法的示例。 其中， 图 15示出了用于采集链路间的干扰状态信息的一个示例性方 法。
[72] 如图 15所示，该示例性的方法可包括如下步骤 S1504-l、 S1504-3 和 S1504-5。 可选地， 该方法还可包括步骤 S1504-2。
[73] 在步骤 S1504-1中，才艮据通信系统的链路间干扰状态的变化程度 来进行测量机制的选择。 当通信系统的整体架构发生改变导致大部分 链路发生变化或当建立通信系统时， 可以采用专属时间测量机制。 当 通信系统中仅局部发生变化导致仅仅局部的链路间发生干扰状态的 改变时， 可以采用数据传输过程测量机制。
[74] 在专属时间测量机制中，通信系统分配专门的时间用于链路间互 斥关系 （即干扰关系）的测量。 在此专门的时间中， 不进行有效的数 据传输。
[75] 在数据传输过程测量机制中， 当通信系统的局部区域的链路间的 互斥关系发生变化时，在有效的数据传输过程中由通信系统中的相关 节点对该局部区域中发生了变化的、正在进行数据传输的链路进行测 量，这些相关节点可以是可能与该局部区域中发生了变化的链路之间 信号覆盖范围发生重叠的节点， 例如， 可以选择该局部区域中除了正 在通信的节点之外的一个或更多个空闲节点作为用于进行策略的相 关节点。数据传输过程测量机制可以看作是对专属时间测量机制的补 充。
[76] 如果选择专属时间测量机制， 则执行下述步骤 S1504-2、 S1504-3 和 S1504-5。 如果选择数据传输过程测量机制， 则可直接执行步骤 S1504-5。
[77] 在步骤 S1504-2中， 对通信系统中的无线链路进行分簇（也称为 "簇化"）， 形成一个或更多个链路簇（cluster )。
[78] 通常， 通信系统中节点（如用户）众多， 各节点之间存在大量的 无线链路。对链路进行分簇的目的是就进行互斥关系测量的对象的粒 度粗化。根据通信系统的分布和性能需求， 无线链路簇化可以有多种 策略。 以主系统网络为中继网络为例， 最简单的簇化方式是将基站 / 中继站（BS/RS )及其直接服务的用户分为一簇， 称之为自然簇； 然 后进一步根据负载均衡等需求， 可以将一个自然簇裂化为多个簇， 或 者将多个自然簇聚集为一个簇。作为另一示例 ,还可将小区面积均分, 将同属一个面积单元的无线链路作为一个簇。 当然， 还可以采用其它 任何适当的方式进行链路簇化， 这里不——列举。对于通信系统中的 次系统为例， 由于通常情况下次用户较少， 因此可以将每个链路作为 一个簇。 当次用户较多时， 也可以根据具体情形采用其他任何适当的 方法进行簇化， 这里不一一列举。 图 17示出了对包括图 14所示的采 集对象的通信系统进行链路分簇后的一个示例性结果。 在该示例中， 通信系统的主系统网络为中继网络，采用自然簇化的方法进行链路簇 化； 而次系统则采用以用户链路作为簇的簇化方法。 自然簇以基站或 中继站及其直接服务的任意一个用户之间的链路来表示。 如图 17所 示， BS或 RS直接服务的用户仅以一个下角标与其相同的节点 P表 示。例如， B0与其直接服务的用户形成的簇用 P0到 B0的链路表示。
[79] 通过对通信系统中的链路进行簇化，可以在后续的测量中以链路 簇为单位进行互斥关系的分析和测量。 进一步地， 在后续的资源分配 中， 也可以用链路簇为单位进行粗粒度的资源分配， 再在每个链路簇 内以链路为单位进行细粒度的资源分配。 利用链路簇化， 能够减少资 源管理信息的分析测量的计算量，并有利于在进行资源分配时在复杂 度和最终系统性能间进行平衡。 [80] 当然， 该簇化步骤 S1504-2是可选的。
[81] 另外， 当通信系统仅有局部的工作状态发生变化， 也可以不进行 簇化。 在这种情况下， 可以直接执行步骤 S1504-5, 进行第 3类互斥 关系测量。
[82] 在步骤 1504-3 中， 才艮据通信系统中各节点的天线配置、 收发装 置的配置等情况（这些信息可以从例如主系统的主控节点和次系统的 主控设备中获得， 这里不详细描述）， 进行第 1、 2类互斥关系的分析 和测量。 例如， 当某个节点仅配置有单个接收或发射天线时， 则其不 能同时从多个源接收不同信号、或者不能同时向多个目标发送不同信 号， 因而相应的链 之间存在第 1类互斥关系。 如图 14中所示， 在 节点 B。仅配置有单套^装置的情况下， 节点 B。不能同时从中继站 和 接收信号， 因此， 链路 Ri→B。与链路 R2→B。之间存在第 1 类互斥关系。 又如， 第 2类互斥关系表示一个节点不能同时进^ f亍接收 和发送， 图 14的中继站节点 R3 (假设该节点仅配置有单套收发装置） 不能同时接收来自主用户节点 P31的信号并向中继站节点 发送信 号， 因此， 链路 P^ Rs与链路 之间存在第 2类互斥关系。 为 了图示简洁， 假设图 14例示的各个节点均仅配置有单套 装置。 应该理解， 这是示例性的， 不应被视为将本发明限制于此。 在实际的 应用中， 通信系统中的各个节点（如基站、 中继站或移动站等）均可 以配置多套收发装置。 例如， 如果图 14的节点 B。配置有多套收发装 置， 则图 14所示的模型中， 可以从该节点 B。引出多 ¾路。 这些链 路可以用于在节点 B。与其他节点之间进行信号传输， 互不干扰。 这 些链路与其他链路的互斥关系可以采用上面示例中的方法来分析、测 量， 这里不再赘述。
[83] 在一个示例中， 在进行了无线链路簇化（步骤 S1504-2 )后， 可 以依据各链路簇之间的关系来定义其之间的第 1、 2类互斥关系。 根 据各个链路簇的节点的天线和收发装置的配置情况 , 即可分析判断各 簇之间是否存在第 1、 2类互斥关系， 从而得到链路簇之间的 1、 2类 互斥关系信息。 另外， 根据每个链路簇内各节点的天线和收发装置的 配置情况等， 得到该簇内各链路之间的 1、 2类互斥关系信息。
[84] 在另一示例中， 在没有进行链路簇化的情况下， 可以根据通信系 统中各个节点的天线和收发装置的配置情况， 来分析、 判断各节点之 间是否存在第 1、 2类互斥关系， 从而得到各链 之间的 1、 2类互斥 关系信息。
[85] 在步骤 1504-5中， 根据各链路之间是否存在信号覆盖范围重叠， 来进行链路间的第 3类互斥关系的分析和测量。
[86] 如果源节点和目的节点均不相同的两条链路由于信号覆盖范围 发生重叠而有可能发生同频干扰，则这两条链路之间可存在第 3类互 斥关系。 如图 14中所示， 链路 与链路 具有不同的源 节点和目的节点， 但由于二者的信号覆盖范围存在重叠， 因此， 二者 之间存在第 3类互斥关系。
[87] 作为一个示例， 步骤 S1504-5可以包括两个子步骤 S1504-51和 S1504-52„在步骤 S1504-51中，选取被测链路，分配并发布测量时隙。 当系统状态只有局部改变时， 仅需对部分链路进行测量。 这就需要根 据局部改变所涉及的节点来选取被测链路。 然后， 为被测链路分配时 隙， 并将分配的时隙通知到参与测量的节点。 如上所述， 参与测量的 节点可以是有可能受到上述局部改变影响的相关节点，比如上述局部 改变所涉及的局部区域中的一个或多个空闲节点。 例如， 假设通信系 统中新加入了一个用户节点 Px， 其直接 J§ 务的中继站为 Rx， 则这两 个节点之间的链路为新增链路 Rx Px, 与 Rx相邻的几个中继站及其 下的用户可视为潜在与该链路产生相互干扰的相关节点。 在进行第 3 类互斥关系的测量时， 可以选择节点 Px及这些相关节点等节点之间 的链路作为被测链路。 为链路！^^^^^分配测量时隙， 当到达该测量 时隙时， 可以由这些相关节点中的一个或更多个空闲节点进行测量。 在步骤 S1504-52 中， 由参与测量的节点在所分配的时隙实施测量。 具体地， 在所分配的时隙， 通过被测链路进行信号发送， 参与测量的 节点监听该信号。 如果监听到的信号达到某种标准， 比如监听到信号 强度超过一定的阈值，则可认为被测链路对该节点的数据接收产生干 扰，从而可以确定该被测链路与该参与测量的节点的相应链路之间存 在第 3类互斥关系。应理解， 上述采集第 3类互斥关系的方法是示例 性的， 不应被视为将本发明限制于此。 根据实际需要， 可以采用其他 任何适当的方法来采集这些信息， 这里不——列举。
[88] 在一个示例中， 可以忽略上述步骤 S1504-l。 例如， 可以将专属 时间测量机制作为默认测量机制对通信系统中的第 1、 2和 3类互斥 关系进行分析和 /或测量。 又如， 还可以将数据传输过程测量机制作 为默认机制对第 1、 2和 3类互斥关系进行分析和 /或测量。 [89] 图 16示出了进行了无线链路簇化的情况下采集业务流信息的一 个示例性方法。 如图 16所示， 该方法包括步骤 S1604-2和 S1604-4。 在步骤 S1604-2中， 进行簇化链路业务流统计， 即统计每个相关链路 簇的业务流。 具体地， 可以根据相关用户的带宽需求信息（这些信息 可以从例如主系统的主控节点和次系统的主控设备中获得，这里不详 细描述）， 来计算每个链路簇的总带宽需求， 从而得到该链路簇的业 务流信息。每个链路簇内的各个链路的带宽需求的总和即为该链路簇 的总带宽需求。 在步骤 S1604-4中， 进行其它链路业务流统计， 即计 算非簇化链路的带宽需求。 非簇链路通常是用来进行数据转发的， 其 带宽需求为由其转发所需的带宽总量。 例如， 图 17中所示的链路 —B。所需的带宽为用于转发来自链路 R3→Ri, 链路 ¾— 和链路 的数据所需的带宽的总和。
[90] 在另一示例中， 在没有进行无线链路簇化的情况下， 可以根据相 关用户的带宽需求信息来分别计算每个链路的带宽需求，从而统计得 到通信系统的业务流信息。
[91] 在一个示例中， 当通信系统中仅局部区域发生变化导致仅仅局部 区域的节点的业务流发生改变时，可以仅重新采集该局部区域的业务 流信息。
[92] 应该理解， 上述对资源管理信息进行重新采集的方法是示例性 的， 而非穷尽性的， 不应被视为将本发明局限于此。 可以采用其他任 何适当的技术和方法来采集通信系统的资源管理信息，在此不一一列 举。
[93] 作为一个示例，所采集的通信系统的资源管理信息可以保存在该 通信系统的主控节点（如主系统中的基站）中。 作为另一示例， 所采 集的资源管理信息也可以分布式地保存在该通信系统的其他节点中， 如保存在一个或更多个中继站或计算能力较强的用户节点中， 具体 地，每个中继站或计算能力较强的用户节点可以保存其所在的局部区 域的资源管理信息。系统的资源管理信息的保存，可以根据实际需要、 利用任何适当的技术来实现， 这里不作详述。
[94] 图 5 示出了根据本发明的另一实施例的资源管理方法的示意性 流程图。 图 5所示的方法与图 4的实施例相似， 不同之处在于， 图 5 所示的方法还包括对通信系统中的无线链路进行簇化的步骤。 [95] 如图 5所示， 该资源管理方法包括步驟 S502、 S504-l、 S504-2 和 S506, 并且还包括步骤 S501。
[96] 在步骤 S501中， 对通信系统中的链路进行分簇， 以获得一个或 更多个链路簇。 这样， 后续的处理步骤可以用链路簇为单位进行。 可 以采用与上述示例 /实施例中相似的方法对链路进行簇化， 这里不再 重复。
[97] 其他步骤 S502、 S504-l、 S504-2和 S506与图 4中的步骤 S402、 S404-l、 S404-2和 S406相似， 这里不再重复。
[98] 作为一个具体示例， 在对链路进行簇化之后， 重新采集有关链路 间的干扰状态的信息的步骤 S504-1 可以包括： 获取各链路簇之间的 干扰状态信息以及每个簇内链路间的干扰状态信息。
[99] 作为另一具体示例， 在对链路进行簇化之后， 重新采集业务流的 信息的步骤 S504-2可以包括： 获取每个链路簇的业务流信息。
[100] 另外，在图 5的方法中，链路簇化步骤 S501被示出为在步骤 S502 之前执行。 在另一示例中， 该链路簇化步骤还可在步骤 S502之后或 其他适当的时机进行， 这里不 列举。
[101] 利用链路簇化，能够减少重新采集资源管理信息的过程中的工作 量， 从而降低通信系统的负荷。
[102] 图 6、 图 7和图 8分别示出了才艮据本发明的实施例的用于确定资 源分配策略的方法的示例性流程图。
[103] 图 6、 图 7或图 8所示的方法用于根据通信系统的资源管理信息 来确定该通信系统的资源分配策略。这里所述的资源管理信息与上述 实施例 /示例中的资源管理信息相同， 并可以采用上述实施例 /示例中 的相关方法来采集， 这里不再重复。
[104] 图 6所示的方法包括步骤 S606和 S608, 具体地， 在步骤 S606 中，建立所述资源管理信息与通信系统的资源分配目标之间的量化关 系。 在步骤 S606中， 根据所建立的量化关系来确定通信系统的资源 分配策略。
[105] 在图 7所示的实施例中，对图 6所示的建立量化关系的步骤进行 了进一步细化。 如图 7所示， 根据所述资源管理信息来确定所述通信 系统的资源分配策略的步驟可以包括两个子步骤 S706-1和 S706-2。 在步骤 S706-1 中， 根据所述资源管理信息来建立资源分配模型。 该 资源分配模型可以反映通信系统中各链^间的相邻关系、各链^ 间的互斥关系以及每个链路的带宽需求和优先等级等。在步骤 S706-2 中， 根据所述资源分配模型来建立资源分配约束条件， 并量化资源分 配目标。 步骤 S708与图 6所示的步骤 S608相似， 这里不再重复。
[106] 在一个示例中，在根据所述资源管理信息来确定所述通信系统的 资源分配策略的步骤之前，还可以包括对通信系统的无线链路进行分 簇的步骤（如前述实施例中所述， 这里不再重复）。 在该示例中， 在 步骤 S706-1 中所建立的资源分配模型可以反映各链路簇之间的相邻 关系、各链路簇之间的互斥关系以及每个链路簇的带宽需求和优先等 级等信息。通过链路簇化，可以降低建立资源分配模型的计算复杂度。
[107] 图 18示例性地示出了如何利用图论的方法、 根据所述资源管理 信息来建立资源分配模型的过程。 如图 18所示， 建立通信系统的资 源分配模型的过程可以包括三个步骤 S1801、 S1802和 S1803。
[108] 在步骤 S1801中，根据通信系统中各链路的相邻关系来构造线图 ( Line Graph )„ 为了描述方便， 这里以图 17示出的网络结构为例。 用字母 T表示图 17所示的图。 图 18(a)所示为根据图 17所示的图而 构造的线图， 用 T'表示。 如图 18(a)所示， T'中的顶点 （Vertex )对 应 T 中的有向弧（Arc, 即无线链路）。 有向弧的箭头指向的是头 ( Head )顶点， 而其箭尾指向的是尾（Tail )顶点。 主系统网络中的 链路以空心点来表示， 次系统网络中的链路以实心点表示。 T'中任两 顶点间用有向 ^目连当且仅当该两顶点在 τ中对应两个相邻的弧（一 个弧的头顶点是另一个弧的尾顶点）， 并且 T'中弧的方向与其顶点在 T中对应的弧保持方向一致， 以表示数据的流向。 例如， 图 17中的 链路 R3→ Ri和链路 → B。在图 18(a)中分别转化为两个顶点 和 RxBo, 并且由从 指向 Β。的^目连。
[109] 在步骤 S1802中， 加载各链路间的互斥关系。 T'中的任意两个顶 点间用无向边（Edge )相连当且仅当该两顶点在 T 中对应的两个弧 之间存在第 1、 2或 3类互斥关系， 从而得到如图 18(b)所示的图 T"。
[110] 在步骤 S1803中，加载实际的带宽需求。赋予 Τ"的顶点以权值， 从而形成图 18(c)所示的图 G。 一个顶点的权值对应于该顶点在 T中 的对应弧的带宽需求， 如图 18(c)中各顶点内的数值所示。 如果实际 带宽需求非整数值， 可通过归一化处理得到整数值， 以备后续操作使 用。
[111] 图 G可以称为分级加权混合图（Hierarchically Weighted Mixed Graph)。 这里， 所谓的 "分级" 表示图 G中的各顶点有不同的优先 等级。 例如， 本示例包含两个优先等级（即主系统和次系统）， 分别 以空心点和实心点进行区分。 所谓的 "加权" 表示图 G 中的各顶点 有权值。 所谓的 "混合图" 表示图 G 中各顶点间具有有向弧和无向 边两类连接方式。
[112] 通过上述方法， 可以建立通信系统的资源分配模型。 下面给出根 据所建立的资源分配模型来建立资源分配约束条件并量化资源分配 目标的一些示例。
[113] 通过上述示例中的资源分配模型， 即图 G， 通信系统的资源共享 分配问题可以映射为对图 G的多重染色（ Multicoloring )问题， 也称 为分级加权混合图多重染色 (Hierarchically Weighted Mixed Graph Multicoloring, 下文简称为 H丽 2 )问题。
[114] 为便于理解后续内容， 首先介绍将要使用的一些符号和术语。符 号 " e"表示 "属于"， 比如， 表示 属于集合 w; 符号 "3" 表示"存在"，比如， eN表示至少存在一个元素 ,该元素属于集合 N; 符号 "V"表示 "任意"， 比如， v¾ eN表示集合 N中的任意一个元素 在该示例中， N表示自然数集合， [w]表示自然数区间 {"+1,..., ·}，其中 i,jeN i≤ j。 1X 1表示集合 X的势（Cardinality), 即集合 X中元素的 个数。 图 G可具体表示为四元组 0/,A,E,«)， 其中， 表示顶点集合， A表示有向弧集合, E表示无向边集合， 而 w表示权值集合。 按优先 等级划分， 顶点集合 V可以由向量 ( … )表示， 其中 V,表示优先等 级为第 类的顶点的集合， e[l..m]， m表示顶点的优先等级的数量。
M vi =v (即所有 的并集为 V ), 且若 ≠ ， 则 nv,= (即当 ≠ 时， ^与 的交集为空集）。 的顶点优先级高于 的顶点当且仅当 i< j。 顶点 V对应的顶点优先等级可表示为 r(v)e[l..m]， 即 v e (v)。 若有 向!^的尾項点为 "ey， 头顶点为 vey， 则该有向 ϋ己做 也可 称为 （顶点 V的）前趋顶点， V也可称为 （顶点 w的）后继顶点。 顶点 V所有前趋顶点组成的集合可以表示为 /^) = {¾1 , ^)£^}。 连接顶 点 和！的无向边可表示为 [W,v|。 顶点的集合 V中的顶点 veV的权值用 ov来表示。
[115] 一般而言， 对于分级加权混合图 G的多重染色 Ψ是从图 G的顶 点集合 V到自然数集合 N的幂集（Power Set) 2W的一种映射， 即
Ψ： V→ 2W。 该映射为顶点集合 V中的每个顶点 V e V分配 I Ψ(ν) 1= ων个不 同的数或称颜色（Color), 并且满足以下条件： 由无向边相连的两个 顶点所分得的颜色的集合不相交（ disjoint )、 由有向弧相连的两个顶 点所分得的颜色的集合符合前趋 ( Precedence ) P艮制以及具有不同优 先等级的顶点遵守优先级约束。 顶点 V所分得的最小颜色可表示为 s^{v) = min{ 1 i e Ψ(ν)} , 其 所 分 得 的 最 大 颜 色 可 表 示 为 ψ (V) = max{ 1 i e Ψ(ν)}。顶点集合 中的所有顶点所分得的颜色中的最大 颜色 i己做 fw = max{fw(v) \veV}0
[116] 颜色集合如同自然数集合一样是有序的集合，颜色序号和自然数 一一对应。 在该示例中， 对颜色和自然数不加区分， 提到颜色就是指 其对应的自然数。 染色过程将按照颜色从小到大进行分配。 在多重染 色 Ψ中， 颜色 被分配给的所有顶点组成的集合可以记做
Γψ(ζ·) = {ν| Ψ(ν),νεν}。 设顶点 ve 分配到的某颜色为 ^Ψ(ν), 则比顶 点 V优先等级高且在集合 Γψ(ς·)中的顶点所组成的集合可以记做 Λψ (V, ς) = \ Ml..r(v i] ^ ΠΓΨ (^； 而比 ν优先等级高但不在 Γψ (ς·)中的顶点所 组成的集合可以记做 Χψ(ν,ς·) = V -Αψ(ς)。
[117] 下面针对各类约束条件和优化目标对 H丽 2问题（通信系统的资 源共享分配问题）进行分类和描述。
[118] I、 约束条件的建立
[119] 根据约束 可以从两个方面对 H丽 2问题进行分类。
[120] 在一个方面， 可以将 H丽 2问题分为非抢占式 (Non-preemptive) 和抢占式 (Preemptive)两类。 非抢占式H丽2中，任意一个顶点分得的 颜色是连续的，对应的资源分配的意义是一个链路分得的资源块在资 源块有序集合上是连续的，对应机器调度的意义是一个机器节点一旦 开始调度必须连续工作到该节点任务完成才能结束调度。 在抢占式 H丽 2中， 任意一个顶点分得的颜色允许不连续， 对应的资源分配的 意义是一个链路分得的资源块可以不连续，对应的机器调度的意义是 一个机器节点在其调度过程中可以随时暂停再在稍后的某个时间重 新开始调度。
[121] 在另一方面，可以将 H丽 2问题分为非交叉式（Non-interleaving ) 和交叉式（Interleaving ) 两类。 在非交叉式H丽2中， 任意一个顶点 分得的最小颜色大于其前趋顶点分得的最大颜色，对应的资源分配的 意义是一个链路分得的资源块在资源块有序集合上滞后于其前趋链 路分得的资源块（以中继网络为例， 负责中继转发的链路只有从其前 趋链路接收到数据后才可能进行转发）； 对应作业调度（如流水线作 业调度）的意义是一个加工环节在获取其前趋环节加工的所有对象后 才能开始下一个环节的加工，原因可能是这两个相邻环节所需的工具 或资源冲突。 在交叉式 H丽 2中， 在任意前 N个可用颜色中， 任意 一个顶点分得的颜色数目不超过其所有前趋顶点分得的颜色数目之 和， 对应的资源分配的意义是资源块有序集合的前 ^个资源块中任一 链路分得的资源块数量不超过其前趋链路分得的资源块数量之和（以 中继网络为例，任意时刻负责中继转发的链路转发的数据只可能是其 从前趋链路接收到的数据的子集）； 对应的作业调度（如流水线作业 调度）的意义是一个加工环节一旦从前趋环节获得加工对象可以立即 进行加工， 因为两个环节使用的工具或资源不冲突。
[122] 表 2示出了根据约束 从上述两个方面进行分类的 H丽 2问 题： 表 1 H丽 2问题根据约束 ^来分类
非抢占式 抢占式
(Non-preemptive) (Preemptive) 非交叉式 HWM2 HWMp 2 ni
(Non-interleaving)
交叉式 - HWM2.
(Interleaving)
[123] 根据表 2， 综合以上两种约束 可以将"丽2问题分为 3类。
[124] 第 1 类"丽2问题可称为非抢占-非交叉式 H M2 , 即表 2 中的
[125] 分^ 权混合图 G的非抢占-非交叉式多重染色H醫 可以记做 ： →2 给每个顶点 ve 分配 ΙΨ^»^个不同的颜色， 同时需
Figure imgf000023_0001
(!) veV,^ ,(v) = ½ ,(v) + -l)
(2) / (u) < s (v),^(u,v) e A
(3) ψ (")r ,若 [", E
(4) g e Ψ (v), Vu e Αψ^ (v, ς), 3w e Λψ^ (v, ς), (u, w) e A,或 (w, u) e A,或 [w, w]eE
[126] 其中， 条件 (1)表示任意顶点 v分配得到的最大颜色 /ψ (ν)等于其 所分配得到的最小颜色 raW与所分得的颜色数 之和减 1， 即任意 顶点 V分配到的颜色是连续的。条件 (2)表示有向弧 A的尾顶点"所分得 的最大颜色/ Ψ (Μ)小于该弧的头顶点 V所分得的最小颜色 W，即任 意顶点 v的染色开始不能超前于其前趋顶点"染色的结束。 条件 (3)表 示任意由边相连的顶点 V和 "分配到的颜色不相交。 条件 (4)表示任意 顶点 V的染色不能优先于比其优先等级高的顶点。
[127] 第 2 类^ yM2问题可称为抢占-非交叉式 H丽 2， 即表 2 中的 顧 2 。 [128] 分级加权混合图 G 的抢占-非交叉式多重染色H丽 可以记做 · ^ ~ ^ 2 o给每个顶点 V V分配 I Ψ . (V) 1= ων个不同的颜色， 同时满足 以下糸 (5)-(7)：
(5) /ψ (u)<sv (V),^ET(U,V) e A (6) ψρηί ( )ΠΨρηί(ν) =
Figure imgf000024_0001
(7) Υζτ e Ψρηί (ν)， Vw e Αψ^ (ν， ς), 3w e Λψ (ν， ς), (u, w) e Λ,或 (w， u) e Λ,或 [ , w] e E
[129] 其中， /Ψ （")表示顶点 "所分得的最大颜色， (V)表示顶点 V所 分得的最小颜色。条件 (5)表示对于由有向弧 Α相连的顶点"和 V ,尾顶 点"所分得的最大颜色 小于该弧的头顶点 V所分得的最小颜色 sVpm (V)， 即任意顶点 V的染色开始不能超前于其前趋顶点"染色的结 束。 条件 (6)表示任意由边相连的顶点 V和"分配到的颜色不相交。 条 件 (7)表示任意顶点 V的染色不能优先于比其优先等级高的顶点。
[130] 第 3类"丽2问题可称为抢占-交叉式 H丽 2, 即表 2中的H丽 ,。 [131] 分级加权混合图 G 的抢占-交叉式多重染色H丽 ^可以记做
Ψ≠ '.ν→2Ν。 给每个顶点 ve 分配 ΙΨρ»^个不同的颜色， 同时需要 满足以下 Η8)-(11):
Figure imgf000024_0002
(9) Ψρ )门 » = ^,若
(10) ψ^ΠΨ» ^:^
(11) e Ψ^. (ν), Vw e Λψρ_ (ν, ς), 3w e Λψρ_ (ν, ς), (u, w) e Α,或 (w, ) e A,或 [ , w] e E
[132] 其中， 条件 (8)表示任意前 个可用颜色中任意一个顶点 v分得 的颜色数目不超过其所有前趋顶点" eP(v)分得的颜色数目之和。 条件 (9)表示任意由有向弧相连的顶点"和 V分配到的颜色不相交。条件 (10) 表示任意由无向边相连的顶点"和 V分配到的颜色不相交。 条件 (11)表 示任意顶点 V的染色不能优先于比其优先等级高的顶点。
[133] II、 优化目标的量化
[134] 染色的优化目标通常是： 使用最少的颜色数完成染色。在该示例 中，设计了关于多重染色 Ψ中各顶点 V分配到的最大颜色 /ψ (V)的函数， 该函数可记做 ΘΨ(σ) = ν^Α/Ψ ( 其中， Α表示系数。 根据不同的优 化目标， 可以设定不同的系数 A。 换言之， 不同的系数 A可以反映不 同的优化目标。 通过设定不同的系数 A， 即可达到量化优化目标的目 的。
[135] 下面给出示用于根据优化目标来设定系数 βν的三个示例。 [136] 在第一示例中， 采用下列公式（1-1)来设定系数 A：
Figure imgf000025_0001
[137] 在该示例中， 可以得到0^(^)=|]^(^)11/|]^(^)1 ^=^。 使得函数
Θψ(σ)取得最小值的优化目标， 即求得图 G的多重染色 Ψ所需的最少 的总颜色数。 该颜色数叫做多重染色 Ψ的加权色数 (Weighted Chromatic Number),记做 Z (G)。对应于表 2中所示的 3类多重染色 问题的加权色数分别可以记做： (G) , (G)和; ^ (G)。 该优化目 标对应的资源分配方案能够使得系统吞吐量（ Throughput )达到最大。 换言之，如果通信系统的资源分配的优化目标是使得系统的吞吐量最 大， 则可以公式（1-1)来设定系数 A。
[138] 在第二示例中， 采用下列公式（1-2)来设定系数 A：
Figure imgf000025_0002
[139] 在该示例中， 可以得到0^(?) =
Figure imgf000025_0003
∑^^( 。 使得 ΘΨ(σ)最小的 优化目标， 即求得图 G所有顶点分得的最大颜色数的平均值的最小 值。 该优化目标对应的资源分配方案能够使得各链路的平均时延
(Delay)达到最小。 换言之， 如果通信系统的资源分配的优化目标 是使得各链路的平均时延最小， 则可以公式（1-2)来设定系数 A。
[140] 在第三示例中， 采用下列公式（1-3)来设定系数 A：
v =g(r(v)) ,veV (1-3)
[141] 在公式（1-3)中， 表示任意函数。 在该示例中， 相同优先等 级的顶点 V具有相同的系数 A。 例如，若给定优先等级 e [ .m]，则在 ^ [l/i r^max^ ^ l v e yj) ! = 的情形下， 使得 (G)最小的优化
[0 ， r(v)≠ ί. 目标即求得第 类优先等级的顶点染色全部完成时所需的最少的总颜 色数。 在中继网络的开放式频傳访问体系中， 当 = 1时， 该优化目标 对应于主系统中完成所有用户业务所需的资源最少。 [142] 在上述三个示例中， 通过设定不同的系数 Α， 可将不同的资源分 配优化目标量化。 换言之， 利用上述方法， 能够实现根据资源分配的 约束条件来量化资源分配的优化目标的目的。
[143] 以上给出了用于根据资源分配模型来建立资源分配的约束条件、 并量化资源分配的优化目标的一些示例。应该理解， 这些示例是说明 性的， 并非穷尽性的， 因此， 不应被视为将本发明局限于此。
[144] 另外，上述分级加权混合图多重染色的方法可应用于具有相似约 束条件的多优先等级的系统资源共享管理。除了可应用于通信系统的 资源共享管理之外， 还可以应用于机器调度， 如流水线机器调度等。
[145] 图 8 示出了根据本发明的另一实施例的用于根据通信系统的资 源管理信息来确定资源分配策略的方法的示例性流程图。
[146] 在图 8所示的实施例中，对根据所建立的量化关系来确定通信系 统的资源分配策略的步骤进行了进一步细化。 如图 8所示， 根据所建 立的量化关系来确定所述资源分配策略的步骤可以包括两个子步骤 S808-1和 S808-2。 在子步骤 S808-1中， 将所述资源分配模型中的各 链^ #序， 选择可同时被分配资源的链路。 在子步骤 S808-2 中， 根 据所述资源分配约束条件和量化的资源分配目标，为所选择的每个链 路分配资源。
[147] 在一个示例中，在根据所建立的量化关系来确定通信系统的资源 分配策略的步骤之前，还可以包括对通信系统中的无线链路进行簇化 的步骤（如前述实施例所述， 这里不再重复）。 在该示例中， 所建立 的资源分配模型可以反映各链路簇之间的相邻关系、各链路簇之间的 互斥关系以及每个链路簇的带宽需求和优先等级等信息。步骤 S808-1 可包括： 将资源分配模型中的各链路簇排序， 选择可同时被分配资源 的链路簇； 步骤 S808-2可包括： 才艮据所述资源分配约束条件和量化 的资源分配目标， 为所选择的每个链路簇分配资源。 另外， 在该示例 中，所述确定通信系统的资源分配策略的过程还可包括将分配给每个 链路簇的资源进一步分配给该链路簇中的各个链路的步骤。通过链路 簇化， 可以降低资源分配策略的决策过程的复杂度。
[148] 图 19给出了根据通信系统的资源管理信息与资源分配目标之间 的量化关系来确定通信系统的资源分配策略的一个具体示例。
[149] 如图 19所示， 该方法包含簇间资源分配和簇内资源分配两个步 骤， 即图 19中的步骤 S1908和 S1910。
[150] 在步骤 S1908中， 进行簇间资源分配。换言之， 求解^丽2问题。 因为该问题的各种优化目标都是 NP-hard问题（即在多项式时间内无 法求到的最优解）， 而通信系统（如开放式频傳访问体系） 中的资源 分配需要周期性地频繁地进行， 因此可以采用一些近似算法得到次优 的分配策略， 以在系统性能和计算复杂度之间进行平衡。 图 19的示 例给出了一种近似求解方案。 图 19所示的方法中的各个步骤是以图 17和 18所示的图 T和图 G为例来描述的。该示例性方法适合基于表 2中的 3类约束条件的多重染色问题,示例的优化目标为求加权色数。 如图 19所示， 簇间资源分配步骤包括 5个子步骤。
[151] 在步骤 S1908-1中， 初始化图 T。 在经过初始化的图 Τ的初始状 态中， 与分级加权混合图 G相比， 其区别仅在于图 Τ中的具有前趋 顶点的顶点的权值为零。 图 G中的顶点相互制约， 因此对图 G中的 顶点染色存在先后顺序的不同。 图 Τ中的顶点若符合 "权值不为零" 的条件， 则表明该顶点当前可以被染色， 即该顶点可以获得资源。
[152] 在步骤 S1908-2中，选择可染色顶点并对所选择的顶点进行排序。 具体地， 首先选择图 Τ中的当前可染色顶点， 即图 Τ中的权值不为 零的顶点。 然后， 将这些被选择的可染色顶点排序。
[153] 应理解， 丽 2问题的最优解是对每个颜色从某个有序序列中按 照顺序选择顶点进行染色而得到的，而近似解中的排序目标是尽可能 地让更多的顶点同时获得资源， 以逼近最优解。
[154] 作为一个示例， 一种可能的对顶点进行排序的规则为： （1 )不同 优先等级的顶点按优先等级从高到低进行排序， （2 )具有相同优先等 级的顶点按该顶点为终点的有向路径的长度从小到大进行排序 (有向 路径的长度为有向路径上有向弧的个数）， ( 3 )具有相同的有向路径 长度的顶点按该顶点为起点的有向路径上各顶点的权值之和从大到 小进行排序， 以及（4 )剩余的顶点可以随机排序。 这样可得到有序 的可染色顶点集， 该可染色顶点集可记做 z。
[155] 在步骤 S1908-3中， 对可染色顶点集中的各个顶点进行染色。 具 体地， 从集合 z中选择同时被染色顶点， 并为其分配颜色。 作为一个 示例， 一种可能的选择同时被染色顶点的方法是： 按顺序依次考察集 合 z中的各顶点，得到极大独立集（Maximal Independent Set ), 该极 大独立集可以记做 。 在极大独立集 中， 任何两个顶点间无弧无边 相连。 同时分配的颜色数" （1≤"≤极大独立集 中顶点的权值的最 大值） 的取值不同会影响到资源分配的计算量。 "的值越大（即同时 分配的颜色数越多）， 算法循环次数越少， 计算量也会随之减少。 但 最终所分配的颜色总数会有所增加。
[156] 在步骤 S1908-4中， 对图 T中各顶点的权值进行修改。 具体地， 用每个顶点的权值减去该顶点所分配到的颜色数"。 如果某个顶点被 分配的颜色总和已经达到其在图 G 中的权值， 则标记该顶点状态为 染色完成（ Colored )。
[157] 在步骤 S1908-5中，判断图 T中是否所有顶点都已经被标注为染 色完成。 如果是， 则整个染色过程结束。 否则， 转入步骤 S1908-2, 新一漏环。
[158] 在步骤 S1910中， 进行簇内资源分配。
[159] 将在步骤 S1908 中分配给每个簇的资源进一步分配给每个簇内 的每一个无线链路。 当一个簇是多个自然簇的聚集时， 可将各个自然 簇当作顶点形成新的 WWW2问题， 并按照上述方法进行求解。 当一个 簇为自然簇或者自然簇的子集时，可以使用任何适当的资源分配方法 进行簇内分配， 例如可以利用点到多点 （ Point-to-Multipoint )架构 的通信网络的各种资源分配方法进行分配， 这里不 详述。 这样即 可得到为通信系统中的每个链路分配的资源数量。
[160] 图 9 示出了根据本发明的一个实施例的资源管理方法的示意性 流程图。 图 9所示的资源管理方法以图 3所示的实施例的基础， 并利 用了图 6-8中所示的用于确定资源分配策略的方法。
[161] 如图 9所示，该资源管理方法包括步骤 S902、S904、S906和 S908。 其中， 步骤 S902与图 3的步骤 S302或图 4的步骤 S402等相似； 步 骤 S904与图 3的步骤 S304或图 4的步骤 S404-1和 S404-2等相似； 步骤 S906与图 6的步骤 S806、 或图 7的步骤 S706-1和 S706-2或图 8的步骤 S806-1和 S806-2等相似； 步骤 S908与图 6的步骤 S808、 或图 7的步骤 S708或图 8的步骤 S808-1和 S808-2等相似。 这里不 再重复。
[162] 图 10示出了根据本发明的另一实施例的资源管理方法的示意性 流程图。 图 10所示的资源管理方法与图 9所示的实施例相似， 不同 之处在于图 10所示的方法还包括一个链路簇化步骤。
[163] 如图 10所示， 该资源管理方法包括步骤 S1001、 S1002、 S1004、 S1006和 S1008。 在步骤 S1001中， 对通信系统中的无线链路进行分 簇， 以得到一个或更多个链路簇。 通过链路簇化， 可以降低资源管理 信息的采集过程中的工作量，并可以降低资源分配策略的决策过程的 复杂度。 可以采用上述实施例和 /或示例中的链路簇化方法， 这里不 再赘述。
[164] 另外， 该链路簇化步骤 1001不局限于在步骤 S1002之前执行。 在另一示例中， 根据实际需要， 该步骤 1001还可以在资源管理方法 的¾½中的任何适当的时机进行， 例如步骤 S1004之前、 步骤 S1006 之前等， 这里不——列举。
[165] 步骤 S1002、 S1004、 S1006和 S1008与图 9的步骤 S902、 S904、 S906和 S908相似， 这里不再重复。
[166] 图 11示出了根据本发明的一个实施例的用于选择资源分配机制 的方法的示例性流程图。 所述资源分配机制是指由通信系统（如开放 式频讲访问体系） 中的哪些节点来进行资源分配。 图 11的方法可以 根据通信系统的负载量的变化来自适应调整通信系统的资源分配机 制。
[167] 如图 11所示，该方法包括步骤 S1110和 S1112。在步骤 S1110中， 统计通信系统的负载量。作为一个示例， 负载量可根据一段时间内的 系统平均吞吐量占系统容量的比例来计算。 当然， 可以利用其他任何 适当的方法来统计通信系统的负载量， 这里不详细说明。 然后， 在步 骤 S1112中，根据所统计的负载量来选择用于执行资源分配策略的资 源分配机制，即才艮据所统计的负载量来选择由通信系统中的哪些节点 执行该通信系统的资源分配策略。
[168] 图 12给出了上述方法的一个示例。 如图 12所示， 在步骤 S1210 中统计了通信系统的负载量之后， 在步骤 S1212-1中， 才艮据所统计的 负载量来判断通信系统是处于轻负载状态还是处于重负载状态。如果 为轻负载， 则在步骤 S1212-2中， 选择集中式的资源分配机制； 如果 为重负载， 则在步骤 S1212-3中， 选择分布式的资源分配机制。
[169] 作为一个示例，可以通过判断所统计的负载量是否大于一预定的 阈值， 来判断通信系统为轻负载还是重负载。 例如， 当负载量大于该 阈值时， 可以确定为重负载， 否则为轻负载。 所述阈值可以才艮据实际 应用来设置， 这里不作任何限制。
[170] 在所述集中式的资源分配机制中， 由通信系统中的主控节点（如 基站或者主系统网络的基站）来集中分配通信系统的资源。 在这种资 源分配机制中 ,需要将资源管理信息以及资源分配的优化目标汇总到 基站， 由基站决策出资源分配策略， 再将资源分配结果发布给通信系 统中的相应的节点。
[171] 在所述分布式的资源分配机制中，通信系统中的多个节点可作为 局部决策节点， 由每个局部决策节点对其相应的局部区域的资源进行 分配。 之后， 由主控节点（如基站）对局部决策的结果进行协调（在 通信系统包括多个系统网络的情况下， 由主系统网络的基站进行协 调）， 从而得到最终的资源分配策略。 在此机制下， 各节点的资源管 理信息将会汇聚到其所在区域的局部决策节点，该局部决策节点对这 些局部信息进行分析和量化， 得到局部分配策略。 这些局部分配策略 进一步汇聚到基站（或主系统网络的基站）， 经协调得到通信系统的 全局资源分配策略。
[172] 不同的资源分配机制导致通信系统中各节点的功能划分不同，从 而产生传递的信息在类别、 数量、 对象等方面的区别， 最终导致通信 系统中交互信息的数量、 流向和发送时机的不同。 在图 10-11所示的 实施例中，能够才艮据通信系统的负载量的变化来自适应地选择与负载 量相适应的资源分配机制。 利用这种方式， 能够充分利用各节点的计 算和通信能力， 在系统的有效性能和系统开销之间进行平衡， 并能够 尽可能地提高系统的资源利用率。 例如， 当通信系统的负载较重时， 作为所有数据汇聚的目的地的主系统的基站， 必然负载较重。 而此时 通信系统中会有一些节点处于闲置状态，利用它们进行局部资源分配 决策， 能够减少基站的计算负担， 同时也能减少发往基站的资源分配 所需信息。 而当通信系统的负载减轻时， 又可以重新选择将所有资源 管理信息汇聚到基站， 由基站做出全局较优的分配决策， 从而能够优 化系统的性能。
[173] 图 11和图 12所示的选择资源分配机制的方法可应用于前述实施 例和 /或示例的资源管理方法中。图 13示出了应用了图 11所示的资源 分配机制的选择方法的资源管理方法的一个实施例。 如图 13所示， 所述资源管理方法包括步骤 S1302、 S1304、 S1306和 S1310、 S1312„ 其中， 步骤 S1302、 S1304、 S1306与图 3所示的步骤 S302、 S304和 S306相似，而步骤 S1310和 S1312与图 11所示的步骤 S1110和 S1112 相似， 这里不再重复。 该实施例除了能够根据通信系统的工作状态的 变化程度来自适应调 息采集策略之夕卜，还能够根据通信系统的负 载量的变化来自适应地选择与负载量相适应的资源分配机制。应该理 解， 图 13所示的实施例是示例性的， 并非穷尽性的。 例如， 图 11和 图 12所示的步骤还可以在图 4-图 10中的各步骤之后或之前或者在图 4-图 10中所示流程的过程中执行。 又如， 图 11和图 12所示的步骤 可以与图 3-图 10中所示¾½并行进行。 这里不 列举。
[174] 上述实施例和示例描述了对通信系统中的资源进行共享管理的 方法。 上述资源管理方法能够应用于开放式频傳体系结构中， 特别是 能够应用于多个网络共存的通信系统中。上述管理资源方法能够根据 系统结构的变化（包括主系统的节点 （如中继站） 的数量 /位置 /信号 覆盖范围 /移动性、 次系统的类型 / 莫 /个数等）来自适应地调整。 在 保证主系统的用户资源需求得到满足的同时， 尽可能地复用资源， 以 为次系统的用户提供资源使用机会， 提高整个系统的资源利用效率。
[175] 图 20示出了根据本发明的一个实施例的对通信系统中的资源进 行共享管理的资源管理系统。 与上述的方法实施例 /示例相似， 这里 所述资源可包括通信系统的时域资源、 频域资源、码域资源及其任何 组合，这里所述的通信系统可以是任何需要对系统资源进行动态分配 管理的通信系统， 例如具有开放式频傳访问体系特点的通信系统（例 如图 1和图 2所示的系统）。
[176] 如图 20所示， 该资源管理系统可以包括状态查询装置 2001、 信 息采集装置 2003和分配策略决策装置 2005。
[177] 状态查询装置 2001可以判断通信系统的工作状态的变化程度是 否会导致该通信系统的资源管理信息发生变化， 换言之， 状态查询装 置 2001可以根据通信系统的工作状态的变化程度来判断是否需要重 新采集该通信系统的资源管理信息， 如果是， 则状态查询装置 2001 指示所述信息采集装置 2003重新采集所述资源管理信息。 否则， 不 重新采集所述资源管理信息， 即利用之前采集或存储的资源管理信 息。
[178] 与前述方法实施例 /示例相似， 通信系统的资源管理信息是指能 够影响通信系统的资源管理、 分配策略的决策的信息， 包括但不限于 有关所述通信系统中各节点的状态、各链路间的干扰状态及业务流信 息等。 上文中已给出了资源管理信息的多个示例， 这里不再重复。
[179] 信息采集装置 2003可以根据所述状态查询装置 2001的指示来重 新采集通信系统的资源管理信息。
[180] 作为一个示例， 所采集的资源管理信息可存储在存储装置内， 该 存储装置可以位于资源管理系统中，也可以位于通信系统的某个节点 (如基站）中。 作为一个示例， 所采集的通信系统的资源管理信息可 以保存在通信系统的主节点（如主系统中的基站）中。作为另一示例， 所采集的资源管理信息也可以分布式地保存在该通信系统的其他节 点中， 如保存在一个或更多个中继站中， 具体地， 每个中继站可以保 存其所在的局部区域的管理信息。 系统的资源管理信息的保存， 可以 根据实际需要、 利用适当的技术来实现， 这里不作详述。 所述存储装 置可以是任何适当的存储介质， 包括但不限于软盘、 光盘、 磁光盘、 存储卡、 存储棒等等， 这里不一一列举。
[181] 分配策略决策装置 2005可以根据所述资源管理信息来确定通信 系统的资源分配策略。
[182] 在进行资源分配所需的信息的采集（如分析 /统计 /测量等）过程 中， 图 20所示的资源管理系统可以根据通信系统的工作状态的变化 程度来适应性地调整信息采集的策略，从而能够有效地降低信息采集 所需花费的系统开销。
[183] 状态查询装置 2001可以利用多种方法来判断通信系统的工作状 态的变化程度是否影响到了进行资源管理决策所需的信息（即是否需 要重新采集资源管理信息）。
[184] 作为一个示例， 当通信系统的工作状态的变化仅仅涉及到局部区 域时， 可以仅重新采集与该局部区域相关的资源管理信息， 与其他区 域相关的资源管理信息则采用之前采集或保存的信息。 作为另一示 例， 当通信系统的变化仅仅涉及到部分工作状态（如链路间的干扰状 态或业务流状态）时， 可以仅重新采集与该变化的工作状态相关的信 息。 例如， 当某个主用户节点移动， 导致其与其他节点之间的链路互 斥关系等发生变化而业务流未发生变化时，可以仅采集与相关链路的 互斥关系有关的信息，与该节点有关的业务流信息则可以采用之前采 集或保存的。 又如， 当某个主用户节点与其他节点之间的业务流发生 变化而链路间的干扰关系不变时，可以仅采集与该主用户节点相关的 业务流的信息。
[185] 图 21示出了根据本发明的另一实施例的资源管理系统。
[186] 图 21所示的资源管理系统与图 20相似，包括状态查询装置 2101、 信息采集装置 2103和分配策略决策装置 2105。与图 20的不同之处在 于， 信息采集装置 2103包括用于采集有关链路间的干扰状态的信息 的干扰状态采集单元 2103-1 和用于采集有关业务流的信息的业务流 采集单元 2103-2。 状态查询装置 2101可以被配置用于判断通信系统 的工作状态的变化是否影响到所述通信系统中各链路间的干扰状态， 若是， 则指示干扰状态采集单元 2103-1 重新采集有关链路间的干扰 状态的信息。 状态查询装置 2101还可以判断所述通信系统的工作状 态的变化是否导致所述通信系统的业流量的变化， 若是， 则指示业务 流采集单元 2103-2重新采集有关业务流的信息。 如果通信系统的工 作状态的变化既没有影响到通信系统中各链路间的干扰状态也没有 影响到通信系统的业务流量， 则确定不需要重新采集系统管理信息。 换言之， 在这种情况下， 可以不重新采集资源管理信息， 而可以利用 之前采集或保存的资源管理信息。分配策略决策装置 2105与图 20所 示的分配策略决策装置 2005相似， 这里不再重复。
[187] 与图 20所示的资源管理系统相似， 图 21所示的资源管理系统在 进行资源分配所需的信息的采集（如分析 /统计 /测量等）过程中， 可 以根据通信系统的工作状态的变化程度来适应性地调整信息采集的 策略，从而能够有效地降低信息采集所需花费的系统开销。具体而言， 可以根据通信系统的各区域的各种工作状态（某些节点之间的链路间 的互斥关系和某些节点的业务流的变化等）的变化程度来确定是否需 要重新采集资源管理信息以及需要重新采集哪些资源管理信息（在图 21的示例中采集有关链路间的互斥关系的信息、采集有关业务流的信 息或者采集二者）。
[188] 信息采集装置 2003或 2103可以根据上文所述的方法（例如参考 图 14-图 16所描述的各个实施例 /示例等）来采集通信系统的资源管 理信息， 这里不再重复。
[189] 图 22示出了根据本发明另一实施例的资源管理系统。 在该实施 例中， 在采集通信系统的资源管理信息之前， 还对通信系统的链路进 行分簇。
[190] 如图 22所示， 该资源管理系统包括状态查询装置 2201、 信息采 集装置 2203和分配策略决策装置 2205, 还包括链路簇化装置 2207。
[191] 状态查询装置 2201、 信息采集装置 2203 和分配策略决策装置 2205与图 20或 21中的对应装置相似。
[192] 链路簇化装置 2207可用于对通信系统中的链路进行分簇， 以获 得一个或更多个链路簇。 链路簇化装置 2207可采用上文中的示例 /实 施例中所描述的方法对链路进行簇化， 这里不再重复。信息采集装置 2203可利用该分簇的结果来采集资源管理信息。具体地，信息采集装 置 2203可以通过获取各链路簇间的干扰状态、 每个链路簇内的各链 路间的干扰状态及每个链路簇的业务流信息等来采集所述资源管理 信息 o
[193] 作为一个具体示例，在链路簇化装置 2207对链路进行簇化之后， 信息采集装置 2203可以通过获取各簇之间的干扰状态信息以及每个 簇内链路间的干扰状态信息来采集干扰状态信息，还可以通过获取每 个链路簇的业务流信息来采集业务流信息。 另外， 作为一个示例， 分 配策略据此装置 2205在才艮据资源管理信息确定资源分配策略的过程 中， 还可包括首先将资源分配每个链路簇， 然后再将分配给每个链路 簇的资源进一步分配给该链路簇中的各个链路（例如参考图 19所描 述的示例）。
[194] 图 22所示的资源管理系统对通信系统的链路进行簇化， 能够减 少重新采集资源管理信息的过程中的工作量，并能够降低资源分配策 略的决策过程的复杂度， 从而降低系统的负荷。
[195] 图 23示出了根据本发明的一个实施例的用于根据通信系统的资 源管理信息来确定通信系统的资源分配策略的分配策略决策装置。 [196] 图 23所示的分配策略决策装置 2305包括信息转化单元 2305-1 和确定单元 2305-2。 信息转化单元 2305-1可以建立通信系统的资源 管理信息与资源分配目标之间的量化关系， 而确定单元 2305-2可以 根据所建立的量化关系来确定通信系统的资源分配策略。作为一个具 体示例， 信息转化单元 2305-1 可以通过如下方式来建立所述量化关 系： 首先， 根据资源管理信息来建立资源分配模型， 然后， 根据所述 资源分配模型来建立资源分配约束条件， 并量化资源分配目标。 与前 述方法实施例 /示例相同， 这里所述的资源分配模型反映通信系统中 各链 之间的相邻关系、各链^间的互斥关系以及每个链路的带宽 需求和优先等级等。 信息转化单元 2305-1 可以采用上文所述的方法 (如参考图 7和图 18描述的实施例 /示例中的方法）来建立通信系统 的资源分配模型， 并可以采用上文所述的方法（如参考分级加权混合 图多重染色问题来描述的方法示例等）来建立各种约束条件、 量化资 源分配目标， 这里均不再重复。
[197] 作为另一具体示例， 确定单元 2305-2可以通过如下方式来确定 资源分配策略： 将所述资源分配模型中的各链路排序， 选择可同时被 分配资源的链路；并根据所述资源分配约束条件和量化的资源分配目 标， 为所选择的每个链路分配资源。 确定单元 2305-2可以采用上文 所述实施例 /示例（如参考图 8和 19所描述的实施例 /示例等）中的方 法来确定资源分配策略， 这里也不再重复。
[198] 图 24 示出了根据本发明的另一实施例的分配策略决策装置 2405。 与图 23所示的装置 2305相似， 图 24所示的装置 2405包括信 息转化单元 2405-1和确定单元 2405-2。 不同之处在于， 图 24所示的 装置 2405还包括链路簇化装置 2405-3。链路簇化装置 2405-3可用于 对通信系统中的链路进行分簇， 以获得一个或更多个链路簇。链路簇 化装置 2405-3可采用上文中的示例 /实施例中所描述的方法对链路进 行簇化， 这里不再重复。 在对通信系统的链路进行簇化之后， 信息转 化单元 2405-1 所建立的资源分配模型可以反映各链路簇之间的相邻 关系、各链路簇之间的互斥关系以及每个链路簇的带宽需求和优先等 级等信息。 确定单元 2405-2可以将资源分配模型中的各链路簇排序， 选择可同时被分配资源的链路簇，并根据资源分配约束条件和量化的 资源分配目标， 为所选择的每个链路簇分配资源。 确定单元 2405-2 还可以将分配给每个链路簇的资源进一步分配到该链路簇内的各个 链路。 可以看到， 通过链路簇化， 降低了资源分配策略的决策过程的 复杂度。
[199] 图 23或 24所示的分配策略决策装置 230或 2405可以应用于上 文所述的资源管理系统（如参考图 20-22所描述的资源管理系统）中， 这里不详细描述。
[200] 图 25示出了根据本发明的一个实施例用于确定通信系统的资源 分配机制的分配机制控制装置 2508。 与上述方法实施例 /示例相同， 所述的资源分配机制是指由通信系统（如开放式频傳访问体系）中的 哪些节点来进行资源分配。 图 25的控制装置 2508可以根据通信系统 的负载量的变化来自适应调整通信系统的资源分配机制。
[201] 如图 25所示， 分配机制控制装置 2508包括统计单元 2508-1和 选择单元 2508-2。 统计单元 2508-1可用于统计通信系统的负载量， 而选择单元 2508-2可根据所统计的负载量来选择用于执行通信系统 的资源分配策略的资源分配机制。 与上述方法实施例 /示例相同， 负 载量可根据一段时间内的系统平均吞吐量占系统容量的比例来计算。 当然， 统计单元 2508-1 可以利用其他任何适当的方法来统计通信系 统的负载量， 这里不详细说明。
[202] 在一个示例中， 选择单元 2508-2还可以根据通信系统的负载量 来判断所述通信系统为轻负载还是重负载。 若为轻负载， 则选择单元 2508-2为该通信系统选择集中式的资源分配机制。若为重负载， 则选 择单元 2508-2为该通信系统选择分布式的资源分配机制。 作为一个 具体示例，选择单元可以通过判断所统计的负载量是否大于一预定的 阈值， 来判断通信系统为轻负载还是重负载。 例如， 当负载量大于该 阈值时， 选择单元可以确定通信系统处于重负载， 否则为轻负载。 所 述阈值可以根据实际应用来设置， 这里不作任何限制。
[203] 上文中已详细描述了集中式的资源分配机制和分布式的资源分 配机制， 这里不再重复。
[204] 图 25所示的分配机制控制装置可以应用于图 20-22所示的资源 管理系统中。 图 26示出了包括分配机制控制装置的资源管理系统的 一个示例。如图 26所示， 该资源管理系统包括： 信息查询装置 2601、 信息采集装置 2603和分配策略决策装置 2605, 还包括分配机制控制 装置 2608。 分配机制控制装置 2608与图 25所示的装置 2508相似， 信息查询装置 2601、 信息采集装置 2603和分配策略决策装置 2605 与图 20所示的对应装置相似， 这里不再重复。 在选择了通信系统的 资源分配机制之后， 分配机制控制装置 2608可以将资源分配机制反 馈给分配策略决策装置 2605， 使得通信系统可以根据该资源分配机 制、 按照决策装置 2605所确定的资源分配策略进行资源的分配。
[205] 图 27示出了根据本发明的另一实施例的资源管理系统。 与图 20 所示的实施例相似， 图 27 所示的资源管理系统包括信息查询装置 2701、信息采集装置 2703和分配策略决策装置 2705; 不同之处在于， 图 27所示的资源管理系统还可以包括信息管理装置 2709。
[206] 信息查询装置 2701、 信息采集装置 2703 和分配策略决策装置 2705与图 20所示的对应装置相似， 这里不再重复。
[207] 信息管理装置 2709用于管理并保存通信系统的工作状态。 信息 管理装置 2709可以受到通信系统的各种状态改变事件 (如中继站 RS 的移动、 中继站 RS的功率变化导致覆盖范围变化、用户的加入 /离开 等)的驱动， 并根据这些变化对相应的状态信息进行更新。 状态查询 装置 2701可以向信息管理装置 2709进行查询， 以确定通信系统的工 作状态的变化程度，从而确定是否需要重新采集资源管理信息以及需 要采集系统的哪个区域的哪些工作状态信息。作为一个示例， 当信息 管理装置 2709检测到通信系统的链路间干扰状态或业务流等发生变 化时， 可以通过例如发送控制信号）通知状态查询装置 2701。 例如， 当检测到通信系统的链路间干扰状态或业务流等发生变化时，信息管 理装置 2709可以将发送给状态查询装置 2701的控制信号中的相应的 状态改变位置位，以便将相应的变化通知到状态查询装置 2701。例如， 当通信系统的工作状态改变会影响链路间干扰状况的变化时，则置控 制信号中的干扰测量状态位为 l ( True ); 而当通信系统的工作状态 改变涉及用户业务流变化时，则置控制信号中的业务流统计状态位为 1 ( True )„ 作为另一示例， 状态查询装置 2701还可以向信息管理装 置 2709发出请求， 由信息管理装置 2709将所述变化反馈给状态查询 装置 2701 (例如通过发送上述控制信号）。 作为另一示例， 状态查询 装置 2701还可以从信息管理装置 2709中读取有关通信系统的工作状 态变化的信息。 例如， 所述干扰测量状态或业务流统计状态可以存储 于信息管理装置 2709中， 并由信息管理装置 2709来不断更新。 状态 查询模块 2701可以通过读取这些状态来获知通信系统的工作状态的 改变程度。
[208] 图 28示出了根据本发明的另一实施例的资源管理系统。 与图 27 所示的实施例相似， 图 28 所示的资源管理系统包括信息查询装置 2801、 信息采集装置 2803、 分配策略决策装置 2805和信息管理装置 2809； 不同之处在于， 图 28所示的资源管理系统还可以包括链路簇 化装置 2807和分配机制控制装置 2808。
[209] 信息查询装置 2801、信息采集装置 2803、分配策略决策装置 2805 和信息管理装置 2809与图 27所示的相应装置相似， 这里不再重复。
[210] 链路簇化装置 2807与图 22所示的链路簇化装置 2207相似， 而 分配机制控制装置 2808与图 25或 26所示的分配机制控制装置 2508 或 2608相似， 这里均不再重复。
[211] 图 29给出了用于对通信系统的资源进行共享管理的资源管理系 统的一个具体示例。
[212] 图 29所示的资源管理系统包括信息查询装置 2901、 信息采集装 置 2903、 分配策略决策装置 2905和信息管理装置 2909、 分配机制控 制装置 2908。
[213] 该示例所针对的通信系统为开放式频傳体系，例如包括一个主系 统网络和至少一个次系统网络的通信系统。这种通信系统的资源管理 信息包括但于限于主系统网络和次系统网络中各节点的状态、各链路 间的干扰状态及业务流信息等。 信息管理装置 2909可以包括用于存 储主系统网络的资源管理信息的主信息管理单元 2909-1，还可以包括 用于存储次系统网络的资源管理信息的次信息管理单元 2909-2。在上 文中， 已详细描述了资源管理信息的示例， 这里不再重复。 作为一个 具体示例， 主信息管理单元 2909-1还可以包括用于存储主系统网络 的主用户的相关信息（如表 1所示） 的主用户信息子单元 2909-11以 及用于存储主系统网络的相关信息（如表 1所示）的主网络信息子单 元 2909-12。 作为另一具体示例， 次信息管理单元 2909-2还可以包括 用于存储次系统网络的次用户的相关信息（如表 1所示）的次用户信 息子单元 2909-21以及用于存储次系统网络的相关信息（如表 1所示） 的次网络信息子单元 2909-22。 这些单元 /子单元可以受到通信系统的 各种状态改变事件 (如中继站 RS的移动、 中继站 RS的功率变化导致 覆盖范围变化、 主或次用户的加入 /离开等)的驱动， 并根据这些变化 对相应的状态信息进行更新。
[214] 状态查询装置 2901用于向信息管理装置 2909查询通信系统的工 作状态自上次状态查询后是否发生改变，以确定是否需要重新采集资 源管理信息。 状态查询装置 2901可以采用上述实施例中描述的方法 从信息管理装置 2909中获得有关通信系统的状态变化的信息， 这里 不再重复。
[215] 信息采集装置 2903包括干扰状态采集单元 2903-1和业务流采集 单元 2903-2。单元 2903-1和 2903-2与图 21所示的对应单元相似，这 里不再重复。若状态查询装置 2901确定需要重新采集资源管理信息， 则可以向信息采集之后自 2903的相应单元发送激励信号， 以激励所 述单元进行信息采集。例如，若通信系统的链路间干扰状态发生变化， 则激活干扰状态采集单元 2903-1; 若通信系统的业务流状态发生变 化， 则激活业务流采集单元 2903-2。 信息采集装置 2903还可以包括 第一信息集散子单元 2903-3。 第一信息集散子单元 2903-3可以与资 源管理系统中的其他装置进行信息的交互， 例如， 可以将单元 2903-1 和 2903-2所采集的信息发送给信息管理装置 2909和分配策略决策装 置 2905等， 还可以接收来自分配机制控制装置 2908的信息。
[216] 若状态查询装置 2901确定不需要重新采集资源管理信息， 则可 以指示分配策略决策装置 2905利用上次查询的资源管理信息来确定 资源分配策略。作为一个示例， 上次查询的资源管理信息可以保存在 信息管理装置 2909中。
[217] 分配策略决策装置 2905 包括信息转化单元 2905-1 和确定单元 2905-2。 单元 2905-1和 2905-2与图 23或 24所示的相应单元相似， 这里不再重复。 分配策略决策装置 2905还可以包括第二信息集散子 单元 2905-3。 第二信息集散子单元 2905-3可以与资源管理系统中的 其他装置进行信息的交互， 例如， 可以接收来自信息采集装置 2903 和 /或信息管理装置 2909和 /或状态查询装置 2901的信息， 可以从分 配机制控制装置 2908获得有关负载量以及资源分配机制的信息， 还 可以将所确定的资源分配策略发送出去，例如发送给相应的策略实施 装置（未示出）。
[218] 策略实施装置首先将每个链路分配到的资源数量换算成实际的 无线资源 （如时域资源、 频域资源、 码域资源及其各种组合等等）， 再结合通信系统管理所需的资源（如通信系统内用户信息交互所需的 资源）形成资源分配策略信息包， 最后将这些信息包发布出去。 对于 主系统网络， 信息发布可以通过在帧中携带信息来发布； 对于次系统 网络， 可以通过主系统 /次系统交互信息来发布。 然后， 主 /次系统网 络的各节点就可以在分配到的无线资源上进行数据传输。作为一个示 例。 所述策略实施装置可以实施于通信系统中的主控节点（如基站或 者主系统网络的基站） 中。
[219] 分配机制控制装置 2908与图 25或 26所示的装置 2508或 2608 相似。
[220] 分配机制控制装置 2908可以根据通信系统运营过程中的负载状 态的变化来自适应地改变适当的信息交互内容，通过控制各装置中信 息集散单元的行为，可以形成灵活的开放式频 i瞽访问体系资源分配机 制， 从而有效利用系统中各节点的计算和通信能力， 使系统性能得到 提高。 例如在集中式资源分配机制（也可称为中央控制的资源分配机 制）中， 由主系统网络的基站统一进行资源管理决策。 这就需要第二 信息集散单元将信息转化装置得到的资源分配所需信息以及优化目 标汇总到基站， 一旦基站决策出资源分配策略， 再由第二信息集散单 元将该分配策略发布给相应的节点。 在分布式资源分配机制中， 资源 管理系统将部分节点作为局部决策节点，用来处理其所在局部区域的 资源管理决策；再由主系统网络的基站对局部决策结果进行协调得到 最终资源分配策略。 在分布式的资源分配机制中， 各节点的资源管理 信息采集结果将会汇聚到其所在区域的局部决策节点，该局部决策节 点对这些局部信息进行转化和计算， 得到局部决策结果； 这些局部结 果进一步汇聚到主系统网络的基站，经协调得到系统全局资源分配结 果， 再由信息集散单元将该分配结果发布给相应的节点。
[221] 与图 25所示的装置 2508相似， 分配机制控制装置 2908可以包 括统计单元和选择单元（未示出）。 该统计单元用于统计通信系统的 负载状态。 若为轻负载， 则选择单元选择中央控制的资源分配机制； 若为重负载，则选择单元选择分布式的资源分配机制。作为一个示例， 负载的轻重程度可根据一段时间内的系统平均吞吐量占系统容量的 比例来计算， 如果超过某个阈值可认为通信系统处于重负载， 否则认 为通信系统处于轻负载。 与上述示例 /实施例相似， 所述阈值可以根 据实际需要来确定， 这里不作任何限制。 [222] 在选择使用中央控制的资源分配机制的情况下，选择单元还可以 进一步确定需要交互的信息的类别、 数量、 对象以及发送时机等。 例 如，可以将信息转化装置得到的资源分配所需的信息以及优化目标汇 总到基站， 一旦基站决策出资源分配策略， 再由第二信息集散单元将 该分配策略发布给相应的节点。
[223] 在选择使用分布式的资源分配机制的情况下，还需要先对通信系 统中的节点进行功能划分， 以便选择局部决策控制节点。 可以由主系 统网络的基站来选择局部决策控制节点。 例如， 可以根据各节点的计 算能力、位置分布以及通信情况等来选择局部决策控制节点。作为一 个示例， 如果主系统网络为中继网络， 可以选择中继站， 还可以选择 路由器、 接入点 （AP )或者计算能力较强的用户节点。 选定了局部 决策控制节点之后，选择单元可以进一步确定交互信息的类别、数量、 对象和发送时机等。作为一个示例， 假设通信系统中有 100个节点的 信息需要采集， 那么， 在分布式的资源分配机制中， 可以选择 10个 局部决策节点。 这时， 每个局部决策节点平均负责 10个节点的信息 采集和分配策略决策任务。 如果选择 5个局部决策节点， 则每个局部 决策节点平均负责 20个节点的信息采集和分配策略决策任务。 这些 局部决策节点可以仅对所采集的信息进行汇总以得到局部的资源分 配模型， 然后发送给中央决策节点（如基站）进行资源分配策略的决 策。这些局部决策节点还可以直接才艮据所采集的局部信息进行局部资 源分配策略的决策， 再把局部决策结果通知中央决策节点， 由中央决 策节点在各个局部决策结果之间进行辅助性协调。 因此， 选择单元可 以根据所选择的局部决策节点的数量、在通信系统中的分布、每个局 部决策节点所负责的局部区域以及功能等来确定交互信息的类别、数 量、 对象和发送时机等， 这里不再详述。
[224] 资源管理系统中各装置之间以及与通信系统的各节点之间的信 息交互也需要占用系统资源， 因此， 需要进行相应的资源分配。 作为 一个示例， 这些交互信息可以视为系统信息， 可以在帧结构中分配专 门的域来实现。 作为另一示例， 这些交互信息也可以视为数据信息， 与用户所需的资源一起分配。作为另一示例， 可以在确定了针对各用 户的资源分配策略后，根据交互的资源和时机需要来为这些交互信息 分配适当的资源块。 该资源分配可以由分配机制控制装置来进行。
[225] 分配机制控制装置还可以驱动各个信息集散单元更新交互信息 的内容， 例如， 可以激活各信息集散单元更新下一次（或下一阶段） 交互信息的各种设置， 如交互信息的类别、 数量、 对象和分配的资源 等。
[226] 上文描述的实施例和示例均为示例性。应该理解， 本发明不应被 视为局限于任何具体的实施例或示例。
[227] 作为一个示例，上述资源管理方法的各个步骤以及上述资源管理 系统的各个装置、 组成模块和 /或单元可以实施为通信系统的主节点 (例如基站）中的软件、 固件、 硬件或其组合， 并作为该基站的资源 管理设备的一部分。 上述系统中的各个装置、 组成模块、 单元通过软 件、 固件、硬件或其组合的方式进行配置时可使用的具体手段或方式 为本领域技术人员所熟知， 在此不再赘述。 作为另一示例， 可以在现 有基站的资源管理设备中实施根据本发明上述实施例的资源管理方 法和 /或系统， 其中对已有基站的资源管理设备的各组成部分作一定 修改即可。
[228] 作为另一示例， 上述资源管理系统还可以是分布式的。 例如， 信 息管理装置可以位于基站，也可以分布式地位于基站和各个局部决策 节点中。 又如， 信息转化单元可以在基站中实施， 也可以分布式地位 于基站和各个局部决策节点中，各个局部决策节点所转化的信息可以 汇集到基站中。 又如， 分配策略决策装置可以在基站中实施， 也可以 分布式地位于基站和各个局部决策节点中，各个局部决策节点确定局 部策略， 再汇集到基站中， 由基站中的分配策略决策设备确定全局策 略。 又如， 状态查询装置或信息采集装置可以在基站中实施， 也可以 在其他节点中实施。 总之， 本发明的资源管理系统和方法可以根据通 信系统的实际情况来自适应调整，能有效利用通信系统中各个节点的 能力。 在保证主用户的资源需求得到满足的同时， 尽可能地为次用户 提供资源使用机会， 从而提高整个系统的资源利用效率。
[229] 本发明还提出一种存储有机器可读取的指令代码的程序产品。所 述指令代码由机器读取并执行时，可执行上述根据本发明实施例的方 法。
[230] 相应地，用于承载上述存储有机器可读取的指令代码的程序产品 的存储介质也包括在本发明的公开中。所述存储介质包括但不限于软 盘、 光盘、 磁光盘、 存储卡、 存储棒等等。 [231] 在上述实施例和示例中， 采用了 "第一"、 "第二" 等表述。 本领 域的普通技术人员应理解， 上述表述只是为了对术语作文字上的区 分， 而并非表示其顺序或任何其他限定。
[232] 在上面对本发明具体实施例的描述中，针对一种实施方式描述和 /或示出的特征可以以相同或类似的方式在一个或更多个其它实施方 式中使用， 与其它实施方式中的特征相组合， 或替代其它实施方式中 的特征。
[233] 应该强调， 术语 "包括 /包含" 在本文使用时指特征、 要素、 步 骤或组件的存在， 但并不排除一个或更多个其它特征、要素、 步骤或 组件的存在或附加。
[234] 此外，根据本发明的实施例的方法不限于按照说明书中描述的时 间顺序来执行，也可以按照其他的时间顺序地、并行地或独立地执行。 因此，本说明书中描述的方法的执行顺序不对本发明的技术范围构成
P艮制。 另外， 应理解， 在不脱离本发明的范围的情况下， 可以根据实 际需要对本发明的各个实施例中的步骤或装置、单元等进行组合、合 并或删减。 换言之， 本发明并不限于上述具体示例或实施例。 作为示 例，图 5所示的链路簇化步骤 S501还可应用于图 3所示的实施例中。 例如，在图 3所示的步骤 S302或者 S304之前，还可包括与步骤 S501 相似的链路簇化步骤， 以将通信系统中的链路分簇。 这样， 可以通过 获取各个链路簇之间的干扰关系、每个链路簇内的各链路间的干扰关 系以及每个链路簇的业务流信息等来获取资源管理信息。作为另一示 例， 图 5所示的链路簇化步骤 S501还可应用于图 6-8所示的实施例 中， 以降低资源分配策略决策过程中的计算量。 这里不再详述。
[235] 尽管上面已经通过对本发明的具体实施例的描述对本发明进行 了披露， 但是， 应该理解， 上述的所有实施例和示例均是示例性的， 而非限制性的。本领域的技术人员可在所附权利要求的精神和范围内 设计对本发明的各种修改、 改进或者等同物。 这些修改、 改进或者等 同物也应当被认为包括在本发明的保护范围内。

Claims

权利 要求 书
1. 一种通信系统中的资源管理方法， 包括：
判断所述通信系统的工作状态的变化程度是否会导致所述通信 系统的资源管理信息发生变化， 如果是， 则重新采集所述资源管理信 息，其中，所述资源管理信息包括有关所 信系统中各节点的状态、 各链路间的干扰状态及业务流信息； 以及
才艮据所述资源管理信息来确定所述通信系统的资源分配策略。
2. 如权利要求 1所述的方法， 还包括：
统计所 iiit信系统的负载量； 根据所统计的负载量来选择用于执行所述资源分配策略的资源 分配机制。
3. 如权利要求 2所述的方法，其中，根据所统计的负载量来选择 资源分配机制的步骤包括： 根据所述负载量来判断所 信系统为轻负载还是重负载，若为 轻负载， 则选择集中式的资源分配机制； 若为重负载， 则选择分布式 的资源分配机制，
其中， 在所述集中式的资源分配机制中， 由所述通信系统中的主 控节点来集中分配所述通信系统的资源；在所述分布式资源分配机制 中， 所述通信系统中的多个节点作为局部决策节点， 由每个局部决策 节点对其相应的局部区域的资源进行分配。
4. 如权利要求 1所述的方法，其中：判断所述通信系统的工作状 态的变化程度是否会导致所述通信系统的资源管理信息发生变化的 步骤包括：
判断所述通信系统的工作状态的变化是否影响到所述通信系统 中各链路间的干扰状态， 如果是， 则确定需要重新采集有关链路间的 干扰状态的信息；
判断所述通信系统的工作状态的变化是否影响到所述通信系统 的业务流量， 如果是， 则确定需要重新采集有关业务流的信息； 否则， 则确定不需要重新采集所述系统管理信息。
5. 如权利要求 1所述的方法，其中，在重新采集所述资源管理信 息之前， 所述方法还包括： 对所述通信系统中的链路进行分簇， 以获 得一个或更多个链路簇， 并且
其中， 重新采集所述资源管理信息包括： 获取各链路簇间的干扰 状态、每个链路簇内的各链路间的干扰状态及每个链路簇的业务流信 息。
6. 如权利要求 1所述的方法，其中，根据所述资源管理信息来确 定所 信系统的资源分配策略的步骤包括：
建立所述资源管理信息与资源分配目标之间的量化关系； 才艮据所建立的量化关系来确定所述资源分配策略。
7. 如权利要求 6所述的方法，其中，建立所述资源管理信息与资 源分配目标之间的量化关系的步骤包括： 根据所述资源管理信息来建立资源分配模型，所述模型反映所述 通信系统中各链 之间的相邻关系、各链 之间的互斥关系以及每个 链路的带宽需求和优先等级；
才艮据所述资源分配模型来建立资源分配约束条件，并量化资源分 配目标。
8. 如权利要求 7所述的方法，其中，根据所建立的量化关系来确 定所述资源分配策略的步骤包括：
将所述资源分配模型中的各链路排序，选择可同时被分配资源的 链路;
才艮据所述资源分配约束条件和量化的资源分配目标， 为所选择的 每个链路分配资源。
9. 如权利要求 6所述的方法， 还包括：
对所述通信系统中的链路进行分簇， 以获得一个或更多个链路 簇，
其中，建立所述资源管理信息与资源分配目标之间的量化关系的 步骤包括：
根据所述资源管理信息来建立资源分配模型，所述模型反映所述 通信系统中各链路簇之间的相邻关系、各链路簇之间的互斥关系以及 每个链路簇的带宽需求和优先等级；
才艮据所述资源分配模型来建立资源分配约束条件，并量化资源分 配目标。
10.如权利要求 9所述的方法， 其中， 根据所建立的量化关系来 确定所述资源分配策略的步骤包括：
将所述资源分配模型中的各链路簇排序，选择可同时被分配资源 的链路簇；
才艮据所述资源分配约束条件和量化的资源分配目标， 为所选择的 每个链路簇分配资源；
将分配给每个链路簇的资源进一步分配给该链路簇中的各个链 路。
11.如权利要求 1所述的方法， 其中， 所述通信系统包括主系统 网络和至少一个次系统网络，所述主系统网络和所述次系统网络具有 不同的优先等级，所述资源管理信息包括所述主系统网络和所述次系 统网络中各节点的状态、 各链路间的干扰状态及业务流信息。
12.一种通信系统中的资源管理系统， 包括状态查询装置、 信息 采集装置和分配策略决策装置， 其中：
所述状态查询装置用于判断所述通信系统的工作状态的变化程 度是否会导致所述通信系统的资源管理信息发生变化， 如果是， 则指 示所述信息采集装置重新采集所述资源管理信息；
所述信息采集装置用于根据所述状态查询装置的指示来重新采 集所述资源管理信息， 其中， 所述资源管理信息包括有关所述通信系 统中各节点的状态、 各链路间的干扰状态及业务流信息；
所述分配策略决策装置用于根据所述资源管理信息来确定所述 通信系统的资源分配策略。
13.如权利要求 12所述的资源管理系统，其中，所述信息采集装 置包括用于采集有关链路间的干扰状态的信息的干扰状态采集单元 和用于采集有关业务流的信息的业务流采集单元， 并且
其中， 所述状态查询装置还被配置用于：
判断所述通信系统的工作状态的变化是否影响到所述通信系统 中各链路间的干扰状态， 若是， 则指示所述信息采集装置的干扰状态 采集单元重新采集有关链路间的干扰状态的信息； 以及
判断所述通信系统的工作状态的变化是否影响到所述通信系统 的业务流量， 若是， 则指示所述信息采集装置的业务流采集单元重新 采集有关业务流的信息。
14.如权利要求 12所述的资源管理系统， 还包括：
链路簇化装置， 用于对所述通信系统中的链路进行分簇， 以获得 一个或更多个链路簇， 并且其中
所述信息采集装置还被配置用于通过获取各链路簇间的干扰状 态、每个链路簇内的各链路间的干扰状态及每个链路簇的业务流信息 来采集所述资源管理信息。
15.如权利要求 12所述的资源管理系统，其中，所述分配策略决 策装置包括：
信息转化单元，用于建立所述资源管理信息与资源分配目标之间 的量化关系；
确定单元， 用于根据所建立的量化关系来确定所述资源分配策 略。
16.如权利要求 15所述的资源管理系统，其中，所述信息转化单 元还被配置用于：
根据所述资源管理信息来建立资源分配模型，所述模型反映所述 通信系统中各链 之间的相邻关系、各链 之间的互斥关系以及每个 链路的带宽需求和优先等级； 以及
才艮据所述资源分配模型来建立资源分配约束条件，并量化资源分 配目标。
17.如权利要求 16所述的资源管理系统，其中，所述确定单元还 被配置用于：
将所述资源分配模型中的各链路排序，选择可同时被分配资源的 链路； 以及 才艮据所述资源分配约束条件和量化的资源分配目标， 为所选择的 每个链路分配资源。
18.如权利要求 14所述的资源管理系统，其中，所述分配策略决 策装置包括：
信息转化单元，用于建立所述资源管理信息与资源分配目标之间 的量化关系；
确定单元， 用于根据所建立的量化关系来确定所述资源分配策 略。
19.如权利要求 18所述的资源管理系统，其中，信息转化单元还 被配置用于：
根据所述资源管理信息来建立资源分配模型，所述模型反映所述 通信系统中各链路簇之间的相邻关系、各链路簇之间的互斥关系以及 每个链路簇的带宽需求和优先等级； 以及
才艮据所述资源分配模型来建立资源分配约束条件，并量化资源分 配目标。
20.如权利要求 19所述的资源管理系统，其中，所述确定单元还 被配置用于：
将所述资源分配模型中的各链路簇排序，选择可同时被分配资源 的链路簇；
才艮据所述资源分配约束条件和量化的资源分配目标， 为所选择的 每个链路簇分配资源；
将分配给每个链路簇的资源进一步分配给该链路簇中的各个链 路。
21.如权利要求 12所述的资源管理系统，其中，所述通信系统包 括主系统网络和次系统网络，所述资源管理信息包括所述主系统网络 和所述次系统网络中各节点的状态、各链路间的干扰状态及业务流信 息。
22.如权利要求 12所述的资源管理系统，还包括分配机制控制装 置， 其中， 所述分配机制控制装置包括统计单元和选择单元， 并且其 中，
所述统计单元用于统计所述通信系统的负载量， 所述选择单元用 于根据所统计的负载量来选择用于执行所述资源分配策略的资源分 配机制。
23.如权利要求 22所述的资源管理系统，其中，所 i½择单元还 被配置用于：
根据所述负载量来判断所 信系统为轻负载还是重负载，若为 轻负载， 则选择集中式的资源分配机制； 若为重负载， 则选择分布式 的资源分配机制，
其中， 在所述集中式的资源分配机制中， 由所述通信系统中的主 控节点来集中分配所述通信系统的资源；在所述分布式资源分配机制 中， 所述通信系统中的多个节点作为局部决策节点， 由每个局部决策 节点对其相应的局部区域的资源进行分配。
PCT/CN2010/078767 2009-11-17 2010-11-16 資源管理方法和系統 Ceased WO2011060704A1 (zh)

Priority Applications (11)

Application Number Priority Date Filing Date Title
US13/509,137 US9654275B2 (en) 2009-11-17 2010-11-16 Resource management method and system thereof
JP2012539170A JP5704174B2 (ja) 2009-11-17 2010-11-16 リソース管理方法及びシステム
EP21193277.7A EP3944651A1 (en) 2009-11-17 2010-11-16 Resource management method and system thereof
EP10831119.2A EP2503739B1 (en) 2009-11-17 2010-11-16 Resource management method and system thereof
ZA2012/04186A ZA201204186B (en) 2009-11-17 2012-06-07 Resource management method and system thereof
US14/062,640 US9130732B2 (en) 2009-11-17 2013-10-24 Resource management method and system thereof
US14/806,005 US9419773B2 (en) 2009-11-17 2015-07-22 Resource management method and system thereof
US15/220,553 US9762373B2 (en) 2009-11-17 2016-07-27 Resource management method and system thereof
US15/669,011 US10333684B2 (en) 2009-11-17 2017-08-04 Resource management method and system therof
US16/408,491 US11088810B2 (en) 2009-11-17 2019-05-10 Resource management method and system thereof
US17/364,916 US11848895B2 (en) 2009-11-17 2021-07-01 Resource management method and system thereof

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910224762.9A CN102065544B (zh) 2009-11-17 2009-11-17 资源管理方法和系统
CN200910224762.9 2009-11-17

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US13/509,137 A-371-Of-International US9654275B2 (en) 2009-11-17 2010-11-16 Resource management method and system thereof
US14/062,640 Continuation US9130732B2 (en) 2009-11-17 2013-10-24 Resource management method and system thereof

Publications (1)

Publication Number Publication Date
WO2011060704A1 true WO2011060704A1 (zh) 2011-05-26

Family

ID=44000573

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/078767 Ceased WO2011060704A1 (zh) 2009-11-17 2010-11-16 資源管理方法和系統

Country Status (6)

Country Link
US (7) US9654275B2 (zh)
EP (2) EP3944651A1 (zh)
JP (4) JP5704174B2 (zh)
CN (1) CN102065544B (zh)
WO (1) WO2011060704A1 (zh)
ZA (1) ZA201204186B (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107040325A (zh) * 2017-05-19 2017-08-11 中国电子科技集团公司第七研究所 基于策略的频谱资源动态分配方法、装置和系统

Families Citing this family (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102065544B (zh) * 2009-11-17 2015-02-25 索尼株式会社 资源管理方法和系统
US8713183B2 (en) * 2011-03-27 2014-04-29 Hewlett-Packard Development Company, L.P. Resource compatability for data centers
CN102932160B (zh) * 2011-08-10 2017-12-12 中兴通讯股份有限公司 一种资源管理系统
CN103748950A (zh) * 2011-09-28 2014-04-23 富士通株式会社 多点协作系统中的调度分配方法以及装置
US9143309B2 (en) 2012-04-13 2015-09-22 Dominant Technologies, LLC Hopping master in wireless conference
US10568155B2 (en) 2012-04-13 2020-02-18 Dominant Technologies, LLC Communication and data handling in a mesh network using duplex radios
US10136426B2 (en) 2014-12-05 2018-11-20 Dominant Technologies, LLC Wireless conferencing system using narrow-band channels
CN103546433B (zh) * 2012-07-12 2017-06-30 阿里巴巴集团控股有限公司 信息同步系统和方法
CN102833165B (zh) * 2012-08-27 2015-06-17 华为技术有限公司 资源的调度方法及装置
BR112015017342A2 (pt) 2013-01-28 2017-07-11 Sony Corp sistema, e, mídia legível por computador
CN103974261B (zh) * 2013-01-28 2020-02-18 索尼公司 无线通信系统中的设备和方法
CN104144425B (zh) * 2013-05-08 2020-06-12 索尼公司 无线通信系统中的网络管理装置、方法和装置
JP6197358B2 (ja) * 2013-05-14 2017-09-20 富士通株式会社 基地局装置、基地局装置におけるデータ送信方法、及び無線通信システム
US20150078260A1 (en) * 2013-09-13 2015-03-19 Fujitsu Limited Parallel resource management in white space bands using transmit power control and channel set assignment
US9232527B2 (en) * 2013-12-13 2016-01-05 Harris Corporation Cross-layer, cross-node cognitive network enhanced dynamic spectrum allocation
JP6488238B2 (ja) * 2013-12-20 2019-03-20 京セラ株式会社 移動通信システム、無線通信装置、ネットワーク装置、及び無線端末
US9538571B2 (en) 2014-12-05 2017-01-03 Dominant Technologies, LLC Communication and data handling in a mesh network using duplex radios
US9628168B2 (en) * 2015-02-26 2017-04-18 Space Systems/Loral, Llc Dynamic link adaption and/or dynamic allocation of communication resources of a communication system based on external interference information received from external interference information sources
DE112016004715T5 (de) * 2015-10-16 2018-09-27 Intel IP Corporation Sas-störungsabschwächungsoptionen
CN105657721A (zh) * 2016-01-29 2016-06-08 福建师范大学 基于vcg机制的防骗频谱资源分配方法及系统
US10819585B2 (en) * 2016-05-04 2020-10-27 At&T Intellectual Property I, L.P. Determining RACH root sequences as a function of access point configuration using graph coloring
CN107371165A (zh) * 2016-05-13 2017-11-21 索尼公司 频谱管理装置和方法、电子装置和方法以及无线通信系统
US10098005B2 (en) * 2017-02-22 2018-10-09 Federated Wireless, Inc. Spectrum sharing between primary users and co-existence groups of secondary users
CN109936604B (zh) * 2017-12-18 2022-07-26 北京图森智途科技有限公司 一种资源调度方法、装置和系统
CN109614223B (zh) * 2018-11-01 2023-06-09 新华三技术有限公司成都分公司 硬件资源调度方法、装置及硬件资源调度设备
CN111246596B (zh) * 2018-11-29 2023-05-02 中兴通讯股份有限公司 链路的确定、建立方法及装置，传输系统，卫星通讯系统
US10694420B1 (en) * 2018-11-30 2020-06-23 T-Mobile Usa, Inc. Traffic deprioritization by using dynamically indicated invalid subframes
US12588047B2 (en) * 2020-04-03 2026-03-24 Lenovo (Beijing) Ltd. Method and apparatus for sensing measurement and report for sidelink
CN113840244A (zh) * 2020-06-24 2021-12-24 成都鼎桥通信技术有限公司 群组接入控制方法、装置、设备及计算机可读存储介质
WO2022093988A1 (en) 2020-10-30 2022-05-05 XCOM Labs, Inc. Clustering and/or rate selection in multiple-input multiple-output communication systems
CN112492643B (zh) * 2020-11-12 2023-02-14 普联技术有限公司 基于多链路的数据转发方法、装置及终端设备
CN112688797B (zh) * 2020-12-10 2022-11-18 中国联合网络通信集团有限公司 网络线路选择方法、系统、终端设备及计算机存储介质
US11636417B2 (en) * 2020-12-17 2023-04-25 International Business Machines Corporation Cognitive analysis for enterprise decision meta model
US20230189008A1 (en) * 2021-12-10 2023-06-15 Dish Network L.L.C. Shared spectrum coordination
CN115884386B (zh) * 2022-11-21 2025-09-09 厦门大学 基于个性化多粒度无级图染色的无线资源管理方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040208559A1 (en) * 2001-12-31 2004-10-21 Murali Krishnaswamy Wavelength and path assignment in wavelength division multiplexed ring networks
CN101141771A (zh) 2006-09-08 2008-03-12 华为技术有限公司 实现频谱共享的无线资源管理系统及方法
CN101197026A (zh) * 2007-12-20 2008-06-11 浙江大学 高性能访问控制系统中资源及其访问控制策略的设计与存储方法
CN101227248A (zh) * 2008-01-29 2008-07-23 中兴通讯股份有限公司 业务路径建立方法
CN101500022A (zh) * 2009-03-09 2009-08-05 北大方正集团有限公司 一种数据访问资源的分配方法及其系统和设备

Family Cites Families (37)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
BR0110674A (pt) * 2000-05-01 2003-04-29 Interdigital Tech Corp Controle de potência de "link" inferior para múltiplos espaços de tempo em "link" inferior em sistemas de comunicações tdd
US6738625B1 (en) * 2000-05-11 2004-05-18 Telefonaktiebolaget Lm Ericsson (Publ) Rehoming and resource sharing in communications networks
EP1261228B1 (en) 2001-05-25 2005-04-06 NTT DoCoMo, Inc. Radio communication system for reducing interferences with respect to other communication system using close frequency band
TW595140B (en) * 2002-04-22 2004-06-21 Cognio Inc System and method for spectrum management of a shared frequency band
US7054646B2 (en) * 2002-10-17 2006-05-30 Nokia Corporation Transmission method in a communication system
JP4260613B2 (ja) * 2003-01-21 2009-04-30 パナソニック株式会社 通信システム及び端末
EP2533594A3 (en) 2004-03-05 2013-02-27 NTT DoCoMo, Inc. Frequency channel assignment system, base station, control station, inter-system common control apparatus, frequency channel assignment method, and control method
JP4622649B2 (ja) * 2004-04-21 2011-02-02 日本電気株式会社 無線アクセス通信ネットワーク、動的負荷分散装置及びそれらに用いる動的負荷分散方法
KR100640474B1 (ko) * 2004-07-10 2006-10-30 삼성전자주식회사 다중 반송파 기반의 코드분할다중접속 시스템을 위한 하향링크 자원 할당 방법
JP2006094001A (ja) * 2004-09-22 2006-04-06 Ntt Docomo Inc 移動通信システムおよび周波数帯割当装置ならびに周波数帯割当方法
US20060190944A1 (en) * 2005-02-18 2006-08-24 Charles Moon System and Method for Resource Management
US20070032254A1 (en) 2005-08-02 2007-02-08 Hitachi, Ltd. System and method for providing efficient spectrum usage of wireless devices in unlicensed bands
US7653357B2 (en) * 2005-08-22 2010-01-26 Toshiba America Research, Inc. Access point interference control and selection methods
JP4398927B2 (ja) 2005-09-22 2010-01-13 株式会社東芝 周波数利用状況測定システム
KR100705501B1 (ko) * 2005-11-16 2007-04-09 한국전자통신연구원 이동통신 시스템 기지국의 공간분할 다중화에 의한하향링크/상향링크 스케쥴링 및 자원 할당 방법
FR2899054B1 (fr) * 2006-03-27 2008-09-12 Thales Sa Procede et systeme d'allocation de ressources
FI20065269A0 (fi) 2006-04-26 2006-04-26 Nokia Corp Spektrin käyttö radiojärjestelmässä
CN100373980C (zh) 2006-04-26 2008-03-05 电子科技大学 一种认知无线电系统中避免干扰的并行频谱分配方法
JP4772582B2 (ja) * 2006-04-28 2011-09-14 株式会社東芝 コグニティブ無線システム
KR20080014420A (ko) * 2006-08-11 2008-02-14 삼성전자주식회사 이동 통신 시스템에서 동적 자원 할당 방법
KR100840129B1 (ko) * 2006-11-16 2008-06-20 삼성에스디에스 주식회사 통계적인 분석을 이용한 성능장애 관리시스템 및 그 방법
JP4767880B2 (ja) * 2007-02-23 2011-09-07 日本電信電話株式会社 通信装置とその通信方法
CN101262680A (zh) 2007-03-09 2008-09-10 华为技术有限公司 无线宽带接入中的信道测量资源分配方法和系统
JP4881816B2 (ja) * 2007-08-22 2012-02-22 日本電信電話株式会社 チャネル割当て方法、無線通信システム、および管理局装置
JP4583430B2 (ja) * 2007-11-08 2010-11-17 日本電信電話株式会社 無線通信システム
US8705506B2 (en) * 2007-11-16 2014-04-22 Qualcomm Incorporated Time reservation for a dominant interference scenario in a wireless communication network
EP2066078A1 (en) * 2007-11-27 2009-06-03 Nokia Siemens Networks Oy Method for resource assignment signalling in a mobile radio communication system and base station for a mobile radio communication system
US8509696B2 (en) * 2007-12-28 2013-08-13 Nec Corporation Radio apparatus, radio communication system, and method for detecting radio wave
US8825046B2 (en) * 2008-02-01 2014-09-02 Qualcomm Incorporated Short-term interference mitigation in a wireless communication system
JP4512143B2 (ja) * 2008-02-21 2010-07-28 株式会社トヨタＩｔ開発センター 移動体無線通信システムおよび無線通信方法
JP2009206621A (ja) * 2008-02-26 2009-09-10 National Institute Of Information & Communication Technology アクセスポイント選択処理装置，アクセスポイント選択方法およびアクセスポイント選択処理プログラム
JP5190676B2 (ja) * 2008-03-31 2013-04-24 独立行政法人情報通信研究機構 通信ネットワークシステム及びネットワーク通信方法、ネットワーク管理装置
US8982996B2 (en) * 2008-06-10 2015-03-17 Samsung Electronics Co., Ltd. Cognitive radio communication system using multiple input multiple output communication scheme
JP2010205209A (ja) * 2009-03-06 2010-09-16 Hitachi Ltd 管理計算機、計算機システム、物理リソース割り当て方法
CN102065544B (zh) * 2009-11-17 2015-02-25 索尼株式会社 资源管理方法和系统
US8804671B2 (en) * 2010-07-15 2014-08-12 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for determining UE mobility status
TW201446021A (zh) * 2013-01-28 2014-12-01 Interdigital Patent Holdings 頻譜協調方法及裝置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040208559A1 (en) * 2001-12-31 2004-10-21 Murali Krishnaswamy Wavelength and path assignment in wavelength division multiplexed ring networks
CN101141771A (zh) 2006-09-08 2008-03-12 华为技术有限公司 实现频谱共享的无线资源管理系统及方法
CN101197026A (zh) * 2007-12-20 2008-06-11 浙江大学 高性能访问控制系统中资源及其访问控制策略的设计与存储方法
CN101227248A (zh) * 2008-01-29 2008-07-23 中兴通讯股份有限公司 业务路径建立方法
CN101500022A (zh) * 2009-03-09 2009-08-05 北大方正集团有限公司 一种数据访问资源的分配方法及其系统和设备

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2503739A4

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107040325A (zh) * 2017-05-19 2017-08-11 中国电子科技集团公司第七研究所 基于策略的频谱资源动态分配方法、装置和系统

Also Published As

Publication number Publication date
CN102065544A (zh) 2011-05-18
US20170332382A1 (en) 2017-11-16
JP2015136144A (ja) 2015-07-27
US9130732B2 (en) 2015-09-08
CN102065544B (zh) 2015-02-25
EP3944651A1 (en) 2022-01-26
US20160028531A1 (en) 2016-01-28
JP2013511232A (ja) 2013-03-28
US20210336753A1 (en) 2021-10-28
US9654275B2 (en) 2017-05-16
US11848895B2 (en) 2023-12-19
US20120231829A1 (en) 2012-09-13
EP2503739B1 (en) 2021-09-08
US20140051472A1 (en) 2014-02-20
US9762373B2 (en) 2017-09-12
JP5704174B2 (ja) 2015-04-22
US20190268126A1 (en) 2019-08-29
US9419773B2 (en) 2016-08-16
ZA201204186B (en) 2012-12-27
US11088810B2 (en) 2021-08-10
US20170026160A1 (en) 2017-01-26
EP2503739A4 (en) 2017-07-12
JP2021013183A (ja) 2021-02-04
JP2018113704A (ja) 2018-07-19
US10333684B2 (en) 2019-06-25
EP2503739A1 (en) 2012-09-26
JP7222386B2 (ja) 2023-02-15

Similar Documents

Publication Publication Date Title
WO2011060704A1 (zh) 資源管理方法和系統
CN102098684B (zh) 认知无线网络中跨层资源分配系统及方法
CN110493757A (zh) 单服务器下降低系统能耗的移动边缘计算卸载方法
CN101534510A (zh) 用于分布式频谱共享的方法及系统
CN103517279B (zh) Lte系统中联合动态无线资源分配与移动负载均衡的方法
Tang et al. Throughput optimization via association control in wireless LANs
CN104540229B (zh) 资源管理方法和系统
CN104618915B (zh) 资源管理方法和系统、资源管理系统的测量装置和方法
CN116684056A (zh) 基于独立组网共享基站的终端接入调整方法及相关设备
CN108599913B (zh) 一种多运营商场景下LTE-U和WiFi的共存方法
Wu et al. Energy‐Efficient User Association with Congestion Avoidance and Migration Constraint in Green WLANs
Duan et al. Research on spectrum allocation of HF access network based on intelligent frequency hopping
Kaniezhil et al. Improvement of Spectrum Sharing using Traffic pattern prediction
CN109672484A (zh) 一种机会资源智能探索方法
Esenogho Channel assembling policies for heterogeneous fifth generation (5G) cognitive radio networks
Zhang A cooperative opportunistic spectrum access scheme in cognitive cellular networks
Chen Low Overhead Spectrum Allocation and Secondary Access in Cognitive Radio Networks
Andrews A Comparison of Scheduling Algorithms for Wireless Access plus X-Haul
Lakshmi et al. A Novel Channel Sensing Mechanism for Cognitive Radio Systems
Pei Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model
Nandhini et al. USER UTILITY IN SPECTRUM ALLOCATION
PD et al. Efficient Scheduling and Collision Reduction in Hybrid Cognitive Radio Network using SBP

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

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 13509137

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 2010831119

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2012539170

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 4570/CHENP/2012

Country of ref document: IN