WO2007051389A1 - Procede et appareil reseau destines a ajuster les resssources de communication dans une communaute - Google Patents

Procede et appareil reseau destines a ajuster les resssources de communication dans une communaute Download PDF

Info

Publication number
WO2007051389A1
WO2007051389A1 PCT/CN2006/002577 CN2006002577W WO2007051389A1 WO 2007051389 A1 WO2007051389 A1 WO 2007051389A1 CN 2006002577 W CN2006002577 W CN 2006002577W WO 2007051389 A1 WO2007051389 A1 WO 2007051389A1
Authority
WO
WIPO (PCT)
Prior art keywords
community
base station
relationship table
adjacency
station
Prior art date
Application number
PCT/CN2006/002577
Other languages
English (en)
French (fr)
Inventor
Xuyong Wu
Zhong Pan
Quanbo Zhao
Original Assignee
Huawei Technologies Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to EP06791163A priority Critical patent/EP1940188A4/en
Priority to CN2006800115193A priority patent/CN101156485B/zh
Publication of WO2007051389A1 publication Critical patent/WO2007051389A1/zh
Priority to US12/114,206 priority patent/US8005109B2/en

Links

Classifications

    • 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/02—Resource partitioning among network components, e.g. reuse partitioning

Definitions

  • the present invention relates to communication technologies, and in particular, to a method and network device for adjusting communication resources in a base station community. Background technique
  • Broadband wireless access technology is currently booming, and the technology of using broadband resources for broadband metro access has strong vitality and market space.
  • wireless spectrum resources are very valuable, especially in areas with no well-planned or unlicensed bands (LE Band, License-Exempt Band), which often require multiple base stations to operate on the same channel, resulting in the system. Interfere with each other.
  • L Band License-Exempt Band
  • Neighbor is referred to herein means a common coverage area and base station (BS, Base Station) 0 FIG terminal region containing an effective common cover 1, the figure represents the active terminal is located asterisk
  • the location, BS1 and BS2 are geographically close, and the BS1 and BS2 stations are each in the coverage area of the other party.
  • it since there is no terminal in the common coverage area and there is no serious interference to the other party's wireless network, it is not considered as a neighbor.
  • BS2 and BS3 are referred to herein as neighboring stations.
  • the community mentioned in this paper is a set of base stations in the same environment, and a subset consisting of any one of the base stations or part of the base stations is at least one base station with the same body but not belonging to the subset.
  • BS1, BS2, BS3, and BS4 collectively form a common body Cl.
  • BS5 has an overlapping coverage area with BS3, since there is no effective terminal in the overlapping area, BS5 does not belong to the community C1, but forms the community C2 independently.
  • BS6 and BS7 they do not belong to the community Cl itself, but constitute another community C3.
  • the adjacency relationship table can completely record the adjacency relationship in the community, that is, whether each base station and other base stations are adjacent to each other, reflecting the network topology of the community.
  • the row and column of the table are sorted in the same order, for example, according to the number of neighbors from large to small.
  • the value of the adjacency relation table is a symmetric matrix. For each element, a value of 0 indicates that the corresponding base station and column two base stations are not adjacent to each other, and a value of 1 indicates that the corresponding two base stations are adjacent to each other.
  • Table 1 shows an example of the adjacency relation table, and the number of neighboring stations of each of the base stations BS1, BS2, BSn is sequentially decreased.
  • All base stations in the community have the same limited spectrum resources.
  • the base station cannot be arbitrarily selected for its working frequency, but needs to be planned in a coordinated manner.
  • the size of the community is relatively large, it is related to whether the spectrum resources can be effectively utilized and whether the utilization is sufficient, thereby affecting the base station and the community. Performance.
  • the existing network planning methods are to statically configure the frequency band for the base station, so that the base stations in the community work in different frequency bands as much as possible. This method does not support dynamic configuration, and it is difficult for operators to coordinate. When the network changes, adjustments and negotiations cannot be made automatically, and planning must be repeated, and work efficiency is low. Summary of the invention
  • the present invention provides a method and a network device for adjusting communication resources in a community to solve the problem of low resource utilization and inflexible resource allocation in the prior art method for fixedly allocating communication resources.
  • a method for adjusting communication resources in a community includes the following steps:
  • Each base station in the community adjusts its respective communication resources to the communication resources newly allocated to the base station at the same adjustment time.
  • a base station or a community server in the community updates the community adjacency relationship table when the community structure changes, and sends the updated adjacency relationship table to each base station in the community; each base station in the community uses the same algorithm according to the updated algorithm respectively.
  • the adjacency relationship table re-allocates the target communication resources for the base station.
  • a base station or a community server in the community updates the community adjacency relationship table when the community structure changes, and re-allocates the target communication resources for each base station in the community according to the updated adjacency relationship table; the community server or the execution The base station for resource reallocation notifies the base station of the allocation result to the base station in the community.
  • a base station or a community server in the community transmits the transmission time information to each base station while transmitting the adjacency relation table or the target communication resource allocation result, and each base station determines the same adjustment time according to the transmission time information.
  • the transmission time information is a frame number at the time of transmission, and the same adjustment time is a time at which the frame sequence number is extended by a frame period.
  • the community server that updates the community adjacency relationship table when the community structure changes is to update the community adjacency relation table according to the information reported by the base station at the community change location.
  • the base station in the community change location simultaneously reports the community change time information, and the community server records the community change time information.
  • the base station that updates the community adjacency relation table when the community structure changes is a base station that is in a community change position.
  • the base station in the community change location updates the local community adjacency relationship table according to the neighbor relationship table of the neighboring station, and records the community change time information.
  • the process of obtaining, by the base stations in the community, the updated community adjacency relationship table and the community change time information includes the following steps:
  • the community server or the base station in the community change location updates the community adjacency relationship table and The same time change time information; then, the updated community adjacency relationship table and the community change time information are sent to other base stations in the community; the other base stations in the community update the community adjacency relationship table of the base station according to the received adjacency relation table and save the Community change time information; or
  • the community server or the base station in the community change location updates the community adjacency relationship table and the community change time information; and then sends the updated community adjacency relationship table and the community change time information to its neighboring station; each neighboring station is further stepwise based on The adjacency is broadcast to all base stations in the community.
  • the community change time information is a frame sequence number in the community, or an absolute time synchronized in the community.
  • each base station in the community delays the community change time information by a threshold to obtain the adjustment time.
  • the set threshold is the number of frames in the community, or the absolute length of time.
  • the base station in the community change location includes: a new base station in the community, a neighboring station of the newly added base station, a base station to be shut down, a neighboring station that shuts down the base station, a base station configured to actively change resources, and an active change.
  • the method further includes: adding a base station to synchronize the frame timing with the neighbor station and the frame sequence number when joining the community.
  • the communication resource includes a frequency, a time used by the base station, a codeword in the CDMA system or a subchannel in the OFDM/OFDMA system; and/or an algorithm for reallocating the communication resource includes a greedy algorithm.
  • the present invention further provides a network device, including a transceiver module, the network device further includes: a update module, a storage module, and a processing module;
  • the update module is connected between the transceiver module and the storage module, and updates the adjacency relationship table stored in the storage module according to the community change information received from other network devices in the community and/or the self-sensing community change information, or the received relationship table
  • the community adjacency relationship table is updated into the storage module;
  • the processing module is connected to the storage module, reallocates the communication resource according to the updated adjacency relationship table, and determines the switching time.
  • the network device further includes: a notification module, connected between the transceiver module and the processing module, generating a notification message including a resource allocation result and a switching time, or generating a community adjacency relationship table The notification message, and the notification message is sent to other network devices in the community through the transceiver module.
  • a notification module connected between the transceiver module and the processing module, generating a notification message including a resource allocation result and a switching time, or generating a community adjacency relationship table The notification message, and the notification message is sent to other network devices in the community through the transceiver module.
  • the network device further includes: an adjustment module, connected to the processing module, to adjust the base station to a corresponding target resource when the handover time arrives.
  • the present invention provides a method and network device for automatically allocating communication resources, so that communication resources are cooperatively and automatically allocated among coexisting base stations, thereby improving optimal allocation and utilization of resources;
  • the changed community can automatically complete the automatic adjustment of the communication resources, and achieve the purpose of using the minimum amount of resources to achieve the maximum capacity of the system;
  • the community in the technical solution of the present invention includes a set of coexisting base stations in various existing communication systems, and the method of the present invention can be used to adjust most existing communication resources, including the frequency and time used by the base station. a codeword in a CDMA system or a subchannel in an OFDM/OFDMA system, etc., and thus the present invention is a general method for optimizing resource allocation;
  • Figure 1 Schematic diagram of the neighboring station concept
  • Figure 2 is a schematic diagram of the concept of the community
  • FIG. 3 and FIG. 4 are schematic diagrams showing the principle of the method according to the present invention.
  • FIG. 5 is a flowchart of automatically calculating a target resource and adjusting each base station in the distributed adjustment mode according to the present invention
  • 6 is a schematic diagram of determining, by a base station, a unified adjustment time according to a frame number corresponding to a change in a community structure in a distributed adjustment mode according to the present invention
  • 7 is a flowchart of calculating, by a primary station, a target resource and notifying a slave station of synchronization adjustment in the centralized adjustment mode according to the present invention
  • FIG. 8 is a flow chart of the primary station requesting the slave station to calculate the target resource adjustment and synchronously adjusting in the hybrid adjustment mode according to the present invention
  • FIG. 10 is an example 2 of a time-frequency block according to the present invention.
  • Figure 11 and Figure 12 are schematic diagrams showing two modes of constructing a subchannel
  • FIG. 13 is a schematic diagram of main structures of a network device according to the present invention.
  • Figure 14 is a schematic diagram showing the main structure of a server as a primary station in the centralized control scheme of the present invention.
  • Figure 15 is a schematic diagram showing the main structure of a base station as a primary station in the centralized control scheme of the present invention.
  • FIG. 16 is a schematic diagram of a main structure of a base station in the distributed control scheme according to the present invention.
  • FIG. 17 is a schematic diagram of a calculation procedure of a greedy algorithm. detailed description
  • the present invention provides a method for dynamically allocating available communication resources according to changes in the structure of the community.
  • a new base station joins or exits from the community, and the community merges or splits, the topology of the community changes, which will inevitably affect The layout of communication resources within the community, at which point communication resources can be reallocated within the community, allocating available communication resources to newly joined members.
  • the communication resource according to the present invention is a generalized concept, which is not only a spectrum but also all other exclusive resources required for the base station to work normally, such as a time slice, a CDMA codeword, a subchannel, and the like.
  • the combination of various resources is also a new form of resources.
  • the coexistence of the community requires that all member base stations share on various resources and do not interfere with each other. Only some resources are not rare, and the number of individuals is far more than the number of members of the community. However, the number of individuals that some resources can supply to the community is not large, and it is necessary to share multiplexing among base stations that are not adjacent in the community.
  • the present invention does not describe a situation in which a neighboring station is allowed to use the same resource.
  • two base stations are adjacent to each other.
  • only the terminals located in the common coverage area have interference problems under the same resource, and for the common coverage area. Outside terminals, even if the two base stations use the same spectrum resources or other resources, there will be no interference.
  • the base stations that intersect each other are neighbors. If they use the same frequency, interference will occur. For this they need to work at different frequencies.
  • BS1 ⁇ BS6 are the base stations that are working normally, belonging to two different communities. Assume that there are only 3 frequency points available for the two communities, and the usage areas of each frequency point are represented by different background colors. It is assumed that the distribution of these three frequency points in the two communities is as shown in Fig. 3. At this time, if another new base station BS7 is activated at the position shown in the figure, the two communities merge. However, since BS7, BS4, BS4 and BS5 of BS7 already occupy all frequency points, if BS7 and other neighboring stations are required to have no interference, additional frequency points need to be provided.
  • BS7 allocates an existing frequency point.
  • frequency allocation methods that can also assign one of the frequency points used by other background color areas to BS7.
  • the distribution of other communication resources is also the same. It can be seen that the distribution of communication resources in the community will require different amounts of resources. Therefore, when the community expands, the current communication resource allocation layout in the community can be adjusted to reduce the community's demand for communication resources.
  • the technical idea of the present invention is to redistribute the communication resources used by each base station according to the updated community adjacency relationship after the change of the community, to achieve the purpose of optimizing the allocation, and the specific adjustment modes are distributed adjustment and centralized adjustment.
  • the spectrum in the communication resource is taken as an example for description.
  • Embodiment 1 distributed adjustment
  • each base station in the community needs to store the adjacency relationship of the community.
  • the adjacency relationship table records the adjacency relationship of each base station in the community, indicating whether the two base stations are adjacent to each other.
  • the base station at the changing location can directly know the change and its time point, and then the base station broadcasts to other base stations through the wired network; or can be learned by the base station at the changing position.
  • the changes and their time points are broadcast to their respective neighbors, which are then broadcast to their neighbors, so that they are broadcast on a level-by-level basis. If the base station has received the message, the broadcast will not continue. Both can be informed of the change, as well as the moment of change.
  • the base stations in the community change location include the following: a new base station in the community, a neighboring station of the newly added base station, a base station to be shut down, a neighboring station that shuts down the base station, a base station configured with active change resources, and a base station configured with active change resources.
  • the effective terminal of the coverage area of the base station detects a message sent by another base station, the interference information is reported to the base station.
  • the base station learns that the community changes, and collects the adjacency relationship table of the neighboring station, and then integrates it into the updated community adjacency relationship table, and then sends the information to other base stations through broadcast or level-by-stage broadcast.
  • each base station is in the same position, and the operation of each base station is completely the same. Taking one round of resource adjustment process as an example, the following process is included:
  • Each base station updates the adjacency relationship table according to the learned community change message, and the updated adjacency relationship table of each base station is still the same;
  • each base station in the community After the update is completed, each base station in the community performs operation processing according to the updated adjacency relation table according to the unified calculation criterion, and obtains the target resource and the switching time that the base station needs to jump to;
  • the unified computing criteria chosen here must be an optimal resource-saving algorithm, such as the algorithm, to ensure that the same amount of resources can be used to meet the same requirements.
  • the base station also calculates the time of resource switching by itself, and the time point can be calculated by the same formula, because each base station in the community is completely synchronized, so it is easy to implement.
  • the community topology is generated.
  • the frame number at the time of the change is transmitted to each base station along with the update message.
  • each base station can delay the same frame time on the basis of the frame number, so that the handover can be performed at the same time, but the number of delayed frame periods needs to ensure that the slowest base station has also completed the target. Calculation of resources.
  • Each base station uniformly adjusts to a target resource of the local base station when the handover time arrives.
  • each base station switches to the target resource to release the originally occupied resources. After all the base stations are switched to the target resources, the update operation of the community is completed, and the base stations work normally.
  • Embodiment 2 Centralized adjustment
  • a base station or server stores and maintains a neighbor relation table of the community.
  • the base station or server is referred to as a master station, and other base stations are slave stations.
  • Adjacencies adjacency table records for each base station within the Community show pairwise mutually neighbor base station NO ⁇ r.
  • the primary station is a base station in the community.
  • the specific processing procedure includes the following process:
  • the primary station updates the adjacency relationship table according to the information learned in the community;
  • the new community is generated and the primary station needs to know the change. Since the community changes, the base station at the changing position can always directly know the change. If the base station itself is only a slave station, the base station can report the change and the time point to the master station. The master can thus know the change, and the moment when the change occurs, and accordingly update the adjacency list accordingly, and the slave does not need to process.
  • the primary station calculates, according to the updated adjacency relation table, each base station in the new community (the primary station and the secondary station) Target resource and unified switching time;
  • the primary station recalculates the allocation scheme of the resource in the community according to the updated adjacency relation table, and the greedy algorithm can also be used.
  • the result of the calculation is how to allocate the least amount of resources in the community.
  • the result of each calculation is the optimal result, which is the most important allocation for saving the resources. Unlike distributed, each slave does not need to be self-contained. Calculation.
  • the primary station sends a handover indication to each slave station in the community;
  • the handover indication mainly includes the following parts:
  • Target resource identifier The resource identifier that the slave station needs to switch to;
  • Switching time It can be represented by frame number. It is the time point of slave station switching. All base stations in the community switch at this moment.
  • the switching time may still be that the frame number of the community change is delayed by a certain frame period, and when the switching instruction is sent, the frame number corresponding to the sending time may be delayed by a certain frame period. Therefore, the primary station may change the frame number when the community structure changes. Or the frame number corresponding to the transmission time is transmitted to each base station, and each base station adjusts each frame period according to the received frame number and then adjusts each frame period.
  • the slave station receives a handover indication from the primary station.
  • step S705a, S705b, the primary station and the secondary station are respectively adjusted to the target resources at a unified switching time. If the primary station is not a base station, there is no need to allocate the target resource as a base station in step S702, and there is no corresponding step S705a.
  • Hybrid adjustment is a combination of distributed and centralized adjustment methods.
  • a base station or server stores and maintains the adjacency relation table of the community, and then each base station calculates its own target resource individual. After the calculation, all base stations synchronously hop. Go to the target resource individual.
  • the base station or the server is also referred to as a master station, and the other base stations are slave stations.
  • the base station that is first activated in the community as the primary station, and the base station with the most neighbors in the adjacency list is the primary station, and the other base stations are slaves. Station.
  • the adjacency relationship table records the adjacency relationship of each base station in the community, indicating whether the two base stations are adjacent to each other.
  • the primary station is a base station in the community.
  • the specific processing procedure includes the following process:
  • the primary station updates the adjacency relationship table according to the information learned in the community;
  • the new community is generated and the primary station needs to know the change. Since the community changes, the base station at the changing position can always directly know the change. If the base station itself is only a slave station, the base station can report the change and the time point to the master station. The master can thus know the change, and the moment when the change occurs, and accordingly update the adjacency list accordingly, and the slave does not need to process.
  • the primary station sends a resource adjustment request to each slave station in the community;
  • the handover indication mainly includes the following parts:
  • Switching time It can be represented by frame number. It is the time point of slave station switching. All base stations in the community switch at this moment.
  • the switching time may be that the frame number when the community changes is delayed by a certain frame period, or the frame number when the switching instruction is sent may be delayed by a certain frame period.
  • the slave station receives a resource adjustment request from the primary station.
  • Each base station in the community performs operation processing according to the updated adjacency relation table according to a unified calculation criterion, and obtains a target resource that the base station needs to jump to and a handover time; the unified calculation criterion selected here must be one of the most Excellent resource-saving algorithms, such as greedy algorithms, ensure that the same amount of resources can be used to meet the same requirements.
  • a new resource allocation scheme for the entire community is formed.
  • the base station also calculates the time of resource switching by itself, and the time point can be calculated by the same formula, because each base station in the community is completely synchronized, so it is easy to implement.
  • the community topology is generated.
  • the frame number at the time of the change is transmitted to each base station along with the update message.
  • each base station can delay an equal frame period based on the frame number, that is, to switch at the same time, but the number of delayed frame periods needs to ensure that the slowest base station has also completed the target. Calculation of resources.
  • the primary station and the secondary station are respectively adjusted to the target resources at a unified switching time. If the primary station is not a base station, there is no need to request the primary station as a base station to adjust the resource in step S802, and there is no step S805a.
  • the present invention integrates spectrum resources and time resources into time-frequency block resources, which can be applied to the expansion of limited spectrum resources.
  • the time-frequency block is a resource formed by combining frequency and time slices, as shown in FIG. Shown, is an example of a time-frequency block, there are 4 available frequency points, / 2
  • time-frequency block resources b 2 , ...
  • time shift block division can be performed even in a manner similar to the multi-frequency point multi-time period mixing in the following figure, if allowed.
  • BS X operates at frequency j in the previous time of each frame, and the latter time is idle, and »S y is in each frame.
  • the previous time worked at frequency / 2
  • the latter time worked at frequency /i, while the middle was idle for a while.
  • the community structure of the present invention is not limited to a coexisting base station in a broadband access network, and can also be applied to a CDMA (Code Division Multiple Addressing) system to allocate codewords used by each base station, codewords. It is a communication resource in a CDMA system that is used to distinguish the coding of a channel or a user.
  • the CDMA system allows users to share the same spectrum using different codewords. The length of the codeword is different, the rate provided by the channel is different, and the required power is also different, which lays a foundation for the CDMA system to effectively support multiple services and provide different levels of service quality.
  • each base station in the CDMA system can implement automatic allocation and dynamic adjustment of codewords at startup, thereby achieving optimal allocation of communication resources.
  • the method of the present invention can also be applied to an OFDM/OFDMA (Orthogonal Frequency Division Multiple/Orthogonal Frequency Division Multiple Access) system to implement automatic allocation and dynamic adjustment of subchannels in an OFDM/OFDMA system.
  • the subcarriers are composed.
  • the subchannels may be composed of adjacent consecutive multiple subcarriers.
  • the subchannels may also be composed of a plurality of subcarriers dispersed throughout the entire spectrum.
  • the method of the present invention is not limited to application when the community is expanded, and when the community shrinks, the resource allocation can still be re-optimized by the method of the present invention.
  • the present invention further provides a network device 1300, where the adjacency relationship table of the belonging community is stored, and the connection relationship table can be updated in time according to the change of the community, and then The new resource allocation scheme is determined according to the adjacency relationship table, and thus the network device 1300 includes the following structure:
  • the transceiver module 1301 receives community change information sent by other network entities;
  • the update module 1302 and the storage module 1303 are connected between the transceiver module 1301 and the storage module 1302, and update the adjacency stored in the storage module 1303 according to the community change information received from other network entities and/or the self-sensing community change information. Relationship table; or update the received community adjacency relationship table to the storage module 1303;
  • the processing module 1304 is connected to the storage module 1303, and reallocates the communication resource according to the updated adjacency relation table, and determines the switching time.
  • the server when the network device is a server for centralized or hybrid resource adjustment in the community as a primary station, the server includes the following structure in addition to the structure shown in FIG. 13:
  • the notification module 1305 is connected between the transceiver module 1301 and the processing module 1304, generates a notification message including the resource allocation result and the switching time information, or generates a notification message including the community adjacency relationship table, and sends the notification message to the transceiver module 1301. Base stations in the community;
  • the base station when the function of the server is undertaken by one of the base stations, in addition to the structure shown in FIG. 14, the base station further includes the following structure:
  • each base station in the community includes an adjustment module 1306 in addition to the structure shown in FIG. 13, and the connection processing module 1304 adjusts the base station to correspond when the handover time arrives. Target resources.
  • the method of the present invention can apply various optimization algorithms.
  • the background color is used to represent the frequency points, and different background colors represent different frequency points.
  • the process of selecting frequency points for each base station in the community is a process of coloring each node.
  • the adjacency relation table of the community is the adjacency relationship of each node, and the two nodes adjacent to each other are connected by lines, which constitutes the topology structure diagram of the node.
  • the problem of automatically selecting frequency points in a community base station is equivalent to the well-known coloring problem.
  • the example diagram of the different frequency distribution layouts has different results, and the generated topology of the new common body can be abstracted into the node topology shown in FIG.
  • the neighbor relationship table corresponding to the community is shown in Table 2, where the number of neighboring stations is sorted by the number of neighboring stations.
  • the greedy algorithm is one of the more practical algorithms for solving the coloring problem.
  • the coloring process performed by the greedy algorithm can be illustrated by the following formula.
  • BS3 is dark gray
  • BS4 can also be dark gray, and the rest is left.
  • the node is not connected to BS3, but is connected to BS4.
  • a new background color such as black.
  • BS5, BS7, BS1, BS2 and BS6 are not colored.
  • BS5 is selected to be black, and then BS1 can also be made black.
  • the remaining nodes are not connected to BS5, but are connected to BS1.
  • a new background color such as light gray
  • BS7 is selected to be light gray
  • BS2 is connected to BS7 wireless strip, so BS2 can also be made light gray
  • BS6 is neither connected to BS7 nor connected to BS2 cable, so BS6 can also be light gray.

