WO2017122882A1

WO2017122882A1 - Method for reusing resources in bdma-based communication system

Info

Publication number: WO2017122882A1
Application number: PCT/KR2016/005460
Authority: WO
Inventors: 길계태; 조동호; 금승원; 이주용; 김영국; 오상민
Original assignee: 한국과학기술원
Priority date: 2016-01-15
Filing date: 2016-05-24
Publication date: 2017-07-20

Abstract

A method for reusing resources in a BDMA-based communication system comprises the steps of: identifying, by a resource allocation device, adjacent beam sectors in multiple cells by different types; and allocating, by the resource allocation device, a plurality of resources in different orders for beam sectors having the different types among the beam sectors.

Description

Resource Reuse Method in BDMA-based Communication Systems

The technology described below relates to a technique for reusing resources in BDMA-based multiple cells.

As the traffic of high-speed data communication rapidly increases in a wireless or mobile communication system, research on beam division multiple access (BDMA) systems is actively being conducted in next-generation communication systems. Further research on BDMA systems using patterned / polarized antennas is underway.

Since a radio communication system has limited resources available, a technique for reusing a given radio resource in a plurality of sectors while minimizing interference between sectors has been studied to increase the capacity of the system.

The technology described below is intended to provide a method for reusing radio resources in a BDMA based communication system or a pattern / polarized BDMA based communication system.

In a BDMA-based communication system, a resource reusing method includes: a resource allocator identifying different beam sectors adjacent to each other in the multiple cells, and the resource allocator assigns a plurality of resources to different types of beam sectors among the beam sectors. Assigning in different orders.

In a BDMA-based communication system, a resource reusing method may include: determining, by a resource allocator, at least one of a plurality of resources as a candidate resource for each of the adjacent beam sectors in the multiple cell; Allocating available resources among the priority candidate resources for one target beamsector to the target beamsector, and if there is no available resource among the priority candidate resources for the target beamsector, among the plurality of resources. Allocating available resources to any one of the beamsectors except for the first candidate resource for the target beamsector.

In a BDMA-based communication system, a resource reusing method may include: determining, by a resource allocator, at least one of a plurality of resources as a candidate resource for each of the adjacent beam sectors in the multiple cell; Allocating available resources among the priority candidate resources for one target beamsector to the target beamsector, and if there is no resource among the preferred candidate resources for the target beamsector, assigning the target beamsector to the target beamsector. And allocating available resources to the target beamsector among priority candidate resources of the beamsector located in the non-interfering region with the target beamsector in the direction of the forming antenna.

The technique described below improves the efficiency of radio resource usage by mitigating interference between adjacent sectors in a BDMA based communication system or a pattern / polarized BDMA based communication system.

1 shows an example of a BDMA based communication system.

2 is an example of a radiation pattern using a pattern / polarized antenna.

3 is an example illustrating the concept of a pattern / polarized BDMA based communication system.

4 is an example of a multi-cell communication system composed of a plurality of sectors and a radio resource used in the communication system.

FIG. 5 illustrates an example of allocating radio resources to a beam sector based on a type of a beam sector in a 6 sector cell structure.

FIG. 6 illustrates an example of allocating radio resources to a beam sector based on a type of a beam sector in a 12 sector cell structure.

7 is an example of radio resources with a certain order.

8 illustrates an example of allocating a radio resource to a beamsector using a greed allocation method.

9 illustrates an example of allocating radio resources to a beamsector based on a greed allocation scheme in a 6 sector cell structure.

10 illustrates an example of allocating radio resources to a beamsector based on a greed allocation scheme in a 12 sector cell structure.

The following description may be made in various ways and have a variety of embodiments, specific embodiments will be illustrated in the drawings and described in detail. However, this is not intended to limit the technology described below to specific embodiments, it should be understood to include all changes, equivalents, and substitutes included in the spirit and scope of the technology described below.

The terms first, second, A, B, etc. may be used to describe various components, but the components are not limited by the terms, but merely for distinguishing one component from other components. Only used as For example, the first component may be referred to as the second component, and similarly, the second component may be referred to as the first component without departing from the scope of the technology described below. The term and / or includes a combination of a plurality of related items or any item of a plurality of related items.

As used herein, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It is to be understood that the present invention means that there is a part or a combination thereof, and does not exclude the presence or addition possibility of one or more other features or numbers, step operation components, parts or combinations thereof.

