CN102858017B - Method and apparatus for cooperative scheduling using interference between multiple points - Google Patents

Abstract

A method and apparatus for cooperative scheduling using interference between multiple points is described. For each link, a cooperative set including cooperative links for cooperative scheduling is set. A collaborative session map is generated, wherein the collaborative session map is used to define a cooperative link selected from the cooperative set for each link in each session of the network. The collaboration groups that will be scheduled concurrently are determined using the collaboration session map.

Description

Method and apparatus for cooperative scheduling using interference between multiple points

This application claims the benefit of Korean Patent Application No. 10-2011-0062786 filed with the Korean Intellectual Property Office on Jun. 28, 2011, the entire disclosure of which is hereby incorporated by reference.

technical field

The following description relates to a method and apparatus for cooperative scheduling using interference between multiple points.

Background technique

In the current communication environment, problems may arise when a rapid increase in traffic occurs. This rapid increase in traffic may be the result of multiple electronic devices communicating simultaneously. For example, the multitude of devices in communication may include smart devices, sensor devices, and the like. Current cellular communications are generally not capable of handling rapid increases in traffic.

Another problem that may occur in the current communication environment may be a limited amount of conventional frequency resources, which may not be sufficient to support an increase in the number of communication terminals or electronic devices and an increase in traffic. Conventionally used frequency bands may not sufficiently improve frequency efficiency. In some cases, frequency bands of tens of GHz can be used for broadband frequency resources. However, broadband frequency resources may have problems such as a relatively short transmission distance due to path loss.

Accordingly, there is a need for devices and methods that will be configured to communicate by using multi-hops or Communicating directly over relatively short distances communicates more efficiently with reduced latency. Furthermore, there is a need for an apparatus and method that can compensate for interference due to resource reuse (reuse) while allowing a terminal to communicate with other terminals to reuse as efficiently as possible frequency resources.

Contents of the invention

According to the illustrated example, a method for cooperative scheduling using interference between multiple points is described. The method includes: setting, for each link, a cooperation set (cooperationset) including cooperative links for cooperative scheduling. The method includes generating a cooperative session map, wherein the cooperative session map is used to define a cooperative link selected from a cooperative set for each link in each session of the network. The method also includes determining cooperation groups to be concurrently scheduled using the cooperation session map.

According to another illustrated example, an apparatus for cooperative scheduling using interference between multiple points is described. The device includes: a setting unit configured to set, for each link, a cooperative set including cooperative links for cooperative scheduling. The apparatus includes a generator configured to generate a collaborative session map, wherein the collaborative session map defines at least one collaborative link selected from a cooperative set for each link in each session of the network. The apparatus further includes a determining unit configured to determine a cooperative group to be concurrently scheduled using the cooperative session map.

Other features and aspects will be apparent from the following detailed description, drawings, and claims.

Description of drawings

FIG. 1 is a cross-layer structure illustrating a network performing cooperative scheduling using interference between multi-hops according to an illustrated example.

2A , 2B and 2C are diagrams illustrating base units for performing cooperative scheduling using interference between multi-hops according to the illustrated example.

FIG. 3 is a flowchart illustrating a method for cooperative scheduling using interference between multiple hops according to the illustrated example.

FIG. 4 is a flowchart further illustrating a method for cooperative scheduling using interference between multiple hops according to another illustrated example.

FIG. 5 is a diagram illustrating a method of generating a collaborative link table according to the illustrated example.

FIG. 6 is a diagram illustrating a collaborative session map and a relationship between links verified from the collaborative session map according to the illustrated example.

FIG. 7 is a diagram illustrating a method of selecting a candidate group for cooperative scheduling according to an illustrated example.

FIG. 8 is a diagram illustrating a method of performing scheduling using a finally determined cooperative group in a process of performing cooperative scheduling using interference between multi-hops according to an illustrated example.

FIG. 9 is a block diagram illustrating an apparatus for cooperative scheduling using interference between multiple hops according to the illustrated example.

Throughout the drawings and detailed description, unless otherwise described, the same drawing reference numerals will be understood to refer to the same elements, features and structures. The relative size and description of these elements may be exaggerated for clarity, illustration, and convenience.

detailed description

The following detailed description is provided to assist the reader in gaining an overall understanding of the methods, devices and/or systems described herein. Accordingly, various changes, modifications, and equivalents of the systems, devices, and/or methods described herein will be suggested to one of ordinary skill in the art. Also, descriptions of well-known functions and constructions may be omitted for increased clarity and conciseness.

Fig. 1 shows a cross-layer structure of a network performing cooperative scheduling using interference between multiple hops according to the illustrated example.

Coordinated scheduling using interference between multiple hops according to various examples described herein may correspond to scheduling operations performed in a medium access control (MAC) layer of a network.

