KR102073812B1 - Shared resource allocation method for avoiding a cluster interference in ad-hoc network - Google Patents

Abstract

According to the present invention, a shared resource allocation method for avoiding interference between clusters in an ad-hoc network comprises: a step in which an individual cluster as a protocol for the operation of a plurality of clusters constructed in an ad-hoc network has a unique ID and a unique sequence matched thereto, and a special frame shared by all clusters is constructed in the ad-hoc network to allow each cluster to transfer unique sequences for synchronization acquisition for the special frame and receive unique sequence signals from the special frame to acquire synchronization; a step in which clusters acquiring synchronization by received unique sequence signals participate in resource allocation, and clusters which do not acquire synchronization wait for participation in a next special frame by back-off; and a step in which each cluster shares resource allocation information in a predetermined control slot in the protocol after synchronization acquisition, and considers the influence of interference between clusters participating in the resource allocation to separate shared resources and non-shared resources to divide the shared resources for each cluster to allocate the shared resources.

Description

SHARE RESOURCE ALLOCATION METHOD FOR AVOIDING A CLUSTER INTERFERENCE IN AD-HOC NETWORK}

The present invention relates to a shared resource allocation method for avoiding inter-cluster interference in an ad hoc network.

Ad-hoc network is a network that does not have a fixed wired network and consists only of mobile hosts. Therefore, it is suitable for wired networks that are difficult to use or for short-term use after configuring networks. In the ad hoc network, there is no restriction on the movement of hosts and no wired networks and base stations are required. There are many situations in which different units work together to draw attention to its usefulness in many military sectors.

Nodes on an ad hoc network must perform security and routing functions without the support of existing infrastructure. In addition, since there is no node in charge of central management, each function is distributed to nodes in the network. In addition, as the topology of the network changes frequently, the ad hoc network can construct various types of networks that immediately reflect the status of nodes, and must be able to continuously provide services regardless of the topology change of the network. In addition, nodes in the ad hoc network are restricted from using resources such as CPU, memory, and battery. Therefore, it is necessary to apply efficient algorithms and mechanisms to maximize processing with minimum resource usage to prevent unnecessary resource waste.

With the recent development of communication technology, real-time communication is possible only when the tactical communication device is introduced to the large-scale small and medium-sized combat units that are actually engaged in combat at the forefront. In the future, it would be most effective to introduce a mobile ad-hoc network (MANET) technology to small combat units in front of them (see Korean Patent Publication No. 2012-0031569).

MANET refers to a technology that establishes a communication system through interworking communication between nodes in the environment where the topology and mobility of nodes are severely changed. Various routing protocols have been studied and their performance has been verified.

However, when a large number of clusters are formed, there have not been many studies on technologies such as inter-cluster inter-cluster acquisition, synchronization between different clusters, and sharing of resource information. There is an urgent need.

The present invention has been made to solve the above problems, and its object is to provide a method for allocating shared resources for avoiding inter-cluster interference in an ad hoc network.

In particular, the present invention assumes that routing is already implemented in a MANET situation, and provides a method of effectively avoiding interference between clusters, thereby establishing a robust network.

According to the present invention, as a protocol for operating a plurality of clusters configured in an ad hoc network, a special frame shared by the entire cluster is configured in the ad hoc network, with each cluster having a unique ID and a unique sequence matched thereto. Each cluster delivering a unique sequence for synchronization acquisition and receiving a unique sequence signal from a special frame to obtain synchronization; Clusters that have acquired synchronization through the received unique sequence signal participate in resource allocation, and the cluster that has not obtained synchronization waits to participate in the next special frame through backoff; And after the synchronization is acquired, each cluster shares resource allocation information in a control slot determined in the protocol, and divides shared resources by clusters by dividing shared resources and non-shared resources in consideration of the influence of interference between each cluster participating in the resource allocation. Making; It provides a shared resource allocation method for avoiding inter-cluster interference in an ad hoc network comprising a.

)를 산정하고, 산정된 신호대잡음간섭비(

)를 다음의 수학식 2에 대입해 임계값(

)과 비교함으로써 임계값(

) 보다 큰 신호대잡음간섭비(

)를 가지는 노드의 ID를 도출하는 단계; 상기 도출된 노드의 ID들을 이용해 전체 자원구간에서 자원할당이 가능한 UE ID의 집합(

)을 다음의 수학식 3을 통해 정의하는 단계; 및 상기 집합(

)에 속한 UE ID에 대해 할당된 자원블록(RB) 외에 클러스터의 공유 자원을 추가 사용할 수 있도록 할당하는 단계; 를 포함하는 것을 특징으로 한다. Preferably, the step of dividing the shared resources by clusters may include: designating a link for each cluster that can share the resources among the clusters; Signal-to-noise interference ratio according to the following equation for each link cluster (

), And the estimated signal to noise interference ratio (

) By substituting