Prior to the detailed description of the drawings, it is to be clear that the division of the components in the present specification is only divided by the main function of each component. That is, two or more components to be described below may be combined into one component, or one component may be provided divided into two or more for each function. Each of the components to be described below may additionally perform some or all of the functions of other components in addition to the main functions of the components, and some of the main functions of each of the components are different. Of course, it may be carried out exclusively by.

In addition, in carrying out the method or operation method, each process constituting the method may occur differently from the stated order unless the context clearly indicates a specific order. That is, each process may occur in the same order as specified, may be performed substantially simultaneously, or may be performed in the reverse order.

The technology described below relates to a technique for reusing resources in a beam division multiple access (BDMA) based communication system. Furthermore, the technology described below relates to a technique for reusing resources in a pattern / polarized BDMA based communication system. Therefore, BDMA and pattern / polarized BDMA are briefly described first.

1 shows an example of a BDMA based communication system. In the BDMA-based communication system, the AP device 10 transmits beams to terminals 5 at different angles (directions), respectively, and simultaneously transmits data to several terminals 5 (downlink). It is assumed that the AP device 10 knows the position of the terminal 5 in advance. The AP device 10 may use an antenna capable of changing the direction of the beam or beamforming a predetermined area.

Similarly, when the terminal 5 sends data to the base station, the terminal 5 transmits a beam directed to the AP device 10. One terminal does not dedicate one beam, and terminals at similar angles may communicate with the base station by sharing one beam. For example, in FIG. 1, Beam 2 becomes a channel through which three terminals and the AP device 10 communicate. In this case, it is preferable that terminals sharing one beam share frequency / time resources.

The AP device 10 includes a device such as a base station of mobile communication. For example, the AP device 10 includes a base station constituting a macro cell of mobile communication, an AP device constituting a small cell of mobile communication, an AP device of WiFi, and an AP device for short range communication such as ZigBee. It is a concept. In the following description, the AP device 10 refers to a device that communicates with the terminal 5 using a specific communication scheme. The AP device 10 may perform a function of connecting the core network and the terminal 5. For convenience of explanation, it is assumed that the AP device 10 is a base station (nodeB, eNodeB, etc.) of a mobile communication network.

The terminal 5 includes various devices that perform wireless communication through the AP device 10. For example, the terminal 5 includes a smartphone, a tablet PC, a notebook computer, a wearable device, and the like. The terminal 5 may be a device having mobility or may be a device fixed at a fixed position.

2 is an example of a radiation pattern using a pattern / polarized antenna. Pattern / polarized BDMA systems communicate using pattern / polarized antennas. The antenna may basically form a constant beam as described in FIG. The antenna includes an antenna element. Furthermore, the antenna element may exhibit different characteristics according to the shape and material of the antenna element.

Depending on the characteristics of the antenna element, the antenna may have a radiation pattern of a certain shape. 2 is an example of a radiation pattern that an antenna may represent. 2 largely illustrates two radiation patterns (n = 1 and n = 2). In addition, different patterns may be configured according to the direction in which the radiation pattern of the same shape is directed. FIG. 2 shows three different radiation patterns for radiation pattern n = 1 and five radiation patterns for radiation pattern n = 2. Furthermore, if the antenna uses a polarized antenna, it may provide different patterns depending on the direction in which the electric and magnetic fields travel.

When the AP device 10 transmits a signal using a unique radiation pattern (first radiation pattern), the terminal 5 may receive a signal by distinguishing the first radiation pattern from another radiation pattern. After all, the radiation pattern is a kind of channel that transmits a signal separately from the beam.

Hereinafter, the "pattern antenna" means an antenna device in which a plurality of antenna elements having a certain pattern are constantly arranged. The pattern antenna may include antenna elements having different patterns. In this case, the antenna device may be a device having a radiation pattern unique to the antenna device. Hereinafter, the "polarized antenna" means an antenna device in which antenna elements having a constant polarization pattern are constantly arranged. As described above, the polarized antenna refers to an antenna that transmits signals that are distinguished from each other in an electric field and a magnetic field area by simultaneously using an electric field antenna and a magnetic field antenna. Hereinafter, "pattern / polarized antenna" means an antenna device using both a plurality of antenna elements having a constant pattern and an antenna element having a constant polarization pattern.