Referring to FIG. 1 , a block bounded by dashed lines on the left side of FIG. 1 shows a network hierarchy 110 of Link 1 . The network layer structure 110 includes a network layer 115 , a MAC layer 113 and a physical layer 111 . The block bounded by dashed lines on the right side of FIG. 1 shows the network hierarchy 130 of Link 2 . The network layer structure 130 includes a network layer 135 , a MAC layer 133 and a physical layer 131 .

The physical layer 111 may send channel information of link 1 to the MAC layer 113 . The network layer 115 may send the session information of link 1 to the MAC layer 113, wherein the session information includes routing information and quality of service (QoS) information.

The physical layer 131 may send the channel information of Link 2 to the MAC layer 133 . The network layer 135 may send the session information of link 2 to the MAC layer 133, wherein the session information includes routing information and QoS information.

The physical layer 111 of link 1 and the physical layer 131 of link 2 can send information on the relevant channel and the amount of interference to the MAC layer 113 and the MAC layer 133, respectively, so that the MAC layer 113 and the MAC layer 133 can determine the Interfering with usage plans. Information about the channel of interest and the amount of interference may include, but is not limited to, signal-to-noise ratio (SNR), interference-to-noise ratio (INR), signal-to-interference-noise ratio (SINR), and interference-plus-signal-to-noise ratio (ISNR).

The MAC layer 113 of link 1 and the MAC layer 133 of link 2 may determine the best scheduling set. The optimal scheduling set may include a cooperative set that combines information exchanged between the MAC layer 113 and the MAC layer 133 . When the same frequency is used to efficiently multiplex limited frequency resources, the same frequency can also be used for links that do not interfere with each other.

Therefore, according to the illustrated example, a cross-layer structure may be used to receive information for determining whether each of link 1 and link 2 is interfered by co-scheduling from upper or lower layers of the MAC layer 113 and the MAC layer 133 . In this case, it may be assumed that a structure capable of using or removing various types of interference of each physical layer is given, and an equation for calculating performance gain is predetermined according to each structure.

2A , 2B and 2C illustrate basic units for performing cooperative scheduling using interference between multiple hops according to the illustrated example.

FIG. 2A shows a cooperation session based unit (cooperation session based unit), FIG. 2B shows a cooperation link based unit (cooperation link based unit), and FIG. 2C shows a hop based unit (hop based unit). In one example, the cooperative session-based unit of FIG. 2A may include multiple hops, and the cooperative link-based unit of FIG. 2B and the hop-based unit of FIG. 2C may include a single hop.

Figure 2A includes a first session 210 connecting node A to node B through an intermediate repeater and a second session 220 connecting node C to node D through an intermediate repeater. The first session 210 and the second session 220 may correspond to basic units (ie, co-session-based units to be co-scheduled). In a collaborative session based unit, scheduling can be performed using a collaborative session as a basic unit. In other words, scheduling can be performed using multiple hops to be scheduled cooperatively. In one illustrated example, a session may represent a traffic flow from a source node to a destination node.

FIG. 2B includes a first link 230 from node A to node B and a second link 240 from node C to node D. FIG. The first link 230 and the second link 240 may correspond to a basic unit. In other words, the first link 230 and the second link 240 may serve as cooperative link-based units to be cooperatively scheduled.

The collaborative session-based unit of FIG. 2A may include a plurality of collaborative link-based units as shown and described in FIG. 2B . The cooperative link-based unit of FIG. 2B may include two hop-based units as shown and described in FIG. 2C.

In one illustrated example, the base unit configured to perform cooperative scheduling using inter-hop interference generally corresponds to the cooperative session-based unit of FIG. 2A and the cooperative link-based unit of FIG. 2B .

FIG. 3 illustrates a method for cooperative scheduling using interference between multi-hops (hereinafter, referred to as scheduling devices) according to an illustrated example.

At 310, for each of the plurality of links, the method sets at least one cooperative set comprising cooperative links. In one example, a cooperative link may represent a link available for cooperative scheduling. Links available for cooperative scheduling may mean links that can transmit signals by sharing resources smoothly without destroying each other or negatively interacting with each other due to interference that occurs when terminals multiplex resources (eg, frequencies). influences.

At 320, the scheduling device may generate a collaborative session map, wherein the collaborative session map defines at least one cooperative link selected from at least one cooperative set for each of the plurality of links in each session of the network. In one example, as shown in FIG. 1, the method for scheduling a device may receive channel information from a physical layer of each of a plurality of coordinated links, and may receive channel information from a network layer of each of the plurality of coordinated links. Session information including routing information and QoS information. As a result, at 320, the method of scheduling devices may generate a cooperative linkage table using session information and channel information received from each layer. A method of coordinating devices may generate a cooperative session map based on information verified from a cooperative map generated using a cooperative link table. As previously described, a collaborative link table may be generated for each of the plurality of links. The collaboration session map may define at least one collaboration link, wherein the at least one collaboration link is selectable from the at least one collaboration set for each session of the network.

