U.S. patent application number 14/209162 was filed with the patent office on 2016-11-03 for method and apparatus to control interference in multi-hop network and relay node and node pair using the method.
This patent application is currently assigned to CORNELL UNIVERSITY. The applicant listed for this patent is CORNELL UNIVERSITY, SAMSUNG ELECTRONICS CO., LTD.. Invention is credited to A. Salman AVESTIMEHR, Silas L. FONG, Ibrahim ISSA, Kyung Hun JANG, Jong Bu LIM, Won Jong NOH, Won-Jae SHIN.
Application Number | 20160323042 14/209162 |
Document ID | / |
Family ID | 51757372 |
Filed Date | 2016-11-03 |
United States Patent
Application |
20160323042 |
Kind Code |
A9 |
SHIN; Won-Jae ; et
al. |
November 3, 2016 |
METHOD AND APPARATUS TO CONTROL INTERFERENCE IN MULTI-HOP NETWORK
AND RELAY NODE AND NODE PAIR USING THE METHOD
Abstract
A method and apparatus to control interference in a relay node
are provided and include simultaneously receiving a symbol from
source nodes, adjusting channel coefficients; and relaying the
symbol to destination nodes with adjusted channel coefficients. The
simultaneously receiving and the relaying are performed during a
symbol transmission process between the source and destination
nodes.
Inventors: |
SHIN; Won-Jae; (Seoul,
KR) ; ISSA; Ibrahim; (Ithaca, NY) ; FONG;
Silas L.; (Ithaca, NY) ; AVESTIMEHR; A. Salman;
(Ithaca, NY) ; NOH; Won Jong; (Seoul, KR) ;
LIM; Jong Bu; (Yongin-si, KR) ; JANG; Kyung Hun;
(Suwon-si, KR) |
|
Applicant: |
Name |
City |
State |
Country |
Type |
CORNELL UNIVERSITY
SAMSUNG ELECTRONICS CO., LTD. |
Ithaca
Suwon-si |
NY |
US
KR |
|
|
Assignee: |
CORNELL UNIVERSITY
Ithaca
NY
SAMSUNG ELECTRONICS CO., LTD.
Suwon-si
|
Prior
Publication: |
|
Document Identifier |
Publication Date |
|
US 20140355513 A1 |
December 4, 2014 |
|
|
Family ID: |
51757372 |
Appl. No.: |
14/209162 |
Filed: |
March 13, 2014 |
Related U.S. Patent Documents
|
|
|
|
|
|
Application
Number |
Filing Date |
Patent Number |
|
|
61778718 |
Mar 13, 2013 |
|
|
|
Current U.S.
Class: |
1/1 |
Current CPC
Class: |
H04J 11/003 20130101;
H04B 15/00 20130101; H04B 7/15 20130101; H04J 11/0023 20130101 |
International
Class: |
H04B 15/00 20060101
H04B015/00; H04B 7/15 20060101 H04B007/15 |
Foreign Application Data
Date |
Code |
Application Number |
Jun 4, 2013 |
KR |
10-2013-0063917 |
Jan 23, 2014 |
KR |
10-2014-0008318 |
Claims
1. A method to control interference in a relay node, comprising:
simultaneously receiving a symbol from source nodes; adjusting
channel coefficients; and relaying the symbol to destination nodes
with adjusted channel coefficients, wherein the simultaneously
receiving and the relaying are performed during a symbol
transmission process between the source and destination nodes.
2. The method of claim 1, wherein a number of the symbol
transmission process is equal to or greater than a number of
symbols simultaneously received.
3. The method of claim 1, wherein the relaying of the symbol
comprises using one of an amplify-and-forward (AF) scheme, a
quantize-and-forward (QF) scheme, and a compute-and-forward (CF)
scheme, based on the channel coefficients.
4. The method of claim 1, wherein the symbol transmission process
corresponds to a time slot.
5. The method of claim 1, wherein the symbol transmission process
corresponds to a frequency band.
6. The method of claim 1, wherein the relaying of the symbol
comprises relaying the symbol through channels between the source
and destination nodes.
7. The method of claim 6, wherein the relaying of the symbol
comprises: removing an interference channel from among channels
between the source nodes and the destination nodes by adjusting the
channel coefficients; and relaying the symbol, using the channels
between the source nodes and the destination nodes from which the
interference channel is removed.
8. The method of claim 7, wherein the removing of the interference
channel comprises: receiving, from a source node among the source
nodes, channel information between the source node and relay nodes;
transmitting channel information between the relay nodes and a
destination node among the destination nodes to the destination
node; receiving feedback information for the channel information
between the relay nodes and the destination node from the
destination node; and adjusting the channel coefficients based on
the feedback information and removing the interference channel.
9. The method of claim 6, wherein the relaying of the symbol
comprises: generating an end-to-end channel matrix, using a first
channel matrix between the source nodes and relay nodes, a second
channel matrix between the relay nodes and the destination nodes,
and the channel coefficients; and relaying the symbol from the
source nodes to the destination nodes using the end-to-end channel
matrix.
10. The method of claim 1, wherein, in response to two source nodes
and two destination nodes being provided, the receiving, and the
relaying are performed during a first symbol transmission process,
a second symbol transmission process, and a third symbol
transmission process.
11. The method of claim 10, wherein the relaying of the symbol
comprises: in the first symbol transmission process, relaying the
symbol by removing an interference channel between a second source
node and the first destination node; in the second symbol
transmission process, relaying the symbol by removing an
interference channel between the first source node and a second
destination node; and in the third symbol transmission process,
relaying the symbol, using channels between the source nodes and
the destination nodes.
12. The method of claim 11, wherein, in the third symbol
transmission process, the receiving of the symbol comprises:
receiving a symbol from the first source node, the symbol being
identical to a symbol received from the first source node in the
first symbol transmission process; and receiving a symbol from the
second source node, the symbol being identical to a symbol received
from the second source node in the second symbol transmission
process.
13. The method of claim 11, wherein the relaying of the symbol in
the first symbol transmission process comprises: receiving channel
information between the second source node and relay nodes from the
second source node; transmitting channel information between the
relay nodes and the first destination node to the first destination
node; receiving feedback information for the channel information
between the relay nodes and the first destination node from the
first destination node; adjusting the channel coefficients based on
the feedback information; and removing the interference channel
between the second source node and the first destination node.
14. The method of claim 11, wherein the relaying of the symbol in
the second symbol transmission process comprises: receiving channel
information between the first source node and relay nodes from the
first source node; transmitting channel information between the
relay nodes and the second destination node to the second
destination node; receiving feedback information for the channel
information between the relay nodes and the second destination node
from the second destination node; adjusting the channel
coefficients based on the feedback information; and removing the
interference channel between the first source node and the second
destination node.
15. The method of claim 1, wherein, in response to three source
nodes and three destination nodes being provided, the receiving and
the relaying are performed during a first symbol transmission
process and a second symbol transmission process.
16. The method of claim 15, wherein the relaying of the symbol
comprises: in the first symbol transmission process, relaying the
symbol by removing an interference channel between the first source
node and a second destination node, and an interference channel
between the first source node and a third destination node; and in
the second symbol transmission process, relaying the symbol using
channels between the source nodes and the destination nodes.
17. The method of claim 16, wherein the receiving of the symbol
comprises: in the first symbol transmission process, receiving the
symbol from each of the first source node and the second source
node; and in the second symbol transmission process, receiving the
symbol from each of the second source node and a third source
node.
18. A method of controlling interference in a node pair,
comprising: simultaneously receiving a symbol from source nodes for
each of at least one symbol transmission process; transmitting to
destination nodes signals for each of the at least one symbol
transmission process with adjusted channel coefficients; and
extracting the symbol from the signals transmitted.
19. A method of controlling interference in a relay node,
comprising: simultaneously receiving a real number component symbol
and an imaginary number component symbol from source nodes; and
relaying the real number component symbol and the imaginary number
component symbol to destination nodes with adjusted channel
coefficients, wherein the simultaneously receiving and the relaying
are performed during a symbol transmission process between the
source and destination nodes.
20. A method of controlling interference in a node pair,
comprising: simultaneously receiving a real number component symbol
and an imaginary number component symbol from source nodes, for
each of at least one symbol transmission process; transmitting to
destination nodes, signals for each of the at least one symbol
transmission process with adjusted channel coefficients; and
extracting the real number component symbol and the imaginary
number component symbol from the signals transmitted.
21. An apparatus to control interference, comprising: a relay node
configured to simultaneously receive a symbol from source nodes,
adjust channel coefficients, and relay the symbol to destination
nodes with adjusted channel coefficients, wherein the relay node
simultaneously receives and the relays the symbol during a symbol
transmission process between the source nodes and the destination
nodes.
22. An apparatus to control interference in a node pair,
comprising: a relay node configured to simultaneously receive a
symbol from source nodes for each of at least one symbol
transmission process, transmit to destination nodes signals for
each of the at least one symbol transmission process with adjusted
channel coefficients, and extract the symbol from the signals
transmitted.
Description
CROSS-REFERENCE TO RELATED APPLICATION(S)
[0001] This application claims the benefit under 35 USC 119(e) of
U.S. Provisional Application No. 61/778,718, filed on Mar. 13,
2013, in the U.S. Patent and Trademark Office, and under 35 USC
119(a) of Korean Patent Application No. 10-2013-0063917, filed on
Jun. 4, 2013, and Korean Patent Application No. 10-2014-0008318,
filed on Jan. 23, 2014, in the Korean Intellectual Property Office,
the entire disclosures of which are hereby incorporated by
reference for all purposes.
BACKGROUND
[0002] 1. Field
[0003] The following description relates to a method and apparatus
controlling interference in a multi-hop network, and a relay node
and a node pair using the method.
[0004] 2. Description of Related Art
[0005] A communications system is a collection of individual
communications networks, transmission systems, relay stations,
tributary stations, and data terminal equipment (DTE) usually
capable of interconnection and interoperation to form an integrated
whole. However, only 1% of mobile devices or stand-alone electronic
devices existing are connected to one another over a network.
However, with the development of communication technologies and the
trend toward unification through device integration, smart phones,
sensor devices, and other communication devices form a large
network. In addition, a large number of users of communication
terminals use a various applications for content sharing,
synchronization, outputting, and gaming using wireless connection
between devices. To respond to an increased demand for
connectivity, wireless access technologies may support a
device-to-device (D2D) communication beyond a cellular
communication using an existing infrastructure.
[0006] The D2D communication in an early stage is based on a
single-hop transmission technology, but is moving toward multiple
hops. Additionally, in one communication scenario including a
single source node and a single destination node, an existing relay
technology generally employs a plurality of relay nodes to obtain a
diversity gain or a multiplexing gain. However, it is expected that
a plurality of node pairs will often transmit signals concurrently
in a so-called multiple unicast multi-hop network. Accordingly, a
need exists to control interference between a plurality of node
pairs and a plurality of relay nodes.
SUMMARY
[0007] This Summary is provided to introduce a selection of
concepts in a simplified form that are further described below in
the Detailed Description. This Summary is not intended to identify
key features or essential features of the claimed subject matter,
nor is it intended to be used as an aid in determining the scope of
the claimed subject matter.
[0008] In accordance with an illustrative example, there is
provided a method to control interference in a relay node,
including simultaneously receiving a symbol from source nodes;
adjusting channel coefficients; and relaying the symbol to
destination nodes with adjusted channel coefficients. The
simultaneously receiving and the relaying are performed during a
symbol transmission process between the source and destination
nodes.
[0009] A number of the symbol transmission process may be equal to
or greater than a number of symbols simultaneously received.
[0010] The relaying of the symbol may include using one of an
amplify-and-forward (AF) scheme, a quantize-and-forward (QF)
scheme, and a compute-and-forward (CF) scheme, based on the channel
coefficients.
[0011] The symbol transmission process may correspond to a time
slot.
[0012] The symbol transmission process may correspond to a
frequency band.
[0013] The relaying of the symbol may include relaying the symbol
through channels between the source and destination nodes.
[0014] The relaying of the symbol may include removing an
interference channel from among channels between the source nodes
and the destination nodes by adjusting the channel coefficients;
and relaying the symbol, using the channels between the source
nodes and the destination nodes from which the interference channel
is removed.
[0015] The removing of the interference channel may include
receiving, from a source node among the source nodes, channel
information between the source node and relay nodes; transmitting
channel information between the relay nodes and a destination node
among the destination nodes to the destination node; receiving
feedback information for the channel information between the relay
nodes and the destination node from the destination node; and
adjusting the channel coefficients based on the feedback
information and removing the interference channel.
[0016] The relaying of the symbol may include generating an
end-to-end channel matrix, using a first channel matrix between the
source nodes and relay nodes, a second channel matrix between the
relay nodes and the destination nodes, and the channel
coefficients; and relaying the symbol from the source nodes to the
destination nodes using the end-to-end channel matrix.
[0017] In response to two source nodes and two destination nodes
being provided, the receiving, and the relaying may be performed
during a first symbol transmission process, a second symbol
transmission process, and a third symbol transmission process.
[0018] The relaying of the symbol may include in the first symbol
transmission process, relaying the symbol by removing an
interference channel between a second source node and the first
destination node; in the second symbol transmission process,
relaying the symbol by removing an interference channel between the
first source node and a second destination node; and in the third
symbol transmission process, relaying the symbol, using channels
between the source nodes and the destination nodes.
[0019] In the third symbol transmission process, the receiving of
the symbol may include receiving a symbol from the first source
node, the symbol being identical to a symbol received from the
first source node in the first symbol transmission process; and
receiving a symbol from the second source node, the symbol being
identical to a symbol received from the second source node in the
second symbol transmission process.
[0020] The relaying of the symbol in the first symbol transmission
process may include receiving channel information between the
second source node and relay nodes from the second source node;
transmitting channel information between the relay nodes and the
first destination node to the first destination node; receiving
feedback information for the channel information between the relay
nodes and the first destination node from the first destination
node; adjusting the channel coefficients based on the feedback
information; and removing the interference channel between the
second source node and the first destination node.
[0021] The relaying of the symbol in the second symbol transmission
process may include receiving channel information between the first
source node and relay nodes from the first source node;
transmitting channel information between the relay nodes and the
second destination node to the second destination node; receiving
feedback information for the channel information between the relay
nodes and the second destination node from the second destination
node; adjusting the channel coefficients based on the feedback
information; and removing the interference channel between the
first source node and the second destination node.
[0022] In response to three source nodes and three destination
nodes being provided, the receiving and the relaying may be
performed during a first symbol transmission process and a second
symbol transmission process.
[0023] The relaying of the symbol may include in the first symbol
transmission process, relaying the symbol by removing an
interference channel between the first source node and a second
destination node, and an interference channel between the first
source node and a third destination node; and in the second symbol
transmission process, relaying the symbol using channels between
the source nodes and the destination nodes.
[0024] The receiving of the symbol may include in the first symbol
transmission process, receiving the symbol from each of the first
source node and the second source node; and in the second symbol
transmission process, receiving the symbol from each of the second
source node and a third source node.
[0025] In accordance with an illustrative example, there is
provided a method of controlling interference in a node pair,
including simultaneously receiving a symbol from source nodes for
each of at least one symbol transmission process; transmitting to
destination nodes signals for each of the at least one symbol
transmission process with adjusted channel coefficients; and
extracting the symbol from the signals transmitted.
[0026] In accordance with another illustrative example, there is
provided a method of controlling interference in a relay node,
including simultaneously receiving a real number component symbol
and an imaginary number component symbol from source nodes; and
relaying the real number component symbol and the imaginary number
component symbol to destination nodes with adjusted channel
coefficients,
[0027] The simultaneously receiving and the relaying may be
performed during a symbol transmission process between the source
and destination nodes.
[0028] In accordance with a further illustrative example, there is
provided a method of controlling interference in a node pair,
including simultaneously receiving a real number component symbol
and an imaginary number component symbol from source nodes, for
each of at least one symbol transmission process; transmitting to
destination nodes, signals for each of the at least one symbol
transmission process with adjusted channel coefficients; and
extracting the real number component symbol and the imaginary
number component symbol from the signals transmitted.
[0029] In accordance with an illustrative example, there is
provided an apparatus to control interference, including a relay
node configured to simultaneously receive a symbol from source
nodes, adjust channel coefficients, and relay the symbol to
destination nodes with adjusted channel coefficients, wherein the
relay node simultaneously receives and the relays the symbol during
a symbol transmission process between the source nodes and the
destination nodes.
[0030] In accordance with another illustrative example, there is
provided an apparatus to control interference in a node pair,
including a relay node configured to simultaneously receive a
symbol from source nodes for each of at least one symbol
transmission process, transmit to destination nodes signals for
each of the at least one symbol transmission process with adjusted
channel coefficients, and extract the symbol from the signals
transmitted.
[0031] Other features and aspects will be apparent from the
following detailed description, the drawings, and the claims.
BRIEF DESCRIPTION OF THE DRAWINGS
[0032] These and/or other aspects will become apparent and more
readily appreciated from the following description of the
embodiments, taken in conjunction with the accompanying drawings in
which:
[0033] FIG. 1 is a diagram illustrating an example of a multi-hop
network and an alternating topology, in accord with an
embodiment.
[0034] FIGS. 2A through 2C are diagrams illustrating examples of an
interference control scheme in a multi-hop network including two
node pairs, in accord with an embodiment.
[0035] FIGS. 3A and 3B are diagrams illustrating examples of an
interference control scheme in a multi-hop network including three
node pairs, in accord with an embodiment.
[0036] FIG. 4 is a diagram illustrating an example of an
interference control scheme using classification of signals in a
multi-hop network, in accord with an embodiment.
[0037] FIG. 5 is a flowchart illustrating an example of a method to
control interference in relay nodes in a multi-hop network, in
accord with an embodiment.
[0038] FIG. 6 is a flowchart illustrating an example of a method to
control interference in node pairs in a multi-hop network, in
accord with an embodiment.
[0039] Throughout the drawings and the detailed description, unless
otherwise described or provided, the same drawing reference
numerals will be understood to refer to the same elements,
features, and structures. The drawings may not be to scale, and the
relative size, proportions, and depiction of elements in the
drawings may be exaggerated for clarity, illustration, and
convenience.
DETAILED DESCRIPTION
[0040] The following detailed description is provided to assist the
reader in gaining a comprehensive understanding of the methods,
apparatuses, and/or systems described herein. However, various
changes, modifications, and equivalents of the systems, apparatuses
and/or methods described herein will be apparent to one of ordinary
skill in the art. Also, descriptions of functions and constructions
that are well known to one of ordinary skill in the art may be
omitted for increased clarity and conciseness.
[0041] The features described herein may be embodied in different
forms, and are not to be construed as being limited to the examples
described herein. Rather, the examples described herein have been
provided so that this disclosure will be thorough and complete, and
will convey the full scope of the disclosure to one of ordinary
skill in the art.
[0042] Multi-Hop Network and Alternating Topology
[0043] FIG. 1 illustrates an example of a multi-hop network and an
alternating topology, in accord with an embodiment.
[0044] Referring to FIG. 1, a multi-hop network 110 is a two-hop
network including source nodes, relay nodes, and destination nodes.
For example, the multi-hop network 110 includes K source nodes, K
relay nodes, and K destination nodes. In the multi-hop network 110,
the source nodes transmit signals to the destination nodes through
the relay nodes. In the multi-hop network 110, users of a cellular
system may transmit data to base stations through relays. However,
when signals are simultaneously transmitted by different node
pairs, signals, symbols, or streams may interfere with each other
during a multi-hop process, which may cause inter-stream
interference. In accord with an embodiment, interference in the
multi-hop network 110 is controlled based on cooperation between
relay nodes and node pairs.
[0045] For instance, in the multi-hop network 110, S.sub.1 and
S.sub.2 denote source nodes, u and v denote relay nodes, and
d.sub.1 and d.sub.2 denote destination nodes. In an example in
which the source node S.sub.1 intends to transmit a symbol to the
destination node d.sub.1, the source node S.sub.1 and the
destination node d.sub.1 pair up with one another. Each source node
S.sub.i includes a message or symbol W.sub.i for each destination
node d.sub.i (i.epsilon.{1, 2}), pairing up with each source node
S.sub.i. Additionally, H.sub.1 denotes a channel matrix between
source nodes and relay nodes, and is represented by
H 1 = [ h s 1 , u h s 2 , u h s 1 , .upsilon. h s 2 , .upsilon. ] .
##EQU00001##
H.sub.2 denotes a channel matrix between relay nodes and
destination nodes, and is represented by
H 2 = [ h u , d 1 h .upsilon. , d 1 h u , d 2 h .upsilon. , d 2 ] .
##EQU00002##
In an example, channel gains may be real-values, and may be drawn
from a continuous distribution. In one example, the channel
matrices are defined during communication between the node pairs
and the relay nodes, and may be communicated to all the nodes.
[0046] In a time slot k, a transmission signal of the source node
S.sub.i may be defined as X.sub.i,k.epsilon., and a transmission
signal of a relay node r may be defined as X.sub.r,k.epsilon..
Y.sub.r,k denotes a signal received by the relay node r in the time
slot k, as shown in Equation 1. Y.sub.i,k denotes a signal received
from the destination node d.sub.i in the time slot k, as shown in
Equation 2.
Y.sub.r,k=h.sub.s.sub.1.sub.,rX.sub.1,k+h.sub.s.sub.2.sub.,rX.sub.2,k+Z.-
sub.r,k,r.epsilon.{u,v},k.epsilon., [Equation 1]
Y.sub.i,k=h.sub.u,d.sub.iX.sub.u,k+h.sub.v,d.sub.iX.sub.v,k+Z.sub.d.sub.-
i.sub.,k,i.epsilon.{1,2},5.epsilon., [Equation 2]
[0047] In Equations 1 and 2, Z.sub.r,k and Z.sub.d.sub.i.sub.,k
denote independently and identically distributed (i.i.d.) noise in
the relay node r, and i.i.d noise in the destination node d.sub.i,
respectively, and follow a distribution of N(0,1). Additionally,
Z.sub.r,k and Z.sub.d.sub.i.sub.,k are independent of messages
{W.sub.1, W.sub.2}. X.sup.n is represented to define a random
column Vector [X.sub.1 X.sub.2 . . . X.sub.n].sup.T, and when S.OR
right.{1, 2, . . . , n}, X.sup.S is defined as
{X.sub.k|k.epsilon.S}.
[0048] In an example of an interference control scheme in the
multi-hop network 110, relay nodes and node pairs control
interference in the multi-hop network 110, based on mutual
cooperation. In the interference control scheme in the multi-hop
network 110, the relay nodes remove an interference channel by
adjusting channel coefficients, and generate an alternating
topology, for example, topologies 120 to 150 illustrated in FIG. 1.
In one example, the alternating topology refers to a network
between the source nodes and the destination nodes that is occur in
turn repeatedly or alternate from an original network between the
source nodes and the destination nodes due to a change in
connectivity of the interference channel based on time or
frequency.
[0049] The node pairs transmit and receive at least one symbol
using the alternating topology. For example, when K node pairs
simultaneously transmit N symbols, K source nodes transmit the N
symbols to the relay nodes through M symbol transmission processes.
In this example, M may be equal to or greater than N. Additionally,
channel coefficients of the relay nodes may be adjusted differently
for each of symbol transmission processes and, accordingly, an
intensity of an interference signal received by K destination nodes
from source nodes, which are not paired up with the K destination
nodes, may be changed for each of the symbol transmission
processes.
[0050] A change in the intensity of the interference signal
indicates that an interference channel from source nodes to
destination nodes may be changed for each of the symbol
transmission processes. For example, in the topology 120, both, an
interference channel from the source node S.sub.1 to the
destination node d.sub.2, and an interference channel from the
source node S.sub.2 to the destination node d.sub.1 exists. In the
topology 130, an interference channel from the source node S.sub.2
to the destination node d.sub.1 does exist, but an interference
channel from the source node S.sub.1 to the destination node
d.sub.2 does not exist. In the topology 140, an interference
channel from the source node S.sub.1 to the destination node
d.sub.2 exists, but an interference channel from the source node
S.sub.2 to the destination node d.sub.1 does not exist. In the
topology 150, neither an interference channel from the source node
S.sub.1 to any of the destination nodes d.sub.1 and d.sub.2 nor an
interference channel from the source node S.sub.2 to any of the
destination nodes d.sub.1 and d.sub.2 exists. The destination nodes
d.sub.1 and d.sub.2 may decode the N symbols, based on the
alternating topology, using signals received from the interference
channels for each of the M symbol transmission processes.
[0051] Interference control scheme in multi-hop network including
two node pairs
[0052] FIGS. 2A through 2C illustrate examples of an interference
control scheme in a multi-hop network including two node pairs, in
accord with an embodiment. Although the interference control scheme
illustrates two node pairs, a person of ordinary skill in the
relevant art will appreciate that additional node pairs may be
implemented.
[0053] Referring to FIG. 2A, a multi-hop network 210 includes two
source nodes S.sub.1 and S.sub.2, two destination nodes d.sub.1 and
d.sub.2, and two relay nodes R.sub.1 and R.sub.2. In an
interference control scheme in the multi-hop network 210, the relay
nodes R.sub.1 and R.sub.2 and node pairs S.sub.1, S.sub.2, d.sub.1
and d.sub.2 may use a linear time-varying amplify-and-forward (AF)
scheme. Additionally, in an example, the relay nodes R.sub.1 and
R.sub.2 and the node pairs S.sub.1, S.sub.2, d.sub.1 and d.sub.2
may use a linear time-varying quantize-and-forward (QF) scheme, or
a linear time-varying compute-and-forward (CF) scheme. In another
example, the relay nodes R.sub.1 and R.sub.2 and the node pairs
S.sub.1, S.sub.2, d.sub.1 and d.sub.2 may control interference in
the multi-hop network 210, based on at least one frequency band,
instead of at least one time slot. For example, in the interference
control scheme in the multi-hop network 210, the relay nodes
R.sub.1 and R.sub.2 and the node pairs S.sub.1, S.sub.2, d.sub.1
and d.sub.2 may use a linear frequency-selecting AF scheme, a
linear frequency-selecting QF scheme, or a linear
frequency-selecting CF scheme. The following description is
provided based on the linear time-varying AF scheme.
[0054] In an example in which two node pairs S.sub.1, S.sub.2,
d.sub.1 and d.sub.2 are provided, when the linear time-varying AF
scheme is used in the relay nodes R.sub.1 and R.sub.2 and the node
pairs S.sub.1, S.sub.2, d.sub.1 and d.sub.2, conditions (c-1),
(c-2), and (c-3) may be assumed in the interference control scheme
of the multi-hop network 210. In this example, the condition (c-1)
may indicate that all channel gains are nonzero. The conditions
(c-2) and (c-3) may be represented, as shown in Equation 3.
( c - 2 ) rank ( H i ) = 2 , i .di-elect cons. { 1 , 2 } . [
Equation 3 ] ( c - 3 ) rank ( H i = [ h u , d 1 h s i , u h
.upsilon. , d 1 h s i , .upsilon. h u , d 2 h s i , u h .upsilon. ,
d 2 h s i , .upsilon. ] ) = 2 , i .di-elect cons. { 1 , 2 } , i _ =
3 - i . ##EQU00003##
[0055] Signals received by destination nodes in the time slot k may
be represented, as shown in Equation 4.
[ Y 1 , k Y 2 , k ] = H 2 [ .mu. k 0 0 .lamda. k ] H 1 [ X 1 , k -
1 X 2 , k - 1 ] + [ Z ~ 1 , k Z ~ 2 , k ] = G k [ X 1 , k - 1 X 2 ,
k - 1 ] + [ Z ~ 1 , k Z ~ 2 , k ] , [ Equation 4 ] ##EQU00004##
[0056] In Equation 4, .mu..sub.k and .lamda..sub.k denote channel
coefficients or AF coefficients in the time slot k, and {tilde over
(Z)}.sub.i,k denotes effective noise in the destination node
d.sub.i (i.epsilon.{1, 2}) and is represented by {tilde over
(Z)}.sub.i,k=h.sub.u,k.sub.i.mu..sub.kZ.sub.u,k-1+h.sub.v,d.sub.i.lamda..-
sub.kZ.sub.v,k-1+Z.sub.d.sub.i.sub.,k. Additionally, G.sub.k
denotes an equivalent end-to-end channel matrix, and is represented
by
G k = H 2 [ .mu. k 0 0 .lamda. k ] ##EQU00005##
[0057] G.sub.k may also be represented, as shown in Equation 5.
G k = [ .mu. k h u , d 1 h s 1 , u + .lamda. k h .upsilon. , d 1 h
s 1 , .upsilon. .mu. k h u , d 1 h s 2 , u + .lamda. k h .upsilon.
, d 1 h s 2 , .upsilon. .mu. k h u , d 2 h s 1 , u + .lamda. k h
.upsilon. , d 2 h s 1 , .upsilon. .mu. k h u , d 2 h s 2 , u +
.lamda. k h .upsilon. , d 2 h s 2 , .upsilon. ] ##EQU00006##
[0058] G.sub.k may be also represented by
G k = [ .alpha. 1 , k .beta. 1 , k .alpha. 2 , k .beta. 2 , k ] .
##EQU00007##
{tilde over (Z)}.sub.i,k may be represented by Z.sub.i,k free of a
tilde symbol .about.. Accordingly, the relay nodes R.sub.1 and
R.sub.2 may relay at least one symbol from the source nodes S.sub.1
and S.sub.2 to the destination nodes d.sub.1 and d.sub.2, using the
end-to-end channel matrix. The signals received at the destination
nodes d.sub.1 and d.sub.2 in the time slot k may be represented, as
shown in Equation 6.
Y.sub.i,k=.alpha..sub.i,kX.sub.1,k+.beta..sub.i,kX.sub.2,k+Z.sub.i,k,k.e-
psilon.{1,2, . . . ,n} [Equation 6]
[0059] In Equation 6, Z.sub.i,k depends on the channel coefficients
and AF factors. Accordingly, a scale of the Z.sub.i,k may not be
changed by a power constraint P.
[0060] In the interference control scheme in the multi-hop network
210, the relay nodes R.sub.1 and R.sub.2 and the node pairs
S.sub.1, S.sub.2, d.sub.1 and d.sub.2 may use the linear
time-varying AF scheme. When two symbols are to be transmitted from
a node pair, the relay nodes R.sub.1 and R.sub.2 and the node pairs
S.sub.1, S.sub.2, d.sub.1 and d.sub.2 may control interference
through three symbol transmission processes.
[0061] In the linear time-varying AF scheme, each of subsets u and
v correspond to a definite subset of a set of real numbers . In one
example, the subset u includes channel coefficients of a first
relay node ({.mu..sub.k.epsilon.u}.sub.k=1.sup.n), and the subset v
includes channel coefficients of a second relay node
({.lamda..sub.k.epsilon.v}.sub.k=1.sup.n). The subset u is a set to
u={c}, and the subset v is a set to V={0,
-ch.sub.u,d.sub.1h.sub.s.sub.2.sub.,u/h.sub.v,d.sub.1h.sub.s.sub.2.sub.,v-
,
-ch.sub.u,d.sub.2h.sub.s.sub.1.sub.,u/h.sub.v,d.sub.2h.sub.s.sub.1.sub.,-
v}. A constant c is included in the set of real numbers , and is
selected in the relay nodes to satisfy the power constraint P. The
constant is represented by c=min{ {square root over
(1/(h.sub.s.sub.1.sub.,u.sup.2+h.sub.s.sub.2.sub.,u.sup.2+1))},l
{square root over
(1/(h.sub.s.sub.1.sub.,v.sup.2+h.sub.s.sub.2.sub.,v.sup.2+1)})} in
which l indicates
min{|h.sub.v,d.sub.1h.sub.s.sub.2.sub.,v/h.sub.u,d.sub.1h.sub.s.sub.2.sub-
.,u|,|h.sub.v,d.sub.2h.sub.s.sub.1.sub.,v/h.sub.u,d.sub.2h.sub.s.sub.1.sub-
.,u|}. Based on the condition (c-1), denominators may be
nonzero.
[0062] FIG. 2B illustrates symbol transmission processes 220, 230,
and 240 in the multi-hop network 210, in accord with an
embodiment.
[0063] Referring to FIG. 2B, in the symbol transmission process
220, relay nodes R.sub.1 and R.sub.2 receive symbols a.sub.1 and
b.sub.1 from source nodes S.sub.1 and S.sub.2, respectively.
a.sub.1.sup.2 and b.sub.1.sup.2 may be less than or equal to the
power constraint P, (a.sub.1.sup.2,b.sub.1.sup.2.ltoreq.P).
Additionally, the relay nodes R.sub.1 and R.sub.2 remove an
interference channel between the source node S.sub.2 and the
destination node d.sub.1, by adjusting channel coefficients.
Accordingly, a channel coefficient .mu..sub.1 of a relay node
R.sub.1 may be set to .mu..sub.1=c, and a channel coefficient
.lamda..sub.1 of a relay node R.sub.2 may be set to
.lamda..sub.1=-ch.sub.u,d.sub.1h.sub.s.sub.2.sub.,u/h.sub.v,d.sub.1h.sub.-
s.sub.2.sub.,v. The relay nodes R.sub.1 and R.sub.2 relay the
symbols a.sub.1 and b.sub.1, using channels between the source
nodes S.sub.1 and S.sub.2 and the destination nodes d.sub.1 and
d.sub.2, from which the interference channel between the source
node S.sub.2 and the destination node d.sub.1 is removed. When
.mu..sub.1=c and
.lamda..sub.1=-ch.sub.u,d.sub.1h.sub.s.sub.2.sub.,u/h.sub.v,d.sub.1h.sub.-
s.sub.2.sub.,v are substituted to Equation 6, signals received at
the destination nodes d.sub.1 and d.sub.2 in the symbol
transmission process 220 may be represented, as shown in Equation
7.
y 1 , 1 = .alpha. 1 , 1 a 1 + z 1 , 1 , and y 2 , 1 = .alpha. 2 , 1
a 1 + .beta. 2 , 1 b 1 L 1 ( a 1 , b 1 ) + z 2 , 1 [ Equation 7 ]
##EQU00008##
[0064] In Equation 7, y.sub.1,1 denotes a signal received at the
destination node d.sub.1 in the symbol transmission process 220,
denotes a signal received at the destination node d.sub.2 in the
symbol transmission process 220. Based on the above-described
conditions (c-1) through (c-3), .alpha..sub.1,1 and .beta..sub.2,1
may be nonzero. Additionally,
.alpha..sub.2,1a.sub.1+.beta..sub.2,1b.sub.1 is represented by
L.sub.1(a.sub.1,b.sub.1). L.sub.1(a.sub.1,b.sub.1) is a linear
equation in which the symbols a.sub.1 and b.sub.1 are linearly
combined.
[0065] In the symbol transmission process 230, the relay nodes
R.sub.1 and R.sub.2 receive symbols a.sub.2 and b.sub.2 from the
source nodes S.sub.1 and S.sub.2, respectively. a.sub.2.sup.2 and
b.sub.2.sup.2 may be less than or equal to the power constraint P,
(a.sub.2.sup.2,b.sub.2.sup.2.ltoreq.P). Additionally, the relay
nodes R.sub.1 and R.sub.2 remove an interference channel between
the source node S.sub.1 and the destination node d.sub.2, by
adjusting the channel coefficients. Accordingly, a channel
coefficient .mu..sub.2 of the relay node R.sub.1 is set to
.mu..sub.2=c, and a channel coefficient of .lamda..sub.2 the relay
node R.sub.2 is set to
.lamda..sub.2=-ch.sub.u,d.sub.2h.sub.s.sub.1.sub.,u/h.sub.v,d.sub.2h.sub.-
s.sub.1.sub.,v. The relay nodes R.sub.1 and R.sub.2 relay the
symbols a.sub.2 and b.sub.2, using channels between the source
nodes S.sub.1 and S.sub.2 and the destination nodes d.sub.1 and
d.sub.2, from which the interference channel between the source
node S.sub.1 and the destination node d.sub.2 is removed. When
.mu..sub.2=c and
.mu..sub.2=-ch.sub.u,d.sub.2h.sub.s.sub.1.sub.,u/h.sub.v,d.sub.2h.sub.s.s-
ub.1.sub.,v are substituted to Equation 6, signals received at the
destination nodes d.sub.1 and d.sub.2 in the symbol transmission
process 230 are represented, as shown in Equation 8.
y 1 , 2 = .alpha. 1 , 2 a 2 + .beta. 1 , 2 b 2 L 2 ( a 2 , b 2 ) +
z 1 , 2 , and y 2 , 2 = .beta. 2 , 2 b 2 + z 2 , 2 [ Equation 8 ]
##EQU00009##
[0066] In Equation 8, y.sub.1,2 is a signal received by the
destination node d.sub.1 in the symbol transmission process 230,
y.sub.2,2 is a signal received by the destination node d.sub.2 in
the symbol transmission process 230. Based on the above-described
conditions (c-1) through (c-3), .alpha..sub.1,2 and .beta..sub.2,1
may be nonzero. Additionally,
.alpha..sub.1,2a.sub.2+.beta..sub.1,2b.sub.2 may be represented by
L.sub.2(a.sub.2,b.sub.2). L.sub.2(a.sub.2,b.sub.2) is a linear
equation in which the symbols a.sub.2 and b.sub.2 are linearly
combined.
[0067] In the symbol transmission process 240, the relay nodes
R.sub.1 and R.sub.2 receive, from the source node S.sub.1, a symbol
a.sub.1 that is identical to the symbol received from the source
node S.sub.1 in the symbol transmission process 220. Also, the
relay nodes R.sub.1 and R.sub.2 receive, from the source node
S.sub.2, a symbol b.sub.2 that is identical to the symbol received
from the source node S.sub.2 in the symbol transmission process
230. Accordingly, in the symbol transmission process 240, the
destination node d.sub.1 receives L.sub.3(a.sub.1,b.sub.2) in which
the symbols a.sub.1 and b.sub.2 are linearly combined, and the
symbol a.sub.1 is extracted from Equations 7 and 8. The destination
node d.sub.2 receives L.sub.4(a.sub.1,b.sub.2), and the symbol
b.sub.1 is extracted using Equations 7 and 8. The relay nodes
R.sub.1 and R.sub.2 may relay the symbols a.sub.1 and b.sub.2,
using channels between the source nodes and the destination nodes.
Accordingly, in the symbol transmission process 240, when the
source nodes S.sub.1 and S.sub.2 transmit the symbols a.sub.1 and
b.sub.2, respectively, when a channel coefficient .beta..sub.3 of
the relay node R.sub.1 is set to c, and when a channel coefficient
.lamda..sub.3 of the relay node R.sub.2 is set to zero, signals
received by the destination nodes d.sub.1 and d.sub.2 may be
represented, as shown in Equation 9.
y 1 , 3 = .alpha. 1 , 3 a 1 + .beta. 1 , 3 b 2 L 3 ( a 1 , b 2 ) +
z 1 , 3 , y 2 , 3 = .alpha. 2 , 3 a 1 + .beta. 2 , 3 b 2 L 4 ( a 1
, b 2 ) + z 2 , 3 , [ Equation 9 ] ##EQU00010##
[0068] In Equation 9, y.sub.1,3 denotes the signal received by the
destination node d.sub.1 in the symbol transmission process 240,
and y.sub.2,3 denotes the signal received at the destination node
d.sub.2 in the symbol transmission process 240. Based on the
above-described conditions (c-1) through (c-3), .beta..sub.1,3 and
.alpha..sub.2,3 may be nonzero.
[0069] Accordingly, when the symbol transmission processes 220
through 240 are performed, the destination node d.sub.1 may extract
a signal represented, as shown in Equation 10, from the received
signals y.sub.1,1, y.sub.1,2, y.sub.1,3.
y 1 a 1 = a 1 + z 1 , 1 / .alpha. 1 , 1 , a nd y 1 a 2 = a 2 + 1
.alpha. 1 , 2 z 1 , 2 - .beta. 1 , 2 .alpha. 1 , 2 .beta. 1 , 3 z 1
, 3 + .alpha. 1 , 3 .beta. 1 , 2 .alpha. 1 , 1 .alpha. 1 , 2 .beta.
1 , 3 z 1 , 1 [ Equation 10 ] ##EQU00011##
[0070] In Equation 10, y.sub.1.sup.a.sup.1 denotes a signal
associated with the symbol a.sub.1 transmitted from the source node
S.sub.1, and y.sub.1.sup.a.sup.2 denotes a signal associated with
the symbol a.sub.2 transmitted from the source node S.sub.1. For
example, when .sigma..sub.1.sup.2 and .sigma..sub.2.sup.2
correspond to a noise variance in the signals y.sub.1.sup.a.sup.1
and y.sub.1.sup.a.sup.2, .sigma..sub.1.sup.2 and
.sigma..sub.2.sup.2 depend on the channel coefficients and AF
factors. Accordingly, the power constraint P may not change a scale
of each of .sigma..sub.1.sup.2 and .sigma..sub.2.sup.2, and a rate,
as defined in Equation 11, may be extracted using a preset
outercode.
R 1 = 1 6 ( log ( 1 + P .sigma. 1 2 ) + log ( 1 + P .sigma. 2 2 ) )
.gtoreq. 1 3 log P .sigma. 1 .sigma. 2 [ Equation 11 ]
##EQU00012##
[0071] Based on Equation 11, the destination node d.sub.1 may
achieve 2/3 degrees of freedom (DoF). The destination node d.sub.2
may also achieve 2/3 DoF. Accordingly, a sum-DoF of the multi-hop
network 210 may be 4/3, which may lead to 33% increase, compared to
a time division multiplexing (TDM).
[0072] The order of the symbol transmission processes 220 through
240 performed at the relay nodes R.sub.1 and R.sub.2, the source
nodes S.sub.1 and S.sub.2, and the destination nodes d.sub.1 and
d.sub.2 may be changed without departing from the spirit and scope
of the described configurations. In an example, in an opposite
order to the above-described order, the symbol transmission
processes 220 through 240 may be performed, for example, the symbol
transmission processes 240, 230, and 220 may be subsequently and
sequentially performed. In another example, when the symbol
transmission process 230 is first performed, the symbol
transmission processes 240, and 220 may be subsequently and
sequentially performed.
[0073] Additionally, the symbol transmission processes 220 through
240 may be performed using an orthogonal dimension, for example, an
orthogonal time-division multiplexing or a an orthogonal
frequency-division multiple access. For example, the symbol
transmission processes 220 through 240 may be performed, using
multiple subcarriers and multiple subbands in an orthogonal
frequency-division multiplexing (OFDM).
[0074] In the interference control scheme in the multi-hop network,
the relay nodes may remove an interference channel between the
source nodes S.sub.1 and S.sub.2 and the destination nodes d.sub.1
and d.sub.2, based on a part of channel information, which will be
further described with reference to FIG. 2C.
[0075] Referring to FIG. 2C, a symbol transmission process 250
represents feedback of channel information in the symbol
transmission process 220 of FIG. 2B. As described in FIG. 2B, in
the symbol transmission process 220, the relay nodes R.sub.1 and
R.sub.2 remove the interference channel between the source node
S.sub.2 and the destination node d.sub.1, by adjusting the channel
coefficients. The relay nodes R.sub.1 and R.sub.2 adjust the
channel coefficients based on channel information between the
source node S.sub.2 and the relay nodes R.sub.1 and R.sub.2, and
channel information between the relay nodes R.sub.1 and R.sub.2 and
the destination node d.sub.1.
[0076] As shown in FIG. 2C, in the symbol transmission process 250,
in accord with an embodiment, a relay node R.sub.1 receives channel
information from the source node S.sub.2. The channel information
includes information about a channel between the source node
S.sub.2 and the relay node R.sub.1. A relay node R.sub.2 receives
channel information from the source node S.sub.2. The channel
information includes information about a channel between the relay
node R.sub.2 from the source node S.sub.2. The channel information
between the source node S.sub.2 and the relay node R.sub.1, and the
channel information between the source node S.sub.2 and the relay
node R.sub.2 may be, for example, channel state information at
receiver (CSIR). The relay node R.sub.1 estimates channel
information between the relay node R.sub.1 and a destination node
d.sub.1, and transmits the estimated channel information to the
destination node d.sub.1. In turn, the relay node R.sub.2 estimates
channel information between the relay node R.sub.2 and a
destination node d.sub.1, and transmits the estimated channel
information to the destination node d.sub.1. The channel
information between the relay node R.sub.1 and the destination node
d.sub.1, and the channel information between the relay node R.sub.2
and the destination node d.sub.1 may be, for example, channel state
information at transmitter (CSIT). The relay node R.sub.1 receives
feedback information from the destination node d.sub.1 about the
channel information between the relay node R.sub.1 and a
destination node d.sub.1, and the relay node R.sub.2 receives
feedback information from the destination node d.sub.2 about the
channel information between the relay node R.sub.2 and a
destination node d.sub.1. The relay nodes R.sub.1 and R.sub.2 may
adjust channel coefficients based on the feedback information, and
remove an interference channel between the source node S.sub.2 and
the destination node d.sub.1. Accordingly, in the symbol
transmission process 250, the relay nodes R.sub.1 and R.sub.2
remove the interference channel between the source node S.sub.2 and
the destination node d.sub.1, based on a portion of channel
information between the destination node d.sub.1 and the relay
nodes R.sub.1 and R.sub.2, instead of being based on all of the
channel information between the source node S.sub.2, the relay
nodes R.sub.1 and R.sub.2, and the destination node d.sub.1. For
example, channel information between the source node S.sub.2 and
the relay nodes R.sub.1 and R.sub.2, and channel information
between the destination node d.sub.1 and the relay nodes R.sub.1
and R.sub.2 may be used.
[0077] In the symbol transmission process 230 of FIG. 2B, the relay
nodes R.sub.1 and R.sub.2 remove the interference channel between
the source node S.sub.1 and the destination node d.sub.2, by
adjusting the channel coefficients. To adjust the channel
coefficients, the relay nodes R.sub.1 and R.sub.2 use channel
information between the source node S.sub.1 and the relay nodes
R.sub.1 and R.sub.2, and channel information between the
destination node d.sub.2 and the relay nodes R.sub.1 and
R.sub.2.
[0078] In a symbol transmission process 260, in accord with an
embodiment, a relay node R.sub.1 receives channel information
between the source node S.sub.1 and the relay node R.sub.1 from the
source node S.sub.1. A relay node R.sub.2 receives channel
information between the source node S.sub.1 and the relay node
R.sub.2 from the source node S.sub.1. The channel information
between the source node S.sub.1 and the relay node R.sub.1, and the
channel information between the source node S.sub.1 and the relay
node R.sub.2 are, for example, CSIR. The relay node R.sub.1
estimates channel information between the relay node R.sub.1 and a
destination node d.sub.2, and transmits the estimated channel
information to the destination node d.sub.2. The relay node R.sub.2
estimates channel information between the relay node R.sub.2 and a
destination node d.sub.2, and transmits the estimated channel
information to the destination node d.sub.2. The channel
information between the relay node R.sub.1 and the destination node
d.sub.2, and the channel information between the relay node R.sub.2
and the destination node d.sub.2 are, for example, CSIT.
[0079] The relay node R.sub.1 receives feedback information for the
channel information between the relay node R.sub.1 and a
destination node d.sub.2 from the destination node d.sub.2. The
relay node R.sub.2 receives feedback information for the channel
information between the relay node R.sub.2 and a destination node
d.sub.2 from the destination node d.sub.2. The relay nodes R.sub.1
and R.sub.2 adjust channel coefficients based on the feedback
information, and remove an interference channel between the source
node S.sub.1 and the destination node d.sub.2. Accordingly, in the
symbol transmission process 260, the relay nodes R.sub.1 and
R.sub.2 remove the interference channel between the source node
S.sub.1 and the destination node d.sub.2, based on a portion of
channel information between the destination node d.sub.2 and the
relay nodes R.sub.1 and R.sub.2, instead of based on all of the
channel information including, for example, channel information
between the source node S.sub.1 and the relay nodes R.sub.1 and
R.sub.2, and channel information between the destination node
d.sub.2 and the relay nodes R.sub.1 and R.sub.2 may be used.
[0080] In the symbol transmission process 240 of FIG. 2B, the relay
nodes relay at least one symbol using channels between the source
nodes S.sub.1 and S.sub.2 and the destination nodes d.sub.1 and
d.sub.2. In the symbol transmission process 240, the relay nodes
R.sub.1 and R.sub.2 do not remove an interference channel between
the source nodes S.sub.1 and S.sub.2 and the destination nodes
d.sub.1 and d.sub.2. Accordingly, in a third symbol transmission
process 270 of FIG. 2C, channel information between the source
nodes S.sub.1 and S.sub.2 and the relay nodes R.sub.1 and R.sub.2,
and channel information between the relay nodes R.sub.1 and R.sub.2
and the destination nodes d.sub.1 and d.sub.2 are not required.
[0081] In an example in which two node pairs, and two relay nodes
are provided, feedback of channel information may be performed
periodically, for instance, every three time slots corresponding to
the symbol transmission processes 250 through 270. Additionally,
for each of the symbol transmission processes 250 through 270, the
relay nodes may receive, as feedback, only a part of the channel
information and, as a result, uplink throughput is enhanced.
[0082] Referring to FIGS. 2A through 2C, in the interference
control scheme in the multi-hop network, at least one of the relay
nodes may include a processor or controller to remove an
interference between the source nodes S.sub.1 and S.sub.2 and the
destination nodes d.sub.1 and d.sub.2. The at least one of the
relay nodes would include a transmitter, the processor, and a
receiver to perform the interference control scheme.
[0083] Interference control scheme in multi-hop network including
three node pairs
[0084] FIGS. 3A and 3B illustrate examples of an interference
control scheme in a multi-hop network including three node pairs,
in accord with an embodiment.
[0085] Referring to FIG. 3A, a multi-hop network 310 includes three
source nodes, three destination nodes, and three relay nodes. In an
interference control scheme, a larger number of user interference
may be controlled, based on an increase in a number of node pairs,
and a number of relay nodes. As a result, a topology of the
interference control scheme may be more variously changed.
Similarly to the interference control scheme of FIGS. 2A through
2C, one of a linear time-varying AF scheme, a linear time-varying
QF scheme, a linear time-varying CF scheme, a linear
frequency-selecting AF scheme, a linear frequency-selecting QF
scheme, and a linear frequency-selecting CF scheme may be used in
the interference control scheme of FIGS. 3A and 3B. The following
description is provided based on the linear time-varying AF
scheme.
[0086] In a time slot k, the destination nodes receive signals
through a first channel matrix between the source nodes and the
relay nodes, channel coefficients of the relay nodes, and a second
channel matrix between the relay nodes and the destination nodes,
which may be represented, as given in Equation 12 below.
[ h 2 1 h 2 2 h 2 3 ] H 1 [ .mu. 1 0 0 0 .lamda. 1 0 0 0 .kappa. 1
] [ h 1 1 h 1 2 h 1 3 ] H 1 [ Equation 12 ] ##EQU00013##
[0087] In Equation 12, .mu..sub.1 is a channel coefficient of a
relay node R.sub.1 in a first symbol transmission process,
.lamda..sub.1 is a channel coefficient of a relay node R.sub.2, and
.kappa..sub.1 is a channel coefficient of a relay node R.sub.3. In
the interference control scheme in the multi-hop network, an
end-to-end channel matrix G is generated using the first channel
matrix, the second channel matrix, and the channel coefficients,
and an end-to-end channel matrix in the first symbol transmission
process is represented by
[ .alpha. 1 , 1 .beta. 1 , 1 .gamma. 1 , 1 .alpha. 2 , 1 .beta. 2 ,
1 .gamma. 2 , 1 .alpha. 3 , 1 .beta. 3 , 1 .gamma. 3 , 1 ] .
##EQU00014##
Accordingly, the relay nodes may relay at least one symbol from the
source nodes to the destination nodes, using the end-to-end channel
matrix.
[0088] Referring to FIG. 3B, in a symbol transmission process 320,
source nodes S.sub.1 and S.sub.2 transmit symbols a and b,
respectively, and a source node S.sub.3 does not transmit a symbol.
Additionally, relay nodes remove an interference channel between
the source node S.sub.1 and a destination node d.sub.2, and an
interference channel between the source node S.sub.1 and a
destination node d.sub.3, by adjusting channel coefficients.
Because the source node S.sub.3 does not transmit a symbol,
.alpha..sub.2,3 and .alpha..sub.3,3 are zero in the end-to-end
channel matrix
[ .alpha. 1 , 1 .beta. 1 , 1 .gamma. 1 , 1 .alpha. 2 , 1 .beta. 2 ,
1 .gamma. 2 , 1 .alpha. 3 , 1 .beta. 3 , 1 .gamma. 3 , 1 ] .
##EQU00015##
Accordingly, the channel coefficients in the symbol transmission
process 320 are
[ .mu. 1 .lamda. 1 .kappa. 1 ] = null ( [ h 2 2 .cndot. h 1 1 , T h
2 3 .cndot. h 1 1 , T ] ) . ##EQU00016##
A symbol .largecircle. represents an element-wise multiplier.
Accordingly, a signal received at a destination node d.sub.1 is
L.sub.1(a,b) in which the symbols a and b are linearly combined, a
signal received at the destination node d.sub.2 is the symbol b,
and a signal received at the destination node d.sub.3 is also the
symbol b.
[0089] In a symbol transmission process 330, source nodes S.sub.2
and S.sub.3 transmit symbols b and c, respectively, and a source
node S.sub.1 does not transmit a symbol. Additionally, relay nodes
remove an interference channel between the source node S.sub.3 and
the destination node d.sub.1, and an interference channel between
the source node S.sub.3 and the destination node d.sub.2, by
adjusting channel coefficients. For example, the channel
coefficients in the symbol transmission process 330 are adjusted
to
[ .mu. 2 .lamda. 2 .kappa. 2 ] = null ( h 2 1 .cndot. h 1 3 , T ) .
##EQU00017##
Accordingly, a signal received at the destination node d.sub.1 is
the symbol b, a signal received at the destination node d.sub.2 is
L.sub.2(b,c) in which the symbols b and c are linearly combined,
and a signal received at a destination node d.sub.3 is L.sub.3(b,c)
in which the symbols b and c are linearly combined. The destination
node d.sub.1 extracts the symbol a from L.sub.1(a,b), because the
destination node d.sub.1 receives L.sub.1(a,b) in the symbol
transmission process 320 and receives the symbol b in the symbol
transmission process 330. Similarly, the destination node d.sub.3
extracts the symbol c from L.sub.3(b,c), because the destination
node d.sub.3 receives the symbol b in the symbol transmission
process 320 and receives L.sub.3(b,c) in the symbol transmission
process 330. Additionally, the destination nodes d.sub.1, d.sub.2,
and d.sub.3 extract symbols transmitted by the source nodes
S.sub.1, S.sub.2, and S.sub.3, based on signals received from the
relay nodes. The destination node d.sub.2 receives the symbol b in
the symbol transmission process 320.
[0090] Through the symbol transmission processes 320 and 330, each
of the destination nodes d.sub.1, d.sub.2 and d.sub.3 achieve 1/2
DoF. Accordingly, a sum-DoF of the multi-hop network 310 is 3/2,
which may lead to 50% increase, compared to TDM, and is equal to a
DoF of an interference alignment (IA) scheme.
[0091] Similarly to the example of the two node pairs, the order of
the symbol transmission processes 320 and 330 may be changed
without departing from the spirit and scope of the described
configurations.
[0092] Referring to FIGS. 3A through 3B, in the interference
control scheme in the multi-hop network, at least one of the relay
nodes may include a processor or controller to remove an
interference between the source nodes S.sub.1, S.sub.2, and S.sub.3
and the destination nodes d.sub.1, d.sub.2, and d.sub.3. The at
least one of the relay nodes would include a transmitter, the
processor, and a receiver to perform the interference control
scheme.
[0093] Interference control scheme using classification of signals
in multi-hop network
[0094] FIG. 4 illustrates an example of an interference control
scheme using classification of signals in a multi-hop network, in
accord with an embodiment.
[0095] Referring to FIG. 4, a relay node receives a symbol from
each source node among node pairs, and relays the received symbol
to each destination node pairing up with the source nodes. For
example, a source node may classify symbols into real number
component symbols and imaginary number component symbols, and may
transmit the classified symbols to a destination node pairing up
with the source node. In this example, a relay node may relay the
real number component symbols and the imaginary number component
symbols to the destination node. A signal received by the
destination node may be represented, as shown in Equation 13.
[ Y R Y I ] = [ h R - h I h I h R ] [ X R X I ] + [ n R n I ] [
Equation 13 ] ##EQU00018##
[0096] In Equation 13, Y.sub.R denotes a real number component
symbol received at a destination node, Y.sub.I denotes an imaginary
number component symbol received at the destination node, X.sub.R
denotes a real number component symbol transmitted from a source
node, and X.sub.I denotes an imaginary number component symbol
transmitted from the source node. Additionally,
[ h R - h I h I h R ] ##EQU00019##
indicates a channel matrix between a source node and a destination
node, N.sub.R denotes a real number component of a noise signal,
and N.sub.I denotes an imaginary number component of a noise
signal.
[0097] In an example in which two node pairs and two relay nodes
are provided, the relay nodes simultaneously receive real number
component symbols and imaginary number component symbols from
source nodes. The relay nodes also relay the real number component
symbols, and the imaginary number component symbols to destination
nodes by adjusting channel coefficients. The destination nodes
receive signals from the relay nodes, and extract the real number
component symbols, and the imaginary number component symbols based
on the received signals. In an example, through a symbol
transmission process, the relay nodes relay the real number
component symbols and the imaginary number component symbols to the
node pairs. For example, the node pairs and the relay nodes
transmit signals from a first symbol transmission process to a
third symbol transmission process.
[0098] In a symbol transmission process 410, a first source node
transmits a real number component symbol a.sub.R1 and an imaginary
number component symbol a.sub.I1 to a first relay node. A second
source node transmits a real number component symbol b.sub.R1 and
an imaginary number component symbol b.sub.I1 to a second relay
node. By adjusting a channel coefficient, the first relay node
relays the received real number component symbol a.sub.R1, and the
received imaginary number component symbol a.sub.I1 to a first
destination node and a second destination node. In addition, by
adjusting the channel coefficient, the second relay node relays the
received real number component symbol b.sub.R1, and the received
imaginary number component symbol b.sub.I1 to the first destination
node and the second destination node.
[0099] For example, the first relay node and the second relay node
adjust the channel coefficients and, among all interference
channels, enable an interference channel for the real number
component symbol a.sub.R1 between the first source node and the
second destination node. The first relay node and the second relay
node remove the other interference channels. The first relay node
and the second relay node relay the real number component symbols
a.sub.R1 and b.sub.R1 and the imaginary number component symbols
a.sub.I1 and b.sub.I1 from the first source node and the second
source node to the first destination node and the second
destination node. The first relay node and the second relay node
relay the real number component symbols a.sub.R1 and b.sub.R1 and
the imaginary number component symbols a.sub.I1 and b.sub.I1 using
channels other than the removed interference channels.
[0100] In a symbol transmission process 420, a first source node
transmits a real number component symbol a.sub.R2, and an imaginary
number component symbol a.sub.I1, to a first relay node. A second
source node transmits a real number component symbol b.sub.R2 and
an imaginary number component symbol b.sub.I2 to a second relay
node. The first relay node relays the received real number
component symbol a.sub.R2, and the received imaginary number
component symbol a.sub.I1, to a first destination node and a second
destination node by adjusting a channel coefficient. The second
relay node relays the received real number component symbol
b.sub.R2 and the received imaginary number component symbol
b.sub.I2 to the first destination node and the second destination
node by adjusting a channel coefficient. For example, the first
relay node and the second relay node adjust the channel
coefficients and, among all interference channels, enable an
interference channel for the real number component symbol b.sub.R2
between the second source node and the first destination node. The
first relay node and the second relay node remove the other
interference channels. Using channels other than the removed
interference channels, the first relay node and the second relay
node relay the real number component symbols a.sub.R2 and b.sub.R2
and the imaginary number component symbols a.sub.I2 and b.sub.I2
from the first source node and the second source node to the first
destination node and the second destination node.
[0101] In a symbol transmission process 430, a first source node
transmits a real number component symbol a.sub.R1 and an imaginary
number component symbol a.sub.I3 to a first relay node. A second
source node transmits a real number component symbol b.sub.R2, and
an imaginary number component symbol b.sub.I3 to a second relay
node. The first relay node adjusts a channel coefficient and relays
the received real number component symbol a.sub.R1 and the received
imaginary number component symbol a.sub.I3 to a first destination
node and a second destination node. The second relay node adjusts a
channel coefficient and relays the received real number component
symbol b.sub.R2 and the received imaginary number component symbol
b.sub.I3 to the first destination node and the second destination
node. For example, the first relay node and the second relay node
adjust the channel coefficients and enable an interference channel,
among all interference channels, for the real number component
symbol a.sub.R1 between the first source node and the second
destination node. The first relay node and the second relay node
also enable an interference channel, among all interference
channels, for the real number component symbol b.sub.R2 between the
second source node and the first destination node. The first relay
node and the second relay node remove the other interference
channels. Using channels other than the removed interference
channels, the first relay node, and the second relay node relay the
real number component symbols a.sub.R1 and b.sub.R2, and the
imaginary number component symbols a.sub.I3 and b.sub.I3 from the
first source node and the second source node to the first
destination node and the second destination node.
[0102] Method of Controlling Interference in Relay Nodes in
Multi-Hop Network
[0103] FIG. 5 illustrates an example of a method of controlling
interference in relay nodes in a multi-hop network, in accord with
an embodiment.
[0104] Referring to FIG. 5, at operation 510, in response to node
pairs simultaneously transmitting at least one symbol, the method
at relay nodes receives the at least one symbol from source nodes.
The node pairs may be represented as K node pairs, and the at least
one symbol may be represented as N symbols. In the method of FIG.
5, the at least one symbol is relayed from the relay nodes through
at least one symbol transmission process. The at least one symbol
transmission process may be represented as M symbol transmission
processes. M indicates a number of symbol transmission processes
equal to or greater than N indicating a number of the symbols
transmitted from the K node pairs. The M symbol transmission
processes correspond to M time slots. Accordingly, each of the at
least one symbol transmission process may be performed over time.
Additionally, the M symbol transmission processes may correspond to
M frequency bands. For example, each of the at least one symbol
transmission process are performed using multiple subcarriers and
multiple subbands in an OFDM.
[0105] In an example, the method receives at the relay nodes the at
least one symbol from the source nodes using a channel matrix
between the relay nodes and the source nodes.
[0106] In another example, the method simultaneously receives at
the relay nodes a real number component symbol and an imaginary
number component symbol from the source nodes.
[0107] At operation 520, the method adjusts the channel
coefficients at the relay nodes and relays the at least one symbol
from the source nodes to destination nodes. The method may adjust
the channel coefficients based on the M symbol transmission
processes. In an example, the method uses one of an
amplify-and-forward (AF) scheme, a quantize-and-forward (QF)
scheme, and a compute-and-forward (CF) scheme based on the channel
coefficients. In the AF scheme, the method amplifies a source
signal using power scaling, and forwards the amplified source
signal to a destination node. In the QF scheme, the method
quantizes and compresses a source signal and forwards the
compressed source signal. Additionally, in the CF scheme, the
method generates a new signal based on a source signal using a
lattice code, and forwards the new signal to a destination
node.
[0108] In an example, method relays from the relay nodes at least
one symbol, using channels between node pairs and the relay nodes.
The method at the relay nodes removes at least one interference
channel, from among channels between source nodes and destination
nodes, by adjusting channel coefficients. In this example, the
method receives at relay nodes channel information between the
relay nodes and at least one source node among the source nodes
from the at least one source node. The method also transmits
channel information between the relay nodes and at least one
destination node among the destination nodes to the at least one
destination node. Additionally, the method receives feedback
information at the relay nodes for the channel information between
the relay nodes and the at least one destination node from the at
least one destination node, adjusts the channel coefficients based
on the received feedback information, and removes the at least one
interference channel.
[0109] Using the channels between the source nodes and the
destination nodes, the method relays from the relay nodes the at
least one symbol from which the at least one interference channel
is removed.
[0110] In another example, the method generates at the relay nodes
an end-to-end channel matrix, using a first channel matrix between
the source nodes and the relay nodes, a second channel matrix
between the relay nodes and the destination nodes, and the channel
coefficients. The method may also relay at least one symbol from
the source nodes to the destination nodes, using the end-to-end
channel matrix.
[0111] For example, when two node pairs are provided, the method
relays from the relay nodes at least one symbol through a first
symbol transmission process through a third symbol transmission
process.
[0112] In the first symbol transmission process, the method removes
at the relay nodes an interference channel between a second source
node and a first destination node, and relays at least one symbol.
For example, the method receives at the relay nodes channel
information between the second source node and the relay nodes from
the second source node, and transmits channel information between
the relay nodes and the first destination node to the first
destination node. Additionally, the method receives at the relay
nodes feedback information for the channel information between the
relay nodes and the first destination node from the first
destination node, adjusts the channel coefficients based on the
received feedback information, and removes the interference channel
between the second source node and the first destination node.
[0113] In a second symbol transmission process, the method receives
at the relay nodes an interference channel between a first source
node and a second destination node, and may relay at least one
symbol. For example, the method receives at the relay nodes channel
information between the first source node and the relay nodes from
the first source node, and transmits channel information between
the relay nodes and the second destination node to the second
destination node. Additionally, the method receives at the relay
nodes feedback information for the channel information between the
relay nodes and the second destination node from the second
destination node, adjusts the channel coefficients based on the
received feedback information, and removes the interference channel
between the first source node and the second destination node.
[0114] In the third symbol transmission process, the method relays
at the relay nodes at least one symbol, using channels between
source nodes and destination nodes. For example, from the first
source node, the method receives at the relay nodes a symbol that
is identical to a symbol received from the first source node in the
first symbol transmission process. Additionally, from the second
source node, the method receives at the relay nodes a symbol that
is identical to a symbol received from the second source node in
the second symbol transmission process.
[0115] For example, when three node pairs are provided, the method
at the relay nodes relays at least one symbol through a first
symbol transmission process and a second symbol transmission
process.
[0116] In the first symbol transmission process, the method at the
relay nodes removes an interference channel between a first source
node and a second destination node, and an interference channel
between the first source node and a third destination node, and
relays at least one symbol. The method at the relay nodes receives
at least one symbol from each of the first source node and a second
source node.
[0117] In the second symbol transmission process, the method at the
relay nodes relays at least one symbol using channels between
source nodes and destination nodes. For example, the method at the
relay nodes receives at least one symbol from each of the second
source node and a third source node.
[0118] In still another example, the method at the relay nodes
relays a real number component symbol and an imaginary number
component symbol to the destination nodes by adjusting the channel
coefficients.
[0119] The above description with reference to FIGS. 1 through 4
may equally be applied to the method of FIG. 5 and accordingly,
further description of the method is omitted herein.
[0120] Method of Controlling Interference in Node Pairs in
Multi-Hop Network
[0121] FIG. 6 illustrates an example of a method of controlling
interference in node pairs in a multi-hop network, in accord with
an embodiment.
[0122] Referring to FIG. 6, at operation 610, the method
simultaneously transmits from source nodes to relay nodes at least
one symbol for each of symbol transmission processes. For example,
M, which indicates a number of the symbol transmission processes,
may be equal to or greater than N, which indicates a number of
symbols transmitted by K node pairs. Additionally, M symbol
transmission processes may correspond to M time slots, and may also
correspond to M frequency bands.
[0123] In an example, the method simultaneously transmits from the
source nodes a real number component symbol and an imaginary number
component symbol to the relay nodes for each of the symbol
transmission processes.
[0124] At operation 620, for each of the symbol transmission
processes, the method receives at the destination nodes signals
from the relay nodes with adjusted channel coefficients.
[0125] At operation 630, the method extracts at the destination
nodes at least one symbol based on the received signals. For
example, for each of the M symbol transmission processes the method
extracts or decodes the N symbols transmitted by the source nodes
pairing up with the destination nodes based on the received
signals.
[0126] In an example, the method extracts at the destination nodes
a real number component symbol and an imaginary number component
symbol based on the received signals.
[0127] The above description with reference to FIGS. 1 through 4
may equally be applied to the method of FIG. 6 and accordingly,
further description of the method is omitted herein.
[0128] The source nodes, the relay nodes, and the destination nodes
described herein may be implemented using hardware components. For
example, the hardware components may include processing devices,
controllers, microphones, amplifiers, band-pass filters, audio to
digital convertors, and processing devices. A processing device may
be implemented using one or more general-purpose or special purpose
computers, such as, for example, a processor, a controller and an
arithmetic logic unit, a digital signal processor, a microcomputer,
a field programmable array, a programmable logic unit, a
microprocessor or any other device capable of responding to and
executing instructions in a defined manner. The processing device
may run an operating system (OS) and one or more software
applications that run on the OS. The processing device also may
access, store, manipulate, process, and create data in response to
execution of the software. For purpose of simplicity, the
description of a processing device is used as singular; however,
one skilled in the art will appreciated that a processing device
may include multiple processing elements and multiple types of
processing elements. For example, a processing device may include
multiple processors or a processor and a controller. In addition,
different processing configurations are possible, such a parallel
processors.
[0129] It is to be understood that in the embodiment of the present
invention, the operations in FIGS. 5-6 are performed in the
sequence and manner as shown although the order of some operations
and the like may be changed without departing from the spirit and
scope of the described configurations. In accordance with an
illustrative example, a computer program embodied on a
non-transitory computer-readable medium may also be provided,
encoding instructions to perform at least the method described in
FIGS. 5-6.
[0130] Program instructions to perform a method described in FIGS.
5-6, or one or more operations thereof, may be recorded, stored, or
fixed in one or more computer-readable storage media. The program
instructions may be implemented by a computer. For example, the
computer may cause a processor to execute the program instructions.
The media may include, alone or in combination with the program
instructions, data files, data structures, and the like. 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 that are specially configured to store and
perform program instructions, such as read-only memory (ROM),
random access memory (RAM), flash memory, and the like. Examples of
program instructions include machine code, such as produced by a
compiler, and files containing higher level code that may be
executed by the computer using an interpreter. The program
instructions, that is, software, may be distributed over network
coupled computer systems so that the software is stored and
executed in a distributed fashion. For example, the software and
data may be stored by one or more computer readable recording
mediums. Also, functional programs, codes, and code segments for
accomplishing the example embodiments disclosed herein may be
easily construed by programmers skilled in the art to which the
embodiments pertain based on and using the flow diagrams and block
diagrams of the figures and their corresponding descriptions as
provided herein.
[0131] As a non-exhaustive illustration only, a terminal or device
described herein may refer to mobile devices such as a cellular
phone, a personal digital assistant (PDA), a digital camera, a
portable game console, and an MP3 player, a portable/personal
multimedia player (PMP), a handheld e-book, a portable laptop PC, a
global positioning system (GPS) navigation, a tablet, a sensor, and
devices such as a desktop PC, a high definition television (HDTV),
an optical disc player, a setup box, a home appliance, and the like
that are capable of wireless communication or network communication
consistent with that which is disclosed herein.
[0132] A number of examples have been described above.
Nevertheless, it should be understood that various modifications
may be made. For example, suitable results may be achieved if the
described techniques are performed in a different order and/or if
components in a described system, architecture, device, or circuit
are combined in a different manner and/or replaced or supplemented
by other components or their equivalents. Accordingly, other
implementations are within the scope of the following claims.
* * * * *