3 is an example illustrating the concept of a pattern / polarized BDMA based communication system. 3 shows an example of a pattern / polarization antenna on top. As shown in FIG. 3, the pattern / polarization antenna may be an antenna array. That is, the pattern / polarization antenna may include a plurality of unit patterns / polarization antennas. An antenna array composed of a plurality of unit pattern / polarized antennas is referred to as a pattern / polarized antenna array hereinafter. In FIG. 3, one unit pattern / polarization antenna 50 is represented by a dotted dotted line. One unit pattern / polarization antenna 50 includes a plurality of

antennas

51, 52, 53. 54. The plurality of

antennas

51, 52, 53. 54 have different radiation patterns, respectively.

The pattern / polarization antenna array may configure B sectors through beamforming. The pattern / polarization antenna array uses beamformers with unique weights per sector to split the beams into sectors spatially, and transmits beams with the same Angle of Direction (AoD) using different pattern / polarization antennas. Can be. Through this, the patterned polarization antenna array may transmit a signal having a plurality of pattern / polarization characteristics simultaneously in each sector. Referring to FIG. 3, K different radiation patterns are simultaneously transmitted using K patterns / polarized antennas. That is, multiple-input multiple-output (MIMO) transmission is possible using a patterned polarization antenna array. If the terminal 5 uses one antenna, multiple-input single-output (MISO) transmission is possible.

A BDMA technique using a pattern / polarized antenna is called pattern / polarized BDMA. In pattern / polarized BDMA, interference between multiple pattern / polarized signals constituting the same sector is previously removed by a precoder and then transmitted. Pattern / polarized BDMA can simultaneously obtain a beamforming gain of a conventional BDMA system and a pattern polarization gain using a pattern / polarized antenna.

The technology described below is a technique for reusing resources in a wireless communication system. In particular, it corresponds to a technique for reusing resources in a wireless communication system composed of multiple cells. The communication system or wireless communication system described below is meant to include various types of communication systems such as a mobile communication system, a WiFi system, a ZigBee system, a Wibro system, and the like. That is, the technology described below is not limited to a specific communication method.

4 is an example of a multi-cell communication system composed of a plurality of sectors and a radio resource used in the communication system. 4A is an example of a multi-cell communication system in which one cell has six sectors (hereinafter referred to as six sectors). The AP device is located in the center region of each cell. In FIG. 4A, an AP device is illustrated as having an antenna in three directions. Of course, the AP device may have an antenna or an antenna array in more various directions. In FIG. 4 (a), the antenna located at the center of the cell is illustrated in a triangle shape. In FIG. 4A, only one antenna or two antennas are illustrated in the boundary region. One cell having _six sectors S ₁ to S ₆ is shown in the upper right side of FIG. 4A. In FIG. 4A, one sector corresponds to a sector formed by the beam described with reference to FIG. 1 or 3. Hereinafter, the sector formed by the beam is called a beam sector.

4B is an example of radio resources used in a cell or sector. In the following description, a 'wireless resource' may be defined as a multi-dimensional area including a time, frequency, space, code, and pattern polarization area given for the purpose of the AP device to use for communication with terminals as shown in FIG. 4 (b). .

The 'wireless resource' may use at least one of time, frequency, space, code, and pattern polarization. Accordingly, although not shown, (i) the radio resource may be a plurality of resource blocks located in a one-dimensional straight line corresponding to any one of time, frequency, space, code, and pattern polarization region. (ii) The radio resource may be a plurality of resource blocks located in a two-dimensional plane composed of any two of time, frequency, space, code, and pattern polarization region.

The radio resource allocation or radio resource reuse method described below is largely two techniques. (1) One is a method of dividing a beam sector into a plurality of types and allocating available resources in a different order for each type (hereinafter, referred to as a "type based method"). (2) The other method is to set a resource that can be used first for each beam sector among the resources, and to allocate the resource based on this (hereinafter, referred to as a "greedy allocation method").

Meanwhile, the radio resource allocation or reuse may be performed by the AP device communicating with the terminal. One AP device in charge of one cell may allocate radio resources for a terminal in coverage. Alternatively, in a plurality of cells, each AP device may cooperate with each other while delivering necessary information to allocate radio resources for a terminal in coverage of each AP device. Meanwhile, a separate entity that is responsible for allocating resources for the terminal in the core network may allocate radio resources for the terminal. The entity in charge of resource allocation in the core network transmits commands or information related to radio resource allocation to the AP device so that the AP device allocates resources to the terminal located in the coverage. In the radio resource allocation or radio resource reuse method described below, it is not important which object allocates resources. Therefore, hereinafter, an object for allocating a radio resource is called a resource allocation device. The resource allocating apparatus may allocate idle radio resources in various ways such as sequential allocation and random allocation.