At 330, the method determines a collaborative group to be concurrently scheduled using the collaborative session map. Before determining the cooperative group, the method may select basic units for performing cooperative scheduling. The method may also determine the synergistic group from at least one candidate group of the synergistic group based on the basic unit. In one illustrated example, the basic unit for performing cooperative scheduling may correspond to a hop-based unit, a cooperative link-based unit, and a cooperative session-based unit as described and illustrated in FIGS. 2A , 2B, and 2C. at least one of the

In a method for cooperative scheduling using interference between multiple hops according to some aspects of the examples described herein, the plurality of links may correspond to links that exist in a distributed network structure or in a hierarchical network Links that exist in the structure. When the plurality of links corresponds to links existing in the distributed network structure, each of the plurality of points in the distributed network may share information about the cooperative group decentralized. The points may include, but are not limited to, network nodes or section points as redistribution points or communication endpoints (some terminal devices). Optionally, a predetermined one of the plurality of points in the hierarchical network may transmit information about the cooperative group to other points when the plurality of links correspond to links present in the hierarchical network structure.

Each of the links present in the distributed network structure can collect information that can be used to determine a cooperative group. Alternatively, in a hierarchical network structure, information received from each point corresponding to at least one main point among equivalent points (or nodes) at a hub, a base station, an access point, etc. may be used to determine the synergistic group. In this case, the at least one backbone point may transmit information on the determined cooperative group to other plurality of points. In some illustrated examples, the method for cooperative scheduling using interference between multiple hops can be applied to partially decentralized and fully decentralized structures in a hierarchical network structure. Several backbone points can be determined according to the infrastructure, and the points (or nodes) that meet the predetermined requirements can be selected.

Figure 4 describes a method for cooperative scheduling using interference between multiple hops according to the illustrated example.

At 405, the method of the scheduling device identifies links among the plurality of links that are adjacent to each other. In one example, links that are adjacent to each other may represent links within an area where the links may interfere with each other. For example, links adjacent to each other may indicate links within an area within which signals transmitted through predetermined links can reach. In one illustrated example, links that are adjacent to each other may include a configuration as shown and described in FIG. 1 , where the links may include network hierarchies 110 and 130, respectively.

The method may set neighboring links available for cooperative scheduling using interference between neighboring links to at least one cooperating set.

In one example, the interference that exists between neighboring links can be exploited by data exchange and channel information between sessions using a relay channel or by an interfering channel between at least two users. When the relay channel is used, the interference channel can be scheduled according to the channel state. Optionally, when the relay channel is used, the signal channel and the interference channel may be scheduled according to the channel state. In one example, in the relay channel, an amplify and forward (AF)/decode and forward (DF)/compress and forward (CF) scheme, etc. may be selected and used according to the location and channel of the relay.

At 410, the method determines whether the SNRs of two of the adjacent links that cooperate with each other are greater than or equal to a predetermined threshold.

At 415, when the SNR of the two links that cooperate with each other at 410 is determined to be greater than or equal to a predetermined threshold, the method defines the two links as at least one cooperating set. For example, before cooperating with each other, the SNRs of link A and link B may be determined to be less than or equal to a predetermined threshold using Equation 1 below.

[equation 1]

Here, S represents the magnitude of the signal, I represents the magnitude of the interference at the corresponding link, and γ represents a predetermined threshold value, eg, a threshold value for the corresponding link.

As shown in Equation 2 below, after link A and link B cooperate with each other and the SNR is greater than or equal to the threshold value γ, link A and link B may correspond to a cooperative link to be scheduled together (i.e., available for cooperative link scheduled co-set).

[equation 2]

Here, S' represents a signal gain generated by cooperation, and I' represents an interference gain generated by performing cooperation. In addition, c represents a cooperation scheme for cooperation, and H represents a channel used during cooperation.

At 420, when the SNR of the two links coordinated with each other at 410 is determined to be less than the predetermined threshold, the method defines the two links as an interference set. An interference set may represent interfering links that are not available for co-scheduling using interference between neighboring links. For example, an interfering link that is unavailable for cooperative scheduling between link A and link B and that satisfies Equation 3 during scheduling may represent an interfering set.

[equation 3]

The method may generate a collaboration map based on at least one collaboration set. The collaboration map may indicate whether a collaboration between multiple links is to be performed.