By comparing

Signal-to-noise interference ratio greater than

Deriving an ID of a node having a); A set of UE IDs capable of allocating resources in all resource sections using the derived node IDs (

) Is defined by Equation 3 below; And the set (

Allocating the shared resources of the cluster to be used in addition to the resource blocks (RBs) allocated for the UE IDs belonging to the MS; Characterized in that it comprises a.

[Equation 1]

[Equation 2]

[Equation 3]

은 상수값을 나타낸다. In Equation 2

Denotes a constant value.

)에 속하지 않은 UE ID에 대해 상기 수학식 1 내지 3에 따라 전체 자원구간에서 자원할당이 가능한 UE ID의 집합(

)을 재선정하여 할당된 자원블록(RB) 외에 클러스터의 공유 자원을 추가 사용할 수 있도록 할당하는 단계; 를 반복 진행하는 것을 특징으로 한다. Preferably, after allocating the shared resources of the cluster for further use, the set (

A set of UE IDs capable of allocating resources in all resource sections according to Equations 1 to 3 for UE IDs not belonging to

Reselecting) and allocating the shared resources of the cluster to be used in addition to the allocated resource blocks (RBs); It characterized in that to proceed repeatedly.

According to the present invention, the inter-cluster interference avoidance in the ad hoc network is effective.

When constructing an ad hoc network through the present invention, it is possible to construct a network robust to interference between clusters, and when the interference is avoided, as well as reducing the probability of interference in the network, the gain of the improved signal-to-noise interference ratio (SINR). This results in improved data throughput performance and the ability to reduce the probability of outages.

1 is a view for explaining an ad hoc network of a single cluster configuration.
2 is a diagram illustrating a resource allocation method of a single cluster configuration in an ad hoc network.
3 is a diagram illustrating a resource collision phenomenon in a multi-cluster configuration in an ad hoc network.
4 is a diagram illustrating a resource allocation method of multiple clusters in an ad hoc network.
5 is a diagram illustrating a resource allocation method for avoiding inter-cluster interference in an ad hoc network according to an embodiment of the present invention.
FIG. 6 is a diagram illustrating a multi-cluster operation in an ad hoc network.
FIG. 7 illustrates a method for allocating shared resources for avoiding inter-cluster interference in an ad hoc network according to an embodiment of the present invention.
8 is a diagram for describing a resource allocation method of dividing shared and non-shared resources.
9 is a diagram for explaining a special slot structure for synchronization acquisition in an ad hoc network according to an embodiment of the present invention.
10 is a diagram illustrating a frame structure for resource allocation control information in an ad hoc network according to an embodiment of the present invention.

As the invention allows for various changes and numerous embodiments, particular embodiments will be illustrated in the drawings and described in detail in the written description. However, this is not intended to limit the present invention to specific embodiments, it should be understood to include all modifications, equivalents, and substitutes included in the spirit and scope of the present invention. In describing the drawings, similar reference numerals are used for similar elements.

Terms such as first, second, A, and B may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, the first component may be referred to as the second component, and similarly, the second component may also be referred to as the first component. The term and / or includes a combination of a plurality of related items or any item of a plurality of related items.

When a component is said to be "connected" or "connected" to another component, it may be directly connected to or connected to that other component, but it may be understood that another component may be present in the middle. Should be. On the other hand, when a component is said to be "directly connected" or "directly connected" to another component, it should be understood that there is no other component in between.

The terminology used herein is for the purpose of describing particular example embodiments only and is not intended to be limiting of the present invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In this application, the terms "comprise" or "have" are intended to indicate that there is a feature, number, step, operation, component, part, or combination thereof described in the specification, and one or more other features. It is to be understood that the present invention does not exclude the possibility of the presence or the addition of numbers, steps, operations, components, components, or a combination thereof.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art. Terms such as those defined in the commonly used dictionaries should be construed as having meanings consistent with the meanings in the context of the related art, and shall not be construed in ideal or excessively formal meanings unless expressly defined in this application. Do not.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram illustrating an ad hoc network in a single cluster configuration, and FIG. 2 is a diagram illustrating a resource allocation method in a single cluster configuration in an ad hoc network.

