CN101977103A - Implementation method of equivalent full duplex in bidirectional relay network - Google Patents
Implementation method of equivalent full duplex in bidirectional relay network Download PDFInfo
- Publication number
- CN101977103A CN101977103A CN2010105281681A CN201010528168A CN101977103A CN 101977103 A CN101977103 A CN 101977103A CN 2010105281681 A CN2010105281681 A CN 2010105281681A CN 201010528168 A CN201010528168 A CN 201010528168A CN 101977103 A CN101977103 A CN 101977103A
- Authority
- CN
- China
- Prior art keywords
- nodes
- relay
- node
- group
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 230000002457 bidirectional effect Effects 0.000 title claims abstract description 38
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000005540 biological transmission Effects 0.000 claims description 25
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 20
- 238000004891 communication Methods 0.000 claims description 9
- 230000003993 interaction Effects 0.000 claims description 4
- 238000001228 spectrum Methods 0.000 abstract description 12
- 238000010586 diagram Methods 0.000 description 10
- 238000013507 mapping Methods 0.000 description 9
- 230000008569 process Effects 0.000 description 9
- 230000009471 action Effects 0.000 description 3
- ODCKICSDIPVTRM-UHFFFAOYSA-N [4-[2-hydroxy-3-(propan-2-ylazaniumyl)propoxy]naphthalen-1-yl] sulfate Chemical compound C1=CC=C2C(OCC(O)CNC(C)C)=CC=C(OS(O)(=O)=O)C2=C1 ODCKICSDIPVTRM-UHFFFAOYSA-N 0.000 description 2
- 238000005562 fading Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 239000000654 additive Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an implementation method of equivalent full duplex in bidirectional relay network. Applying the embodiment of the invention, high efficiency relay coordination is adopted, so that only one relay node participating in coordination in each hop is in sending state while the other nodes are in receiving state from the moment that time slot number is prepared. The embodiment of the invention utilizes alternate transceiving of relay nodes, equivalent full duplex bidirectional relay network can be realized, network resource utilization factor is improved, and spectrum efficiency is improved to the utmost extent.
Description
Technical Field
The invention relates to the technical field of generalized cooperative communication, in particular to a method and a device for realizing equivalent full duplex in a bidirectional relay network.
Background
In the multipoint cooperative communication, the multi-hop communication, the time division multiplexing of the bidirectional channel and the half-duplex working mode of the node are three main factors causing the low spectrum efficiency of the bidirectional relay channel. The existing method for improving the spectrum efficiency of the bidirectional relay channel comprises the following steps:
(1) the relay node processes the bidirectional data simultaneously in a decoding-forwarding (DF) mode (namely, after the bidirectional data are decoded respectively, a network coding mode is adopted);
(2) the relay node processes bidirectional data (namely physical layer network coding) in a denoising mapping mode;
(3) the relay node processes the bidirectional data simultaneously in an amplify-and-forward (AF) manner (i.e., bidirectional throughput enhancement relay in an amplify-and-forward manner).
Although the existing method can improve the spectrum efficiency of the bidirectional relay channel to a certain extent, the method can only compensate the loss of the system spectrum efficiency caused by the time division multiplexing of the bidirectional channel, and under a wireless bidirectional relay channel model of a node half-duplex mode, the method can not achieve that a target node receives information in each time slot, so that the spectrum efficiency of the bidirectional relay channel is still low, and a large improvement space exists.
Disclosure of Invention
The invention provides an equivalent full duplex implementation method in a bidirectional relay network, a target node can receive information in each time slot after the time slot number is prepared, and the spectrum efficiency is improved to the maximum extent.
The invention provides an equivalent full-duplex realization method in a bidirectional relay network, which is characterized in that a first group of nodes (S1, D1) and a second group of nodes (S2, D2) with spaces are arranged, the nodes S1 and S2 are always in a sending state, the nodes D1 and D2 are always in a receiving state, no direct link exists between the nodes S1 and D2, and between the nodes S2 and D1, and information interaction is realized between the first group of nodes (S1, D1) and the second group of nodes (S2, D2) through at least one group of relay nodes; the method further comprises the following steps:
in the first time slot for transmitting data, the node S1 and the node S2 transmit data, and the nodes in the relay group are in a receiving state; the relay node in the receiving state completes physical layer network coding operation;
starting from the second time slot of the transmitted data, selecting one relay node from the relay nodes in the receiving state as a transmitting node in each time slot of the transmitted data, and enabling the rest nodes in the relay group to be in the receiving state; the relay node in the receiving state completes physical layer network coding operation;
starting from the number of the prepared time slots, only one relay node is in a transmitting state and the rest relay nodes are in a receiving state in each data transmission time slot and the relay nodes participating in assistance.
And the number of the preparation time slots is determined according to the hop count of the interval between the first group of nodes and the second group of nodes.
Wherein the determining of the number of the prepared time slots according to the number of hops spaced between the first group of nodes and the second group of nodes specifically includes: the number of prepared time slots is equal to the number of hops between the first set of nodes and the second set of nodes after the communication is initiated.
And selecting an optimal relay node from all relay nodes in a receiving state in the last time slot according to an optimal path selection algorithm to convert the optimal relay node into a sending state.
The number of the actual transmission models of each time slot is multiple, and the specific number is the number of the relay nodes participating in forwarding in each group.
Wherein the node S1 and the node S2 each transmit a new data packet per slot; alternatively, network coded data is transmitted every time slot, the network coded data being the network coded data of the new data packet and the received data packet.
The data transmitted by the relay node in the transmission state is data obtained by encoding a bidirectional data stream through a network.
By applying the embodiment of the invention, only one relay node participating in the cooperation in each hop is always in a sending state from the time slot number preparation through the efficient relay cooperation, and the rest relay nodes are in a receiving state. The embodiment of the invention utilizes the alternate transceiving between the relay nodes to realize the equivalent full-duplex bidirectional relay network, improve the utilization rate of network resources and improve the spectrum efficiency to the maximum extent.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flowchart of an equivalent full duplex implementation method in a two-hop bidirectional relay network according to an embodiment of the present invention;
fig. 2 is a schematic diagram of an implementation when 2 hops exist between a first group of nodes and a second group of nodes in a space and the number of relay nodes in each hop is 3 according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of PNC operation on i-way signals based on the embodiment shown in FIG. 2;
FIG. 4 is all possible system models for the first two time slots based on the embodiment shown in FIG. 2;
fig. 5 is a schematic diagram of an implementation when 3 hops exist between a first group of nodes and a second group of nodes in a space and the number of relay nodes in each hop is 2 according to an embodiment of the present invention;
fig. 6 is a schematic diagram of an implementation when there are 4 hops between the first and second groups of nodes in space and the number of relay nodes per hop is 3 according to an embodiment of the present invention;
fig. 7 is a schematic diagram of an implementation when 5 hops are between the first and second groups of nodes in the space and the number of relay nodes per hop is 3 according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the embodiment of the invention, a plurality of half-duplex nodes can realize the resource utilization rate of an equivalent full-duplex bidirectional relay network and effectively improve the spectrum efficiency of a bidirectional relay channel by time division alternate transceiving and channel state information-based optimal path selection on the basis of processing multi-path data by utilizing physical layer network coding in the mutual cooperation relay process.
Referring to fig. 1, which is a flowchart of an equivalent full-duplex implementation method in a two-hop bidirectional relay network according to an embodiment of the present invention, in this embodiment, a first group of nodes (S1, D1) and a second group of nodes (S2, D2) that exist in a space are set, a node S1 and a node S2 are always in a transmission state, a node D1 and a node D2 are always in a reception state, and no direct link exists between a node S1 and a node D2 and between a node S2 and a node D1, that is, information interaction is implemented between the first group of nodes (S1, D1) and the second group of nodes (S2, D2) through at least one group of relay nodes (the relay node used in each hop is referred to as a group); the nodes S1 are closer to D1 and S2 is closer to D2, that is, the nodes S1 and D1, S2 and D2 can realize data sharing by some means such as direct links; the method further comprises the following steps:
The number of the prepared time slots is determined according to the hop count of the interval between the first group of nodes and the second group of nodes; specifically, the number of prepared slots is equal to the number of hops between the first group of nodes and the second group of nodes after the communication is initiated. For example, if 2 hops are provided between the first group of nodes and the second group of nodes, the number of prepared slots is 2, and if 3 hops are provided between the first group of nodes and the second group of nodes, the number of prepared slots is 3.
It should be noted that, according to the optimal path selection algorithm, an optimal relay node is selected from all relay nodes in the receiving state in the previous time slot, and the selected relay node is converted into the transmitting state.
It should be noted that there are multiple actual transmission models per timeslot, and the specific number is the number of relay nodes participating in forwarding in each group.
It should be noted that the node S1 and the node S2 may transmit a new data packet every time slot; it is also possible to transmit network coded data containing new data packets per time slot.
It should be noted that the bidirectional data streams are converged at the relay nodes located at the "relative center" of the network, and the network coding is followed by relay forwarding; (Note: since there is no relay node at the absolute center in the case of an odd hop interval between two end-node pairs, "relative center" is used to indicate where the bidirectional data intersection occurs.
By applying the embodiment of the invention, only one relay node participating in the cooperation in each hop is always in a sending state from the time slot number preparation through the efficient relay cooperation, and the rest relay nodes are in a receiving state. The embodiment of the invention utilizes the alternate transceiving between the relay nodes to realize the equivalent full-duplex bidirectional relay network, improve the utilization rate of network resources and improve the spectrum efficiency to the maximum extent.
The present invention will be described in detail below with reference to 2-5 hops as an example.
Referring to fig. 2, it is a schematic diagram of an implementation of 2 hops between a first group of nodes and a second group of nodes in a space according to an embodiment of the present invention.
(1) In the first time slot of the sending data, all the relay nodes receive the bidirectional data from the two source nodes S1 and S2 at the same time, and realize the Physical Layer Network Coding (PNC) operation of two signals according to a proper demodulation mapping rule such as an MAP mapping rule; at this time, all the nodes in the relay group are in a receiving state;
(2) starting from the 2 nd time slot, the relay node in the receiving state receives the superposition of the 3 paths of signals from the two source nodes and the relay node in the sending state, and completes the PNC operation of the 3 paths of signals; and each time slot selects the optimal relay node from all the relay nodes in the receiving state in the previous time slot according to the optimal path selection algorithm to be converted into the sending state, the latest received coding information is forwarded to the next hop, and the relay nodes in the sending state are converted into the receiving state in the subsequent time slot.
When the number n of the relay nodes is 3, the specific implementation process is as follows:
considering the quasi-static fading channel, all nodes operate in half-duplex state. The data packets transmitted by the source nodes S1 and S2 at the jth slot are
Wherein,
a modulo-2 addition operation indicating that the source node i transmits data in the jth slot and the j-1 th slot.
From the 2 nd slot, the relay node in the receiving state receives the superposition of the 3-way signals from the two source nodes S1 and S2 and the relay node in the transmitting state, and completes the PNC operation of the 3-way signal. Relay node R in receiving statemThe received signals of (a) are:
where P is the node transmit power, xvRepresents the modulation symbol of unit power of node v, v ∈ { S }1，S2，Rt}，t∈{1，2，3}；
As a relay node RmAdditive white Gaussian noise (with mean 0 and variance N)0/2，N0Representing the noise power.
Representing the fading characteristics of the channel, obeying a mean of 0 and a variance of σ2The rayleigh distribution of (a).
In the forwarding stage, the optimal relay node is selected from all the relay nodes in the receiving state in the last time slot according to the optimal path selection algorithm and is converted into the sending state, and the latest received coding information is converted
And forwarding to the next hop, converting the relay node in the sending state into the receiving state in the subsequent time slot, and subsequently receiving the data.
The "optimal" path selection criterion h is specifically:
wherein n is the number of relay nodes, and the rest letters have the same meanings as the above.
It should be noted that, due to the broadcasting characteristics of the wireless channel, the nodes in the receiving state, which are located in the communication range of the source nodes S1 and S2, can receive the information transmitted by the source nodes S1 and S2, and the nodes in the transmitting state cannot receive the information. The nodes S1 and S2 need not know to which relay they need to send data, but only need to send directly.
Referring to fig. 3, a schematic diagram of PNC operation on i-way signals according to the embodiment shown in fig. 2 is shown.
Generic PNC mapping procedureAs shown in FIG. 3, considering the physical layer network coding mapping process in which i nodes participate, M is defined to represent a digital symbol set, and M is providedjE.m (j 1.. i) andsubsequently, E is defined to represent a set of electromagnetic wave domain (PNC domain) modulation symbols. Each mjE, M (j ═ 1.. times, i) may each be mapped to a corresponding modulation symbol ejE (j ═ 1.. times, i), define f: m → E denotes the modulation mapping function, i.e.
In the electromagnetic wave domain, a plurality of modulation symbols are spatially superposed, with e1+e2+...+ei＝e′kE 'where E' is a set different from E and having a higher potential. Each superposed symbol e 'received by the relay node'kE' must be mapped according to some rule to a demodulation symbol mke.M, define h: e '→ M denotes a demodulation mapping function, i.e., h (E'k)＝mk. Notably, f: m → E is a one-to-one mapping, and h: e' → M are many-to-one mappings.
See fig. 4, which is all possible system models for the first two time slots based on the embodiment shown in fig. 2.
Fig. 4(a) is a system model of the first time slot, and since the idea of "optimal" path selection is introduced, starting from the 2 nd time slot, the relay nodes in the transmission state are randomly determined according to the channel state, that is, all the relay nodes in the receiving state in the previous time slot are likely to be converted into the transmission state in the time slot, and fig. 4(b) (c) (d) shows the 2 nd time slot, all the possible system models. Obviously, starting from the 2 nd time slot, the number of all possible system models of the method depends on the number of relay nodes participating in forwarding, and one of the actual transmission processes n is selected.
Referring to fig. 5, it is a schematic diagram of an implementation when there are 3 hops between the first and second groups of nodes in space and the number of relay nodes in each hop is 2 according to the embodiment of the present invention.
For the 3-hop link, 2 cases are also exemplified according to the difference of the data sent by the source node. On the left side, each time slot of 2 source nodes transmits a new data packet; on the right side are the network coded data of the new data packet and the received data packet sent by the source node in each time slot. Here, only 2 cases are exemplified, and other options are available for the data format transmitted by the source node.
Each time slot describes:
time slot 1: the source nodes S1 and S2 transmit data; relay group 1, R in FIG. 511Node and relay group 2, R in fig. 531The node is in a receiving state and receives the data sent by the source nodes S1 and S2;
time slot 2: the source node is consistent with the operation of the time slot 1, and only the specific data content sent is different; the relay group 1 and the relay group 2 select one from the relay nodes in the group as a sending node, and send out the data received in the time slot 1; and other relay nodes continue to be in the receiving state, and receive the data transmitted by the adjacent source node, the transmitting node in the relay group and the transmitting node in the adjacent relay group.
Specifically, the source nodes S1 and S2 still transmit data, but the specific data content of the transmission is different, and the relay node R in the relay group 111And relay node R within relay group 231As a transmitting node, the data received in the time slot 1 is transmitted, and other relay nodes such as R13And R33In an accepting state, for a relay node such as R13It receives the source node S1, the relay node R11And a relay node R31The data to be transmitted; for relay nodes such as R33It receives the source node S2, the relay node R31And a relay node R11The data to be transmitted.
Time slot 3: the source node operates similar to slot 2; for the relay group 1 and the relay group 2, the node in the sending state in the last time slot is switched to the receiving state, and one node in the receiving state in the last time slot is selected as the sending node to send the data received in the last time slot; from this time slot, the destination nodes at both ends of each time slot will receive a new frame of data corresponding to the source node.
Time slot 4: the operation of the nodes in the present two-pair slot node pair ((S1, D1), (S2, D2)), relay node group is similar to slot 3. The only differences are the specific data content of the transmission.
Time slot 5: the operation of the nodes in the present two-pair slot node pair ((S1, D1), (S2, D2)), relay node group is similar to slot 4. The only differences are the specific data content of the transmission.
Referring to fig. 6, it is a schematic diagram of an implementation when there are 4 hops between the first and second groups of nodes in space and the number of relay nodes per hop is 3 according to the embodiment of the present invention.
For the 4-hop link, 2 cases are also exemplified according to the difference of the data sent by the source node. On the left side, each time slot of 2 source nodes transmits a new data packet; on the right side are the network coded data of the new data packet and the received data packet sent by the source node in each time slot. Here, only 2 cases are exemplified, and other options are available for the data format transmitted by the source node.
Each time slot describes:
time slot 1: the relay nodes of the relay group 1 and the relay group 3 are both in a receiving state and receive data sent by adjacent source nodes;
time slot 2: one node is selected from the relay group 1 and the relay group 3 as a sending node respectively, the data received in the last time slot is sent out, and other relay nodes in the relay group 1 and the relay group 3 are used as receiving nodes. For example, relay nodes R are selected in relay group 1 and relay group 3, respectively11And a relay node R33As a transmitting node, a relay node R in the relay group 112And a relay node R13Continuing as a receiving node, relay node R in relay group 332And a relay node R31Continue to be a receiving node
At this time, all the nodes in the relay group 2 are in a receiving state, and receive data transmitted by the transmitting nodes in the relay group 1 and the relay group 3.
Time slot 3: one of the relay groups 2 is selected as a sending node, the data received in the last time slot is sent, and other nodes are in a receiving state. Relay group 1 and relay group 3: the node in the sending state in the last time slot is converted into a receiving state, and the data sent by the sending node in the group, the adjacent source node and the relay group 2 are received; and selecting one of the nodes in the receiving state in the last time slot as a sending node.
For example, selecting a relay node R in relay group 222As a transmitting node, a relay node R in the relay group 221And a relay node R23Continuing to serve as a receiving node; relay node R with last time slot as transmitting node in relay group 1 and relay group 311And a relay node R33Switching to a receiving state, and selecting a relay node R from the nodes in the receiving state in the last time slot13And a relay node R31As a transmitting node, at this time, for the relay node R in the relay group 111And a relay node R12Respectively receiving a source node S1 and a relay node R13And relay node R in relay group 222The data to be transmitted; for relay node R in relay group 332And a relay node R33Respectively receiving a source node S2 and a relay node R31And relay node R in relay group 222The data to be transmitted.
Time slot 4: from this time slot, the destination nodes at both ends of each time slot will receive a new frame of data corresponding to the source node. The nodes in each relay group operate in a similar manner as in the previous time slot.
Time slot 5: the operation of the nodes in the present two-pair slot node pair ((S1, D1), (S2, D2)), relay node group is similar to slot 4. The only differences are the specific data content of the transmission.
Referring to fig. 7, it is a schematic diagram of an implementation when there are 5 hops between the first and second groups of nodes in space and the number of relay nodes per hop is 3 according to the embodiment of the present invention. In this embodiment, only the case that the source node transmits a new data packet in each time slot is described, and it can be understood that the case that the source node transmits a new data packet and network coded data of a received data packet in each time slot is also applicable to this embodiment.
For the 5 link case, similar to 4 links. Starting from the 5 th time slot, the destination nodes at both ends of each time slot receive a new frame of data corresponding to the source node.
It can be seen that the link works in a substantially consistent manner no matter whether it is a 2-hop, 3-hop, 4-hop or 5-hop link. The difference is mainly 2 points:
firstly, the number of the preparation time slots for receiving new data of the corresponding source node by the destination nodes at the two ends is different;
secondly, the following steps: because the number of relay groups participating in the cooperation is different, the time slots of the relay groups at different positions participating in the cooperation are different. However, once participating, the basic mode is to select one node from the nodes in the receiving state as a sending node according to a certain rule, and send the data received in the previous time slot; the others are in a receive state. In the next time slot, the nodes in the transmitting state enter the receiving state again, and one of the nodes in the receiving state in the previous time slot is selected as the transmitting node, and the operation is performed alternately.
In summary, after determining the number of hops of the communication link, according to the following description of point 4, the source node sending data type that can simplify the complexity of the relay node data combination as much as possible is selected by properly considering the bidirectional data stream role relayed by each node.
1. The bidirectional data flows are converged at relay nodes positioned at the 'relative center' of the network, and the network coding is carried out and then the relay forwarding is continued; (note: since there is no relay node located at the absolute center in the case of an odd hop interval between two end-node pairs, "relative center" is used to indicate the location where the bidirectional data intersection occurs.) therefore, the data transmitted by the relay node in the transmission state is the data after the bidirectional data stream is encoded by the network.
2. From the 2 nd time slot, only one relay node in each group (each hop) participating in cooperation is in a transmitting state all the time, and the rest relay nodes are in a receiving state. The relay nodes in the transmitting state are preferentially selected from all the relay nodes in the receiving state in the last time slot according to an optimal path selection algorithm, the actual transmission process of each time slot is also multiple, and the number of possible transmission models depends on the number n of each group of relay nodes participating in forwarding;
3. the number of preparation slots depends on the number of hops spaced between the two end node pairs, i.e. the number of preparation slots; after communication is initiated, after time slots with the same hop count as that between two end node pairs, each time slot can realize the bidirectional interaction of a data packet of the corresponding source node;
4. since the data packets transmitted by the nodes S1 and S2 in each time slot are transferred in both directions in each subsequent hop, the intra-group interference information and inter-group transmission information of the relay nodes vary according to the contents of the data transmitted by the nodes S1 and S2 and the number of transmission hops. That is, after the hop count of the interval between two end-node pairs is determined, the data packet content can be transmitted by adjusting the two end source nodes, for example, after the 2 nd time slot in the case of 2 hops, the data transmitted by the source node i in any time slot j can be adjusted to
By properly adjusting the information content on the transmission link of the system, the interference in the relay node group and the useless information superposition of the reverse transmission between the groups are counteracted to the maximum extent; for example, in the case of 2 hops, the above adjustment can cancel the interference in the relay node group and the useless information superposition of the reverse transmission between the groups;
5. the data packets transmitted by the nodes S1 and S2 each slot may be network encoded data of both the new data packet and the received data packet, based on the new data packet.
The embodiment of the invention comprehensively considers the cause of lower frequency spectrum efficiency of the bidirectional relay channel, utilizes the cooperative transmission among the relay nodes, improves the frequency spectrum efficiency of the bidirectional relay channel to the maximum extent, and has more obvious performance advantages along with the increase of relay forwarding hop numbers.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. The term "comprising", without further limitation, means that the element so defined is not excluded from the group consisting of additional identical elements in the process, method, article, or apparatus that comprises the element.
Those skilled in the art will appreciate that all or part of the steps in the above method embodiments may be implemented by a program to instruct relevant hardware to perform the steps, and the program may be stored in a computer-readable storage medium, which is referred to herein as a storage medium, such as: ROM/RAM, magnetic disk, optical disk, etc.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.
Claims (7)
1. An equivalent full-duplex realization method in a bidirectional relay network is characterized in that a first group of nodes (S1, D1) and a second group of nodes (S2, D2) with space existence are set, the nodes S1 and S2 are always in a sending state, the nodes D1 and D2 are always in a receiving state, no direct link exists between the nodes S1 and D2, and between the nodes S2 and D1, and information interaction is realized between the first group of nodes (S1, D1) and the second group of nodes (S2, D2) through at least one group of relay nodes; the method further comprises the following steps:
in the first time slot for transmitting data, the node S1 and the node S2 transmit data, and the nodes in the relay group are in a receiving state; the relay node in the receiving state completes physical layer network coding operation;
starting from the second time slot of the transmitted data, selecting one relay node from the relay nodes in the receiving state as a transmitting node in each time slot of the transmitted data, and enabling the rest nodes in the relay group to be in the receiving state; the relay node in the receiving state completes physical layer network coding operation;
starting from the number of the prepared time slots, only one relay node is in a transmitting state and the rest relay nodes are in a receiving state in each data transmission time slot and the relay nodes participating in assistance.
2. The method of claim 1, wherein the number of preparation slots is determined based on the number of hops separating the first set of nodes and the second set of nodes.
3. The method of claim 1, wherein the determining the number of preparation slots according to the number of hops between the first set of nodes and the second set of nodes comprises: the number of prepared time slots is equal to the number of hops between the first set of nodes and the second set of nodes after the communication is initiated.
4. The method of claim 1, wherein an optimal relay node is selected from all relay nodes in a receiving state in a previous time slot according to an optimal path selection algorithm to transit to a transmitting state.
5. The method of claim 4, wherein there are multiple actual transmission models per timeslot, and the specific number is the number of relay nodes participating in forwarding in each group.
6. The method of claim 1, wherein the node S1 and the node S2 each transmit a new data packet per slot; alternatively, network coded data is transmitted every time slot, the network coded data being the network coded data of the new data packet and the received data packet.
7. The method of claim 1, wherein the data transmitted by the relay node in the transmitting state is data encoded by a bidirectional data stream via a network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105281681A CN101977103A (en) | 2010-11-01 | 2010-11-01 | Implementation method of equivalent full duplex in bidirectional relay network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105281681A CN101977103A (en) | 2010-11-01 | 2010-11-01 | Implementation method of equivalent full duplex in bidirectional relay network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101977103A true CN101977103A (en) | 2011-02-16 |
Family
ID=43576953
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105281681A Pending CN101977103A (en) | 2010-11-01 | 2010-11-01 | Implementation method of equivalent full duplex in bidirectional relay network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101977103A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102946609A (en) * | 2012-10-23 | 2013-02-27 | 汕头大学 | Data communication method of multiuser bidirectional relay communication system |
| CN103051427A (en) * | 2013-01-25 | 2013-04-17 | 西安电子科技大学 | Duplex wireless relay communication method based on network coding |
| CN104052578A (en) * | 2014-06-24 | 2014-09-17 | 东南大学 | Repeated decoding detection method suitable for full duplex physical layer network coding system |
| CN104093200A (en) * | 2014-07-25 | 2014-10-08 | 哈尔滨工业大学 | Dual-jump full-duplex DF relay system optimization power distribution method for single-node power limitation |
| CN105025565A (en) * | 2015-06-12 | 2015-11-04 | 上海交通大学 | A power optimization method for a full duplex bidirectional relay system under asymmetrical speeds |
| CN105099618A (en) * | 2015-06-03 | 2015-11-25 | 香港中文大学深圳研究院 | Decoding method based on physical network coding and corresponding data processing method |
| CN105490721A (en) * | 2015-10-30 | 2016-04-13 | 青岛智能产业技术研究院 | Estimate-forward method of full-duplex transportation cooperative-communication network |
| CN105813210A (en) * | 2016-03-09 | 2016-07-27 | 宁波大学 | Resource allocation method applicable to DF (decode and forward) protocol-based two-way relaying cognitive radio system |
| CN106028455A (en) * | 2016-07-04 | 2016-10-12 | 宁波大学 | DF protocol based resource allocation method for two-way relay cognitive radio system |
| CN107579789A (en) * | 2017-07-21 | 2018-01-12 | 南京航空航天大学 | Extensive unmanned plane junction network channel simulation device and GPU real-time emulation methods |
| CN108039905A (en) * | 2017-12-20 | 2018-05-15 | 中国信息通信研究院 | The system of selection of bidirectional relay system duplex mode and device based on decoding forwarding |
| CN105610475B (en) * | 2016-01-05 | 2018-06-15 | 合肥工业大学 | A kind of collaboration method of the bi-directional relaying based on network code |
| CN108702252A (en) * | 2016-03-17 | 2018-10-23 | R3通信有限公司 | Communication system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN85107963A (en) * | 1984-12-06 | 1986-07-09 | 莫托罗拉公司 | Duplex interconnect/dispatch trunked radio system |
-
2010
- 2010-11-01 CN CN2010105281681A patent/CN101977103A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN85107963A (en) * | 1984-12-06 | 1986-07-09 | 莫托罗拉公司 | Duplex interconnect/dispatch trunked radio system |
Non-Patent Citations (2)
| Title |
|---|
| 吕凌，于宏毅: "物理层网络编码分组的机会中继", 《电子与信息学报》 * |
| 杨波,于宏毅,冯强: "等效全双工双向中继网络及其可达速率分析", 《信息工程大学学报》 * |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102946609B (en) * | 2012-10-23 | 2015-05-13 | 汕头大学 | Data communication method of multiuser bidirectional relay communication system |
| CN102946609A (en) * | 2012-10-23 | 2013-02-27 | 汕头大学 | Data communication method of multiuser bidirectional relay communication system |
| CN103051427A (en) * | 2013-01-25 | 2013-04-17 | 西安电子科技大学 | Duplex wireless relay communication method based on network coding |
| CN103051427B (en) * | 2013-01-25 | 2015-05-20 | 西安电子科技大学 | Duplex wireless relay communication method based on network coding |
| CN104052578B (en) * | 2014-06-24 | 2017-09-26 | 东南大学 | A kind of method that repeatedly decoding is detected physical-layer network coding system suitable for full duplex |
| CN104052578A (en) * | 2014-06-24 | 2014-09-17 | 东南大学 | Repeated decoding detection method suitable for full duplex physical layer network coding system |
| CN104093200A (en) * | 2014-07-25 | 2014-10-08 | 哈尔滨工业大学 | Dual-jump full-duplex DF relay system optimization power distribution method for single-node power limitation |
| CN105099618A (en) * | 2015-06-03 | 2015-11-25 | 香港中文大学深圳研究院 | Decoding method based on physical network coding and corresponding data processing method |
| CN105025565B (en) * | 2015-06-12 | 2018-08-03 | 上海交通大学 | Full duplex bidirectional relay system power optimization method under asymmetric rate |
| CN105025565A (en) * | 2015-06-12 | 2015-11-04 | 上海交通大学 | A power optimization method for a full duplex bidirectional relay system under asymmetrical speeds |
| CN105490721B (en) * | 2015-10-30 | 2019-03-19 | 青岛智能产业技术研究院 | A kind of estimation retransmission method of full duplex traffic cooperative communication network |
| CN105490721A (en) * | 2015-10-30 | 2016-04-13 | 青岛智能产业技术研究院 | Estimate-forward method of full-duplex transportation cooperative-communication network |
| CN105610475B (en) * | 2016-01-05 | 2018-06-15 | 合肥工业大学 | A kind of collaboration method of the bi-directional relaying based on network code |
| CN105813210B (en) * | 2016-03-09 | 2019-05-03 | 宁波大学 | Resource allocation methods in bi-directional relaying cognitive radio system based on DF agreement |
| CN105813210A (en) * | 2016-03-09 | 2016-07-27 | 宁波大学 | Resource allocation method applicable to DF (decode and forward) protocol-based two-way relaying cognitive radio system |
| CN108702252A (en) * | 2016-03-17 | 2018-10-23 | R3通信有限公司 | Communication system |
| CN108702252B (en) * | 2016-03-17 | 2021-06-11 | R3通信有限公司 | Communication system |
| CN106028455A (en) * | 2016-07-04 | 2016-10-12 | 宁波大学 | DF protocol based resource allocation method for two-way relay cognitive radio system |
| CN106028455B (en) * | 2016-07-04 | 2019-08-20 | 宁波大学 | Resource allocation methods in bi-directional relaying cognitive radio system based on DF agreement |
| CN107579789A (en) * | 2017-07-21 | 2018-01-12 | 南京航空航天大学 | Extensive unmanned plane junction network channel simulation device and GPU real-time emulation methods |
| CN107579789B (en) * | 2017-07-21 | 2020-04-24 | 南京航空航天大学 | Large-scale unmanned aerial vehicle relay network channel simulation device and GPU real-time simulation method |
| CN108039905A (en) * | 2017-12-20 | 2018-05-15 | 中国信息通信研究院 | The system of selection of bidirectional relay system duplex mode and device based on decoding forwarding |
| CN108039905B (en) * | 2017-12-20 | 2019-12-13 | 中国信息通信研究院 | Method and device for selecting duplex mode of bidirectional relay system based on decoding forwarding |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101977103A (en) | Implementation method of equivalent full duplex in bidirectional relay network | |
| US11757604B2 (en) | Distributed collaborative signaling in full duplex wireless transceivers | |
| Xie et al. | Multisource, multidestination, multirelay wireless networks | |
| JP2008104184A (en) | Cooperative diversity communication method applied to multi-hop communication system | |
| US20080107044A1 (en) | Methods and apparatus for network communication via barrage relay onto an independent medium allocation | |
| WO2009107314A1 (en) | Multi-hop wireless communication system | |
| Zhang et al. | On relay assignment in network-coded cooperative systems | |
| EP2353325B1 (en) | Method to increase network capacity for wireless mesh network | |
| CN104202790B (en) | A kind of MIMO-CCRN bottleneck effect removing methods based on power adaptive | |
| JP4857219B2 (en) | Radio communication system and relay radio apparatus | |
| Chen et al. | Link-layer-and-above diversity in multihop wireless networks | |
| Umehara et al. | Performance analysis of slotted ALOHA and network coding for single-relay multi-user wireless networks | |
| CN101656560B (en) | Collaboration communication method of high-efficiency frequency spectrum utilization ratio | |
| Chan et al. | Interference alignment with physical-layer network coding in MIMO relay channels | |
| Sheng et al. | Energy efficient cooperative wireless communication and networks | |
| Brulatout et al. | A cooperative MAC protocol for lossy forwarding networks | |
| KR20110049035A (en) | Low complexity network coding method and apparatus in multi-hop multi-user wireless network | |
| Kim | Throughput and delay performance with a cooperative retransmission scheme using distributed beamforming | |
| Berder et al. | Non-regenerative full distributed space-time codes in cooperative relaying networks | |
| Sahu et al. | M-PNC: Multi-hop physical layer network coding for shared paths in vehicular networks | |
| Kim et al. | A technique to exploit cooperation for packet retransmission in wireless ad hoc networks | |
| Akhlaghi et al. | Power allocation strategies in block-fading two-way relay networks | |
| Jain et al. | An implementation of Automatic Repeat reQuest (ARQ) mechanism in cooperative wireless networks using max-ratio relay selection | |
| Hoseyni | ROUTING IN MIMO WIRELESS X NETWORKS USING ALTERNATE RELAYING AND SIGNAL ALIGNMENT | |
| Duy et al. | A skipped-hop transmission protocol using cooperative communication |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110216 |