At 425, for each of the plurality of links, the method generates, based on the at least one synergy set, a collaboration link table including information related to collaborations between the plurality of links. The method of generating the collaborative link list will be further described with reference to FIG. 5 . The information related to the cooperation among the plurality of links may include, for example, information on cooperation schemes, cooperation gains, channels between the plurality of links, queue information for each of the plurality of links, and/or session information. In one example, the queue information for each of the plurality of links may represent traffic waiting to be sent in a buffer of each of the plurality of links. For example, queue information may be represented as information on a buffer size for each of the plurality of links.

The method in the scheduling device may generate a cooperative link table using channel information received from a physical layer of each of the cooperative links. The method may also use session information received from the network layer of each of the cooperative links to generate a collaborative link table. Session information may include routing information and QoS information.

At 430, the method generates a cooperative mapping table using the cooperative linkage table generated for each of the plurality of links. The cooperation mapping table will be described with reference to Table 1 shown.

[Table 1]

set L1 L2 L3 L4 L5 L6 L7 L1 session (L1) 0.9 (C1) 0 0.6 (C2) 0 0.5 (C2) 0 L2 0.5 (C1) Session (L2) 0.8 (C2) 0.2 (C1) L3 L4 L5 L6 L7

Table 1 shows a cooperation map generated using the cooperation link table generated for each of the plurality of links that will be shown and described in FIG. 5 . The cooperation map may be generated by combining information about the cooperation link table for each of the plurality of links. In the cooperation map, the first row may indicate the plurality of links, the second row may indicate information on the cooperation map for link 1L1, and the third row may indicate information about the cooperation map for link 2L2. Those of ordinary skill in the relevant art will appreciate that the collaboration map may include additional rows and additional information.

Referring to FIG. 5 , in the row of link 1L1 in the cooperation mapping table, link 1L1 cooperates with link 2L2 through a rate split scheme C1 with a cooperation gain of 0.9. Link 1L1 cooperates with link 4L4 and link 6L6 through interference avoidance scheme C2 with coordination gains of 0.6 and 0.5, respectively. In the row of link 2L2, link 2L2 cooperates with link 1L1 and link 7L7 through rate-spirit scheme C1 with synergy gains of 0.5 and 0.2, respectively, and with link 3L3 through interference avoidance scheme C2 with synergy gain of 0.8. In the cooperation mapping table, information on the cooperation link table for each of the link 3L3 and the link 7L7 may be indicated. Additionally, the synergy gains shown and described in FIG. 5 are for illustration purposes only. The synergy gain between link 1L1 and links 2L2 to 7L7 may range from 0.0 to 1.0. Those of ordinary skill in the relevant art will understand that various ranges can be implemented to show the synergy between the multiple links.

At 435, the method generates a collaborative session map based on the information verified from the collaborative map table. The collaboration session map may define at least one collaboration link selected from at least one collaboration set for each session of the network. The relationship between the collaborative session map and links verified from the collaborative session map will be described with reference to FIG. 6 .

At 440, the scheduling device selects a basic unit for performing coordinated scheduling. In one example, the scheduling device may be based on the load of the network according to the basic unit, the structure of the physical layer according to the basic unit, the coordination gain according to the basic unit, the coordination scheme according to the basic unit, and information received from each layer of the network At least one of , to select a basic unit for performing cooperative scheduling. In one configuration, the basic unit for performing cooperative scheduling may correspond to at least one of a hop-based unit, a cooperative link-based unit, and a cooperative session-based unit. In one example, the scheduling device may use the collaboration session map to determine the collaboration groups to be concurrently scheduled.

At 445, the scheduling device selects at least one candidate group in at least one cooperative link defined in the cooperative session map based on the basic unit for performing the cooperative scheduling.

The scheduling device may assign a group identification (ID) to each of the at least one candidate group. A method of selecting a candidate group for performing cooperative scheduling and a method of assigning a group ID to each candidate group for performing cooperative scheduling are shown in FIG. 7 which will be described later.

At 450, the scheduling device calculates a performance gain for each candidate group of the at least one candidate group.

At 455, the scheduling device determines a cooperating group to be scheduled simultaneously in the at least one candidate group based on the calculated result. For example, the scheduling device determines the candidate groups in descending order of performance based on whether the performance gain of each candidate group in the at least one candidate group is relatively high.

At 460, the scheduling device performs cooperative scheduling using the cooperative group.

FIG. 5 illustrates a method of generating a collaborative link list according to the illustrated example. In FIG. 5, link 1L1 to link 7L7 are shown in communication. The dotted line between link 1L1 and link 2L2, the dotted line between link 1L1 and link 4L4, the dotted line between link 1L1 and link 6L6, the dotted line between link 2L2 and link 3L3, and the dotted line between link 2L2 and link 7L7 can be Indicates links that can cooperate with each other. The solid line between link 1L1 and link 3L3, the solid line between link 1L1 and link 5L5, the solid line between link 1L1 and link 7L7, the solid line between link 3L3 and link 4L4, and the solid line between link 5L5 and link 6L6 A solid line between may indicate links that may not cooperate with each other. The scheduling device may generate a cooperative link table for each of the plurality of links.

