CN101977103A - Implementation method of equivalent full duplex in bidirectional relay network - Google Patents

Implementation method of equivalent full duplex in bidirectional relay network Download PDF

Info

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
node
group
time slot
data
via node
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
Application number
CN2010105281681A
Other languages
Chinese (zh)
Inventor
杨波
于宏毅
李鸥
张效义
王晓梅
冯强
刘广怡
刘洋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
PLA Information Engineering University
Original Assignee
PLA Information Engineering University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by PLA Information Engineering University filed Critical PLA Information Engineering University
Priority to CN2010105281681A priority Critical patent/CN101977103A/en
Publication of CN101977103A publication Critical patent/CN101977103A/en
Pending legal-status Critical Current

Links

Images

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

Equivalent full duplex implementation method in a kind of two-way junction network
Technical field
The present invention relates to broad sense collaboration communication technical field, equivalent full duplex implementation method and device in particularly a kind of two-way junction network.
Background technology
In multipoint cooperative communication, the half-duplex mode of operation of the time division multiplexing of multi-hop communication, two-way channel and node is the three big leading factor that cause two-way trunk channel spectrum efficiency lower.The existing method that promotes two-way trunk channel spectrum efficiency comprises:
(1) via node is handled bi-directional data (after promptly deciphering bi-directional data respectively, adopting the network code mode) simultaneously purely in decoding-forwarding (DF) mode;
(2) via node adopts the denoising mapping mode to handle bi-directional data (being physical-layer network coding);
(3) via node is handled bi-directional data (the two-way throughput of promptly amplifying pass-through mode strengthens relaying) simultaneously in amplification-forwarding (AF) mode.
Though existing method can be to a certain extent, promote the spectrum efficiency of two-way trunk channel, but the loss of the system spectral efficiency of only can compensate for bidirectional channel time division multiplexing and causing, under the wireless both-way trunk channel model of node semiduplex mode, use above-mentioned three methods and can not accomplish that still each time slot of destination node all receives information, therefore, two-way trunk channel spectrum efficiency is still lower, also has very big room for promotion.
Summary of the invention
The invention provides equivalent full duplex implementation method in a kind of two-way junction network, destination node can all be received information at each time slot after preparing timeslot number, promotes spectrum efficiency to greatest extent.
The invention provides equivalent full duplex implementation method in a kind of two-way junction network, first group node (the S1 that the space exists is set, D1) and the second group node (S2, D2), described node S1 and node S2 are in transmit status all the time, described node D1 and node D2 are in accepting state all the time, and described node S1 does not all have tie link between node D1 to node D2, node S2, the described first group node (S1, D1) and second group node (S2 realizes information interaction by at least one group of via node between D2); Described method also comprises:
At the first time slot that sends data, described node S1 and node S2 send data, and the node in the relaying group is in accepting state; The via node that is in accepting state is finished the physical-layer network coding operation;
From sending second time slot of data, send the time slot of data at each, from the via node that is in accepting state, select a via node as sending node, all the other nodes in the relaying group are in accepting state; The via node that is in accepting state is finished the physical-layer network coding operation;
From preparing timeslot number, send data slot at each, in the via node that participates in assisting, only there is a via node to be in transmit status all the time, all the other all are in accepting state.
Wherein, described preparation timeslot number is according to the jumping figure decision at interval between described first group node and second group node.
Wherein, described preparation timeslot number specifically comprises according at interval jumping figure decision between described first group node and second group node: described preparation timeslot number equals to communicate by letter and initiates jumping figure between described first group node in back and second group node.
Wherein, all are in and select the via node of an optimum to transfer transmit status in the via node of accepting state from a last time slot according to the optimal route selection algorithm.
Wherein, each time slot actual transmissions model has a plurality of, and concrete number is every group of via node number that participates in forwarding.
Wherein, described node S1 and the every time slot of node S2 all send a new packet; Perhaps, every time slot sends the network code data, and these network code data are new packet and the network code data of receiving packet.
Wherein, the data that via node sent that are in transmit status are flow through data behind the network code of bi-directional data.
The application embodiment of the invention by relaying cooperation efficiently, makes that the via node of each jumping participation cooperation only has one all the time and is in transmit status from preparing timeslot number, and all the other are accepting state.The embodiment of the invention is utilized the alternately transmitting-receiving between via node, can realize the two-way junction network of equivalent full duplex, promotes network resource utilization, promotes spectrum efficiency to greatest extent.
Description of drawings
In order to be illustrated more clearly in the technical scheme in the embodiment of the invention, to do to introduce simply to the accompanying drawing of required use among the embodiment below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is an equivalent full duplex implementation method flow chart in the two-way junction network of a kind of double bounce according to the embodiment of the invention;
Fig. 2 be between first and second group node that exists according to the space of the embodiment of the invention be 2 jump, to jump via node number be 3 o'clock realization schematic diagram for each;
Fig. 3 is based on the schematic diagram that i road signal is carried out the PNC operation embodiment illustrated in fig. 2;
Fig. 4 is based on all possible system model of preceding two time slots embodiment illustrated in fig. 2;
Fig. 5 be between first and second group node that exists according to the space of the embodiment of the invention be 3 jump, to jump via node number be 2 o'clock realization schematic diagram for each;
Fig. 6 be between first and second group node that exists according to the space of the embodiment of the invention be 4 jump, to jump via node number be 3 o'clock realization schematic diagram for each;
Fig. 7 be between first and second group node that exists according to the space of the embodiment of the invention be 5 jump, to jump via node number be 3 o'clock realization schematic diagram for each.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
In embodiments of the present invention, a plurality of half-duplex nodes are in mutual cooperating relay process, utilize physical-layer network coding to handle on the basis of multichannel data, by alternately transmitting-receiving and of time-division based on " optimum " Path selection of channel condition information, can realize the resource utilization of the two-way junction network of equivalent full duplex, effectively promote the spectrum efficiency of two-way trunk channel.
Referring to Fig. 1, it is an equivalent full duplex implementation method flow chart in the two-way junction network of a kind of double bounce according to the embodiment of the invention, in the present embodiment, first group node (the S1 that the space exists is set, D1) and the second group node (S2, D2), node S1 and node S2 are in transmit status all the time, node D1 and node D2 are in accepting state all the time, and node S1 is to node D2, node S2 does not all have tie link between node D1, that is to say, the described first group node (S1, D1) and second group node (S2 realizes information interaction by at least one group of via node (each jump used via node be called a group) between D2); Node S1 and D1, S2 and D2 close together that is to say, node S1 and D1, S2 and D2 can realize data sharing as there being tie link by certain mode; This method also comprises:
Step 101, at the first time slot that sends data, node S1 and node S2 send data, and the node in the relaying group is in accepting state; The via node that is in accepting state is finished the physical-layer network coding operation;
Step 102 from sending second time slot of data, sends the time slot of data at each, selects a via node as sending node from the via node that is in accepting state, and all the other nodes in the relaying group are in accepting state; The via node that is in accepting state is finished the physical-layer network coding operation;
Step 103 from preparing timeslot number, sends data slot at each, in the via node that participates in assisting, only has a via node to be in transmit status all the time, and all the other all are in accepting state.
Above-mentioned preparation timeslot number is according to the jumping figure decision at interval between described first group node and second group node; Concrete, prepare timeslot number and equal to communicate by letter and initiate jumping figure between described first group node in back and second group node.For example, if be 2 jumpings between first group node and second group node, then preparing timeslot number is 2, if be 3 jumpings between first group node and second group node, then preparing timeslot number is 3.
Need to prove that all are in and select the via node of an optimum to transfer transmit status in the via node of accepting state from a last time slot according to the optimal route selection algorithm.
Need to prove that each time slot actual transmissions model has a plurality of, concrete number is every group of via node number that participates in forwarding.
Need to prove that node S1 and node S2 both can all send a new packet by every time slot; Also can be that every time slot sends the network code data that comprise new packet.
Need to prove that " via node at " center " place crosses bidirectional traffic relatively, continues relaying behind the network code and transmits being positioned at network; (annotate: since two end nodes between at interval under the situation of odd number of hops, do not have the via node that is positioned at absolute center, adopt therefore that " " center " is represented the position that bi-directional data crosses and takes place relatively.Therefore, the data that via node sent that are in transmit status are flow through data behind the network code of bi-directional data.
The application embodiment of the invention by relaying cooperation efficiently, makes that the via node of each jumping participation cooperation only has one all the time and is in transmit status from preparing timeslot number, and all the other are accepting state.The embodiment of the invention is utilized the alternately transmitting-receiving between via node, can realize the two-way junction network of equivalent full duplex, promotes network resource utilization, promotes spectrum efficiency to greatest extent.
Be example with the 2-5 jumping below, the present invention is elaborated again.
Referring to Fig. 2, it is to be 2 realization schematic diagrames when jumping between first and second group node that exists according to the space of the embodiment of the invention.
(1) at the first time slot that sends data, all via nodes receive the bi-directional data from two source node S 1 and S2 simultaneously, and according to suitable demodulation mapping ruler such as MAP mapping ruler, realize physical-layer network coding (PNC, the Physical-Layer Network Coding) operation of two paths of signals; At this moment, the node in the relaying group all is in accepting state;
(2) since the 2nd time slot, the via node that is in accepting state is received from the stack of two source nodes with 3 road signals of the via node that is in transmit status, and is finished the PNC operation of 3 road signals; And, all are in the via node of selecting its " optimum " the via node of accepting state and transfer transmit status to from a last time slot according to " optimum " routing algorithm for each time slot, and up-to-date " coding " information that receives sent out to next redirect, the via node that is in transmit status transfers accepting state at time slot subsequently.
When relaying interstitial content n=3, the specific implementation process is as follows:
Consider the quasistatic fading channel, all nodes all are operated in the half-duplex state.The packet that j time slot of source node S 1 and S2 sends is
Figure BDA0000030479630000051
Wherein,
Figure BDA0000030479630000052
The expression source node i adds computing at the mould 2 of j time slot and j-1 time slot transmission data.
Since the 2nd time slot, the via node that is in accepting state is received from two source node S 1 and S2 and the stack of 3 road signals that is in the via node of transmit status, and is finished the PNC operation of 3 road signals.Be in the via node R of accepting state mReceived signal be:
y R m = P ∂ S 1 R m x S 1 + P ∂ S 2 R m x S 2 + P ∂ R t R m x R t + z R m
Wherein P is the node transmitting power, x vThe unit power modulation symbol of expression node v, v ∈ { S 1, S 2, R t, t ∈ 1,2,3};
Figure BDA0000030479630000054
Be via node R mThe additive white Gaussian noise at place, average is 0, variance is N 0/ 2, N 0The expression noise power.
Figure BDA0000030479630000055
The decline feature of expression channel, obeying average is 0, variance is σ 2Rayleigh distributed.
In the forwarding stage, all are in the via node of selecting its " optimum " the via node of accepting state and transfer transmit status to from a last time slot according to " optimum " routing algorithm, and with up-to-date " coding " information that receives
Figure BDA0000030479630000061
Send out to next redirect, the via node that is in transmit status transfers accepting state to, the follow-up data that receive again at time slot subsequently.
" optimum " routing criterion h is specially:
h = max i ∈ ( 2 , n ) { min { | ∂ S 1 R i | 2 , | ∂ S 2 , R i | 2 , | ∂ R 1 R i | 2 , | ∂ R i D 1 | 2 , | ∂ R i D 2 | 2 } }
Wherein, n is the number of via node, and all the other alphabetical implications as hereinbefore.
Need to prove, because the broadcast characteristic of wireless channel, be positioned at source node S 1 and S2 communication range and be in the node of accepting state that all can receive the information of source node S 1 and S2 transmission, relatively, the node that is in transmit status can not receive information.Need send data to which relaying because of node S1 and S2 needn't know, and only need directly transmission to get final product.
Referring to Fig. 3, it is based on the schematic diagram that i road signal is carried out the PNC operation embodiment illustrated in fig. 2.
Common PNC mapping process is considered the physical-layer network coding mapping process that i node participates in as shown in Figure 3, and definition M represents numeric character set, and m is arranged j∈ M (j=1 ..., i) and Subsequently, definition E represents electromagnetism wave zone (PNC territory) modulation symbol collection.Each m j∈ M (j=1 ..., i) all can shine upon corresponding modulation symbol e j∈ E (j=1 ..., i), definition f:M → E represents to modulate mapping function, promptly
Figure BDA0000030479630000064
At the electromagnetism wave zone, the stack of a plurality of modulation symbols space has e 1+ e 2+ ...+e i=e ' k∈ E ', wherein E ' is the set that is different from E and has higher gesture.Each stack symbol e ' that via node receives k∈ E ' must be according to the corresponding demodulation symbol m of certain rule mapping k∈ M, the definition h:E ' → M represent the demodulation mapping function, promptly h (e ' k)=m kIt should be noted that f:M → E is man-to-man mapping relations, and h:E ' → M is many-to-one mapping relations.
Referring to Fig. 4, it is based on all possible system model of preceding two time slots embodiment illustrated in fig. 2.
Fig. 4 (a) is the system model of first time slot, owing to introduced the thought of " optimum " Path selection, since the 2nd time slot, the via node that is in transmit status is decided at random according to channel status, promptly go up the via node that a time slot is in accepting state and all might transfer transmit status at this time slot, Fig. 4 (b) (c) (d) has provided the 2nd time slot, all possible system model.Obviously, since the 2nd time slot, all possible system model number of this method depends on the number of the via node that participates in forwarding, and actual transmission course n selects one.
Referring to Fig. 5, its be between first and second group node that exists according to the space of the embodiment of the invention be 3 jump, to jump via node number be 2 o'clock realization schematic diagram for each.
For 3 jumping links, the difference according to source node transmission data has exemplified 2 kinds of situations again.The left side is that 2 each time slots of source node all send new packet; What the right side was that each time slot of source node sends is new packet and the network code data of having received packet.Here just exemplified wherein 2 kinds of situations, the data mode for source node sends can also have other selections.
Each time slot is described:
Time slot 1: source node S 1 and S2 send data; Relaying group 1 is the R among Fig. 5 11Node and relaying group 2 are the R among Fig. 5 31Node is in accepting state, the data that reception sources node S1 and S2 send;
Time slot 2: source node is consistent with the operation of time slot 1, and just the concrete data content that sends is different; Relaying group 1 and relaying group 2 are selected one as sending node from this group via node, the data that receive in the time slot 1 are sent; Other via nodes keep receive status, reception be the data that sending node sends in sending node in adjacent source node, this relaying group, the contiguous relaying group.
Particularly, source node S 1 and S2 send data and still send data, and just the concrete data content that sends is different, the via node R in the relaying group 1 11With the via node R in the relaying group 2 31As sending node, the data that receive in the time slot 1 are sent other via nodes such as R 13And R 33Be in receive status, for via node such as R 13Its reception be source node S 1, via node R 11With via node R 31The data that send; For via node such as R 33Its reception be source node S 2, via node R 31With via node R 11The data that send.
Time slot 3: the source node operation is similar with time slot 2; For relaying group 1 and relaying group 2, the node that a last time slot is in transmit status transfers accepting state to, and, from last time slot, be in and select one in the accepting state node as sending node, send the data that a last time slot receives; From this time slot, each time slot two ends destination node all can be received a frame new data of corresponding source node.
Time slot 4: two pairs of nodes of this time slot to ((S1, D1), the operation and the time slot 3 of (S2, D2)), via node group interior nodes be similar.The different just concrete data content differences of transmission.
Time slot 5: two pairs of nodes of this time slot to ((S1, D1), the operation and the time slot 4 of (S2, D2)), via node group interior nodes be similar.The different just concrete data content differences of transmission.
Referring to Fig. 6, its be between first and second group node that exists according to the space of the embodiment of the invention be 4 jump, to jump via node number be 3 o'clock realization schematic diagram for each.
For 4 jumping links, the difference according to source node transmission data has exemplified 2 kinds of situations again.The left side is that 2 each time slots of source node all send new packet; What the right side was that each time slot of source node sends is new packet and the network code data of having received packet.Here just exemplified wherein 2 kinds of situations, the data mode for source node sends can also have other selections.
Each time slot is described:
Time slot 1: the via node of relaying group 1 and relaying group 3 all is in accepting state, receives the data that the adjacent source node sends;
Time slot 2: select a node as sending node in relaying group 1 and the relaying group 3 respectively, the data that receive in the last time slot are sent, other via nodes in this relaying group 1 and the relaying group 3 are as receiving node.For example, select via node R respectively in relaying group 1 and the relaying group 3 11With via node R 33As sending node, the via node R in the relaying group 1 12With via node R 13Continuation is as receiving node, the via node R in the relaying group 3 32With via node R 31Continuation is as receiving node
At this moment, all nodes are in accepting state in the relaying group 2, receive the data that sending node sends in relaying group 1 and the relaying group 3.
Time slot 3: select one to send the data that a last time slot receives as sending node in the relaying group 2, other nodes are in accepting state.In relaying group 1 and the relaying group 3: the node that a last time slot is in transmit status transfers accepting state to, receives the data that this group sending node, adjacent source node and relaying group 2 send; A last time slot is in selects one as sending node in the node of accepting state.
For example, select via node R in the relaying group 2 22As sending node, the via node R in the relaying group 2 21With via node R 23Continuation is as receiving node; A last time slot is as the via node R of sending node in relaying group 1 and the relaying group 3 11With via node R 33Transfer accepting state to, be in from a last time slot and select via node R the node of accepting state 13With via node R 31As sending node, at this moment, for the via node R in the relaying group 1 11With via node R 12Difference reception sources node S1, via node R 13With the via node R in the relaying group 2 22The data that send; For the via node R in the relaying group 3 32With via node R 33Difference reception sources node S2, via node R 31With the via node R in the relaying group 2 22The data that send.
Time slot 4: from this time slot, each time slot two ends destination node all can be received a frame new data of corresponding source node.A same time slot of the working method of node is similar in each relaying group.
Time slot 5: two pairs of nodes of this time slot to ((S1, D1), the operation and the time slot 4 of (S2, D2)), via node group interior nodes be similar.The different just concrete data content differences of transmission.
Referring to Fig. 7, its be between first and second group node that exists according to the space of the embodiment of the invention be 5 jump, to jump via node number be 3 o'clock realization schematic diagram for each.Only enumerated each time slot of source node in the present embodiment and all sent new packet situation, be appreciated that what send for each time slot of source node is that new packet is equally applicable in present embodiment with the situation of having received the network code data of packet.
For 5 link condition, similar with 4 links.Just since the 5th time slot, each time slot two ends destination node all can be received a frame new data of corresponding source node.
As seen, no matter be that 2 jumpings, 3 are jumped, links, its working method basically identical are jumped in 4 jumpings or 5.Different 2 points that mainly contain:
The one,, the two ends destination node is received the preparation number of time slots difference of the new data of corresponding source node;
The 2nd: owing to participate in the relaying group number difference of cooperation, therefore, the time slot that the relaying group of diverse location participates in cooperation also is not quite similar.But, in case after participating in, its basic pattern is exactly, from the node that is in accepting state, select one as sending node according to certain rule, send the data that a last time slot is received; Other are in accepting state.At ensuing time slot, the node that is in transmit status enters accepting state again, and a last time slot is in the node of accepting state and selects one again as sending node, so hockets.
In sum, behind definite communication link jumping figure, according to following the 4th description, the source node that the bidirectional traffic effect of each node relaying with due regard to, selection can be simplified regeneration node data combination complexity as far as possible sends data type.
1. " via node at " center " place crosses bidirectional traffic relatively, continues relaying behind the network code and transmits being positioned at network; (annotate: since two end nodes between at interval under the situation of odd number of hops, do not have the via node that is positioned at absolute center, adopt therefore that " " center " is represented the position that bi-directional data crosses and takes place relatively.) therefore, the data that via node sent that are in transmit status are flow through data behind the network code of bi-directional data.
2. since the 2nd time slot, only have one all the time in every group of (every jumping) via node that participates in cooperating and be in emission state, all the other all are in accepting state.All are in the via node of accepting state and choose according to qualifications the via node that is in emission state from a last time slot according to the optimal route selection algorithm, each time slot actual transmissions process has a plurality of, possible mode numbers to depend on every group of number n that participates in the via node of forwarding equally;
3. prepare timeslot number depend on two end nodes between at interval jumping figure, promptly; After communication is initiated, experience and two end nodes between behind the time slot of jumping figure equivalent, each time slot all can be realized the two-way interactive of a data grouping of corresponding source node separately subsequently;
4. owing to the packet of node S1 and each time slot transmission of S2, all by bi-directional, therefore, transmission information can change with the content and the transmission jump number of S1 and S2 transmission data between interior interfere information of via node group and group in each redirect is subsequently sent out.That is, when two end nodes between after at interval jumping figure determines, can send data packet content by adjusting the two ends source node, for example under 2 situations of jumping after the 2nd time slot, source node i can be adjusted in the data that time slot j arbitrarily sends
Figure BDA0000030479630000101
By the information content on the suitable Adjustment System transmission link, with offset to greatest extent in the via node group disturb and group between the garbage stack of reverse transfer; For example under 2 situations of jumping by above-mentioned adjustment, be can offset disturb in the via node group and group between the garbage of reverse transfer superpose;
5. the packet of each time slot transmission of node S1 and S2 is comprising on the basis of new data packet, can be new packet and the network code data of having received packet.
The embodiment of the invention is taken all factors into consideration the lower origin cause of formation of two-way trunk channel spectrum efficiency, utilize the cooperation transmission between the via node, promoted the spectrum efficiency of two-way trunk channel to greatest extent, and the increase of transmitting jumping figure with relaying, its performance advantage is remarkable further.
Need to prove, in this article, relational terms such as first and second grades only is used for an entity or operation are made a distinction with another entity or operation, and not necessarily requires or hint and have the relation of any this reality or in proper order between these entities or the operation.And, term " comprises ", " comprising " or its any other variant are intended to contain comprising of nonexcludability, thereby make and comprise that process, method, article or the equipment of a series of key elements not only comprise those key elements, but also comprise other key elements of clearly not listing, or also be included as this process, method, article or equipment intrinsic key element.Do not having under the situation of more restrictions, the key element that limits by statement " comprising ... ", and be not precluded within process, method, article or the equipment that comprises described key element and also have other identical element.
One of ordinary skill in the art will appreciate that all or part of step that realizes in the said method execution mode is to instruct relevant hardware to finish by program, described program can be stored in the computer read/write memory medium, here the alleged storage medium that gets, as: ROM/RAM, magnetic disc, CD etc.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.All any modifications of being done within the spirit and principles in the present invention, be equal to replacement, improvement etc., all be included in protection scope of the present invention.