The ad hoc network scheme generally considered is a scheme composed of a single cluster as shown in FIGS. 1 and 2.

However, when considering only a single cluster configuration method as shown in Figures 1 and 2, when the ad hoc network is configured by different clusters adjacent to each other, interference between adjacent clusters occurs, causing resource conflicts as shown in FIG. In such a multi-cluster configuration, the signal-to-noise interference ratio (SINR) of each cluster may be lowered, resulting in an outage phenomenon.

3 is a diagram illustrating a resource collision phenomenon in a multi-cluster configuration in an ad hoc network.

Therefore, in order to prevent the occurrence of such outages, an efficient resource allocation method that can avoid inter-cluster interference is required.

In the present invention, a method of dynamically dividing resources in consideration of a Quality of Service (QoS) of a cluster, rather than a method of dividing and allocating resources statically, allows throughput efficiency to be expected as compared with a conventional static method. do.

In the present invention, when multiple clusters are configured as shown in FIG. 4 in a single ad hoc network, a resource allocation method for avoiding interference between clusters is proposed.

4 is a diagram illustrating a resource allocation method of multiple clusters in an ad hoc network.

In order to avoid inter-cluster interference in the ad hoc network proposed by the present invention, the following functions should be included in the protocol. The following functions are presented as the basic protocol for sharing resources between clusters.

1. Different clusters (in the case of groups, individual units of platoons or squads) have unique IDs and unique sequences that match unique IDs.

2. The unique sequence of each cluster is used to obtain intercluster synchronization.

3. There is a special frame shared by all clusters to achieve synchronization.

4. In order to acquire synchronization between each cluster in a special frame, a unique sequence is transmitted and different clusters receive a unique sequence signal to acquire synchronization. (Herein, the synchronization acquisition physical layer implementation scheme depends on the receiver algorithm implementation scheme and the detailed description is omitted in the present invention.)

5. The synchronization acquisition method is a random access approach, in which the first to acquire the synchronization participates in resource allocation for avoiding interference, and the non-synchronized cluster backoffs the next special. Compete in the frame.

6. After synchronization acquisition, resource allocation information is shared in a control slot defined in the protocol.

The resource allocation method considers several dynamic methods: The value obtained for each cluster is used to allocate resources in proportion.

In other words, the resource allocation method for avoiding inter-cluster interference in an ad hoc network according to the present invention is a protocol for operating a plurality of clusters configured in an ad hoc network, and each cluster has a unique ID and a unique sequence matched thereto, and the entire cluster is shared. A special frame configured in an ad hoc network such that each cluster delivers a unique sequence for synchronization acquisition and receives a unique sequence signal from the special frame to obtain synchronization; Clusters that have acquired synchronization through the received unique sequence signal participate in resource allocation, and the cluster that has not obtained synchronization waits to participate in the next special frame through backoff; And after the synchronization is acquired, each cluster shares resource allocation information in a control slot determined by the protocol, and each of the clusters participating in the resource allocation includes any one of the channel capacity of the cluster, the cluster delay time, and the channel capacity and delay time of the cluster. Allocating resources by clusters in consideration of each other; It will be made including.

1) Resource Allocation Method Considering Only Channel Capacity of Cluster

When considering only the channel capacity of the cluster, the sum of the CUEs is first calculated through Equation 1 below for resource allocation.

Where k is the index of the cluster and CUE is the channel capacity of UE _i to UE _j . C (k) represents the sum of all CUEs.

The number N _{C (1)} of resources allocated to each cluster calculates its C for the sum of (C), which is the total capacity of the cluster, as shown in Equation 2 below, and allocates the frequency resource proportionally.

That is, in the step of allocating resources by cluster considering the channel capacity, in order to consider the channel capacity of the cluster, the sum C (k) of all channel capacity CUEs according to Equation 1 is obtained for the clusters acquired. Calculating; And calculating the channel capacity (C) of each cluster with respect to the total channel capacity (sum of (C)) of the cluster according to Equation 2 to derive the number N _{C (l)} of resources allocated to each cluster. Allocating frequency resources to the cluster proportionally; It will include.

2) Resource Allocation Method in Consideration of Delay in Cluster

When considering only the channel capacity of the cluster, the sum of DUEs is first calculated through Equation 2 below for resource allocation.

Where k is the index of the cluster and DUE is the latency of UE _i to UE _j . D (k) represents the sum of all DUEs.

The number N _{D (l)} of the resources allocated to each cluster is allocated to the frequency resource by calculating its D with respect to the sum of (D), which is the total delay of the cluster, as shown in Equation 4 below.

That is, in the step of allocating resources by cluster in consideration of the time delay, in order to consider the delay time of the cluster, the sum D (k) of all the delay time DUEs according to Equation 3 is obtained for the acquired clusters. Calculating; And calculating the delay time (D) of each cluster with respect to the total delay time (sum of (D)) of the cluster according to Equation 4 to derive the number N _{D (l)} of resources allocated to each cluster. Allocating frequency resources to the cluster proportionally; It will include.

3) Resource Allocation Method Considering Both Cluster Capacity and Delay

에 따라 비율적으로 고려하여 T(k)를 산정하게 된다. If both channel capacity and delay of the cluster are taken into consideration, C (k) and D (k) are first calculated using Equation 5 below to allocate resources.

In consideration of proportionally, T (k) is calculated.

The number N _{T (l)} of resources allocated to each cluster is allocated as a result of a consensus considering the total capacity and delay of the cluster proportionally and T of the cluster proportionally, as shown in Equation 6 below. Done.

5 is a diagram illustrating a resource allocation method for avoiding inter-cluster interference in an ad hoc network according to an embodiment of the present invention. As shown in FIG. 5 (three clusters), in the resource allocation scheme proposed in the present invention, each cluster will allocate resources in a top-down manner according to its cell ID size.

That is, the step of allocating resources by cluster taking into account both the capacity and the delay of the cluster, in order to take into account both the channel capacity and the delay time of the cluster, to all the clusters obtained in accordance with the equation (1) and (3) Calculating a sum C (k) of the channel capacities CUE and a sum D (k) of all the DUEs, and then calculating the sum T (k) through Equation 5; And calculating the channel capacity and the delay time of each cluster with respect to the total channel capacity and the total delay time of the cluster according to Equation 6 based on the number N _{T (l)} of the resources allocated to each cluster. Allocating frequency resources to each other; It will include.

4) Resource allocation method to distinguish shared and non-shared resources

The above-described actual resource collision situation of FIG. 4 may be represented as using a balanced antenna, as shown in FIG. 6. FIG. 6 is a diagram illustrating a multi-cluster operation in an ad hoc network.

That is, even if there is no interference in the same cluster, there may be a case where the interference between different clusters is greatly given. The present invention proposes a method of designating a link that can share resources between clusters in order to effectively utilize the resources between clusters. Each link performs scheduling on the entire resource instead of the resource interval specified in the control frame when the signal to noise interference ratio (SINR) measured in the special frame interval calculated in Equation 7 is sufficiently large. Offer to be free.

는 상수값이고, 수학식 8은

가 임계값보다 큰 경우의 노드의 iD 값을 의미한다. 수학식 9의 I는 전체 자원구간에서 자유롭게 자원할당이 가능한 UE ID의 집합으로 정의한다.In Equation 8

Is a constant value, and Equation 8 is

ID value of the node when is greater than the threshold value. I of Equation 9 is defined as a set of UE IDs that can be freely allocated in the entire resource interval.

Equation 7 defines the signal-to-noise interference ratio (SINR) from terminal i to terminal j. In this case, interference of the terminal from the terminal i to the terminal k is excluded. Because j is a signal transmitted from terminal i to terminal j, terminal j should not be recognized as interference.

보다 큰 단말의 인덱스(index)를 나타내게 된다. 따라서 임계값 보다 큰 경우에는 자원을 서로 공유하는 것이고 I의 여집합인 단말들은 정해진 구역내에서만 자원을 할당하게 될 것이다. 임계값 보다 큰 경우에는 자원을 서로 공유해도 다른 단말이 미치는 간섭의 영향이 신호를 주고 받는 시그널 전력보다 작기 때문에 충분히 수용가능하므로 서로 자원을 공유하는 것이 가능하다. 서로 자원을 공유하지 못하는 단말들은 I의 여집합이 되고, 이 단말들이 사용하고자 하는 자원의 양은 수학식 7, 8 및 9에 따라 또 다시 나누어지게 될 것이다. Equation 8 shows the index i ', which is a threshold value