Thus, in one illustrated example, link 1L1 may have a cooperating set relationship with link 2L2, link 4L4, and link 6L6, and may be subject to an interfering set relationship with link 3L3, link 5L5, and link 7L7. Thus, link 1L1 may cooperate with link 2L2, link 4L4, and link 6L6, and may not cooperate with link 3L3, link 5L5, and link 7L7. In addition, link 2L2 may have a co-set relationship with link 3L3, link 1L1, and link 7L7.

In one illustrated example, link 1L1 can cooperate with link 2L2 through a rate-spirit scheme with a synergy gain of 0.9, and can cooperate with link 4L4 and link 6L6 through an interference avoidance scheme with synergy gains of 0.6 and 0.5, respectively. In an example, session A and session B may pass through link 1L1 , and session A and session C may pass through link 2L2 , a cooperative link table for link 1L1 may be represented as shown in the table below FIG. 5 . As previously mentioned, the synergy gains shown and described in FIG. 5 are for illustrative purposes only. The synergy gain between link 1L1 and links 2L2 to 7L7 may range from 0.0 to 1.0. Those of ordinary skill in the relevant art will understand that various ranges can be implemented to show the synergy between the multiple links.

In the cooperative link table shown in FIG. 5 , L1, L2, . . . , L7 of the first row indicate each link, and "session" of the second row indicates sessions through a plurality of links corresponding to the first row. Thus, session A and session B are indicated in link 1L1 and session A and session C are indicated in link 2L2. In the cooperative linkage table, each of C0, C1, and C2 indicates a cooperative scheme, for example, C0 indicates no cooperation, C1 indicates a rate-spirit scheme, and C2 indicates an interference avoidance scheme.

In one example, since link 1L1 may have a synergy set relationship with link 2L2, link 4L4, and link 6L6, corresponding synergy schemes and gains may be recorded in the columns of link 2L2, link 4L4, and link 6L6, respectively. Also, since link 1L1 may have an interference set relationship with link 3L3, link 5L5, and link 7L7, a "0" may be recorded in row C0 for each column of link 3L3, link 5L5, and link 7L7, indicating that no coordination is performed. .

In one illustrated example, a co-link table may be generated for each of the neighboring links except link 1L1. In one configuration, a cooperative link list may be generated between adjacent links having a one-hop relationship.

FIG. 6 illustrates a collaborative session map and a relationship between links verified from the collaborative session map according to the illustrated example.

The upper collaborative session map in FIG. 6 defines collaborative links in units based on collaborative sessions. In one example, the cooperative session based unit may be a multi-hop unit for each session of the network based on information verified from a cooperative map. Accordingly, the sessions through each link and the links coordinated with each link can be verified from the collaboration session map. A collaborative session map may correspond to a table rearranged based on session information from a collaborative map table.

In a cooperative session mapping, session 1 may pass through link 1L1, and link 1L1 may cooperate with link 2L2. Session 2 may pass through link 2L2, and link 2L2 may cooperate with link 1L1. Session 1 may pass through link 3L3, and link 3L3 may cooperate with link 4L4. Session 2 may pass through link 4L4, and link 4L4 may cooperate with link 3L3 and link 5L5. Session 3 may pass through link 5L5, and link 5L5 may cooperate with link 4L4.

The relationship between the links verified from the collaborative session map can be represented as shown below in FIG. 6 . For example, the links passed by session (1) 610 may correspond to link 1L1 and link 3L3. The links passed by session (2) 620 may correspond to link 2L2 and link 4L4. The link passed by session (3) 630 may correspond to link 5L5. In one configuration, each of a plurality of links passed by the same session may be arranged on the same session. For example, since the link 1L1 and the link 2L2 may cooperate with each other, the link 1L1 and the link 2L2 may be arranged in parallel. In another example, since the link 3L3 cooperates with the link 4L4, the link 4L4 cooperates with the link 5L5, and the link 4L4 cooperates with the link 3L3 and the link 5L5, the link 3L3, the link 4L4 and the link 5L5 may be arranged in parallel.

In the illustrated configuration, when scheduling is performed in a cooperative link-based unit, links arranged in parallel can be scheduled simultaneously.

Fig. 7 illustrates a method of selecting a candidate group for cooperative scheduling according to the illustrated example.

In one configuration, the method of scheduling the device may select at least one candidate group in at least one cooperative link defined in the cooperative session map based on the basic unit for performing the cooperative scheduling.