Claims (7)

1. equivalent full duplex implementation method in the two-way junction network, it is characterized in that, first group node (the S1 that the space exists is set, D1) and the second group node (S2, D2), described node S1 and node S2 are in transmit status all the time, described node D1 and node D2 are in accepting state all the time, and described node S1 does not all have tie link between node D1 to node D2, node S2, the described first group node (S1, D1) and second group node (S2 realizes information interaction by at least one group of via node between D2); Described method also comprises:
At the first time slot that sends data, described node S1 and node S2 send data, and the node in the relaying group is in accepting state; The via node that is in accepting state is finished the physical-layer network coding operation;
From sending second time slot of data, send the time slot of data at each, from the via node that is in accepting state, select a via node as sending node, all the other nodes in the relaying group are in accepting state; The via node that is in accepting state is finished the physical-layer network coding operation;
From preparing timeslot number, send data slot at each, in the via node that participates in assisting, only there is a via node to be in transmit status all the time, all the other all are in accepting state.
2. method according to claim 1 is characterized in that, described preparation timeslot number is according to the jumping figure decision at interval between described first group node and second group node.
3. method according to claim 1, it is characterized in that described preparation timeslot number specifically comprises according at interval jumping figure decision between described first group node and second group node: described preparation timeslot number equals to communicate by letter and initiates jumping figure between described first group node in back and second group node.
4. method according to claim 1 is characterized in that, all are in and select the via node of an optimum to transfer transmit status in the via node of accepting state from a last time slot according to the optimal route selection algorithm.
5. method according to claim 4 is characterized in that, each time slot actual transmissions model has a plurality of, and concrete number is every group of via node number that participates in forwarding.
6. method according to claim 1 is characterized in that, described node S1 and the every time slot of node S2 all send a new packet; Perhaps, every time slot sends the network code data, and these network code data are new packet and the network code data of receiving packet.
7. method according to claim 1 is characterized in that, the data that via node sent that are in transmit status are flow through data behind the network code of bi-directional data.
CN2010105281681A 2010-11-01 2010-11-01 Implementation method of equivalent full duplex in bidirectional relay network Pending CN101977103A (en)

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)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN85107963A (en) * 1984-12-06 1986-07-09 莫托罗拉公司 Duplex interconnect/dispatch trunked radio system