타입 기반 방식Type-based approach

First, the type-based method will be described. FIG. 5 illustrates an example of allocating radio resources to a beam sector based on a type of a beam sector in a 6 sector cell structure. 5 shows an example of a case in which one cell has six beam sectors.

FIG. 5A illustrates an example of adjacent beamsector regions in a 6 sector cell structure. The resource allocator classifies adjacent beam sectors into different types in multiple cells. 5 (a) shows adjacent beamsectors of different types A and B. FIG.

5 (b) and 5 (c) show examples of resource allocation order for beam sectors of type A and type B, respectively. 5 (b) and 5 (c) illustrate the resources available to the beam sector in the form of a table. The radio resource may be defined in multiple dimensions as described with reference to FIG. 4 (b), but a table form is also shown for convenience of description.

The size of the radio resource may be a uniform size or may have various sizes. For example, the radio resource may be divided into N subsets of the entire resource set as shown in FIG. 6. At this time, the minimum size of the resource subset is 1. The resource subset corresponds to one radio resource block. Each radio resource block included in the table has a unique ID. In FIG. 5 (b) and FIG. 5 (c), a radio resource block is indicated as a 'Resource subset'. 5 (b) and 5 (c), the table has N radio resource blocks. The resource allocator allocates any one of N radio resource blocks to the beamsector.

The resource allocating apparatus may allocate available resources while searching for a radio resource block from 1 to N (forward) as shown in FIG. 5 (b) for the type A beam sector. In contrast, the resource allocating apparatus may allocate available resources to the type B beamsector while searching for a radio resource block from N to 1 direction (reverse direction) as shown in FIG. Through this, different resource blocks may be allocated to different types of beam sectors, thereby reducing the possibility of interference. The block search method illustrated in FIGS. 5B and 5C is one example. The resource allocator may use various methods for allocating available resources more quickly without overlapping different types of beam sectors.

5 (b) and 5 (c), the resource allocator searches for available resources based on a sequential search method. Unlike in FIG. 5, the resource allocating apparatus may sequentially search for one type (A) of beam sectors based on one direction, and perform random search for another type (B) of beam sectors.

FIG. 6 illustrates an example of allocating radio resources to a beam sector based on a type of a beam sector in a 12 sector cell structure. 6A illustrates an example of an adjacent sector area in a 12 sector cell structure. The resource allocator classifies adjacent beam sectors into different types in multiple cells. 6 (a) shows adjacent beamsectors of different types A and B. FIG.

6 (b) and 6 (c) show an order of allocating radio resources to different types of beam sectors shown in FIG. 6 (a). 6 is an example of allocating radio resources in the same manner as in FIG. 5 except that only the sector structure is different. The resource allocating apparatus may allocate available resources while searching for a radio resource block in a 1 to N direction (forward direction) as shown in FIG. 6 (b) for the type A beam sector. In contrast, the resource allocating apparatus may allocate available resources to the type B beamsector while searching for a radio resource block from N to 1 direction (reverse direction) as shown in FIG. Of course, the block search method shown in Figs. 6 (b) and 6 (c) is an example. The resource allocator may use various resource searching methods.

5 and 6 are divided into two types (A and B) of the beam sector constituting the cell. However, the beam sector constituting the cell may be divided into three or more types. In the resource allocation apparatus, adjacent beam sectors are classified into different types. In addition, the resource allocation apparatus may allocate a plurality of resources in different orders in different types of beam sectors.

7 is an example of radio resources with a certain order. 5 and 6 described that the resource allocation apparatus searches for available resources in a certain order. The resource allocator classifies a plurality of resource blocks in a certain order, and allocates resources to different types of beam sectors in different orders based on the order. The method of determining the order for the plurality of resource blocks may vary. For example, the order may be distinguished by assigning an identifier having a predetermined size to each resource block. FIG. 7A illustrates an example of classifying by assigning a constant identifier to a 2D resource block. For example, the order of resource blocks may be set according to an identifier number from 1 to 50. FIG. 7 (b) shows another example in which a sequence is distinguished by assigning a predetermined identifier in a 2D resource block. FIG. 7C illustrates an example of distinguishing an order by assigning a predetermined identifier to a 3D resource block. FIG. 7 (d) is another example in which the order is divided by assigning a constant identifier in the 3D resource block. In FIG. 7 (d), a certain identifier is assigned to a resource block on a different basis from FIG. 7 (c).