The collaborative session map of FIG. 7 shows that the links passed by session 1 may correspond to link 1L1 and link 3L3. The links passed by session 2 may correspond to link 2L2 and link 4L4. The link passed by session 5 may correspond to link 5L5. In one illustrated example, since link 3L3 receives signals or data transmitted from link 1L1, when the basic unit for performing cooperative scheduling corresponds to a unit based on cooperative link, link 1L1 and link 1 passed by the same session 1 3L3 may not be scheduled concurrently. In another illustrated example, link 2L2 and link 4L4 passed by the same session 2 may not be scheduled at the same time. In one configuration, link 1L1 and link 2L2 may be scheduled concurrently to correspond to the first candidate group 710 for cooperative scheduling. Furthermore, link 3L3 and link 4L4 may be scheduled concurrently to correspond to the second candidate group 730 for cooperative scheduling.

Alternatively, when the basic unit for performing cooperative scheduling corresponds to a cooperative session-based unit, the link 1L1 and the link 3L3 may be scheduled simultaneously with the link 2L2 and the link 4L4. Since session 1 can go through link 1L1 and link 3L3 at the same time, and session 2 can go through link 2L2 and link 4L4 at the same time, link 1L1 and link 3L3 can be scheduled at the same time as link 2L2 and link 4L4. Thus, in one configuration, link 1L1 , link 2L2 , link 3L3 , and link 4L4 may correspond to a third candidate group 750 for cooperative scheduling. In this case, in the table as shown in FIG. 7, the links indicated by "X" for each session may not be scheduled at the same time. Since link 3L3 may correspond to a link adjacent to link 1L1 on the routing path through which session 1 passes, simultaneous scheduling may not be performed for link 1L1 and link 3L3. Here, session 1 may go through "L1-L3-...".

Referring to FIG. 7 , in one example, when the basic unit for performing cooperative scheduling corresponds to a cooperative link-based unit (such as a first candidate group 710 for cooperative scheduling and a second candidate group 730 for cooperative scheduling) , a subgroup ID may be assigned to each of the at least one candidate. In another example, when a basic unit for performing cooperative scheduling corresponds to a cooperative session-based unit, such as the third candidate group for cooperative scheduling 750 , at least one candidate may be assigned a group ID.

In the example shown, a candidate group for cooperative scheduling according to a cooperative link-based unit may be included in several other cooperative session-based units rather than a single cooperative session-based unit.

FIG. 8 illustrates a method of performing scheduling using a finally determined cooperative group in the process of performing cooperative scheduling using interference between multi-hops according to an illustrated example.

Referring to FIG. 8 , a link 1L1 , a link 2L2 , a link 3L3 , and a link 4L4 correspond to a cooperation group which may be called a first cooperation group. Link 6L6 and link 7L7 correspond to another cooperative group that may be referred to as a second cooperative group. In this example, link 5L5 corresponds to a link that can be scheduled with each of these cooperative groups. Although the terms first and second are used, these terms are only used to distinguish between these synergistic groups. The first and second terms do not define a particular order in which these sets need to be constructed, executed or operated. Those of ordinary skill in the relevant arts will understand that association links may be related in an optional order between cooperative groups.

In one illustrated example, since a basic unit for performing cooperative scheduling may correspond to a cooperative session-based unit, the coordination of the first coordination group may be performed through two hops. As an example, when the first cooperative group is scheduled together with the second cooperative group executed with one hop, link 1L1 and link 2L2 included in the first cooperative group may be together with the second cooperative group at time (T)=1 is scheduled. In this example, link 5L5 may also be scheduled. At T=2, a second cooperative group transmitting a signal different from that transmitted at T=1 may be scheduled together with link 3L3 and link 4L4 included in the first cooperative group.

Fig. 9 shows an apparatus 900 for cooperative scheduling using interference between multiple hops according to the illustrated example.

The apparatus 900 for performing cooperative scheduling using interference between multiple hops may include a cooperative set setting unit 910 , a generator 930 and a determining unit 950 .

The cooperative set setting unit 910 may set at least one cooperative set including a plurality of cooperative links for each of the plurality of links. In one example, the plurality of cooperative links may correspond to links to be cooperatively scheduled.

The cooperative set setting unit 910 may include an identifying unit 913 and a setting unit 915 . The identifying unit 913 can identify links that are adjacent to each other among the plurality of links. For at least one cooperative set, the setting unit 915 may use the interference between adjacent links among the mutually adjacent links to set adjacent links available for cooperative scheduling.

The generator 930 may generate a collaborative session map, wherein the collaborative session map is used to define at least one cooperative link selected from at least one cooperative set for each of the plurality of links in each session of the network. The generators may also include a first generator 933 , a second generator 935 and a session map generator 937 . Based on at least one cooperation set and for each of the plurality of links, the first generator 933 may generate a cooperation link table including information related to cooperation among the plurality of links. The second generator 935 may generate a cooperative mapping table using the cooperative link table generated for each of the plurality of links. Based on the information obtained from the cooperation mapping table and for each session of the network, the session map generator 937 may generate a cooperation session map, wherein the cooperation session map is used to define at least one cooperation link selected from the at least one cooperation set.