It indicates the index of the larger terminal. Therefore, if it is larger than the threshold, resources are shared with each other, and terminals, which is a subset of I, will allocate resources only within a predetermined area. If the value is larger than the threshold, even if the resources are shared with each other, since the influence of interference from other terminals is smaller than the signal power to send and receive signals, it is possible to share the resources with each other. Terminals that do not share resources with each other will be a set of I, the amount of resources to be used by these terminals will be divided again according to Equations 7, 8 and 9.

FIG. 7 illustrates a method for allocating shared resources for avoiding inter-cluster interference in an ad hoc network according to an embodiment of the present invention. As shown in FIG. 7 (three clusters), each cluster allocates resources to each other and shares them with each other, but nodes belonging to I in Equation (9) can use additional shared resources in addition to the allocated resources. will be.

FIG. 8 is a diagram illustrating a resource allocation method of dividing the above-described shared resources and non-shared resources.

That is, the shared resource allocation method for avoiding inter-cluster interference in an ad hoc network according to the present invention is a protocol for operating a plurality of clusters configured in an ad hoc network, and each cluster has a unique ID and a unique sequence matched thereto. Sharing a special frame in an ad hoc network such that each cluster delivers a unique sequence for synchronization acquisition and receives a unique sequence signal from the special frame to obtain synchronization; Clusters that have acquired synchronization through the received unique sequence signal participate in resource allocation, and the cluster that has not obtained synchronization waits to participate in the next special frame through backoff; And after the synchronization is acquired, each cluster shares resource allocation information in a control slot determined in the protocol, and divides shared resources by clusters by dividing shared resources and non-shared resources in consideration of the influence of interference between each cluster participating in the resource allocation. Making; It will include.

)를 산정하고, 산정된 신호대잡음간섭비(

)를 수학식 8에 대입해 임계값(

)과 비교함으로써 임계값(

) 보다 큰 신호대잡음간섭비(

)를 가지는 노드의 ID를 도출하는 단계; 상기 도출된 노드의 ID들을 이용해 전체 자원구간에서 자원할당이 가능한 UE ID의 집합(

)을 수학식 9를 통해 정의하는 단계; 상기 집합(

)에 속한 UE ID에 대해 할당된 자원블록(RB) 외에 클러스터의 공유 자원을 추가 사용할 수 있도록 할당하는 단계; 를 포함하게 될 것이다. Herein, the step of dividing the shared resources for each cluster may include assigning a link for each cluster to share the resources among the clusters; Signal-to-noise interference ratio according to Equation 7

), And the estimated signal to noise interference ratio (

) By substituting Equation 8 into the threshold (

By comparing

Signal-to-noise interference ratio greater than

Deriving an ID of a node having a); A set of UE IDs capable of allocating resources in all resource sections using the derived node IDs (

) Through Equation 9; The set (

Allocating the shared resources of the cluster to be used in addition to the resource blocks (RBs) allocated for the UE IDs belonging to the MS; It will include.

)에 속하지 않은 UE ID에 대해 상기 수학식 7 내지 9에 따라 전체 자원구간에서 자원할당이 가능한 UE ID의 집합(

)을 재선정하여 할당된 자원블록(RB) 외에 클러스터의 공유 자원을 추가 사용할 수 있도록 할당하는 단계; 를 반복 진행할 수 있다. In addition, after the step of allocating the shared resources of the cluster for further use, the set (

A set of UE IDs capable of allocating resources in the entire resource interval according to Equations 7 to 9 for UE IDs not belonging to ().

Reselecting) and allocating the shared resources of the cluster to be used in addition to the allocated resource blocks (RBs); Can be repeated.

(5) Sync acquisition frame structure

If each cluster is not synchronized with each other, it is impossible to share information for avoiding inter-node interference. Therefore, the present invention proposes a method for obtaining synchronization between clusters.

Synchronization considers transmitting a preamble signal known to each other at mutually agreed time. Here, the preamble signal may include a PN sequence, a Barker sequence, and a Zadoff-chu. Which signal is selected is left to freedom, and detailed description of this part is omitted in the present invention.

Referring to FIG. 9, a frame for synchronization acquisition considered in the present invention will be described. 9 is a diagram for explaining a special slot structure for synchronization acquisition in an ad hoc network according to an embodiment of the present invention.