탐욕 할당 방식Greed Assignment Method

In the greed allocation method, the resource allocator designates at least one resource block to allocate resources for each beamsector preferentially. Thereafter, the resource allocator first allocates available resources in a resource block to which resources are first allocated for each beam sector. If there is no resource available in the block, the resource allocator searches for available resources among other resource blocks. The greed allocation scheme is preferably searched in an order in which interference can be minimized when allocating resources for each beamsector.

To do this, first divide the entire resource set U into N subsets (R ₁ , R ₂ , ..., R _N ). U = R ₁ ∪ R ₂ ∪ ... ∪ R _N. (R ₁ , R ₂ , ..., R _N ) included in U are called candidate resources. Resource allocation apparatus determines the block to at least preferentially search for a resource block from among a plurality of beams for the sector _{_{(S 1, S 2, ...}} , S K). A block to be preferentially searched for a beamsector is called a candidate resource. For example, the first candidate resources for the beam sector as the first candidate resources for the S ₁ P _1, and that the first candidate resources for the beam sector S ₂ P _2, and the beam sector is defined as P S _K _K. One of the priority candidate resources is set to at least one of the candidate resources R ₁ , R ₂ ,..., R _N. The same candidate resource may be set as the first candidate resource for different beam sectors.

Greed allocation can again be categorized in two ways. Hereinafter, the first greed allocation method and the second greed allocation method. 8 is an example for explaining the first greed allocation scheme, and FIGS. 9 and 10 are examples for explaining the second greed allocation scheme.

The first greed allocation method searches for and allocates resources in the following order. The resource allocator searches for available resources among the resources in the candidate resource P _k first (i) for the type S _k sector. (ii) If there are no resources available in P _k , search for available resources among the resources in UP _k . Where U represents the entire set of resources. The resource allocation unit may use a method such as a sequential scan, random search when searching for a resource available in the other P _k and _k UP.

8 illustrates an example of allocating a radio resource to a beamsector using a greed allocation method. 8 (a) and 8 (b) show examples of allocating radio resources to adjacent sectors in a six-sector cell structure using a greed allocation scheme. 8A illustrates an example of an adjacent sector area in a six sector cell structure. Referring to FIG. 8A, adjacent sector areas include beam sectors S ₁ to S ₆ . 8 (b) is a table showing resources available to the beamsector. The table includes candidate resources (R ₁ , R ₂ , ..., R _N ) obtained by dividing the entire resource resource set U into N pieces. The resource allocator allocates available resources among candidate resources to any beam sector.

First, each beamsector is first assigned a candidate resource. First, the candidate resource may be a resource preferred by a specific beamsector. The preferred candidate resource for beamsector S ₁ is P ₁ , the preferred candidate resource for S ₂ is P ₂ , the preferred candidate resource for S ₃ is P ₃ , and the preferred candidate resource for S ₄ is P ₄ , a first candidate resources for the S ₅ is P _4, is defined as a first candidate for the resource S ₆ is P _6. FIG. 8 (b) shows an example of preferred candidate resources for some beamsectors of FIG. 8 (a). The priority candidate resource P ₁ includes candidate resources R ₁ , R ₂ , R _3, and R _N , the priority candidate resource P ₂ includes candidate resources R _N _-3 and R _N _-2 , and the priority candidate resource P ₃ is Include only candidate resource R ₄ .

The beam sector S ₁ will be described as an example. The resource allocator searches for available resources among the priority candidate resources P ₁ = (R ₁ , R ₂ , R ₃ , R _N ) for S ₁ . If an available resource (eg, R ₃ ) is found at P ₁ , the resource allocator allocates R ₃ to S ₁ . However, if a resource available at P ₁ is not found, the resource allocator searches for available resources at the remaining candidate resources UP ₁ that have not been found. When the resource allocation unit is searching for a resource (R _N-1) available in any particular way in the UP ₁ R to S _N ₁ _- assigns _1. The resource allocation apparatus allocates resources to other beam sectors in the same process.

8 (c) and 8 (d) show an example of allocating radio resources to adjacent sectors in a 12 sector cell structure by a greed allocation method. 8 (c) shows an example of an adjacent sector area in a 12 sector cell structure. Referring to FIG. 8C, adjacent sector areas include beam sectors S ₁ to S ₁₂ . 8 (d) is a table showing resources available to the beamsector. The table includes candidate resources (R ₁ , R ₂ , ..., R _N ) obtained by dividing the entire resource resource set U into N pieces. The resource allocator allocates available resources among candidate resources to any beam sector.

FIG. 8 (d) shows an example of preferred candidate resources for some beamsectors of FIG. 8 (c). The first candidate resource P ₁ includes candidate resources R ₁ and R ₂ , the first candidate resource P ₂ includes candidate resources R ₃ and R ₄ , and the first candidate resource P ₄ is a candidate resource R _N _-2 , R _N- _{. 1} and R _N , and first, candidate resource P ₆ includes only candidate resource R _N-3 .

The beam sector S ₁ will be described as an example. The resource allocator searches for available resources among the priority candidate resources P ₁ = (R ₁ , R ₂ ) for S ₁ . If an available resource (eg, R ₂ ) is found at P ₁ , the resource allocator allocates R ₂ to S ₁ . However, if a resource available at P ₁ is not found, the resource allocator searches for available resources at the remaining candidate resources UP ₁ that have not been found. The resource allocation unit is one resource available in any particular way in the UP ₁ _- a search for (R ₂ _N) assigns a R _N _-2 to S _1. The resource allocation apparatus allocates resources to other beam sectors in the same process.

The second greed allocation method searches for resources for the beam sector in the following order and allocates available resources. The resource search order for a type S _k sector is as follows. (i) searches for a resource from among the available resources in the first candidate P _k resources. (ii) If an available resource is not found in P _k , the available resource is searched among priority candidate resources of beam sectors not located in the primary interference region of the beam sector S _k . Adjacent beamsectors may constantly interfere with each other. Accordingly, the resource allocator first searches for a resource for S _k among the priority candidate resources of the beam sectors located in the non-interfering region with no interference effect. The preferred candidate resource of the beam sector located in the non-interfering region is called O _k . (iii) If an available resource is not found even in O _k , the resource allocator searches for an available resource in the resource except for the priority candidate resource of the opposing sector of sector S _k . The preferred candidate resource of the sector facing the sector S _k is called I _k . At this point, the resource allocation device is U- (P _k ∪ O _k ∪ I _k ) to search for available resources. (iv) If the resource allocator fails to search for available resources for sector S _k , it finally searches for available resources within the priority candidate resource I _k of the opposing sector of sector S _k . In other words, candidate resources with a large interference effect are searched in the last order. The resource allocator may use a sequential search or a random search when searching for resources available in each process. 9 and 10 illustrate an example of the second greed allocation method.

9 illustrates an example of allocating radio resources to a beamsector based on a greed allocation scheme in a 6 sector cell structure. 9A shows an example of an adjacent sector area in a six sector cell structure. FIG. 9B is a table showing resources available to the beamsector of FIG. 9A. The table includes candidate resources R ₁ , R ₂ , ..., R _{N obtained} by dividing the entire resource set U into N pieces. Figure 9 (b) is preferred for the beam sector S ₁ candidate resources _{_{P 1 = (R 1, R}} 2, R 3) and a priority for the beam sector S ₆ candidate resources _{_{P 6 = (R N-3}} , R N- ₂ ) is shown.

Resource allocation for the beam sector S ₁ shown in FIG. 9A will be described as an example. (i) The resource allocator searches for available resources in P ₁ . (ii) If an available resource is not found at P ₁ , the resource allocator searches for a beam sector located in the non-interfering region of the beam sector S ₁ . A region indicated by diagonal lines in FIG. 9 (a) is an interference region of S ₁ . Referring to FIG. 9A, it can be seen that all adjacent sector areas are included in the interference area of S ₁ . Therefore, in this case, there is no beamsector located in the non-interfering region of the beamsector S ₁ . (iii) a resource allocation device retrieves the resources except for the resources of the first candidate of the beam facing the sector S ₁ from the candidate resources that have not been scanned beam sector S _6. That is, the resource allocator searches for available resources among U- (P ₁ ∪P ₆ ). (iv) If no available resource is found in U- (P ₁ ∪ P ₆ ), the resource allocator finally selects the available resource from the resources in P ₆ .