The determining unit 950 may determine a cooperative group to be concurrently scheduled using the cooperative session map. The determination unit 950 may include a candidate selector 953 , a calculator 955 and a cooperative group determination unit 957 . The candidate selector 953 may select at least one candidate group in at least one cooperative link defined in the cooperative session map based on a basic unit for performing cooperative scheduling. The calculator 955 may calculate the performance gain of each candidate group in the at least one candidate group. The candidate group determining unit 957 may determine a candidate group to be simultaneously scheduled in the at least one candidate group based on the calculated result.

In the illustrated example, the apparatus 900 for performing cooperative scheduling using interference between multiple hops may further include a selector 960 and an ID allocation unit 970 . The selector 960 may select a basic unit for performing cooperative scheduling. The ID assigning unit 970 may assign a group ID to each of the at least one candidate group.

According to some illustrative examples described above, links that are schedulable simultaneously and at the same frequency may be determined by employing a cooperative session mapping based on a cooperative group that is to be cooperatively scheduled using interference between links.

According to some illustrative examples described, the rapidly increasing service demands of communication terminals can be met by simultaneously scheduling links available for coordinated scheduling to effectively multiplex limited frequency resources without affecting the performance of the cellular communication system.

According to some illustrative examples described, services may be provided to a large number of users in large venues (large or small). These venues may include, but are not limited to, stadiums, airports, shopping malls, and the like. In these venues, peer-to-peer (P2P) communication can occur frequently in crowded environments by efficiently reusing limited frequency resources.

The above-mentioned processes, functions, methods and/or software including the method for cooperative scheduling using interference between multiple points may be recorded, stored or fixed in one or more non-transitory computer-readable storage media, so The non-transitory computer-readable storage medium includes program instructions to be executed by a computer to cause a processor to execute or execute the program instructions. The media may also include program instructions, data files, data structures, etc. alone or in combination with program instructions. The media and program instructions may be specially designed and constructed media and program instructions, or may be of the type well known and available to those skilled in the computer software arts.

It will be appreciated that in the examples described above, Figures 3-5 and 7 were performed in the order and manner shown, although the order of some of the steps, etc. to the operation in Figure 8. According to the illustrated example, a computer program embodied on a non-transitory computer readable medium may also be provided encoding instructions for performing at least the methods described in FIGS. 3-5 and 7-8.

Program instructions for performing the methods described in FIGS. 3-5 and 7-8 or one or more operations thereof may be recorded, stored, or fixed in one or more computer-readable storage media. Program instructions can be implemented by a computer. For example, a computer may cause a processor to execute program instructions. The media may include program instructions, data files, data structures, etc. alone or in combination with program instructions. Examples of computer-readable media include magnetic media (such as hard disks, floppy disks, and magnetic tape), optical media (such as CD-ROM disks and DVDs), magneto-optical media (such as optical disks), and hardware devices specially configured to store and execute program instructions (such as read only memory (ROM), random access memory (RAM), flash memory, etc.). Examples of program instructions include machine code (such as produced by a compiler) and files containing higher-level code executable by a computer using an interpreter. Program instructions (ie, software) can be distributed over network coupled computer systems so that the software is stored and executed in a distributed fashion. For example, software and data may be stored by one or more computer-readable recording media. In addition, functional programs, codes, and functional programs for implementing the exemplary embodiments disclosed herein can be easily explained by programmers skilled in the art to which the exemplary embodiments pertain based on and using the flowcharts and block diagrams of the drawings and their corresponding descriptions as provided herein. code snippet.

Some examples have been described above. However, it should be understood that various modifications may be made. For example, if the described techniques are performed in a different order, and/or if components in the described system, architecture, device, or circuit are combined in a different manner and/or are replaced by other components or their equivalents or in addition to the described system , architecture, device or components in a circuit, appropriate results may be achieved. Accordingly, other implementations are within the scope of the following claims.

Claims (18)