Substantially one of the entire frames of S0 to S7 may be considered, which follows a predefined manner. In the present invention, different F_width is allocated for each ID of the cluster and a preamble signal is transmitted within a predetermined band. This is because the interference between the preamble signals can be reduced as much as possible. In addition, this method is also effective for detecting jamming signals. Here, F_width is calculated by the following equation (10).

A special slot structure as shown in FIG. 9 is proposed in order to utilize resources for synchronization acquisition as efficiently as possible. In order to acquire synchronization with other clusters, bandpass filtering is required at the physical layer (PHY layer) for F_width. It is suggested that F_width is determined in advance between clusters according to the number of participating clusters.

(6) control information frame structure

The control information frame structure in the present invention will be described with reference to FIG. 10 is a diagram illustrating a frame structure for resource allocation control information in an ad hoc network according to an embodiment of the present invention.

Control information for transmitting resource allocation information is considered to be transmitted according to F_width allocated for each cluster. This is because transmitting resource allocation information of a small amount of data in one slot is disadvantageous in terms of resource efficiency. In addition, it is advantageous for inter-cluster interference by utilizing predetermined resources for each cluster.

Such a frame structure in the ad hoc network makes it possible to recognize the interfering parts between different clusters and is also essential to share resource allocation information with each other.

First of all, mutual synchronization between terminals participating in the same network is important for synchronization. The proposed scheme divides the total number of clusters on the frequency axis and allocates each other so that there is no interference. The control information is also transmitted in the same position where the synchronization signal is located, thereby preventing mutual damage. In this case, normal data may be transmitted without transmitting a synchronization signal, and a synchronization signal may be distinguished from a signal due to characteristics of the synchronization signal even when the synchronization signal overlaps with the data signal.

That is, the frame structure in the ad hoc network according to the present invention is a synchronization acquisition frame shared by all participating clusters for synchronization of the plurality of clusters configured in the ad hoc network, and the entire frame is composed of at least two slots. By assigning one of the slots as a special slot and dividing it into the total number of participating clusters based on the frequency band of the network, the dedicated frequency band is allocated to each cluster, and each cluster transmits a synchronization signal for synchronization acquisition at the dedicated frequency band. Will be done.

Here, the synchronization signal is a preamble signal transmitted at a predetermined time, and one of the slots is a control slot for transmitting resource allocation information, and a dedicated frequency band for each cluster is assigned to the control slot in the same manner as the special slot. Resource allocation information is transmitted to the cluster through each band.

As described above, an optimal embodiment has been disclosed in the drawings and the specification. Although specific terms have been used herein, they are used only for the purpose of describing the present invention and are not used to limit the scope of the present invention as defined in the meaning or claims. Therefore, those skilled in the art will understand that various modifications and equivalent other embodiments are possible. Therefore, the true technical protection scope of the present invention will be defined by the technical spirit of the appended claims.

Claims (3)

A protocol for operating a plurality of clusters configured in an ad hoc network. Each cluster has a unique ID and a unique sequence matched thereto, and a special frame shared by the entire cluster is configured in an ad hoc network so that each cluster acquires synchronization for the special frame. Delivering a unique sequence and receiving a unique sequence signal from a special frame to obtain synchronization;
Clusters that have acquired synchronization through the received unique sequence signal participate in resource allocation, and the cluster that has not obtained synchronization waits to participate in the next special frame through backoff; And
After acquiring synchronization, each cluster shares resource allocation information in a control slot determined by the protocol, and divides shared resources and non-shared resources by assigning them to each cluster in consideration of the influence of interference between the clusters participating in the resource allocation. step; Including;
To allocate shared resources by cluster,
Designating a link for each cluster that can share resources between clusters;
Signal-to-noise interference ratio according to the following equation for each link cluster (

), And the estimated signal to noise interference ratio (

) By substituting

By comparing

Signal-to-noise interference ratio greater than

Deriving an ID of a node having a);
A set of UE IDs capable of allocating resources in all resource sections using the derived node IDs (

) Is defined by Equation 3 below;
The set (

Allocating the shared resources of the cluster to be used in addition to the resource blocks (RBs) allocated for the UE IDs belonging to the MS; Shared resource allocation method for avoiding inter-cluster interference in an ad hoc network comprising a.
[Equation 1]

[Equation 2]

[Equation 3]

In Equation 2

Denotes a constant value.
delete delete

Images