10 illustrates an example of allocating radio resources to a beamsector based on a greed allocation scheme in a 12 sector cell structure. 10A shows an example of an adjacent sector area in a 12 sector cell structure. FIG. 10 (b) is a table showing resources available to the beamsector of FIG. 10 (a). The table includes candidate resources (R ₁ , R ₂ , ..., R _N ) obtained by dividing the entire resource resource set U into N pieces. Figure 10 (b) is first candidate resources for the beam sector P ₁ = _{_{_{S 1 (R 1, R 2}}} , R 3), first candidate resources for the beam sector _{_{_{S 12 P 12 = (R N}}} -1, R N) To show. FIG. 10 (b) shows that the preferred candidate resources for beam sectors S ₃ , S ₆ , S _7, and S ₁₀ include all of R ₄ to R _N _-3 . Priority candidate resources for S ₃ , S ₆ , S _7, and S ₁₀ are not indicated, but P ₃ ∪ P ₆ ∪ P ₇ ∪ P ₁₀ = (R ₄ , ..., R _N-3 ).

Resource allocation for the beam sector S ₁ shown in FIG. 10A will be described as an example. (i) The resource allocator first searches for available resources at P ₁ . That is, the resource allocator searches for available resources at P ₁ = (R ₁ , R ₂ , R ₃ ). (ii) When there is no resource available at P ₁ , the resource allocator searches for available resources among preferred candidate resources of beam sectors not located in the primary interference region of the beam sector S ₁ . That is, the resource allocating apparatus searches for available resources among preferred candidate resources for beam sectors located in the non-interfering region of the beam sector S ₁ . Referring to FIG. 10A, the beam sectors located in the interference region of the beam sector S ₁ in the adjacent sectors of the hexagon are S ₂ , S _11, and S ₁₂ . There are considerations in determining the beamsector located in the non-interfering region. Consider the direction of the beam sector S ₁ to which the current resource is to be allocated. In other words, consideration should be given to the orientation of the antenna providing the beam sector S ₁ . Considering the directionality, O ₁ = P ₃ ∪ P ₆ ∪ P ₇ ∪ P ₁₀ . Therefore, the resource allocator searches for available resources among O ₁ . That is, the resource allocator searches for available resources at P ₃ ∪ P ₆ ∪ P ₇ ∪ P ₁₀ = (R ₄ , ..., R _N _- ₃ ). (iii) When there is no available resource among O ₁ , the resource allocator searches for available resources in resources other than the candidate candidates of the sector S ₁ facing each other among candidate resources not currently searched. In FIG. 10 (a), the first candidate resource I ₁ = P ₁₂ or I ₁ = P ₅ ∪ P ₁₂ of the opposing sector of sector S ₁ may be set. P ₅ which may be included in I ₁ means a beam sector adjacent to the left side of P ₁₂ . For convenience of explanation, it is assumed that I ₁ = P ₁₂ . In this case, the resource allocation device searches for available resources in U- (P ₁ ∪ O ₁ ∪ I ₁ ). (iv) If no resources are available in U- (P ₁ ∪ O ₁ ∪ I ₁ ), then the resource allocator searches for available resources among the resources in I ₁ . That is, the resource allocator searches for available resources at P ₁₂ = (R _N _-1 , R _N ).

4 to 10, a resource allocation method has been described with reference to a beam sector positioned on a predetermined plane. However, the same method can be applied to a polarization / pattern BDMA-based beamsector as shown in FIG. 3. Even if the beam sector is located in the vertical direction, resource allocation can be performed in the same manner.

The embodiments and the drawings attached to this specification are merely to clearly show a part of the technical idea included in the above-described technology, and those skilled in the art can easily make it within the scope of the technical idea included in the above-described technology and drawings. It will be apparent that both the inferred modifications and the specific embodiments are included in the scope of the above-described technology.

Claims

A resource reuse method in a BDMA based multi-cell communication system,

The resource allocating apparatus may further include identifying adjacent beam sectors of different types in the multiple cells; And

The resource allocating apparatus includes allocating a plurality of resources in different orders to different types of beam sectors among the beam sectors.
The method of claim 1,