CLAIMS 1. A method for cooperative scheduling using interference between multiple points, the method comprising: Identify links that are adjacent to each other; determining adjacent links available for coordinated scheduling and adjacent links not available for coordinated scheduling using interference between adjacent links of the mutually adjacent links; Set the neighbor links available for cooperative scheduling to the cooperative set; setting for each link a cooperating set including coordinating links for coordinating scheduling; generating a collaboration map indicating whether collaboration is performed between links based on the collaboration set; generating a cooperative session map for each session of the network based on information obtained from the cooperative map table, wherein the cooperative session map defines a cooperative link selected from the cooperative set for each link in each session of the network; The collaboration groups that will be scheduled concurrently are determined using the collaboration session map. 2. The method of claim 1, further comprising: Session information including routing information and quality of service (QoS) information is received from the network layer of each of the cooperative links. 3. The method of claim 1, further comprising: Channel information is received from the physical layer of each of the cooperative links. 4. The method of claim 1, wherein setting a cooperating set comprising cooperating links for cooperating scheduling comprises: When the signal-to-noise ratios (SNRs) of two adjacent links performing mutual coordination among the adjacent links are greater than or equal to a predetermined threshold, the two adjacent links are set into the coordination set. 5. The method of claim 1, wherein the step of generating a collaboration map indicating whether collaboration is performed between links comprises: generating, for each link based on the collaboration set, a collaboration link table including information about collaboration between the links; A cooperation map is generated using the cooperation link table generated for each link. 6. The method according to claim 5, wherein the information related to cooperation between links includes information on cooperation schemes, cooperation gains, channels between links, queue information for each link, and session information at least one. 7. The method of claim 1, further comprising: Select the base unit for performing co-scheduling. 8. The method of claim 7, wherein the step of selecting comprises: The basic unit for performing cooperative scheduling is selected based on at least one of the following items: the load of the network according to the basic unit, the structure of the physical layer according to the basic unit, the cooperative gain according to the basic unit, the cooperative scheme according to the basic unit, and Information received from each layer of the network. 9. The method of claim 7, wherein the basic unit for performing cooperative scheduling corresponds to at least one of a hop-based unit, a cooperative link-based unit, and a cooperative session-based unit. 10. The method of claim 7, wherein the step of determining comprises: selecting a set of candidates for performing cooperative scheduling among the cooperative links defined in the cooperative session map; Calculate the performance gain of the candidate set; A cooperating group among the candidate groups to be concurrently scheduled is determined based on the calculated result. 11. The method of claim 10, wherein the step of determining comprises: The cooperative group is determined based on whether the performance gain of the candidate group is relatively high. 12. The method of claim 10, further comprising: Assign a group identification ID to the candidate group. 13. The method of claim 12, wherein the step of allocating comprises: assigning a subgroup ID to the candidate group when the basic unit for performing cooperative scheduling corresponds to a cooperative link-based unit; When a basic unit for performing cooperative scheduling corresponds to a cooperative session-based unit, a group ID is assigned to a candidate group. 14. The method of claim 1, wherein the link corresponds to a link existing in a distributed network structure or a link existing in a hierarchical network structure, wherein, in the distributed network structure, multiple points Each point in the network shares information about the cooperative group in a distributed manner. In a hierarchical network structure, a predetermined point among multiple points transmits information about the cooperative group to other points. 15. An apparatus for coordinated scheduling using interference between multiple points, the apparatus comprising: a setting unit configured to set, for each link, a cooperative set including cooperative links for cooperative scheduling; a generator configured to generate a cooperative session map, wherein the cooperative session map defines at least one cooperative link selected from a cooperative set for each link in each session of the network; a determining unit configured to determine a cooperative group to be concurrently scheduled using a cooperative session map, Wherein, the setting unit identifies the links that are adjacent to each other, uses the interference between the adjacent links in the adjacent links to determine the adjacent links that can be used for coordinated scheduling and the adjacent links that cannot be used for coordinated scheduling, and the adjacent links that can be used for coordinated scheduling link set to a co-set, Wherein, the generator generates a cooperation map indicating whether to perform cooperation between links based on the cooperation set, and generates a cooperation session map for each session of the network based on information obtained from the cooperation map. 16. The apparatus of claim 15, wherein the generator comprises: a first generator configured to generate, for each link based on the cooperation set, a cooperation link table including information related to cooperation between the links; a second generator configured to generate a cooperative mapping table using the cooperative link table generated for each link; The session map generator is configured to generate a cooperative session map for each session of the network based on the information obtained from the cooperative mapping table, wherein the cooperative session map is used to define a cooperative link selected from the cooperative set. 17. The device of claim 15, further comprising: a selector configured to select elementary units for performing cooperative scheduling, Among them, the determination unit includes: a candidate selector configured to select a candidate group among cooperative links defined in the cooperative session map based on the basic unit for performing cooperative scheduling; a calculator configured to calculate a performance gain for the candidate set; The cooperative group determination unit determines the cooperative group to be scheduled simultaneously in the candidate group based on the calculated result. 18. The apparatus of claim 15, wherein the link corresponds to a link existing in a distributed network structure or a link existing in a hierarchical network structure, wherein, in the distributed network structure, a plurality of points Each point in the network shares information about the cooperative group in a distributed manner. In a hierarchical network structure, a predetermined point among multiple points transmits information about the cooperative group to other points.