Patent Citations (1)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
吕凌，于宏毅: "物理层网络编码分组的机会中继", 《电子与信息学报》 *
杨波,于宏毅,冯强: "等效全双工双向中继网络及其可达速率分析", 《信息工程大学学报》 *

Cited By (23)

* Cited by examiner, † Cited by third party
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
CN102438235B (en) Method for selecting optimal distributed type interference source in mobile collaborative network
CN1918858B (en) Cost determination in a multihop network
CN101702830B (en) Method for transmitting network coding user collaborative matching in wireless relay system
CN103067127B (en) Distributed decoding under asymmetric speed forwards bi-directional relaying system of selection
CN102790639A (en) Cooperative communication method based on double relays and differential evolution
CN1996785A (en) Forwarding system and its method for the broadband wireless access
CN102845030A (en) A method of communication
CN102932866A (en) Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network
CN102546025B (en) Optimal distribution method for optical network units in optical fiber wireless hybrid access network
CN101562863A (en) Method and device for relay selection
CN103096413A (en) Multi-interface multi-hop wireless network lower-distribution type cooperation route method
CN105119858A (en) Interference avoiding method based on constellation rotation in collaborative D2D transmission system
CN102300234B (en) Novel multi-hop routing transmission method
CN105430709A (en) Relay selection and power distribution method in multisource and multi-objective wireless network
Vaze et al. To code or not to code in multi-hop relay channels
CN104507136A (en) Relay node selection method
CN106912059A (en) Support the cognitive junction network joint relay selection and resource allocation methods of mutual information accumulation
CN104994555B (en) A kind of low complex degree relay selection method in vehicle-carrying communication network
CN101925150B (en) Method for distributing subcarrier and route and equipment
CN102377523B (en) Network coding method of time division duplex (TDD) wireless relay cellular network and communication method
CN102186220A (en) Communication method of wireless cooperative relay network
Ding et al. The throughput optimization for wireless sensor networks adopting interference alignment and successive interference cancellation
Wu et al. Physical layer network coding based on dual relay selection in two-way relay channel
Bhattacharya et al. Multi-path routing in cognitive radio networks for multimedia communication using sample division multiplexing

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