Wherein the adjacent beamsector is at least one of an adjacent beamsector in the same cell and an adjacent beamsector in different cells.
The method of claim 1,

The method of resource reuse in a BDMA based communication system wherein the adjacent beam sectors are identified in one of two types.
The method of claim 1,

The plurality of resources have a sequence of orders,

Any one of the different types of beamsectors is allocated available resources by searching for the plurality of resources in a forward order, and another one of the different types of beamsectors comes out by searching the plurality of resources in a reverse order. Resource reuse method in BDMA based communication system allocated available resources.
The method of claim 1,

The plurality of resources have a sequence of orders,

One of the different types of beamsectors is allocated available resources by searching for the plurality of resources in a predetermined order, and the other of the different types of beamsectors randomly searches the plurality of resources. A resource reuse method in a BDMA based communication system which is allocated outgoing available resources.
The method of claim 1,

The plurality of resources are each identified by an identifier having a size,

Any one of the different types of beamsectors is allocated an available resource that is searched forward from the smallest identifier with the smallest size, and another one of the different types of beamsectors sizes the plurality of resources. Resource reuse method in a BDMA-based communication system in which an allocated resource is searched backwards from the largest identifier.
The method of claim 1,

In the cell, the AP device uses a pattern / polarized antenna to provide a plurality of beams having different radiation patterns to each beamsector.
The method of claim 1,

And the resource is at least one of frequency, time and code.
A resource reuse method in a BDMA based multi-cell communication system,

The apparatus for allocating a resource may include: determining at least one of a plurality of resources as a candidate resource for each of the adjacent beam sectors in the multiple cells;

The resource allocating apparatus may include allocating available resources to the target beamsector among available candidate resources for a target beamsector, which is one of the beamsectors; And

When there is no available resource among the priority candidate resources for the target beamsector, the resource allocating apparatus allocates one of the plurality of resources to resources available for the remaining resources except for the preferred candidate resources for the target beamsector. Resource reuse in a BDMA-based communication system comprising:
The method of claim 9,

The resource allocation apparatus determines the priority candidate resource for each beamsector constituting the multi-cell, allocates available resources among its priority candidates to each of the beamsectors, and among the own priority candidate resources. A resource reuse method in a BDMA-based communication system for allocating available resources to each of the beam sectors except for the first candidate resource of the plurality of resources without available resources.
The method of claim 9,

Wherein the adjacent beamsector is at least one of an adjacent beamsector in the same cell and an adjacent beamsector in different cells.
The method of claim 9,

The resource allocation device

The resource allocation apparatus is a resource reuse method in a BDMA-based communication system for searching for available resources for the target beam sector using a sequential search method or a random search method.
The method of claim 9,

In the cell, the AP device uses a pattern / polarized antenna to provide a plurality of beams having different radiation patterns to each beamsector.
The method of claim 9,

And the resource is at least one of frequency, time and code.
A resource reuse method in a BDMA based multi-cell communication system,

The apparatus for allocating a resource may include: determining at least one of a plurality of resources as a candidate resource for each of the adjacent beam sectors in the multiple cells;

The resource allocating apparatus may include allocating available resources to the target beamsector among available candidate resources for a target beamsector, which is one of the beamsectors; And

The resource allocation apparatus is available among the priority candidate resources of the beam sector located in the non-interfering region with the target beam sector in the direction of the antenna forming the target beam sector when there is no available resource among the priority candidate resources for the target beam sector And allocating a resource to the target beamsector.
The method of claim 15,

The resource allocating apparatus is a location facing each other based on the direction of the target beamsector among resources that have not yet been determined to be available among the plurality of resources when there are no available resources among the priority candidate resources of the beamsector located in the non-interfering region. And allocating available resources to the target beamsector except for the preferential candidate resources of the beamsector in the target beamsector.
The method of claim 16,

The resource allocating apparatus may further include allocating available resources to the target beamsector among priority candidate resources of the beamsector located at the opposite location when no resources are available in the remaining resources. Reuse method.
The method of claim 15,

Wherein the adjacent beamsector is at least one of an adjacent beamsector in the same cell and an adjacent beamsector in different cells.
The method of claim 15,

In the cell, the AP device uses a pattern / polarized antenna to provide a plurality of beams having different radiation patterns to each beamsector.
The method of claim 15,

And the resource is at least one of frequency, time and code.