Landscapes

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

Description

一种调整共同体内通信资源的方法和网络设备 技术领域
本发明涉及通信技术 , 特别涉及一种调整基站共同体内通信资源的方法 和网络设备。 背景技术
宽带无线接入技术目前蓬勃发展， 利用无线资源开展宽带城域接入的技 术具有很强的生命力和市场空间。 与此同时， 无线的频谱资源非常宝贵， 特 别是在没有很好规划区域或没有许可的频段 ( LE Band , License-Exempt Band ), 往往会需要相同的信道有多个基站运行， 导致所属系统的相互干扰。 为了协调同频段下各设备之间的共存， 尤其是免许可频段的设备共存， 或没 有经过网络频率规划设备， 需要建立一些设备间的共存机制。
本文中提到的邻站（Neighbor BS )是指有共同覆盖区域， 且共同覆盖区 域中含有有效终端的基站（BS, Base Station )0 如图 1所示， 图中星号表示有 效终端所处的位置， BS1和 BS2虽然地理很近， 且 BS1和 BS2站点本身各自 都在对方的覆盖区域， 但由于共同覆盖区域中没有终端， 没有对对方无线网 络造成严重干扰， 所以不算邻站。 而 BS2和 BS3间虽然交叠区域比较小， 各 自都不在对方的覆盖区域， 但交叠覆盖区域中存在有效终端， 对对方无线网 络造成干扰， 所以 BS2和 BS3在本文中称为邻站。
本文中提到的共同体（ Community )是处于同一环境下的一组基站的集合， 由其中的任何一个基站或部分基站组成的子集都至少与一个本共同体内、 但 不属于该子集的基站具有有效的共同覆盖区域。如图 2所示， BS1、 BS2、 BS3、 BS4共同组成一个共同体 Cl。 而 BS5虽然与 BS3有重叠的覆盖区域，但由于 该重叠区域内并不存在有效终端， 所以 BS5并不属于共同体 C1 , 而是独立地 组成共同体 C2。 对于 BS6和 BS7, 它们本身并不属于共同体 Cl， 而是组成 另一个共同体 C3。 邻接关系表可以完整地记录共同体内的邻接关系， 即每个基站与其他各 基站之间是否互为邻站， 反映了共同体的网络拓朴结构。 该表的行、 列排序 相同， 例如按邻站数量由大到小依次排列。 邻接关系表的值是一个对称矩阵， 对于每个元素， 0值表示对应的行、 列两个基站不互为邻站， 1值则表示对应 的两基站互为邻站。 表 1为邻接关系表的示例， 各基站 BS1、 BS2 BSn 的邻站数量依次减小。
表 1.邻接关系表
Figure imgf000005_0001
共同体内所有基站拥有相同的有限频谱资源。 基站作为共同体的一个成 员， 其工作频率不能任意选择， 而需要统筹地规划， 特别是共同体的规模比 较大时， 这关系到频谱资源能否有效被利用， 利用是否充分， 进而影响到基 站及共同体的性能。
现有各种网络规划方法是对基站采取静态方式进行频段配置， 使共同体 内各基站尽可能地工作在不同频段。 这种方法不支持动态配置， 运营商之间 难以协调。 在网絡发生变化的时候， 不能自动进行调整和协商， 必须重新进 行规划， 工作效率低下。 发明内容
本发明提供一种调整共同体内通信资源的方法和网络设备， 以解决现有 技术固定分配通信资源方法中存在的资源利用率低、 资源配置不灵活的问题。
本发明所述一种调整共同体内通信资源的方法包括如下步骤：
在所述共同体结构发生变化时更新共同体邻接关系表；
根据更新后的邻接关系表重新分配各基站使用的目标通信资源； 共同体内各基站在相同调整时刻分别调整各自的通信资源为新分配给本 基站的通信资源。
较佳的， 共同体中的一个基站或共同体服务器在共同体结构变化时更新 共同体邻接关系表， 并将更新后的邻接关系表发送给共同体内各基站； 共同 体内各基站利用相同算法分别根据更新后的邻接关系表为本基站重新分配目 标通信资源。
较佳的， 共同体中的一个基站或共同体服务器在共同体结构变化时更新 共同体邻接关系表， 并根据更新后的邻接关系表统一为共同体内每一个基站 重新分配目标通信资源； 所述共同体服务器或执行资源重新分配的基站将分 配结果通知给共同体内各基站。
进一步， 共同体中的一个基站或共同体服务器将在发送邻接关系表或目 标通信资源分配结果的同时， 将发送时刻信息发送给各基站， 各基站根据所 述发送时刻信息确定所述相同调整时刻。
其中， 所述发送时刻信息为发送时的帧序号， 所述相同调整时刻为帧序 号延长设定帧周期的时刻。
所述方法中， 所述在共同体结构变化时更新共同体邻接关系表的共同体 服务器是根据处于共同体变化位置的基站上报的信息更新所述共同体邻接关 系表。
其中， 处于共同体变化位置的基站同时上报共同体变化时间信息， 所述 共同体服务器记录所述共同体变化时间信息。
所述方法中， 所述在共同体结构变化时更新共同体邻接关系表的基站是 处于共同体变化位置的基站。
其中， 处于共同体变化位置的基站根据自己邻站的邻接关系表更新本地 共同体邻接关系表， 并记录共同体变化时间信息。
上述方法中， 共同体内各基站获取更新后的共同体邻接关系表及共同体 变化时间信息的过程包括如下步骤：
共同体服务器或处于共同体变化位置的基站更新共同体邻接关系表和共 同体变化时间信息； 然后将更新后的共同体邻接关系表和所述共同体变化时 间信息发送给共同体内其他基站； 共同体内其他基站根据接收的邻接关系表 更新本基站的共同体邻接关系表并保存所述共同体变化时间信息； 或者
共同体服务器或处于共同体变化位置的基站更新共同体邻接关系表和共 同体变化时间信息； 然后将更新后的共同体邻接关系表和所述共同体变化时 间信息发送给自己的邻站； 各邻站再逐级根据邻接关系广播到共同体内所有 基站。
其中， 所述共同体变化时间信息为共同体内的帧序列号、 或在共同体内 同步的绝对时间。
进一步， 共同体内各基站将所述共同体变化时间信息延迟设定阈值得到 所述调整时刻。 所述设定的阔值是共同体内的帧的数量、 或绝对时间长度。
上述方法中， 所述的处于共同体变化位置的基站至少包括： 共同体内新 增基站、 该新增基站的邻站、 即将关闭的基站、 关闭基站的邻站、 主动变化 资源配置的基站、 主动变化资源配置的基站的邻站、 覆盖区域变化的基站及 其邻站， 以及由于在共同体内新启动的终端而形成的邻站。
并且， 当共同体内新增基站时， 所述方法还包括： 新增基站在加入共同 体时与邻站同步帧定时和所述帧序列号。
上述方法中， 所述的通信资源包括基站使用的频率、 时间、 CDMA系统 中的码字或 OFDM/OFDMA系统中的子信道； 和 /或重新分配通信资源的算法 包括贪婪算法。
本发明还提供一种网络设备， 包括收发模块， 所述网络设备还包括： 更 新模块、 存储模块和处理模块；
所述更新模块连接在收发模块和存储模块之间， 根据从共同体内其它网 络设备接收的共同体变化信息和 /或自身感知的共同体变化信息更新存储模块 中保存的邻接关系表， 或者将接收到的共同体邻接关系表更新到存储模块中； 所述处理模块连接存储模块， 根据更新后的邻接关系表重新分配通信资 源， 并确定切换时间。 „
PC—T/CN2006/002577 进一步， 所述网絡设备还包括： 通知模块， 连接在所述收发模块和处理 模块之间， 生成包括资源分配结果和切换时间的通知消息、 或者生成包含共 同体邻接关系表的通知消息， 并通过收发模块将所述通知消息发送给共同体 内其它网络设备。
进一步， 所述网絡设备还包括： 调整模块， 连接所述处理模块， 在切换 时间到达时将本基站调整到对应的目标资源。
本发明技术方案带来的有益效果：
1、 本发明提供了一种自动分配通信资源的方法和网络设备， 使通信资源 在共存基站间的实现协同自动分配， 提高了资源的优化分配和利用；
2、 应用本发明所述技术方案， 当共同体发生变化时， 变化后的共同体可 以自动完成通信资源的自动调整， 实现了利用最少数量的资源达到系统最大 容量的目的；
3、 由于本发明所述技术方案中的共同体包括现有各种通信系统中的共存 性基站集合， 并且本发明所述方法可用于调整现有大部分通信资源， 包括基 站使用的频率、 时间、 CDMA系统中的码字或 OFDM/OFDMA系统中的子信 道等， 因此本发明为一种通用的优化资源配置的方法；
4、 并且， 本发明所述技术方案可以实现全程动态自动完成， 不需要人工 配置， 便于维护， 条低对建网前的网络规划工作的要求。 附图说明
图 1邻站概念示意图；
图 2为共同体概念示意图；
图 3、 图 4为本发明所述方法原理示意图；
图 5 为本发明所述分布式调整模式下， 各基站分别自动计算目.标资源并 调整的流程图；
图 6为本发明所述分布式调整模式下， 各基站根据共同体结构发生变化 时对应的帧序号确定统一调整时间的示意图； 图 7为本发明所述集中式调整模式下， 主站计算目标资源并通知从站同 步调整的流程图；
图 8为本发明所述混合式调整模式下， 主站请求由从站自行计算目标资 源调整并同步调整的流程图；
图 9为本发明所述时频块示例一；
图 10为本发明所述时频块示例二；
图 11、 图 12为构成子信道的两种方式示意图；
图 13为本发明所述一种网络设备的主要结构示意图；
图 14为本发明所述集中式控制方案中， 作为主站的服务器的主要结构示 意图；
图 15为本发明所述集中式控制方案中， 作为主站的基站的主要结构示意 图；
图 16为本发明所述分布式控制方案中， 基站的主要结构示意图； 图 17为贪婪算法计算步骤示意图。 具体实施方式
本发明提供一种根据共同体结构变化情况动态分配可用通信资源的方 法， 当共同体有新的基站加入或退出， 以及共同体发生合并或分裂， 都会导 致共同体的拓朴结构发生改变， 这势必会影响到通信资源在共同体内的布局， 这时通信资源可以在共同体内重新分配 , 为新加入的成员分配出可用的通信 资源。
本发明所述的通信资源是一个广义上的概念， 不仅是指频谱， 还可以是 基站正常工作所需的所有其他独占的资源， 如时间片、 CDMA码字、 子信道 等。 此外， 各种资源的组合也是一种新的资源形态。 共同体的共存性就是要 求所有成员基站在各种资源上进行共享且互不干扰。 只不过有些资源并不稀 有， 个体的数量远多于共同体成员的数量。 而有些资源可供给共同体使用的 个体数量并不多， 需要在共同体内不相邻的基站间共享复用。 本发明不描述允许邻站使用同样资源的情况， 如两个基站互为邻站， 实 际上也就只有位于共同覆盖区域内的各终端才会存在同一资源下的干扰问 题， 而对于共同覆盖区外的各终端， 即使是这两个基站使用同样的频谱资源 或其他资源， 都不会有任何干扰。
如图 3所示， 殳相交的基站均互为邻站， 如果它们使用了相同的频点， 则会产生干扰。 为此它们需要工作在不同的频点上。 图中 BS1 ~ BS6是正在 正常工作的基站， 分别属于两个不同的共同体。 假设这两个共同体所处的区 域可用频点只有 3 个， 每一个频点的使用区域分别用不同的背景色表示。 假 设这三个频点在这两个共同体内的分配如图 3 所示， 这时如果另有一个新基 站 BS7在图中所示的位置启动， 则两个共同体发生合并。 但由于 BS7的三个 邻站 BS3、 BS4和 BS5已经占用了所有的频点， 如果要求 BS7与各邻站均无 干扰， 则需要提供另外的频点。
如图 4所示， 如果频点按图 4所示的布局在 BS1 ~ BS6间分配， 则既可 以保证两个共同体内原有的基站无干扰地独享一个频点， 也可以为新加入的 基站 BS7分配一个现有的频点，当然，还有其他的频点分配方式也可以为 BS7 分配其他背景色区域使用的频点中的一个。
同理， 其他通信资源的分配情况也是如此， 由此可见， 通信资源在共同 体内的不同分配， 所需的资源数量也将不同。 因此， 在共同体扩张时， 可以 对共同体内当前的通信资源分配布局进行调整， 降低共同体对通信资源数量 的需求。
本发明技术构思正是在共同体发生变化后， 根据更新的共同体邻接关系， 重新分配各基站使用的通信资源， 达到优化分配的目的， 具体调整方式有分 布式调整和集中式调整两种， 下面现以通信资源中的频谱为例分别描述。
实施例一、 分布式调整
分布调整方式下， 各种运算是在共同体的每个成员基站上同时进行， 计 算完毕后所有基站同步跳转到自行计算得到的目标资源个体上。
采用分布式调整时， 共同体内的每个基站都需要存储共同体的邻接关系 表。 邻接关系表记录共同体内各基站的邻接关系， 表明两两基站间是否互为 邻站。
共同体拓朴结构发生变化时， 处于变化位置处的基站可以直接获知该变 化及其时间点， 再由这些基站通过有线网络途经广播给其他基站； 或者也可 以由处于变化位置处的基站将获知的变化及其时间点， 广播到它们各自的邻 站， 再由这些邻站广播给它们的邻站， 如此逐级广播， 若基站已经收到过该 消息， 则不再继续广播， 由此各基站都能够获知该变化， 以及变化的时刻。
处于共同体变化位置的基站包括如下几种： 共同体内新增基站、 该新增 基站的邻站、 即将关闭的基站、 关闭基站的邻站、 主动变化资源配置的基站、 主动变化资源配置的基站的邻站、 覆盖区域变化的基站及其邻站， 以及由于 在共同体内新启动的终端而形成的邻站， 这些基站覆盖区域的有效终端检测 到其他基站发送的消息时， 将干扰信息上报所属基站， 所述基站从而获知共 同体发生变化， 并可以收集邻站的邻接关系表， 然后整合为更新后的共同体 邻接关系表后， 再通过广播或逐级广播的方式发送给其他基站。
如图 5所示， 分布方式下， 各基站处于同等的地位， 各基站的操作完全 相同， 以其中一轮资源调整过程为例， 包括如下过程：
5501、 各基站分别根据获知的共同体变化的消息更新邻接关系表， 各基 站更新后的邻接关系表仍然是相同；
5502、 更新完毕， 共同体内的各基站分别依据统一的计算准则， 根据更 新后的邻接关系表进行运算处理， 得到本基站需要跳转到的目标资源以及切 换时间；
这里选择的统一计算准则必须是一种最优的节省资源算法， 如會婪算法， 保证可以使用最少的资源数量来满足同样的需求。 所有基站都完成后就形成 整个共同体的新的资源分配方案。
基站还自行计算资源切换的时间， 该时间点可以是采用相同的公式计算 得到， 因为共同体内各基站完全是同步操作的， 所以很容易实现。
例如： 在通知各共同体更新邻接关系表的时候， 将共同体拓朴结构发生 更改时的帧序号跟随更新消息一起传递给各基站。 这样， 每个基站都可以在 该帧序号的基础上， 延迟一个相等的帧周期， 即可做到在同样的时刻进行切 换， 但这个延迟的帧周期数需要保证最慢的基站也已经完成目标资源的计算。
S503、 各基站在切换时间到达时统一调整到本基站的目标资源。
如图 6所示， 共同体内有三个基站， BS1、 BS2和 BS3。 它们都被告知共 同体拓朴结构是在帧序号为 n的时刻发生了改变， 并假设各基站都延迟 N帧 后进行切换， 则三个基站只要在 N个帧周期内完成目标资源的计算就可以在 第 n+N+1帧处切换至目标资源个体。 其中， 新增基站加入时， 根据邻站的帧 序号同步本地帧序号。
在切换的时间点， 各基站向目标资源进行切换， 释放原来占用的资源。 所有基站都切换到目标资源后， 共同体这一轮的更新操作完毕， 各基站正常 工作。
实施例二、 集中式调整
集中调整方式下， 由一个基站或服务器存储、 维护共同体的邻接关系表。 下面为方便描述， 称该基站或服务器为主站， 其他基站为从站。 例如但不限 于由共同体内最先启动的基站作为主站、 邻接关系表中邻站最多的基站为主 站等， 其他基站为从站。 邻接关系表记录共同体内各基站的邻接关系， 表明 两两基站间^ r否互为邻站。 ' 如图 7所示， 以其中一轮资源调整过程为例， 主站为共同体内一个基站， 具体处理流程包括如下过程：
5701、 主站根据在共同体内获知的信息更新邻接关系表；
首先， 当共同体拓朴结构发生变化时， 新的共同体生成， 主站需要获知 该变化。 因为共同体发生变化时， 处于变化位置处的基站总是能直接获知该 变化， 如果该基站本身只是从站， 则可以由该基站将此变化、 时间点上报给 主站。 主站由此可以获知该变化， 以及该变化发生的时刻， 并据此对邻接关 系表做相应的更新， 从站无需处理。
5702、 主站根据更新后的邻接关系表计算新共同体内各基站 （主站和从 站）的目标资源和统一切换时间；
接下来， 主站根据更新后的邻接关系表后重新计算共同体内该资源的分 配方案， 同样也可采用贪婪算法。 计算的结果是用最少的资源数量如何在共 同体内分配， 每次计算出的结果都是最优的结果， 都是最节省该资源的分配 布局， 与分布式不同的是， 各从站无需自行计算。
5703、 主站向共同体内各从站发送切换指示；
主站计算出共同体内所有基站的目标资源之后， 就需要指示各从站切换 到相应的目标资源， 切换指示主要包括以下几个部分：
1、 目标资源标识： 从站需要切换到的资源标识；
2、 切换时间： 可以用帧序号来表示， 是从站切换的时刻点， 共同体内所 有基站都在该时刻进行切换。
切换时间仍然可以是共同体变化时的帧序号延迟一定的帧周期， 也可以 将发送切换指示时， 发送时刻对应的帧序号延迟一定的帧周期， 因此， 主站 可以将共同体结构变化时的帧序号或发送时刻对应的帧序号发送给各基站， 各基站根据收到的帧序号再延迟设定帧周期后各自进行调整。
5704、 从站接收来自主站的切换指示；
S705a、 S705b、 主站和从站分别在统一的切换时间调整到目标资源。 如果主站不是一个基站， 则步骤 S702中无需将主站作为一个基站分配目 标资源， 相应也没有步骤 S705a。
所有基站都切换到目标资源后， 共同体这一轮的更新操作完毕， 各基站 正常工作。
实施例三、 混合式调整
混合式调整是分布式和集中式两种调整方式的结合， 首先由一个基站或 服务器存储、 维护共同体的邻接关系表， 然后由各基站自行计算自己的目标 资源个体， 计算完毕后所有基站同步跳转到该目标资源个体上。 下面同样称 该基站或服务器为主站， 其他基站为从站。 例如但不限于由共同体内最先启 动的基站作为主站、 邻接关系表中邻站最多的基站为主站等， 其他基站为从 站。 邻接关系表记录共同体内各基站的邻接关系， 表明两两基站间是否互为 邻站。
如图 8所示， 以其中一轮资源调整过程为例， 主站为共同体内一个基站， 具体处理流程包括如下过程：
S801、 主站根据在共同体内获知的信息更新邻接关系表；
首先， 当共同体拓朴结构发生变化时， 新的共同体生成， 主站需要获知 该变化。 因为共同体发生变化时， 处于变化位置处的基站总是能直接获知该 变化， 如果该基站本身只是从站， 则可以由该基站将此变化、 时间点上报给 主站。 主站由此可以获知该变化， 以及该变化发生的时刻， 并据此对邻接关 系表做相应的更新， 从站无需处理。
5802、 主站向共同体内各从站发送资源调整请求；
主站向共同体内所有基站发送资源调整请求， 就需要指示各从站切换到 相应的目标资源， 切换指示主要包括以下几个部分：
1、 更新后的邻接关系表：
2、 切换时间： 可以用帧序号来表示， 是从站切换的时刻点， 共同体内所 有基站都在该时刻进行切换。
切换时间仍然可以是共同体变化时的帧序号延迟一定的帧周期， 也可以 将发送切换指示时的帧序号延迟一定的帧周期。
5803、 从站接收来自主站的资源调整请求；
5804、 共同体内的各基站分别依据统一的计算准则， 根据更新后的邻接 关系表进行运算处理， 得到本基站需要跳转到的目标资源以及切换时间； 这里选择的统一计算准则必须是一种最优的节省资源算法， 如贪婪算法， 保证可以使用最少的资源数量来满足同样的需求。 所有基站都完成后就形成 整个共同体的新的资源分配方案。
基站还自行计算资源切换的时间， 该时间点可以是采用相同的公式计算 得到， 因为共同体内各基站完全是同步操作的， 所以很容易实现。
例如： 在通知各共同体更新邻接关系表的时候， 将共同体拓朴结构发生 更改时的帧序号跟随更新消息一起传递给各基站。 这样， 每个基站都可以在 该帧序号的基础上， 延迟一个相等的帧周期， 即可 ：到在同样的时刻进行切 换， 但这个延迟的帧周期数需要保证最慢的基站也已经完成目标资源的计算。
S805a、 S805b、 主站和从站分别在统一的切换时间调整到目标资源。 如果主站不是一基站， 则步骤 S802中无需将主站作为一个基站请求调整 资源， 相应也没有步骤 S805a。
如前所述， 频谱只是各种通信资源中最直观的一种。 对于其他资源， 也 具备和频谱一样的独占性。 在必要的时候， 这些资源也必须在共同体内合理 分配和布局， 才能以最少的资源数量满足要求。
本发明根据时分复用的原理， 将频谱资源和时间资源整合为时频块资源， 可以对扩展有限的频谱资源的应用， 时频块是频率和时间片进行组合形成的 资源，如图 9所示，是时频块的一个举例， 图中有 4个可用的频点， 、/2
/4, 如果把每个帧周期划分两个时间片 ^ ， 则可以构成 8个时频块资源， 、 b2、 …、 。
如图 10所示， 在允许的情况下， 甚至还可以进行类似下图多频点多时段 混合的方式进行时频块划分。 假设某个基站 ^ x、 3 分别占用上图中的 、 b2两时频块， 则 BSX在每帧的前段时间工作在频点 j上， 后段时间空闲， 而 »Sy在每帧的前段时间工作在频点 /2上， 后段时间工作在频点 /i上， 而中间一 段时间空闲。
本发明所述的共同体结构不限于宽带接入网中的共存基站， 还可以应用 到是 CDMA ( Code Division Multiple Addressing, 码分多址） 系统中， 对各 基站使用的码字进行分配， 码字是 CDMA系统中的通信资源， 用来区分信道 或用户的编码， CDMA系统允许用户使用不同码字来共享相同的频谱。 码字 长度的不同， 信道提供的速率就不同， 所需要的功率也不同， 这为 CDMA系 统有效支持多种业务、 提供不同等级的服务质量奠定了基础。 如果应用本发 明所述方法， CDMA系统中的各基站在启动时可以实现码字的自动分配和动 态调整， 从而实现通信资源的最优分配。 同理， 本发明所述方法还可以应用在 OFDM/OFDMA ( Orthogonal Frequency Division Multiple/ Orthogonal Frequency Division Multiple Access ) 系 统中， 实现 OFDM/OFDMA系统中子信道的自动分配和动态调整， 子信道是 由多个子载波组成， 在 OFDMA系统中， 如图 11所示， 子信道可由相邻的连 续多个子载波组成， 如图 12所示， 子信道也可以由分散在整个频谱内的多个 子载波组成。
本发明所述方法不限于应用在共同体扩张时， 当共同体发生缩小时， 应 用本发明所述方法仍然可以重新优化资源分配。
如图 13 所示， 为实现上述资源调整方法， 本发明还提供一种网络设备 1300, 该网络设备 1300内保存有所属共同体的邻接关系表， 并能够根据共同 体的变化及时更新连接关系表， 然后根据邻接关系表确定新的资源分配方案， 因此网络设备 1300包括如下结构：
收发模块 1301 , 接收其它网络实体发送的共同体变化信息；
更新模块 1302和存储模块 1303,更新模块 1302连接在收发模块 1301和 存储模块 1302之间，根据从其它网络实体接收的共同体变化信息和 /或自身感 知的共同体变化信息更新存储模块 1303中保存的邻接关系表； 或者将接收到 的共同体邻接关系表更新到存储模块 1303中；
处理模块 1304, 连接存储模块 1303, 根据更新后的邻接关系表重新分配 通信资源， 并确定切换时间。
如图 14所示， 当该上述网络设备为共同体内作为主站的进行集中式或混 合式资源调整的服务器时， 除具备图 13所示结构外， 该服务器还包括如下结 构：
通知模块 1305, 连接在收发模块 1301和处理模块 1304之间， 生成包括 资源分配结果和切换时间信息的通知消息， 或者生成包含共同体邻接关系表 的通知消息， 并通过收发模块 1301将通知消息发送给共同体内各基站；
如图 15 所示， 当该服务器的功能由其中一个基站承担时， 除具备图 14 所示结构外， 该基站还包括如下结构： 调整模块 1306, 连接处理模块 1304, 在切换时间到达时将本棊站调整到 对应的目标资源。
如图 16所示， 如果是分布式控制方式， 则共同体内每一个基站除具备图 13所示结构外， 还包括调整模块 1306, 连接处理模块 1304, 在切换时间到达 时将本基站调整到对应的目标资源。
本发明方法可以应用各种优化算法， 这里仅以常用的贪婪算法为例说明 如何分配频点， 直观起见， 这里用背景色来表示频点， 不同的背景色代表不 同的频点。 而如果 4巴基站看成一个节点的话， 为共同体内各基站选择频点的 过程就是为各节点着色的过程。 共同体的邻接关系表也就是各节点的邻接关 系， 互相邻接的两个节点用线条相连， 即构成了节点的拓朴结构图。 共同体 内基站自动选择频点的问题就等价于著名的着色问题。
仍以前面讲述不同频点分配布局有不同结果的示例图为例， 生成的新共 同体的拓朴结构可以抽象成如图 17所示的节点拓朴结构。 该共同体对应的邻 接关系表如表 2所示， 其中， 按邻站数量多少由大至小排序。
表 2邻接关系表
Figure imgf000017_0001
目前贪婪算法是比较实用的解决着色问题的算法之一。 贪婪算法执行的 着色过程可以用下式来说明。
初始： G = [所有节点的集合 ]
重复： while( G 非空 ） 006 002577 {
选择一种新背景色作为当前背景色 C
尽量多地在未着色的节点中给没有与 C 色节点相连的节点着 成 C色
把该节点从 G中剔除
}
在本例中， 如图 17第一步所示， 假设先用深灰色， 从邻接关系表的第一 行开始， BS3被着成深灰色， 其后 BS4也可以着成深灰色， 剩下来的节点不 是和 BS3相连， 就是和 BS4相连。
如图 17第二步所示， 使用新的背景色， 如黑色。 还有 BS5、 BS7、 BS1、 BS2和 BS6未着色。 首先选择 BS5着成黑色， 其后 BS1也可以着成黑色， 剩 下来的节点不是和 BS5相连， 就是和 BS1相连。
如图 17第三步所示， 再使用一种新的背景色， 如浅灰色。 还剩有 BS7、 BS2和 BS6未着色。 首先选择 BS7着成浅灰色， 而 BS2和 BS7无线条相连， 所以 BS2也可以着成浅灰色。 BS6既不和 BS7有线条相连， 也不和 BS2有线 条相连， 所以 BS6也可着成浅灰色。
至此， 各节点都已经着色完毕， 只需要三种背景色即可达到目的。 这就 是仅用三个频点在该共同体内实现无干扰共存的一种分配方式。
显然， 本领域的技术人员可以对本发明进行各种改动和变型而不脱离本 发明的精神和范围。 这样， 倘若本发明的这些修改和变型属于本发明权利要 求及其等同技术的范围之内， 则本发明也意图包含这些改动和变型在内。

Claims

权 利 要 求
1、 一种调整共同体内通信资源的方法， 所述共同体包括两个或两个以上 基站， 其特征在于， 所述方法包括如下步骤：
在所述共同体结构发生变化时更新共同体邻接关系表；
根据更新后的邻接关系表重新分配各基站使用的目标通信资源； 共同体内各基站在相同调整时刻分别调整各自的通信资源为新分配给本 基站的通信资源。
2、 如权利要求 1所述的方法， 其特征在于， 所述方法中：
共同体中的一个基站或共同体服务器在共同体结构变化时更新共同体邻 接关系表， 并将更新后的邻接关系表发送给共同体内各基站；
共同体内各基站利用相同算法分别根据更新后的邻接关系表为本基站重 新分配目标通信资源。
3、 如权利要求 1所述的方法， 其特征在于， 所述方法中：
共同体中的一个基站或共同体服务器在共同体结构变化时更新共同体邻 接关系表， 并根据更新后的邻接关系表统一为共同体内每一个基站重新分配 目标通信资源；
所述共同体服务器或执行资源重新分配的基站将分配结果通知给共同体 内各基站。
4、 如权利要求 2或 3所述的方法， 其特征在于， 所述方法中还包括： 共 同体中的一个基站或共同体服务器将在发送邻接关系表或目标通信资源分配 结果的同时， 将发送时刻信息发送给各基站， 各基站根据所述发送时刻信息 确定所述相同调整时刻。
5、 如权利要求 4所述的方法， 其特征在于， 所述发送时刻信息为发送时 的帧序号， 所述相同调整时刻为帧序号延长设定帧周期的时刻。
6、 如权利要求 2或 3所述的方法， 其特征在于， 所述在共同体结构变化 时更新共同体邻接关系表的共同体服务器是根据处于共同体变化位置的基站 上报的信息更新所述共同体邻接关系表。
7、 如权利要求 6所述的方法， 其特征在于， 所述方法中， 处于共同体变 化位置的基站同时上报共同体变化时间信息， 所述共同体服务器记录所述共 同体变化时间信息。
8、 如权利要求 2或 3所述的方法， 其特征在于， 所述在共同体结构变化 时更新共同体邻接关系表的基站是处于共同体变化位置的基站。
9、 如权利要求 8所述的方法， 其特征在于， 处于共同体变化位置的基站 根据自己邻站的邻接关系表更新本地共同体邻接关系表， 并记录共同体变化 时间信息。
10、 如权利要求 7或 8所述的方法， 其特征在于， 共同体内各基站获取 更新后的共同体邻接关系表及共同体变化时间信息的过程包括如下步骤： 共同体服务器或处于共同体变化位置的基站更新共同体邻接关系表和共 同体变化时间信息； 然后将更新后的共同体邻接关系表和所述共同体变化时 间信息发送给共同体内其他基站； 共同体内其他基站根据接收的邻接关系表 更新本基站的共同体邻接关系表并保存所述共同体变化时间信息； 或者
共同体服务器或处于共同体变化位置的基站更新共同体邻接关系表和共 同体变化时间信息； 然后将更新后的共同体邻接关系表和所述共同体变化时 间信息发送给自己的邻站； 各邻站再逐级根据邻接关系广播到共同体内所有 基站。
11、 如权利要求 10所述的方法， 其特征在于， 所述共同体变化时间信息 为共同体内的帧序列号、 或在共同体内同步的绝对时间。
12、 如权利要求 11所述的方法， 其特征在于， 共同体内各基站将所述共 同体变化时间信息延迟设定阈值得到所述调整时刻。
13、 如权利要求 12所述的方法， 其特征在于， 所述设定的阈值是共同体 内的帧的数量、 或绝对时间长度。
14、 如权利要求 7或 9所述的方法， 其特征在于， 所述的处于共同体变 化位置的基站至少包括： 共同体内新增基站、'该新增基站的邻站、 即将关闭 的基站、 关闭基站的邻站、 主动变化资源配置的基站、 主动变化资源配置的 基站的邻站、 覆盖区域变化的基站及其邻站， 以及由于在共同体内新启动的 终端而形成的邻站。
15、 如权利要求 14所述的方法， 其特征在于， 当共同体内新增基站时， 所述方法还包括： 新增基站在加入共同体时与邻站同步帧定时和所述帧序列 号。
16、 如权利要求 1所述的方法， 其特征在于，
所述的通信资源包括基站使用的频率、 时间、 CDMA 系统中的码字或 OFDM/OFDMA系统中的子信道； 和 /或
重新分配通信资源的算法包括贪婪算法。
17、 一种网络设备， 包括收发模块， 其特征在于， 所述网络设备还包括： 更新模块、 存储模块和处理模块；
所述更新模块连接在收发模块和存储模块之间， 根据从共同体内其它网 络设备接收的共同体变化信息和 /或自身感知的共同体变化信息更新存储模块 中保存的邻接关系表， 或者将接收到的共同体邻接关系表更新到存储模块中； 所述处理模块连接存储模块， 根据更新后的邻接关系表重新分配通信资 源， 并确定切换时间。
18、如权利要求 17所述的网络设备，其特征在于， 所述网络设备还包括： 通知模块， 连接在所述收发模块和处理模块之间， 生成包括资源分配结 果和切换时间的通知消息、 或者生成包含共同体邻接关系表的通知消息， 并 通过收发模块将所述通知消息发送给共同体内其它网络设备。
19、 如权利要求 17或 18所述的网络设备， 其特征在于， 所述网络设备 还包括：
调整模块， 连接所述处理模块， 在切换时间到达时将本基站调整到对应 的目标资源。
PCT/CN2006/002577 2005-11-04 2006-09-29 Procede et appareil reseau destines a ajuster les resssources de communication dans une communaute WO2007051389A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP06791163A EP1940188A4 (en) 2005-11-04 2006-09-29 METHOD AND NETWORK APPARATUS FOR ADJUSTING COMMUNICATION RESOURCES IN A COMMUNITY
CN2006800115193A CN101156485B (zh) 2005-11-04 2006-09-29 一种调整共同体内通信资源的方法和网络设备
US12/114,206 US8005109B2 (en) 2005-11-04 2008-05-02 Method and network apparatus for adjusting communication resources within a community

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200510115542.4 2005-11-04
CNA2005101155424A CN1960527A (zh) 2005-11-04 2005-11-04 一种调整共同体内通信资源的方法

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/114,206 Continuation US8005109B2 (en) 2005-11-04 2008-05-02 Method and network apparatus for adjusting communication resources within a community

Publications (1)

Publication Number Publication Date
WO2007051389A1 true WO2007051389A1 (fr) 2007-05-10

Family

ID=38005436

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2006/002577 WO2007051389A1 (fr) 2005-11-04 2006-09-29 Procede et appareil reseau destines a ajuster les resssources de communication dans une communaute

Country Status (4)

Country Link
US (1) US8005109B2 (zh)
EP (1) EP1940188A4 (zh)
CN (2) CN1960527A (zh)
WO (1) WO2007051389A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009132674A1 (en) * 2008-05-02 2009-11-05 Nokia Siemens Networks Oy Method, system, base station and signal for communicating planned future cell system information in a radio telecommunication network
CN106788949A (zh) * 2015-11-23 2017-05-31 中国移动通信集团公司 一种同步规划方法及装置
US10740224B2 (en) 2018-08-14 2020-08-11 International Business Machines Corporation Data processing system test suite management including dynamic resource reallocation and reconfiguration

Families Citing this family (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8270295B2 (en) 2007-05-21 2012-09-18 International Business Machines Corporation Reassigning virtual lane buffer allocation during initialization to maximize IO performance
US8654634B2 (en) 2007-05-21 2014-02-18 International Business Machines Corporation Dynamically reassigning virtual lane resources
CN101810022A (zh) * 2007-08-09 2010-08-18 北电网络有限公司 无线网络中的基站邻居的自动发现和管理
JP5106304B2 (ja) * 2008-08-01 2012-12-26 株式会社エヌ・ティ・ティ・ドコモ 無線基地局及び移動通信方法
JP5239676B2 (ja) * 2008-09-18 2013-07-17 富士通株式会社 無線通信システム、通信方法及び無線基地局
CN101729324B (zh) * 2008-10-10 2012-05-09 中兴通讯股份有限公司 资源分配方法以及家庭基站配置服务器
CN101730054B (zh) * 2008-10-28 2012-11-28 中兴通讯股份有限公司 基站间x2接口管理方法和装置
KR101617341B1 (ko) * 2009-02-13 2016-05-19 삼성전자주식회사 무선 통신 시스템에서 인접 기지국 테이블 관리 방법 및 이를 위한 시스템
CN102349323B (zh) * 2009-03-13 2017-04-19 日本电气株式会社 无线通信系统、方法、无线基站以及控制站点
US20100310002A1 (en) * 2009-06-05 2010-12-09 Broadcom Corporation Adaptive and selective frame formats within multiple user, multiple access, and/or mimo wireless communications
EP2549791B1 (en) * 2010-03-17 2017-11-22 Fujitsu Limited Wireless communication system, communication control method, and base station
US9585024B2 (en) * 2010-07-27 2017-02-28 Huawei Technologies Co., Ltd. System and method for self-organized inter-cell interference coordination
US9019942B2 (en) * 2010-08-16 2015-04-28 Ubeeairwalk Method and apparatus of supporting wireless femtocell clusters
WO2012068413A1 (en) * 2010-11-17 2012-05-24 Huawei Technologies Co., Ltd. Methods and apparatus for inter-cell interference coordination self-organized network
US8838119B2 (en) 2012-06-26 2014-09-16 Futurewei Technologies, Inc. Method and system for dynamic cell configuration
US9491801B2 (en) * 2012-09-25 2016-11-08 Parallel Wireless, Inc. Dynamic multi-access wireless network virtualization
US10085154B2 (en) 2012-10-17 2018-09-25 Huawei Technologies Co., Ltd. System and method for dynamic inter-cell interference coordination
KR101980132B1 (ko) * 2013-04-26 2019-08-28 삼성전자주식회사 기지국간 통신을 위한 자원 할당 방법 및 장치
EP3017643B1 (en) * 2013-07-03 2019-09-11 Interdigital Patent Holdings, Inc. Multi-band methods for interference limited wireless local area network systems
CN104902573B (zh) * 2014-03-07 2019-01-25 电信科学技术研究院 一种资源分配方法及装置
JP6472740B2 (ja) * 2015-11-30 2019-02-20 日本電信電話株式会社 無線通信システム、無線通信方法および集中制御局
CN110248414A (zh) * 2018-03-09 2019-09-17 索尼公司 用于无线通信的电子设备、方法和计算机可读存储介质
US11144354B2 (en) * 2018-07-31 2021-10-12 Vmware, Inc. Method for repointing resources between hosts
US12004074B2 (en) * 2020-03-20 2024-06-04 Ruckus Ip Holdings Llc Small cell with self-organized neighbor-relationship table
US11943040B2 (en) * 2020-06-03 2024-03-26 Netsia, Inc. System and method for droneran controller
CN115835368B (zh) * 2023-02-24 2023-06-02 深圳锦沃科技有限公司 一种去中心化的多基站时间槽同步方法、系统及存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1996007284A1 (en) * 1994-08-31 1996-03-07 Telstra Corporation Limited A cellular telecommunications method and network
CN1253704A (zh) * 1997-04-25 2000-05-17 诺基亚网络有限公司 信道分配方法
WO2005064968A1 (en) * 2003-12-31 2005-07-14 Nokia Corporation Resource allocation in mobile network

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE69427404T2 (de) * 1994-10-26 2001-11-08 International Business Machines Corp., Armonk Zuordnungsverfahren und Vorrichtung zur Wiederverwendung von Netzressourcen in einem drahtlosen Kommunikationssystem
US6141565A (en) * 1997-11-13 2000-10-31 Metawave Communications Corporation Dynamic mobile parameter optimization
US7092715B2 (en) * 2001-08-22 2006-08-15 Nokia Corporation Method and apparatus for node adding decision support in a wireless network
US7174170B2 (en) * 2003-02-12 2007-02-06 Nortel Networks Limited Self-selection of radio frequency channels to reduce co-channel and adjacent channel interference in a wireless distributed network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1996007284A1 (en) * 1994-08-31 1996-03-07 Telstra Corporation Limited A cellular telecommunications method and network
CN1253704A (zh) * 1997-04-25 2000-05-17 诺基亚网络有限公司 信道分配方法
WO2005064968A1 (en) * 2003-12-31 2005-07-14 Nokia Corporation Resource allocation in mobile network

Non-Patent Citations (1)

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

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009132674A1 (en) * 2008-05-02 2009-11-05 Nokia Siemens Networks Oy Method, system, base station and signal for communicating planned future cell system information in a radio telecommunication network
CN106788949A (zh) * 2015-11-23 2017-05-31 中国移动通信集团公司 一种同步规划方法及装置
CN106788949B (zh) * 2015-11-23 2020-06-09 中国移动通信集团公司 一种同步规划方法及装置
US10740224B2 (en) 2018-08-14 2020-08-11 International Business Machines Corporation Data processing system test suite management including dynamic resource reallocation and reconfiguration

Also Published As

Publication number Publication date
CN1960527A (zh) 2007-05-09
US20080198798A1 (en) 2008-08-21
US8005109B2 (en) 2011-08-23
EP1940188A1 (en) 2008-07-02
EP1940188A4 (en) 2009-03-04
CN101156485B (zh) 2011-11-02
CN101156485A (zh) 2008-04-02

Similar Documents

Publication Publication Date Title
WO2007051389A1 (fr) Procede et appareil reseau destines a ajuster les resssources de communication dans une communaute
CN110572838B (zh) 通信方法、终端设备和网络侧设备
CN101473592B (zh) 用于在分布式无线系统中对用于多播的无线电资源进行协调控制的方法
US8848700B2 (en) Method for device-to-device communication based on cellular telecommunication system
US7929484B2 (en) Wireless communication network providing multi-hop communications
JP4927870B2 (ja) 基地局ノードのリソースを分配する方法、システムおよび装置
CN101237670B (zh) 一种分时共享信道模式下的上行资源分配方法和基站
US20150009871A1 (en) Resource allocation in a radio communication system
CN101119140B (zh) 一种分层小区结构中的负载平衡方法与装置
CN100512229C (zh) 一种支持大容量移动网格网的无线移动站
Bacioccola et al. IEEE 802.16: History, status and future trends
CN105532029A (zh) 在无线网络中共享操作频率
JP2012504921A (ja) 物理セルｉｄの割当方法と基地局
CN102202353B (zh) 一种干扰协调控制的方法、装置及系统
CN102857376A (zh) 分层无线接入系统的网络管理方法
CN1432227A (zh) 降低帧同步无线通信系统中同信道干扰的方法和设备
WO2007082440A1 (fr) Procédé et système permettant de sélection et d'attribution automatiques de ressources
JP2000083277A (ja) 無線通信システムにおけるチャネル割り当て方法および無線通信システム
KR20090005676A (ko) 통신시스템에서 단말 간 통신을 위한 자원 할당 방법 및장치
JP2004015697A (ja) 移動通信システム及び複数周波数の負荷分散方式
WO2012088835A1 (zh) 一种相邻小区间下行干扰的控制方法及系统
KR20060130496A (ko) 다중채널 매체접속제어를 위한 비애자일 채널화 방법
Popescu et al. A management architecture for multimedia communication in cognitive radio networks
CN102186253A (zh) 一种家庭基站的资源配置方法
JP2003339072A (ja) 無線チャネル割当方法および無線ノードを制御するプログラムの記憶媒体

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 200680011519.3

Country of ref document: CN

WWE Wipo information: entry into national phase

Ref document number: 2006791163

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE

WWP Wipo information: published in national office

Ref document number: 2006791163

Country of ref document: EP