CN102237978A - Collaborative link establishment and maintenance method and related device - Google Patents
Collaborative link establishment and maintenance method and related device Download PDFInfo
- Publication number
- CN102237978A CN102237978A CN2010101626423A CN201010162642A CN102237978A CN 102237978 A CN102237978 A CN 102237978A CN 2010101626423 A CN2010101626423 A CN 2010101626423A CN 201010162642 A CN201010162642 A CN 201010162642A CN 102237978 A CN102237978 A CN 102237978A
- Authority
- CN
- China
- Prior art keywords
- node
- cooperative node
- time
- cooperative
- channel
- 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.)
- Granted
Links
Images
Abstract
The invention relates to a collaborative link establishment method which comprises the following steps: receiving and trying to decode a rateless-coded communication request message m1 which is broadcast by a source node, recording time T[1D] of an acknowledgement message which is broadcast after properly decoding m1, and recording time T[1i] of a communication request response message which is broadcast after monitoring that the potential collaborative node properly decodes m1;Broadcasting a rateless-coded communication permission message m2, recording time T[2s] of a communication permission response message which is broadcast after monitoring that the source node properly decodes m2, and recording time T[2i] of the communication permission response message which is broadcast after monitoring that the potential collaborative node properly decodes m2; and computing the optimal collaborative node according to T[1D], T[2s], and T[1i] and T[2i] of each potential collaborative node, and informing the source node and the optimal collaborative node to establish a collaborative link. The invention also provides a collaborative link maintenance method and a related device. The invention effectively discovers the hidden collaborative node, and enhances the communication reliability and system performance.
Description
Technical field
The present invention relates to communication technical field, relate in particular to a kind of foundation and maintaining method and relevant device of synergistic link.
Background technology
In the sensing network of frequency spectrum share, the receiving-transmitting sides of subsystem is not owing to there is predefined usable frequency, so its communication link must dynamically be set up.But because the channel condition information of the receiving-transmitting sides of subsystem is not exclusively relevant and both sides are uncertain of mutually, so communication link is difficult to set up.Traditional solution is, for subsystem is provided with a common signal channel, this common signal channel is not taken by main system in advance, and the receiving-transmitting sides of subsystem is set up communication link by information transmitted on the common signal channel.There are some problems in said method on practicality, reach how to set this common signal channel etc. as whether there is a common signal channel that is not taken by main system on frequency spectrum resource.In order to solve the problem of utilizing common signal channel to set up the subsystem communication link, need new method to make spectrum activity at main system or subsystem have also to realize under the not exclusively relevant and situation about being uncertain of mutually of the channel condition information of dynamic burst, receiving-transmitting sides adaptive communication link to set up and communicate by letter, thereby can support dynamic spectrum shared reliably, effectively.
In the prior art, a kind of communication link method for building up based on no-rate codes is: the availability of source node perception different channels, and on the available channel of perception after destination node sends message based on no-rate codes, at the needed feedback information of intercepting destination node in the time slot of replying of no-rate codes; Destination node is by the availability of perception different channels, informs that by feedback information which channel of source node can use, and promptly destination node can be intercepted the message based on no-rate codes that source node sends on which channel; Thereby realize " collection of illustrative plates exchange " between destination node and the source node, promptly realize the foundation of the communication link between destination node and the source node.
The inventor finds that in practice said method is only considered the scene of direct communication between source node and the destination node, and communication reliability and systematic function are not very high.
Summary of the invention
Embodiment of the invention technical problem to be solved provides a kind of foundation and maintaining method and relevant device of synergistic link, can effectively find the cooperative node hidden, thereby promotes communication reliability and systematic function.
In order to solve the problems of the technologies described above, the embodiment of the invention provides following technical scheme:
A kind of method for building up of synergistic link comprises:
Receive and attempt the request communication information m1 behind no rate coding of decoding source node broadcasting, write down the time T that is correctly decoded the acknowledge message ACK1_D that goes on the air behind the described request communication information m1
1D, and record listens to the time T that potential cooperative node is correctly decoded the request communication response ACK1_Ri that broadcasts behind the described request communication information m1 on every side
1i
Broadcasting is through the allowance communication information m2 of no rate coding, and record listens to the time T that described source node is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the described allowance communication information m2
2sAnd record listens to the time T that potential cooperative node is correctly decoded the allowance communication response message ACK2_Ri that broadcasts behind the described allowance communication information m2 on every side
2i
According to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculate optimum cooperative node, and notify described source node and optimum cooperative node to set up synergistic link.
A kind of node device comprises:
First processing module, the request communication information m1 behind no rate coding of the source node broadcasting that is used to receive and attempt to decode writes down the time T that is correctly decoded the acknowledge message ACK1_D that goes on the air behind the described request communication information m1
1D, and record listens to the time T that potential cooperative node is correctly decoded the request communication response ACK1_Ri that broadcasts behind the described request communication information m1 on every side
1i
Second processing module, be used for after described first processing module is broadcasted described acknowledge message ACK1_D, broadcasting is through the allowance communication information m2 of no rate coding, and record listens to the time T that described source node is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the described allowance communication information m2
2sAnd record listens to the time T that potential cooperative node is correctly decoded the allowance communication response message ACK2_Ri that broadcasts behind the described allowance communication information m2 on every side
2i
The 3rd processing module is used for according to described T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculate optimum cooperative node;
Manages module everywhere, is used for notifying described source node and optimum cooperative node to set up synergistic link the optimum cooperative node that described the 3rd processing module calculates.
A kind of maintaining method of synergistic link comprises source node, cooperative node and destination node, and wherein, described cooperative node is that the method for building up by above-mentioned synergistic link calculates:
Whether each self-channel of perception is available respectively in perception stage for described source node, cooperative node and destination node, if, then can be with identifying at channel operational phase initial stage transmitting channel;
Described cooperative node, does not have rate coding again and sends to described destination node after the no rate coding bag that the described source node that then will receive sends is correctly decoded if receiving the channel that described destination node sends can use when identifying.
A kind of node device comprises:
Sensing module, be used at the perception stage channel perception whether available, if, then channel operational phase initial stage transmitting channel can with the sign;
Control module is used for when receiving that channel that described destination node sends can be with sign, after the no rate coding bag decoding that the source node that receives is sent, does not have rate coding again and sends to described destination node.
A kind of maintenance system of synergistic link comprises source node, cooperative node and destination node, and described cooperative node is that the method for building up by above-mentioned synergistic link calculates:
Wherein, source node, cooperative node and destination node, whether available at each self-channel of perception stage perception respectively, if then sending each self-channel at the channel operational phase initial stage respectively can be with identifying;
Described source node when the channel of receiving described cooperative node transmission can be used sign, will not have the rate coding bag and will send to described cooperative node;
Described cooperative node when receiving that channel that described destination node sends can be with sign, after the no rate coding bag decoding that the source node that receives is sent, does not have rate coding again and sends to described destination node.
Compared with prior art, the embodiment of the invention has following beneficial effect:
In the embodiment of the invention, the destination node record listens to the time T that potential cooperative node is correctly decoded the request communication response message ACK1_Ri that broadcasts behind the request communication information m1 on every side
1i, write down the time T that it is correctly decoded the acknowledge message ACK1_D that goes on the air behind the request communication information m1
1D, record listens to the time T that source node is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the allowance communication information m2
2s, and record listens to the time T that potential cooperative node is correctly decoded the allowance communication response message ACK2_Ri that broadcasts behind the allowance communication information m2 on every side
2iAccording to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculate optimum cooperative node and notification source node and optimum cooperative node to set up synergistic link.Like this, the cooperative node hidden be can effectively find, thereby communication reliability and systematic function promoted.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, 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.
The flow chart of the method for building up of a kind of synergistic link of providing in the embodiment of the invention is provided Fig. 1;
The request communication information m1 of Fig. 2 for providing respectively in the embodiment of the invention, permit communication information m2, request communication response message ACK1_Ri, acknowledge message ACK1_D, permit communication response message ACK2_Ri, ACK2_S and cooperative node are selected the frame structure schematic diagram of message ACK3_D;
The operational flowchart of source node in the synergistic link foundation that provides in the embodiment of the invention is provided Fig. 3;
The operational flowchart of potential node in the synergistic link foundation that provides in the embodiment of the invention is provided Fig. 4;
The operational flowchart of destination node in the synergistic link foundation that provides in the embodiment of the invention is provided Fig. 5;
The flow chart of optimum cooperative node is provided for the destination node that provides in the embodiment of the invention Fig. 6;
Fig. 7 is provided for the destination node that provides in the embodiment of the invention by the flow chart of optimum cooperative node;
The schematic diagram of a kind of cooperation transmission agreement of providing in the embodiment of the invention is provided Fig. 8 a;
The form schematic diagram of the transmission response ack_D, the ack_R that provide in the embodiment of the invention is provided Fig. 8 b;
Source node the flow chart in communication process of Fig. 9 for providing in the embodiment of the invention;
Optimum cooperative node the flow chart in communication process of Figure 10 for providing in the embodiment of the invention;
Destination node the flow chart in communication process of Figure 11 for providing in the embodiment of the invention;
The structure chart of a kind of node device of providing in the embodiment of the invention is provided Figure 12;
The structure chart of the another kind of node device that provides in the embodiment of the invention is provided Figure 13;
The structure chart of another node device of providing in the embodiment of the invention is provided Figure 14;
The flow chart of the maintaining method of a kind of synergistic link of providing in the embodiment of the invention is provided Figure 15 a;
The node that provides in the embodiment of the invention schematic diagram in the channel perception availability is provided Figure 15 b;
The structure chart of another node device of providing in the embodiment of the invention is provided Figure 16;
The structure chart of the maintenance system of a kind of synergistic link of providing in the embodiment of the invention is provided Figure 17.
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.
See also Fig. 1, the flow chart of the method for building up of a kind of synergistic link of providing in the embodiment of the invention is provided Fig. 1.As shown in Figure 1, this method can comprise:
101, destination node receives and attempts the request communication information m1 behind no rate coding of decoding source node broadcasting, and the record destination node is correctly decoded the time T of the acknowledge message ACK1_D that asks to go on the air behind the communication information m1
1D, and record listens to the time T that potential cooperative node is correctly decoded the request communication response ACK1_Ri that broadcasts behind the request communication information m1 on every side
1i
102, destination node is broadcasted the allowance communication information m2 through no rate coding, and record listens to the time T that source node is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the allowance communication information m2
2sAnd record listens to the time T that potential cooperative node is correctly decoded the allowance communication response message ACK2_Ri that broadcasts behind the allowance communication information m2 on every side
2i
103, destination node is according to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculate optimum cooperative node, and notify described source node and optimum cooperative node to set up synergistic link.
Wherein, destination node is according to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iAfter calculating optimum cooperative node, can select message ACK3_D notification source node and optimum cooperative node by cooperative node, thereby set up synergistic link.
In the embodiment of the invention, destination node is according to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculating optimum cooperative node is specifically as follows:
Destination node is with T
1DTime T with each potential cooperative node
1iCompare, and with T
2sTime T with each potential cooperative node
2iRelatively;
If the time T of each potential cooperative node
1iLess than T
1D, and time T
2iLess than T
2s, determine that then but this potential cooperative node is a cooperative node;
But calculate the time T of each cooperative node
1iWith T
2iAnd value, but will with the minimum cooperative node of value as optimum cooperative node.
In the embodiment of the invention, destination node is according to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculate optimum cooperative node specifically can also for:
Destination node is with T
1DTime T with each potential cooperative node
1iCompare, and with T
2sTime T with each potential cooperative node
2iRelatively;
If the time T of each potential cooperative node
1iLess than T
1D, and time T
2iLess than T
2s, determine that then but this potential cooperative node is a cooperative node;
According to formula
But from the cooperative node of determining, calculate optimum cooperative node, wherein, R
i *Represent optimum cooperative node.
Wherein, the derivation of above-mentioned formula is as follows:
The cooperation transmission of above-mentioned no rate coding can be divided into two transmit stages: in the phase I, the data through no rate coding of potential cooperative node and destination node reception sources node transmission are simultaneously carried out the accumulation of mutual information; At this stage end, potential cooperative node data that source node sends and the destination node data that source node sends of still failing to decode of successfully decoding, promptly destination node also is not accumulated to enough mutual informations source node information is correctly decoded.Transmission subsequently enters second stage, in this stage, potential cooperative node does not send to destination node after the source node information of successfully decoding in the phase I is had rate coding again, thereby this transmission last till always destination node can the mutual information of this accumulation in stage and the mutual information of first segment rank accumulation accumulate be correctly decoded source node information till, source node kept mourning in silence in this stage; At the second stage end, destination node sends response message and informs source node and potential cooperative node it correctly receives data, thereby finishes the transmission of data.
Suppose that source node is γ to the link signal to noise ratio of destination node
0, source node is γ to the link signal to noise ratio of cooperative node
1, cooperative node is γ to the link signal to noise ratio of destination node
2, be under the situation of a bit then in given volume of transmitted data, more than three needed channel access times of link transmission be respectively t
1D=a/c
0, t
1=a/c
1, and t
2=a/c
2C wherein
0=log
2(1+ γ
0), c
1=log
2(1+ γ
1), and c
2=log
2(1+ γ
2) represent the channel capacity of each link respectively.Suppose i the selected participation cooperation of potential cooperative node (being designated as Ri), and the needed channel access times of its decoding source node transmission data are t
I1, then when phase I Ri reception sources node data, destination node is also reception sources node data and trial decoding simultaneously, and the mutual information of destination node accumulation when Ri successfully decodes source node data is
Wherein destination node time of reception length is
Destination node need be I at the mutual information of second stage accumulation
Phase2=a-I
Phase1Send to destination node in second stage by the no-rate codes coding after Ri is correctly decoded source node information, destination node at this stage decoding required time is
Therefore destination node is finished decoding source node information required time and is
This shows, realize that maximum transmission rate is equal between source node and the destination node to select the Ri of an optimum to make t
d iValue is minimum, and promptly optimum cooperative node is
In the embodiment of the invention, the destination node record listens to the time T that potential cooperative node is correctly decoded the request communication response message ACK1_Ri that broadcasts behind the request communication information m1 on every side
1i, write down the time T that it is correctly decoded the acknowledge message ACK1_D that goes on the air behind the request communication information m1
1D, record listens to the time T that source node is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the allowance communication information m2
2s, and record listens to the time T that potential cooperative node is correctly decoded the allowance communication response message ACK2_Ri that broadcasts behind the allowance communication information m2 on every side
2iAccording to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculate optimum cooperative node and notification source node and optimum cooperative node to set up synergistic link.Like this, the cooperative node hidden be can effectively find, thereby communication reliability and systematic function promoted.
See also Fig. 2, shown in Figure 2 be respectively above-mentioned request communication information m1, permit communication information m2, request communication response message ACK1_Ri, acknowledge message ACK1_D permits communication response message ACK2_Ri, and ACK2_S and cooperative node are selected the frame structure schematic diagram of message ACK3_D.
As shown in Figure 2, in the frame structure of request communication information m1, comprise: targeting sequencing, request communication information no-rate codes bag and reply time slot, this request communication information no-rate codes bag comprises message identifier, source node sign, destination node sign, sign indicating number packet number, network settings parameter and traffic flow parameters again, and this is replied time slot and comprises a plurality of competing cycles.
Permit in the frame structure of communication information m2, comprise: targeting sequencing, permit communication information no-rate codes bag and reply time slot, this allowance communication information no-rate codes bag comprises message identifier, destination node sign, source node sign, sign indicating number packet number, network settings parameter and traffic flow parameters again, and this is replied time slot and comprises a plurality of competing cycles.
Comprise in the frame structure of request communication response message ACK1_Ri, acknowledge message ACK1_D, allowance communication response message ACK2_Ri, ACK2_S: message identifier, node identification, accumulation sign indicating number bag number.
Comprise in the frame structure of cooperative node selection message ACK3_D: message identifier and node identification.
Wherein, source node, can be intercepted in the time slot feedback message ACK1 of node (comprising the request communication response message ACK1_Ri of potential cooperative node and/or the affirmation message ACK1_D of destination node) on every side replying of no rate coding requirement through behind the request communication information m1 of no rate coding in broadcasting; Destination node, can be intercepted in the time slot feedback message ACK2 of node (comprising the allowance communication response message ACK2_Ri of potential cooperative node and/or the allowance communication response message ACK2_S of source node) on every side replying of no rate coding requirement through behind the allowance communication information m2 of no rate coding in broadcasting; Destination node can be according to the time T of its acknowledge message ACK1_D that goes on the air that writes down
1D, listen to the time T of the request communication response message ACK1_Ri of potential cooperative node broadcasting
1iTime T with the allowance communication response message ACK2_Ri that broadcasts
2i, and the time T of source node broadcasting allowance communication response message ACK2_S
2sCarry out optimum cooperative node selection algorithm, optimum cooperative node is informed source node and selected optimum cooperative node by ACK3_D message.
See also Fig. 3, Fig. 3 is the operational flowchart of setting up source node in the process of synergistic link.As shown in Figure 3, this flow process comprises:
301, source node detects its channel behaviour in service;
If 302, source node detection channel can be used, then carry out 303; If it is unavailable that source node detects channel, then continue to carry out 301, continue to detect the channel behaviour in service;
303, the source node broadcasting request communication information m1 behind no rate coding, and at the feedback message of intercepting destination node in the time slot of replying of no rate coding requirement;
Wherein, the frame format of the request communication information m1 among the frame format of the request communication information m1 behind no rate coding of source node broadcasting and Fig. 2 is identical.
If 304, source node listens to the affirmation message ACK1_D of destination node feedback, then carry out 305; If source node does not listen to the affirmation message ACK1_D of destination node feedback, then re-execute 303;
Wherein, frame format such as Fig. 2 of the affirmation message ACK1_D of destination node feedback
305, go off the air through the request communication information m1 of no rate coding;
306, source node receives the allowance communication information m2 through no rate coding of destination node broadcasting;
Wherein, the frame format of the allowance communication information m2 in the frame format of the allowance communication information m2 of no rate coding and Fig. 2 of destination node broadcasting is identical.
307, source node attempts being correctly decoded the allowance communication information m2 through no rate coding of the destination node broadcasting that receives, and carries out 308 if source node is correctly decoded; If source node can not be correctly decoded the allowance communication information m2 through no rate coding of the destination node broadcasting that receives, then continue to carry out 306;
308, source node be correctly decoded the destination node broadcasting that receives behind the allowance communication information m2 of no rate coding, broadcasting allowance communication response message ACK2_S;
Wherein, the frame format of the allowance communication response message ACK2_S among the frame format of the allowance communication response message ACK2_S of source node broadcasting and Fig. 2 is identical.
309, after communication response message ACK2_S was permitted in source node broadcasting, the cooperative node that receives destination node broadcasting was selected message ACK3_D.
Wherein, it is destination node broadcasting that cooperative node is selected message ACK3_D, and its frame format selects the frame format of message ACK3_D identical with the cooperative node among Fig. 2, is used for the optimum cooperative node notification source node that destination node is determined.
See also Fig. 4, Fig. 4 is the operational flowchart of setting up potential cooperative node in the process of synergistic link.As shown in Figure 4, this flow process comprises:
401, potential cooperative node detects its channel behaviour in service;
If 402, potential cooperative node detects its channel and can use, then carry out 403; If it is unavailable that potential cooperative node detects its channel, then continue to carry out 401, continue to detect its channel behaviour in service;
403, the request communication information m1 behind no rate coding of potential cooperative node reception sources node broadcasts;
Wherein, the frame format of the request communication information m1 among the frame format of the request communication information m1 behind no rate coding of source node broadcasting and Fig. 2 is identical.
404, potential cooperative node attempts being correctly decoded the request communication information m1 through no rate coding of the source node broadcasting that receives, and then carries out 405 if can not be correctly decoded; If potential cooperative node is correctly decoded the request communication information m1 through no rate coding of the source node broadcasting that receives, then carry out 406;
405, potential cooperative node judges whether timer is overtime, if not, then continues to carry out 403; If, then self be set to invalid cooperative node, and process ends;
406, potential cooperative node be correctly decoded the source node broadcasting that receives behind the request communication information m1 of no rate coding, the broadcast request corresponding message ACK1_Ri that communicates by letter;
Wherein, the frame format of the request communication response message ACK1_Ri of potential cooperative node broadcasting is identical with the frame format of the request communication response message ACK1_Ri shown in Fig. 2, has carried the message identifier of request communication response message ACK1_Ri and the node identification of potential cooperative node among the request communication response message ACK1_Ri.
407, potential cooperative node receives the allowance communication information m2 behind no rate coding of destination node broadcasting;
Wherein, the frame format of the allowance communication information m2 among the frame format of the allowance communication information m2 behind no rate coding of destination node broadcasting and Fig. 2 is identical.
408, potential cooperative node attempts being correctly decoded the allowance communication information m2 behind no rate coding of the destination node broadcasting that receives, and then is correctly decoded and then carries out 410; If potential cooperative node can not be correctly decoded the request communication information m1 through no rate coding of the source node broadcasting that receives, then carry out 409;
409, potential cooperative node judges whether timer is overtime, if not, then continues to carry out 407; If, then self be set to invalid cooperative node, and process ends;
410, communication response message ACK2_Ri is permitted in potential cooperative node broadcasting;
Wherein, the frame format of the allowance communication response message ACK2_Ri of potential cooperative node broadcasting is identical with the frame format of the allowance communication response message ACK2_Ri shown in Fig. 2, has permitted having carried among the communication response message ACK2_Ri message identifier of allowance communication response message ACK2_Ri and the node identification of potential cooperative node.
411, potential cooperative node judges whether timer is overtime, if not, then carries out 412; If, then self be set to invalid cooperative node, and process ends;
412, potential cooperative node is selected message ACK3_D if receive the cooperative node of destination node broadcasting, then carries out 413; Otherwise, continue to carry out 411;
413, potential cooperative node judges whether self is optimum cooperative node, if then self be set to optimum cooperative node and process ends; If not, then self be set to invalid cooperative node and process ends.
See also Fig. 5, Fig. 5 is the operational flowchart of setting up destination node in the process of synergistic link.As shown in Figure 5, this flow process comprises:
501, destination node detects its channel behaviour in service;
If 502, destination node detects its channel and can use, then carry out 503; If it is unavailable that destination node detects its channel, then continue to carry out 501, continue to detect its channel behaviour in service;
503, the request communication information m1 behind no rate coding of destination node reception sources node broadcasts;
Wherein, the frame format of the request communication information m1 among the frame format of the request communication information m1 behind no rate coding of source node broadcasting and Fig. 2 is identical.
504, destination node attempts being correctly decoded the request communication information m1 through no rate coding of the source node broadcasting that receives, and then continues to carry out 503 if can not be correctly decoded; If destination node is correctly decoded the request communication information m1 through no rate coding of the source node broadcasting that receives, then carry out 505;
Wherein, destination node receive and attempt to be correctly decoded the source node broadcasting that receives in the process of the request communication information m1 of no rate coding, intercept potential cooperative node simultaneously and be correctly decoded the request communication response ACK1_Ri that broadcasts behind this request communication information m1, and record listens to the time T of request communication response ACK1_Ri
1i
Wherein, to be correctly decoded the frame format of the request communication response ACK1_R that broadcasts behind this request communication information m1 identical with the frame format of the request communication response ACK1_R shown in Fig. 2 for potential cooperative node.
505, destination node be correctly decoded the source node broadcasting that receives behind the request communication information m1 of no rate coding, broadcast request communication corresponding message ACK1_D, and the communicate by letter time T of corresponding message ACK1_D of recording start broadcast request
1D
Wherein, communicate by letter with the request shown in Fig. 2 frame format of corresponding message ACK1_D of the frame format of destination node broadcast request communication corresponding message ACK1_D is identical, the communicate by letter message identifier of corresponding message ACK1_D and the node identification of destination node of the request of having carried among the request communication corresponding message ACK1_D.
506, the allowance communication information m2 behind no rate coding of destination node broadcasting;
Wherein, the frame format of the allowance communication information m2 among the frame format of the allowance communication information m2 behind no rate coding of destination node broadcasting and Fig. 2 is identical.
If 507, destination node listens to source node and is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the allowance communication information m2, then carry out 805; If destination node does not listen to source node and is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the allowance communication information m2, then continue to carry out 506;
Wherein, destination node is in the process of the allowance communication response message ACK2_S that intercepts source node broadcasting, intercept potential cooperative node simultaneously and be correctly decoded the allowance communication response message ACK2_Ri that broadcasts behind the allowance communication information m2, and record listens to the time T of permitting communication response message ACK2_Ri
2i
508, the destination node record listens to the time T of the allowance communication response message ACK2_S of source node broadcasting
2S, and go off the air and permit communication information m2;
509, destination node is calculated optimum cooperative node, and the optimum cooperative node that will calculate is selected message ACK3_D notification source node and optimum cooperative node by cooperative node.
See also Fig. 6, Fig. 6 calculates the flow chart of optimum cooperative node for destination node.As shown in Figure 6, this flow process comprises:
601, destination node is obtained its pairing time T of ACK1_Ri that listened to before broadcasting ACK1_D
1i(i: i potential cooperative node);
602, destination node is obtained the pairing time T of its ACK2_Ri that listened to before listening to ACK2_S
2i(i: i potential cooperative node);
603, destination node is calculated T for each the potential cooperative node that listens in above-mentioned two steps
i=T
1i+ T
2i, get minimum T
iBeing worth pairing i potential cooperative node is optimum cooperative node.
Wherein, for i potential cooperative node, if it can be before destination node be correctly decoded request communication information m1 message (promptly the time of i potential cooperative node broadcasting ACK1_Ri is before destination node broadcasting ACK1_D), with and be correctly decoded permit communication information m2 again source node be correctly decoded permit communication information m2 before (promptly the time of i potential cooperative node broadcasting ACK2_Ri is before source node is broadcasted ACK2_S), illustrate if come cooperation transmission by this potential cooperative node, channel access times when the channel access times of transfer of data will be than source node and destination node direct communication lack, and promptly use i potential cooperative node that effective transmission gain can be provided.The basic principle that destination node is calculated optimum cooperative node is can provide the decode time (temporal summation of decoding m1 and decoding m2) of the potential cooperative node of actual gain to compare and select to have the potential cooperative node of minimum decode time as optimum cooperative node above-mentioned all.
Below, illustrate by way of example synergistic link set up how optimum cooperative node obtains in the process, as shown in Figure 7:
Each node of subsystem each self-channel behaviour in service of perception respectively in A, the sensing network, wherein, node S, R1, R3, R4, R5 and D channel perception can be used, node R 2 since be positioned at main system (PU) zone of action channel perception unavailable.
B, node S send the request communication information m1 behind no rate coding, and decoding is intercepted and attempted to node on every side.Wherein, node R 2 is because its channel is unavailable, so can't receive request communication information m1; Node R 1, R3, R4, R5 and D constantly receive request communication information m1 and attempt decoding m1 message.
C, node is correctly decoded broadcast request communication response message ACK1 behind the request communication information m1 on every side.Wherein, node R 1, R3, R4 and D according to the sequential that is correctly decoded request communication information m1 broadcast successively ACK1 message (comprise ACK1_R1, ACK1_R3, ACK1_R4, ACK1_D); Node R 5 node D before being correctly decoded request communication information m1 has been correctly decoded this message, so node S stops to send request communication information m1 after receiving the ACK1_D message of node D broadcasting, and R5 is not because the quantity of the no rate packets of accumulation reaches decoding request, can't continue to attempt decoding request communication information m1, become invalid cooperative node.
D, node D send the allowance communication information m2 through no rate coding, and decoding is intercepted and attempted to node on every side.Wherein, node R 2 is because its channel is unavailable, so can't receive m2 message; Node R 1, R3, R4 and S constantly receive and permit communication information m2 and attempt decoding; Node R 5 is because become invalid node, and misalignment is permitted communication information m2 and attempted decoding.
E, on every side node be correctly decoded permit behind the communication information m2 broadcasting permit communication response message ACK2 (comprise ACK2_R1, ACK2_R4, ACK2_S).Wherein, node R 4, R1 and S broadcast allowance communication response message ACK2 successively according to being correctly decoded the sequential of permitting communication information m2; Node R 3 node S before being correctly decoded allowance communication information m2 has been correctly decoded this message, so listening to stop to send after the ACK2_S message of node S broadcasting, node D permits communication information m2, and R3 is not because the quantity of the no rate packets of accumulation reaches decoding request, can't continue to attempt decoding and permit communication information m2, become invalid cooperative node.
F, node D calculate the back according to optimum cooperative node selection algorithm and select node R 1 as optimum cooperative node, and send cooperative node selection message ACK3_D notice node S and node R 1, thereby set up communication link.
In said process, behind node S broadcast request communication information m1, the ACK1_D that the ACK1 message that node D listens to has ACK1_R1, ACK1_R3, ACK1_R4 respectively and self sends; After node D sent the allowance communication information, the ACK2 message that node D listens to had ACK2_R4, ACK2_R1, ACK2_S respectively; T wherein
11, T
13, T
14And T
10Time of the time that listens to ACK1_R1, ACK1_R3, ACK1_R4 of corresponding node D record and the ACK1_D that self begins to send respectively; T
24, T
21And T
20Time that listens to ACK2_R4, ACK2_R1, ACK2_S of corresponding node D record respectively.Node D calculates (T
11+ T
21) and (T
14+ T
24) relation, hypothesis has (a T in above-mentioned example
14+ T
24)＞(T
11+ T
21), so optimum cooperative node is R1.
Selection by above-mentioned optimum cooperative node realizes that source node and destination node begin to communicate after the foundation of synergistic link.Wherein, cooperation transmission agreement such as a Fig. 8 a mistake! Do not find Reference source.Shown in, this cooperation transmission agreement is mainly divided following two stages:
Phase I: node S does not have rate coding with packet, sends no rate coding bag P1 to optimum cooperative node R and node D; Optimum cooperative node R then sends transmission response ack_R if can be correctly decoded source data from the no rate coding bag of accumulative reception, and notice node S stops to send no rate coding bag.
Second stage: optimum cooperative node R will be correctly decoded data does not have the rate coding transmission, the no rate coding bag that the optimum cooperative node R of node D accumulative reception sends, and the no rate coding bag of the node S transmission of associating phase I reception is decoded.When node D can be correctly decoded source data, send transmission response ack_D notice node S and send new data, node R stops to send no rate coding bag simultaneously.
Having two kinds of acknowledge messages in above-mentioned cooperation transmission agreement, is respectively that optimum cooperative node R is correctly decoded transmission response ack_R and the destination node broadcasted after the source node data and is correctly decoded the transmission response ack_D that broadcasts after the source node data.The message format of such two kinds of transmission responses is shown in Fig. 8 b.Wherein, comprise message identifier and node identification among the transmission response ack_R; Comprise message identifier among the transmission response ack_D, node identification and quality of service satisfy index (0: satisfy; 1: do not satisfy).The cooperation transmission agreement that provides in the embodiment of the invention is simple, guarantees that data arrive destination node and do not occur out of order.
See also Fig. 9, Fig. 9 is the flow chart of source node in communication process.As shown in Figure 9, this flow process comprises:
901, source node periodically detects its channel behaviour in service;
If 902, source node detection channel can be used, then carry out 903; If it is unavailable that source node detects channel, then continue to carry out 901, continue to detect the channel behaviour in service;
903, source node does not have rate coding to communication data;
904, source node sends no rate coding bag;
905, source node judges whether to exist cooperative node, if then carry out 906; If not, then carry out 907;
Wherein, the cooperative node in above-mentioned 905 is the optimum cooperative node that destination node is calculated.
906, source node then carries out 907 if not listening to cooperative node is correctly decoded the transmission response ack_Ri that broadcasts behind the no rate coding bag; Source node then carries out 910 if listening to cooperative node is correctly decoded the transmission response ack_Ri that broadcasts behind the no rate coding bag;
907, source node then continues to carry out 904 if not listening to destination node is correctly decoded the transmission response ack_D that broadcasts behind the no rate coding bag; Source node then carries out 908 if listening to destination node is correctly decoded the transmission response ack_D that broadcasts behind the no rate coding bag;
908, if it is 0 that the quality of service that transmission response ack_D carries satisfies index, then carry out 909; Otherwise, enter optimum cooperative node and select flow process;
909, judge whether communication finishes, if, process ends then; Otherwise, continue to carry out 903;
910, source node stops to send no rate coding bag, buffer memory original communication data;
911, source node waits for that receiving destination node is correctly decoded the transmission response ack_D that broadcasts behind the no rate coding bag;
912, source node receives destination node and is correctly decoded the transmission response ack_D that broadcasts behind the no rate coding bag, and carries out 908.
See also Figure 10, Figure 10 is the flow chart of optimum cooperative node in communication process.As shown in figure 10, this flow process comprises:
1001, optimum cooperative node periodically detects its channel behaviour in service;
If 1002, optimum cooperative node detects its channel and can use, then carry out 1003; If it is unavailable that optimum cooperative node detects its channel, then continue to carry out 1001, continue to detect the channel behaviour in service;
1003, the no rate coding bag of optimum cooperative node reception sources node transmission;
If 1004, the no rate coding bag of optimum cooperative node accumulation can be correctly decoded source data, then carry out 1005; Otherwise, then continue to carry out 1003;
Wherein, optimum cooperative node is correctly decoded in the process of source data in reception and trial, intercept destination node simultaneously and be correctly decoded the transmission response ack_D that broadcasts after the source data, if listen to the transmission response ack_D of destination node broadcasting, then stop the no rate coding bag that the reception sources node sends, and the no rate coding bag that received of buffer memory, process ends; If do not listen to the transmission response ack_D of destination node broadcasting, then continue to carry out 1003.
Wherein, the message format of the transmission response ack_D of destination node broadcasting is shown in Fig. 8 b.
If 1005, the no rate coding bag of optimum cooperative node accumulation can be correctly decoded source data, then broadcast transmitted responds ack_R;
Wherein, the message format of the transmission response ack_R of optimum cooperative node broadcasting is shown in Fig. 8 b.
1006, optimum cooperative node sends no rate coding bag;
If 1007, optimum cooperative node listens to destination node and is correctly decoded the transmission response ack_D that broadcasts after the source data according to the no rate coding bag that optimum cooperative node sends, then carry out 1008; Otherwise, continue to carry out 1006;
1008, optimum cooperative node stops to send no rate coding bag, abandons the source data of decoding.
See also Figure 11, Figure 11 is the flow chart of destination node in communication process.As shown in figure 11, this flow process comprises:
1101, destination node periodically detects its channel behaviour in service;
If 1102, destination node detects its channel and can use, then carry out 1103; If it is unavailable that destination node detects its channel, then continue to carry out 1101, continue to detect the channel behaviour in service;
1103, destination node initialization timing device T_D and picking up counting;
1104, the no rate coding bag of destination node reception sources node transmission;
1105, destination node judges whether to exist cooperative node, if then carry out 1106; If not, then carry out 1112;
Wherein, related cooperative node is meant the optimum cooperative node that calculates before the destination node in the present embodiment.
If 1106, destination node listens to the transmission response ack_R of cooperative node broadcasting, then carry out 1107; Otherwise, then carry out 1112;
1107, destination node initialization timing device T_D and picking up counting;
1108, destination node receives the no rate coding bag that cooperative node sends;
1109, destination node then carries out 1113 if can be correctly decoded source data; Otherwise, then carry out 1110;
1110, destination node judges whether timer T_D is overtime, if not, then continues to carry out 1108; If then carry out 1111;
1111, destination node broadcast transmitted response ack_D, the quality of service that transmission response ack_D carries is satisfied to be designated 1; And process ends;
1112, destination node then carries out 1113 if can be correctly decoded source data; Otherwise, then carry out 1116;
1113, destination node judge decoded source data service quality (Quality of Service, QoS) whether parameter meets the demands, if then carry out 1114; If not, then carry out 1111;
1114, destination node broadcast transmitted response ack_D, the quality of service that transmission response ack_D carries is satisfied to be designated 0;
1115, destination node judges whether communication finishes, if, process ends then; Otherwise, continue to carry out 1104;
1106, destination node judges whether timer T_D is overtime, if not, then continues to carry out 1104; If then carry out 1111.
In the embodiment of the invention, after optimum cooperative node is selected to finish, can utilize the optimum cooperative node that chooses to carry out cooperation transmission, performance is better than direct communication certainly when the experience slow fading channel.Therefore, communicating by letter of source node and destination node should be cooperated by optimum cooperative node.Under the situation of fast channel variation, when having driving vehicle to stop channel suddenly, the performance of optimum cooperative node cooperation may descend suddenly, need consider the influence that this fast channel variation is brought in communication.In embodiments of the present invention, utilize broadcasting ACK feedback, timer and feedback sign (comprising message identifier and node identification) to reduce influence.Wherein, optimum cooperative node is selected flow process if adopt periodically and carry out, and can have two problems: the one, and the setting of cycle length, the cycle is provided with and longly makes selection can not reflect channel situation, and the cycle is provided with too short, and overhead is big; The 2nd, system cycle carries out optimum cooperative node to be selected, and each node needs to participate in the sensing network, and is higher to the energy requirement of node.In embodiments of the present invention, the selection of optimum cooperative node is triggering with the incident, when the QoS of communication service is not being met (excessive as time delay), enters the flow process of reselecting optimum cooperative node.In the embodiment of the invention,, withdraw from the use channel immediately if its channel of node perceived is unavailable.When using optimum cooperative node to transmit, if optimum its channel of cooperative node perception is unavailable, and source node can use channel, then should utilize source node to carry out transfer of data again, to improve the frequency spectrum service efficiency.Based on the influence of channel availability to transmission, the embodiment of the invention has proposed to be applicable to the cooperation transmission mechanism based on no-rate codes of sensing network.
The embodiment of the invention is set up in the process at synergistic link, does optimum cooperative node by destination node and selects, and effectively finds hiding cooperative node, thereby can promote communication reliability and systematic function; The performance of guaranteeing selected optimum cooperative node necessarily is higher than direct transmission performances; Protocol message is simple.
See also Figure 12, the structure chart of a kind of node device that Figure 12 provides for the embodiment of the invention.As shown in figure 12, this node can comprise:
The 3rd processing module 1203 is used for according to above-mentioned T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculate optimum cooperative node;
Manages module 1204 everywhere, is used for optimum cooperative node notification source node that the 3rd processing module 1203 is calculated and optimum cooperative node to set up synergistic link.
See also Figure 13, the structure chart of the another kind of node device that Figure 13 provides for the embodiment of the invention.Node as shown in figure 13 is optimized by node shown in Figure 12 and obtains, and as shown in figure 13, the 3rd processing module 1203 can comprise:
First comparison sub-module 12031 is used for above-mentioned T
1DTime T with each potential cooperative node
1iCompare, and with above-mentioned T
2sTime T with each potential cooperative node
2iRelatively; If the time T of each potential cooperative node
1iLess than above-mentioned T
1D, and time T
2iLess than above-mentioned T
2s, determine that then but this potential cooperative node is a cooperative node;
First calculating sub module 12032, but be used to calculate the time T of each cooperative node that first comparison sub-module 12031 determines
1iWith T
2iAnd value, will with the minimum cooperative node of value as optimum cooperative node.
See also Figure 14, the structure chart of the another kind of node device that Figure 14 provides for the embodiment of the invention.Node as shown in figure 14 is optimized by node shown in Figure 12 and obtains, and as shown in figure 14, the 3rd processing module 1203 can comprise:
Second calculating sub module 12034 is used for according to formula
But from the cooperative node that second comparison sub-module 12033 is determined, calculate optimum cooperative node, wherein, R
i *Represent optimum cooperative node.
In the embodiment of the invention, second processing module 1202 also is used for going off the air and permitting communication information m2 listening to after source node is correctly decoded the allowance communication response message ACK2_S that permits broadcasting behind the communication information m2.
In the embodiment of the invention, nodes records listens to the time T that potential cooperative node is correctly decoded the request communication response message ACK1_R that broadcasts behind the request communication information m1 on every side
1i, write down the time T that it is correctly decoded the acknowledge message ACK1_D that goes on the air behind the request communication information m1
1D, record listens to the time T that source node is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the allowance communication information m2
2s, and record listens to the time T that potential cooperative node is correctly decoded the allowance communication response message ACK2_Ri that broadcasts behind the allowance communication information m2 on every side
2iAccording to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculate optimum cooperative node and notification source node and optimum cooperative node to set up synergistic link.Like this, the cooperative node hidden be can effectively find, thereby communication reliability and systematic function promoted.
After synergistic link foundation was finished and begun communication, synergistic link will carry out necessary maintenance.See also Figure 15 a, the flow chart of the maintaining method of a kind of synergistic link that Figure 15 a provides for the embodiment of the invention, this method comprises:
1501, whether each self-channel of perception is available respectively in perception stage for source node, cooperative node and destination node, if, then can be with identifying at channel operational phase initial stage transmitting channel;
Wherein, the channel of source node, cooperative node and destination node can be different with sign, and source node, cooperative node and destination node keep mourning in silence in the channel operational phase when its channel of perception stage perception is unavailable.
Wherein, said cooperative node is the optimum cooperative node that the method for building up by above-mentioned synergistic link calculates in the present embodiment.
Wherein, the perception stage of source node, cooperative node and destination node is the same time period.
1502, cooperative node, does not have rate coding again and sends to destination node after then the no rate coding bag that the source node that receives is sent is correctly decoded if receiving the channel that destination node sends can use when identifying.
Wherein, when source node can be used sign at the channel of receiving the cooperative node transmission, send no rate coding bag to cooperative node.
Further, when source node can be used sign at the channel of receiving the destination node transmission, can send no rate coding bag to destination node.
In the embodiment of the invention specific design in the sensing network each node perceived channel can with the sign.For example, source node S, cooperative node R and destination node D, keep mourning in silence in the channel operational phase at the channel availability of perception stage difference perception oneself when each node perceived channel is unavailable; The channel that the node that channel perception can be used sends self at the channel operational phase initial stage can be used sign; When source node S can be used sign at the channel of receiving cooperative node R transmission, send no rate coding bag to cooperative node R; And/or, when source node S can be used sign at the channel of receiving destination node D transmission, send no rate coding bag to destination node D; Cooperative node R when receiving that channel that destination node D sends can be with sign, with the source node S that receives send no rate coding bag be correctly decoded and do not have rate coding again after send to destination node D, thereby can realize maintenance to synergistic link.Wherein, source node S, cooperative node R and destination node D channel perception availability are as shown in figure 15.A mistake! Do not find Reference source.The application of collaboration communication in sensing network must be considered the influence of each node channel availability, table 1 has provided the influence to communication of in each perception stage its channel availability of each node perceived, and promptly each node is known the operation that specifically can take behind the channel availability of self and other nodes in each perception stage.
Table 1
See also Figure 16, the structure chart of the another kind of node device that Figure 16 provides for the embodiment of the invention.As shown in figure 16, this node device can comprise:
Wherein, control module 1602 also is used for when sensing module 1601 channel perceptions are unavailable, keeps mourning in silence in the channel operational phase.
In the embodiment of the invention, but node device can be in its channel time spent of perception, can be at channel operational phase initial stage transmitting channel with identifying, and when the channel of receiving the destination node transmission can be used sign, after the no rate coding bag decoding that the source node that receives is sent, again do not have rate coding and send to destination node, can realize maintenance synergistic link.
See also Figure 17, the structure chart of the maintenance system of a kind of synergistic link of providing in the embodiment of the invention is provided Figure 17.As shown in figure 17, this maintenance system comprises:
Source node 1701, cooperative node 1702 and destination node 1703, whether available at each self-channel of perception stage perception respectively, if then sending each self-channel at the channel operational phase initial stage respectively can be with identifying;
Wherein, said cooperative node 1702 is optimum cooperative nodes that the method for building up by above-mentioned synergistic link calculates in the present embodiment.
Wherein, source node 1701 when the channel of receiving cooperative node 1702 transmissions can be used sign, will not have the rate coding bag and will send to cooperative node 1702;
Cooperative node 1702 when receiving that channel that destination node 1703 sends can be with sign, after the no rate coding bag decoding that the source node 1702 that receives is sent, does not have rate coding again and sends to destination node 1703.
Wherein, source node 1701 also is used for will not having the rate coding bag and sending to destination node 1703 when the channel of receiving destination node 1703 transmissions can be used sign.
Wherein, the perception stage of source node 1701, cooperative node 1702 and destination node 1703 is the same time period.
In the embodiment of the invention, promptly each node can also be taked the concrete operations shown in above-mentioned table 1 after knowing the channel behaviour in service of self and other nodes, and the embodiment of the invention is not repeated.
The embodiment of the invention is in the maintenance process of synergistic link, and having defined channel can consider QoS with sign; Considered when channel becomes soon when cooperative node channel variation, to utilize direct transmission effectively once more, reduced because the fast decreased performance of bringing that becomes of channel to the influence of cooperation transmission; In communication process, the availability by channel perception decides whether information is received and send, rather than utilizes feedback to realize having practicality; At the receiving node place, unavailable as if perceiving channel, enter silent status, the unavailable mark of feedback channel can not cause potential interference to main system.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be finished by the relevant hardware of program command, aforesaid program can be stored in the computer read/write memory medium, this program is carried out the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: various media that can be program code stored such as read-only memory (ROM), random access device (RAM), magnetic disc or CD.
More than the foundation of a kind of synergistic link that the embodiment of the invention provided and maintaining method and relevant device are described in detail, used specific case herein principle of the present invention and execution mode are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, the part that all can change in specific embodiments and applications, to sum up, this description should not be construed as limitation of the present invention.
Claims (16)
1. the method for building up of a synergistic link is characterized in that, comprising:
Receive and attempt the request communication information m1 behind no rate coding of decoding source node broadcasting, write down the time T that is correctly decoded the acknowledge message ACK1_D that goes on the air behind the described request communication information m1
1D, and record listens to the time T that potential cooperative node is correctly decoded the request communication response ACK1_Ri that broadcasts behind the described request communication information m1 on every side
1i
Broadcasting is through the allowance communication information m2 of no rate coding, and record listens to the time T that described source node is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the described allowance communication information m2
2sAnd record listens to the time T that potential cooperative node is correctly decoded the allowance communication response message ACK2_Ri that broadcasts behind the described allowance communication information m2 on every side
2i
According to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculate optimum cooperative node, and notify described source node and optimum cooperative node to set up synergistic link.
2. method according to claim 1 is characterized in that, and is described according to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculating optimum cooperative node comprises:
With T
1DTime T with each potential cooperative node
1iCompare, and with T
2sTime T with each potential cooperative node
2iRelatively;
If the time T of each potential cooperative node
1iLess than T
1D, and time T
2iLess than T
2s, determine that then but this potential cooperative node is a cooperative node;
But calculate the time T of each cooperative node
1iWith T
2iAnd value, but will with the minimum cooperative node of value as optimum cooperative node.
3. method according to claim 1 is characterized in that, and is described according to T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculating optimum cooperative node comprises:
With T
1DTime T with each potential cooperative node
1iCompare, and with T
2sTime T with each potential cooperative node
2iRelatively;
If the time T of each potential cooperative node
1iLess than T
1D, and time T
2iLess than T
2s, determine that then this potential cooperative node is a cooperative node;
According to formula
But from described cooperative node, calculate optimum cooperative node, wherein R
l *Represent optimum cooperative node.
4. method according to claim 1 is characterized in that, also comprises:
Destination node listens to described source node and is correctly decoded after the allowance communication response message ACK2S_ that broadcasts behind the described allowance communication information m2, and described allowance communication information m2 goes off the air.
5. a node device is characterized in that, comprising:
First processing module, the request communication information m1 behind no rate coding of the source node broadcasting that is used to receive and attempt to decode writes down the time T that is correctly decoded the acknowledge message ACK1_D that goes on the air behind the described request communication information m1
1D, and record listens to the time T that potential cooperative node is correctly decoded the request communication response ACK1_Ri that broadcasts behind the described request communication information m1 on every side
1i
Second processing module, be used for after described first processing module is broadcasted described acknowledge message ACK1_D, broadcasting is through the allowance communication information m2 of no rate coding, and record listens to the time T that described source node is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the described allowance communication information m2
2sAnd record listens to the time T that potential cooperative node is correctly decoded the allowance communication response message ACK2_Ri that broadcasts behind the described allowance communication information m2 on every side
2i
The 3rd processing module is used for according to described T
1D, T
2sAnd the time T of each potential cooperative node
1iAnd T
2iCalculate optimum cooperative node;
Manages module everywhere, is used for notifying described source node and optimum cooperative node to set up synergistic link the optimum cooperative node that described the 3rd processing module calculates.
6. node device according to claim 5 is characterized in that, described the 3rd processing module comprises:
First comparison sub-module is used for described T
1DTime T with each potential cooperative node
1iCompare, and with described T
2sTime T with each potential cooperative node
2iRelatively; If the time T of each potential cooperative node
1iLess than described T
1D, and time T
2iLess than described T
2s, determine that then but this potential cooperative node is a cooperative node;
First calculating sub module, but be used to calculate the time T of each cooperative node that described first comparison sub-module determines
1iWith T
2iAnd value, but will with the minimum cooperative node of value as optimum cooperative node.
7. node device according to claim 5 is characterized in that, described the 3rd processing module comprises:
Second comparison sub-module is used for described T
1DTime T with each potential cooperative node
1iCompare, and with described T
2sTime T with each potential cooperative node
2iRelatively; If the time T of each potential cooperative node
1iLess than described T
1D, and time T
2iLess than described T
2s, determine that then but this potential cooperative node is a cooperative node;
Second calculating sub module is used for according to formula
But from described cooperative node, calculate optimum cooperative node, wherein, R
i *Represent optimum cooperative node.
8. according to claim 5,6 or 7 described node devices, it is characterized in that, described second processing module also is used for listening to after described source node is correctly decoded the allowance communication response message ACK2_S that broadcasts behind the described allowance communication information m2, and described allowance communication information m2 goes off the air.
9. the maintaining method of a synergistic link comprises source node, and cooperative node and destination node is characterized in that, described cooperative node calculates by aforesaid right requirement 1～4 each described method:
Whether each self-channel of perception is available respectively in perception stage for described source node, cooperative node and destination node, if, then can be with identifying at channel operational phase initial stage transmitting channel;
Described cooperative node, does not have rate coding again and sends to described destination node after the no rate coding bag that the described source node that then will receive sends is correctly decoded if receiving the channel that described destination node sends can use when identifying.
10. method according to claim 9 is characterized in that, also comprises:
Described source node can then send no rate coding bag to described destination node with sign if receive the channel that described destination node sends.
11. method according to claim 9 is characterized in that, the perception stage of described source node, cooperative node and destination node is the same time period.
12. a node device is characterized in that, comprising:
Sensing module, be used at the perception stage channel perception whether available, if, then channel operational phase initial stage transmitting channel can with the sign;
Control module is used for when receiving that channel that described destination node sends can be with sign, after the no rate coding bag decoding that the source node that receives is sent, does not have rate coding again and sends to described destination node.
13. node device according to claim 12 is characterized in that, described control module also is used for when described sensing module channel perception is unavailable, keeps mourning in silence in the channel operational phase.
14. the maintenance system of a synergistic link is characterized in that, comprises source node, cooperative node and destination node, and described cooperative node calculates by aforesaid right requirement 1～4 each described method:
Wherein, source node, cooperative node and destination node, whether available at each self-channel of perception stage perception respectively, if then sending each self-channel at the channel operational phase initial stage respectively can be with identifying;
Described source node when the channel of receiving described cooperative node transmission can be used sign, will not have the rate coding bag and will send to described cooperative node;
Described cooperative node when receiving that channel that described destination node sends can be with sign, after the no rate coding bag decoding that the source node that receives is sent, does not have rate coding again and sends to described destination node.
15. system according to claim 14 is characterized in that, described source node also is used for will not having the rate coding bag and sending to described destination node when the channel of receiving described destination node transmission can be used sign.
16. system according to claim 14 is characterized in that, the perception stage of described source node, cooperative node and destination node is the same time period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101626423A CN102237978B (en) | 2010-04-27 | 2010-04-27 | Collaborative link establishment and maintenance method and related device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101626423A CN102237978B (en) | 2010-04-27 | 2010-04-27 | Collaborative link establishment and maintenance method and related device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102237978A true CN102237978A (en) | 2011-11-09 |
| CN102237978B CN102237978B (en) | 2013-12-04 |
Family
ID=44888242
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101626423A Active CN102237978B (en) | 2010-04-27 | 2010-04-27 | Collaborative link establishment and maintenance method and related device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102237978B (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104579613A (en) * | 2015-01-15 | 2015-04-29 | 浙江大学 | Joint encoding modulation method based on no-rate codes and V-OFDM |
| CN106851588A (en) * | 2011-12-28 | 2017-06-13 | 财团法人工业技术研究院 | Broadcast assisted method and its telegon, broadcaster and interception device |
| WO2019001482A1 (en) * | 2017-06-27 | 2019-01-03 | Mediatek Inc. | Shift-coefficient table design of qc-ldpc code for smaller code block sizes in mobile communications |
| US10432227B2 (en) | 2017-01-24 | 2019-10-01 | Mediatek Inc. | Location of interleaver with LDPC code |
| US10484013B2 (en) | 2017-05-12 | 2019-11-19 | Mediatek Inc. | Shift-coefficient table design of QC-LDPC code for smaller code block sizes in mobile communications |
| US10484011B2 (en) | 2017-05-12 | 2019-11-19 | Mediatek Inc. | Shift-coefficient table design of QC-LDPC code for larger code block sizes in mobile communications |
| US10567116B2 (en) | 2017-05-12 | 2020-02-18 | Mediatek Inc. | Wireless communication using codebooks from a QC-LDPC code for shorter processing latency and improved decoder throughput efficiency |
| US10581457B2 (en) | 2017-01-09 | 2020-03-03 | Mediatek Inc. | Shift coefficient and lifting factor design for NR LDPC code |
| US10630319B2 (en) | 2017-01-24 | 2020-04-21 | Mediatek Inc. | Structure of interleaver with LDPC code |
| US10790853B2 (en) | 2016-05-12 | 2020-09-29 | Mediatek Inc. | QC-LDPC coding methods and apparatus |
| CN112954714A (en) * | 2021-01-29 | 2021-06-11 | 博为科技有限公司 | MESH network control method and device |
| CN114402666A (en) * | 2020-08-14 | 2022-04-26 | 北京小米移动软件有限公司 | Processing capacity request, processing capacity sending method, processing capacity receiving method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050190717A1 (en) * | 2004-03-01 | 2005-09-01 | The Charles Stark Draper Laboratory | MANET routing based on best estimate of expected position |
| CN101364944A (en) * | 2008-09-05 | 2009-02-11 | 西安电子科技大学 | Cooperative media access control method for wireless distributed network |
| CN101499914A (en) * | 2008-01-28 | 2009-08-05 | 华为技术有限公司 | Parent node selection method, system and node for multicast system |
-
2010
- 2010-04-27 CN CN2010101626423A patent/CN102237978B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050190717A1 (en) * | 2004-03-01 | 2005-09-01 | The Charles Stark Draper Laboratory | MANET routing based on best estimate of expected position |
| CN101499914A (en) * | 2008-01-28 | 2009-08-05 | 华为技术有限公司 | Parent node selection method, system and node for multicast system |
| CN101364944A (en) * | 2008-09-05 | 2009-02-11 | 西安电子科技大学 | Cooperative media access control method for wireless distributed network |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106851588A (en) * | 2011-12-28 | 2017-06-13 | 财团法人工业技术研究院 | Broadcast assisted method and its telegon, broadcaster and interception device |
| CN104579613B (en) * | 2015-01-15 | 2017-12-29 | 浙江大学 | A kind of combined coding modulation method based on no-rate codes and V OFDM |
| CN104579613A (en) * | 2015-01-15 | 2015-04-29 | 浙江大学 | Joint encoding modulation method based on no-rate codes and V-OFDM |
| US10790853B2 (en) | 2016-05-12 | 2020-09-29 | Mediatek Inc. | QC-LDPC coding methods and apparatus |
| US10581457B2 (en) | 2017-01-09 | 2020-03-03 | Mediatek Inc. | Shift coefficient and lifting factor design for NR LDPC code |
| US10630319B2 (en) | 2017-01-24 | 2020-04-21 | Mediatek Inc. | Structure of interleaver with LDPC code |
| US10432227B2 (en) | 2017-01-24 | 2019-10-01 | Mediatek Inc. | Location of interleaver with LDPC code |
| US10484013B2 (en) | 2017-05-12 | 2019-11-19 | Mediatek Inc. | Shift-coefficient table design of QC-LDPC code for smaller code block sizes in mobile communications |
| US10484011B2 (en) | 2017-05-12 | 2019-11-19 | Mediatek Inc. | Shift-coefficient table design of QC-LDPC code for larger code block sizes in mobile communications |
| US10567116B2 (en) | 2017-05-12 | 2020-02-18 | Mediatek Inc. | Wireless communication using codebooks from a QC-LDPC code for shorter processing latency and improved decoder throughput efficiency |
| WO2019001482A1 (en) * | 2017-06-27 | 2019-01-03 | Mediatek Inc. | Shift-coefficient table design of qc-ldpc code for smaller code block sizes in mobile communications |
| TWI690166B (en) * | 2017-06-27 | 2020-04-01 | 聯發科技股份有限公司 | Method of shift-coefficient table design of qc-ldpc code for smaller code block sizes in mobile communications |
| CN114402666A (en) * | 2020-08-14 | 2022-04-26 | 北京小米移动软件有限公司 | Processing capacity request, processing capacity sending method, processing capacity receiving method and device |
| CN112954714A (en) * | 2021-01-29 | 2021-06-11 | 博为科技有限公司 | MESH network control method and device |
| CN112954714B (en) * | 2021-01-29 | 2022-06-14 | 博为科技有限公司 | MESH network control method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102237978B (en) | 2013-12-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102237978B (en) | Collaborative link establishment and maintenance method and related device | |
| US11856500B2 (en) | Apparatus and method of system information transmission and reception on a carrier supporting multiple bandwidth parts | |
| EP3342236B1 (en) | Transmission and reception of repeated scheduling requests | |
| KR101269550B1 (en) | Communication method and system for sensor network | |
| CN102123399B (en) | Scheduling request method and device | |
| CN110574482A (en) | Method and apparatus for performing random access procedure | |
| CN102077627B (en) | Uplink signal processing method, base station and user terminal | |
| WO2017050184A1 (en) | Mehod for transmitting and receiving system information and transmitting and receiving devices | |
| KR20160042936A (en) | Method and system for initial synchronization and collision avoidance in device to device communications without network coverage | |
| CN107872898B (en) | Single-cell multicast service receiving and sending method, user equipment and base station | |
| JP2018528694A (en) | Method for indicating resources allocated to a HARQ message in a random access procedure for a low complexity narrowband terminal | |
| US20130315120A1 (en) | Cqi reporting method, cqi acquistion method, system, terminal and base station | |
| WO2015018353A1 (en) | Paging method, paging message obtaining method, base station, and terminal | |
| WO2019105291A1 (en) | Communication between terminal and base station, and network access method and apparatus for terminal | |
| KR20210068475A (en) | Method and apparatus for system information (SI) change notification in unlicensed carrier | |
| JP2009528758A (en) | Clear channel reporting and isolated node support in wireless networks | |
| CN102972077A (en) | Method and apparatus for detection and resolution of resource collision in a peer-to-peer network | |
| CN111385819B (en) | DCI transmission method, terminal and network side equipment | |
| CN103796320A (en) | Schedule requesting method and device | |
| US20130124937A1 (en) | Method and apparatus for transmitting data in device-to-device service system | |
| CN113330816A (en) | Method and apparatus for radio link monitoring and radio link failure in sidelink communications | |
| CN112189351A (en) | Wireless link monitoring for sidelink communications | |
| CN111464953B (en) | Resource and carrier reselection method and device | |
| CN112867176A (en) | Communication method, apparatus and storage medium | |
| JP5950071B1 (en) | Method and apparatus for communication device to send discovery signal |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |