CN104994555B - A kind of low complex degree relay selection method in vehicle-carrying communication network - Google Patents
A kind of low complex degree relay selection method in vehicle-carrying communication network Download PDFInfo
- Publication number
- CN104994555B CN104994555B CN201510405428.9A CN201510405428A CN104994555B CN 104994555 B CN104994555 B CN 104994555B CN 201510405428 A CN201510405428 A CN 201510405428A CN 104994555 B CN104994555 B CN 104994555B
- Authority
- CN
- China
- Prior art keywords
- node
- relay node
- relay
- period
- information
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
Abstract
The invention discloses the low complex degree relay selection methods in a kind of vehicle-carrying communication network, include the following steps：In the relay selection stage, source node is according to each S → RkThe channel information of link and corresponding relay node RkDecoding cases in previous cooperation cycle select the forward relay node in current cooperative period and retransmit relay node N；In transmission time slot 1, source node will need the information transmitted to be sent in the forward relay node that step 2) chooses, retransmitting relay node simultaneously needs the information transmitted to be forwarded in destination node source node in a upper cooperation cycle, destination node merges the information that the needs that the re-transmission relay node of information and current cooperative period that needs of the forward relay node forwarding of previous cooperation cycle transmit forwards transmit, then again to the information after merging into row decoding.The complexity of the present invention is low, and can effectively improve error performance.
Description
Technical field
The invention belongs to wireless communication technology field, it is related to the low complex degree relay selection side in a kind of vehicle-carrying communication network
Method.
Background technology
Vehicle-carrying communication network (also known as car networking) is a kind of important application form of Internet of Things, it passes through on a vehicle
It is equipped with the intelligent terminal with communication capacity so that the vehicles can be connected with each other and realize information exchange in the process of moving.
Car networking can effectively enhance travel safety, promote traffic administration efficiency, provide instant messaging services, therefore deep in recent years
It is paid close attention to by academia and industrial quarters.In car networking, the communication between vehicle is usually completed in a multi-hop fashion, and transmission is needed to disappear
Cease and need the vehicle for receiving message to be known respectively as source node and destination node, and during remaining vehicle on road is then considered as
After node, they can form virtual multi-antenna array and source node and destination node is helped to complete information transmission.In order to fill
Divide using more relayings provided diversity gain and spatial multiplexing gain, the concept of collaboration communication is come into being.By going deep into for many years
Research, has emerged a large amount of cooperation transmission agreement, for example, network code, distributed space-time code, distributed beams shape,
Etc..
The common feature of above-mentioned collaboration protocols is, they are required to necessary when transmitting information between each relay node
Stringent synchronization is kept, this is difficult to realize in practice.For this purpose, Bletsas et al. proposes a kind of " opportunistic relay " strategy,
The strategy only selects a best relay node in each cooperation cycle, by the node complete source node and destination node it
Between cooperation transmission, and select the foundation of " best " relaying to be：Instantaneous channel state information (the channel of each repeated link
state information,CSI).It can be proved by stringent mathematical analysis, the strategy item certain in system total power
There is minimum outage probability under part.
However, there are certain difficulties in terms of Project Realization for " opportunistic relay " strategy.This is mainly based upon at following 2 points
Reason：First, distributed implementation can lead to the problem of data collision, fail so as to cause relay selection process；Second,
The implementation of centralization requires continuous channel feedback, to cause the decline of efficiency of transmission and bring swashing for transmission power consumption
Increase.For this purpose, Krikidis et al. propose a kind of " part relay selection " scheme (partial relay selection,
PRS), the program selects " best " relaying merely with the channel state information between source node and relay node, is relayed without considering
Channel quality between node and destination node, to significantly reduce the required channel estimation amount of system and CSI feedback
Expense.
Although PRS schemes have lower implementation complexity, lot of documents is studies have shown that the program can be obtained point
It is only 1 to collect exponent number, and this result can't change with the increase of relay node number, this means that in real system
Middle PRS schemes will embody excessively poor error performance.And in car networking application, the business transmitted often all has more
Stringent service quality (quality of service, QoS) demand, therefore PRS schemes can not directly apply to vehicle-carrying communication
Network.
In view of the above-mentioned problems, the present invention proposes a kind of new low complex degree relay selection scheme, the program is based only upon source
Channel power gain (rather than complete channel information) between node and relay node carries out relay selection, maintains the side PRS
The advantage of case low complex degree；Meanwhile additional fading paths are provided by introducing non orthogonal transmissions mechanism, to be system band
Carry out diversity gain and improves error performance.
Invention content
It is an object of the invention to overcome the above-mentioned prior art, provide low multiple in a kind of vehicle-carrying communication network
Miscellaneous degree relay selection method, the complexity of this method is low, and can effectively improve error performance.
In order to achieve the above objectives, the low complex degree relay selection method in vehicle-carrying communication network of the present invention includes such as
Lower step：
1) in vehicle-carrying communication network, the information transmission of each source node to destination node is made of M cooperation cycle, will
Each cooperation cycle is divided into relay selection stage and data transfer phase, and by the data transfer phase be divided into transmission gap 1 and
Transmission gap 2；
2) in the relay selection stage, source node is according to each S → RkThe channel information of link and corresponding relay node Rk
Decoding cases in previous cooperation cycle select the forward relay node in current cooperative period and retransmit relay node, wherein 1
The quantity of≤k≤N, relay node are N；
3) in transmission time slot 1, source node will need the information transmitted to be sent to the forward relay that step 2) chooses
In node, while retransmitting relay node and needing the information transmitted to be forwarded to destination node source node in a upper cooperation cycle
In, destination node merges the information and current cooperative week that the needs of the forward relay node forwarding of previous cooperation cycle transmit
The information transmitted of needs of the re-transmission relay node forwarding of phase, then again to the information after merging into row decoding；
In transmission time slot 2, the forward relay node in current cooperative period uses decode-forward protocol by the current association
The information for making to need to transmit in the period is sent to destination node, while the current cooperative period is needed the information transmitted to turn by source node
It is sent in each relay node.
Source node is according to each S → R in step 2)kThe channel information of link and corresponding relay node RkIn previous cooperation week
The concrete operations that decoding cases in phase select the forward relay node in current cooperative period are：
Source node S is to each relay node RkBroadcast pilot sequence, relay node RkIt is estimated based on the pilot frequency sequence received
Link S → RkChannel gain, then link S → R for will estimatingkChannel gain feed back to source node S, source node S is according to estimating
Link S → the R counted outkChannel gain judge each S → RkThe SNR of link, and select the corresponding relay nodes of maximum S/N RAs forward relay node.
Source node is according to each S → R in step 2)kThe channel information of link and corresponding relay node RkIn previous cooperation week
The concrete operations for turning relay node again that decoding cases in phase select the current cooperative period are：
The relay node composition for the message that the needs that decoding success source node forwards in previous cooperation cycle transmit is translated
Code collection, when the forward relay node in previous cooperation cycle belongs to the decoding set, and in the forwarding of the previous cooperation cycle
When node is not the forward relay node in current cooperative period, then using the forward relay node of the previous cooperation cycle as working as
The re-transmission relay node of preceding cooperation cycle, otherwise, source node is from forwarding of the random selection except the current cooperative period in decoding set
Any one relay node except node is as re-transmission relay node.
The invention has the advantages that：
Low complex degree relay selection method in vehicle-carrying communication network of the present invention in operation, source node root
According to each S → RkThe channel information of link and corresponding relay node RkDecoding cases in previous cooperation cycle are selected currently
The forward relay node and re-transmission relay node of cooperation cycle, rather than according to complete channel information, in effectively reducing
After the complexity of node selection, while destination node first merges the forward relay section of previous cooperation cycle when into row decoding
The information that the needs for turning relay node forwarding again of information and current cooperative period that the needs of point forwarding transmit transmit, then
According to the result after merging into row decoding, effectively improve error performance, so as to be passed for the data in vehicle-carrying communication network
It is defeated that reliable QoS guarantees are provided.After testing, the diversity order of traditional PRS strategies is only 1, however what the present invention can obtain
Diversity order is 2, therefore compared with traditional PRS strategies, and the present invention has more superior interruption performance and error performance.
Description of the drawings
Fig. 1 is the system model schematic diagram of the present invention；
Fig. 2 (a) is the schematic diagram of transmission time slot 1 in the present invention；
Fig. 2 (b) is the schematic diagram of transmission time slot 2 in the present invention；
Fig. 3 is the relation curve changed with average signal-to-noise ratio using the outage probability of conventional measures and the present invention；
Fig. 4 is using the relation curve that bit error rate changes with average signal-to-noise ratio in conventional measures and the present invention；
Fig. 5 is the outage probability curve of present invention system in different relay node numbers.
Specific implementation mode
The present invention is described in further detail below in conjunction with the accompanying drawings：
With reference to figure 1, the low complex degree relay selection method in vehicle-carrying communication network of the present invention includes the following steps：
1) in vehicle-carrying communication network, the information transmission of each source node to destination node is made of M cooperation cycle, will
Each cooperation cycle is divided into relay selection stage and data transfer phase, and by the data transfer phase be divided into transmission gap 1 and
Transmission gap 2；
2) in the relay selection stage, source node is according to each S → RkThe channel information of link and corresponding relay node Rk
Decoding cases in previous cooperation cycle select the forward relay node in current cooperative period and retransmit relay node, wherein 1
The quantity of≤k≤N, relay node are N；
3) in transmission time slot 1, source node will need the information transmitted to be sent to the forward relay that step 2) chooses
In node, while retransmitting relay node and needing the information transmitted to be forwarded to destination node source node in a upper cooperation cycle
In, destination node merges the information and current cooperative week that the needs of the forward relay node forwarding of previous cooperation cycle transmit
The information transmitted of needs of the re-transmission relay node forwarding of phase, then again to the information after merging into row decoding；
In transmission time slot 2, the forward relay node in current cooperative period uses decode-forward protocol by the current association
The information for making to need to transmit in the period is sent to destination node, while the current cooperative period is needed the information transmitted to turn by source node
It is sent in each relay node.
Source node is according to each S → R in step 2)kThe channel information of link and corresponding relay node RkIn previous cooperation week
The concrete operations that decoding cases in phase select the forward relay node in current cooperative period are：
Source node S is to each relay node RkBroadcast pilot sequence, relay node RkIt is estimated based on the pilot frequency sequence received
Link S → RkChannel gain, then link S → R for will estimatingkChannel gain feed back to source node S, source node S is according to estimating
Link S → the R counted outkChannel gain judge each S → RkThe SNR of link, and select the corresponding relay nodes of maximum S/N RAs forward relay node.
Source node is according to each S → R in step 2)kThe channel information of link and corresponding relay node RkIn previous cooperation week
The concrete operations for turning relay node again that decoding cases in phase select the current cooperative period are：
The relay node composition for the message that the needs that decoding success source node forwards in previous cooperation cycle transmit is translated
Code collection, when the forward relay node in previous cooperation cycle belongs to the decoding set, and in the forwarding of the previous cooperation cycle
When node is not the forward relay node in current cooperative period, then using the forward relay node of the previous cooperation cycle as working as
The re-transmission relay node of preceding cooperation cycle, otherwise, source node is from forwarding of the random selection except the current cooperative period in decoding set
Any one relay node except node is as re-transmission relay node.
In order to illustrate the advantage that the present invention is suggested plans, we divide the performance of system using outage probability as index
Analysis, we will derive the outage probability of tradition PRS strategies first, then derive the outage probability of the present invention, in addition, dividing for simplifying
The purpose of analysis, the influence that will not consider that relay well interferes with each other in the analysis process.
One, the outage probability analysis of traditional scheme：
For the double jump DF cooperative systems considered, thinks that system is in when any one jump Transmission and interrupt
State, therefore, the outage probability of system is：
Wherein, k*For the optimal relay node selected, gi,jSquare channel gain between node i and node j, γ are
Snr threshold is defined as：
It is tactful according to PRS,WithCumulative distribution function (cumulative distribution
Function, CDF) it is expressed as：
F1(x)=(1-e-λx)NU(x) (3)
F2(x)=(1-e-λx)U(x) (4)
Wherein, U () is unit jump function, thenCDF be：
F (x)=1- [1-F1(x)]×[1-F2(x)] (5)
Outage probability in formula (1) is：
Pr (outage)=1- [1- (1-e-λγ)N]e-λγ (6)
In average signal-to-noise ratio, higher and N is prodigious, and formula (6) can be approximately：
By formula (7) it is found that the diversity order of traditional PRS strategies is only 1, therefore there is excessively poor end-to-end interruptibility
Energy and error performance.
Two, outage probability of the invention analysis：
In order to analyze the outage probability suggested plans, it is contemplated that continuous two cooperation cycles m and m+1, and
And the forward relay node in the two cooperation cycles is expressed as i and j, then have, two tuples (i, a j) shared N2Kind is not
Same combination, and probability of each combination is 1/N2, use mark p=1 ..., N2Each combination is represented, then system
Outage probability can be expressed as：
Using total probability formula, then the condition break-point probability in formula (8) can be expressed as：
Wherein,
Pr(gs,i<γ)=(1-e-λγ)N (10)
Pr(gs,i>γ)=1- (1-e-λγ)N (11)
Because of RiFor forward relay node, so it has channel quality of best source node-relay node；And work as
When any jump of multihop system is in interrupt status, then it is assumed that whole system is interrupted, therefore, if S → RiIn link
It is disconnected, then destination node and any relay node all can not correct decoding, in this way we just have：
Pr(outage|gs,i<γ)=1 (12)
Use DfIndicate comprising retransmit relay node node set, then Pr (outage | gs,i>It can γ) be expressed as
Whether the concrete outcome of formula (13) is equal depending on i and j, for this purpose, we will discuss in two kinds of situation.
Situation 1：I=j
For situation 1,Mean in m-th of cooperation cycle, in addition to RiExcept there is no any relaying that can solve
The information of code S, therefore：
If DfIt is empty set, destination node just can only be according to from RiSignal that → D links receive is completed to decode, to：
According to total probability formula, last of (13) formula can be expressed as：
Wherein, | A | the gesture of set A is represented, only having t relay node to be correctly decoded the probability of source node identification just can be with
It is expressed as：
According to the specific descriptions to scheme it is found that in this case, system will be with equal probability from DfIn select at random
It selects a node u and carrys out retransmission source node signal, then have：
Merge (14)~(19), obtains the condition break-point probability of 1 time system of situation.
Situation 2：i≠j
To situation 2, select to simple system node i as relay node is retransmitted, then formula (13) can be reduced to：
For whole N of two tuples (i, j)2For kind combination, the combination of N kinds belongs to situation 1, remaining combination belongs to situation
2, therefore, carrying the outage probability of strategy can be expressed as
Wherein, x=1-e-λγ, y=1-e-λγ-λγe-λγ。
When N tends to infinity, the outage probability given by formula (21) converges on y, and under the conditions of high s/n ratio, it can
To be approximately：
Above formula (22) it is found that the diversity order that can obtain of the present invention is 2, this result and formula (7) are compared it is found that
Compared with traditional PRS schemes, the present invention has more superior interruption performance.
Emulation experiment
With reference to figure 3, simulation parameter used herein above is：λ=1, N=4, R=1bit/s/Hz, by Fig. 3 it can be seen that,
Notional result and numerical result coincide substantially, to show that above-mentioned theory analysis is correct.In addition by slope of a curve in Fig. 3
It is found that by using the present invention, system can obtain significant diversity gain.
With reference to figure 4, it is assumed that system using BPSK modulate, relay node number be 4, Fig. 4's the result shows that：It can using the present invention
So that system obtains second-order diverse, under the conditions of high s/n ratio, compared with traditional PRS strategies, carry tactful BER can under
An order of magnitude drops.
With reference to figure 5, simulation parameter is：λ=1, R=1bit/s/Hz, by increasing the value of N, the performance of system will obtain
Improve；However as N >=3, this gain can be progressively smaller until disappearance, then illustrate, for there is no the double jump of tie link associations
Make for system, only need to find 2~3 relay nodes and selected among them, without largely waiting
It selects and implements relay selection algorithm, due to only being selected between a small amount of relay node, caused volume in relay collection
Overhead is seldom, to be conducive to Project Realization.
Claims (3)
1. the low complex degree relay selection method in a kind of vehicle-carrying communication network, which is characterized in that include the following steps：
1) in vehicle-carrying communication network, the information transmission of each source node to destination node is made of M cooperation cycle, by each association
It is divided into relay selection stage and data transfer phase as the period, and the data transfer phase is divided into transmission gap 1 and transmission
Gap 2；
2) in the relay selection stage, source node is according to each S → RkThe channel information of link and corresponding relay node RkPrevious
Decoding cases in cooperation cycle select the forward relay node in current cooperative period and retransmit relay node, wherein 1≤k
The quantity of≤N, relay node are N；
3) in transmission time slot 1, source node will need the information transmitted to be sent to the forward relay node that step 2) chooses
In, while retransmitting relay node and needing the information transmitted to be forwarded in destination node source node in a upper cooperation cycle, mesh
Node merge previous cooperation cycle forward relay node forwarding the information transmitted of needs and the current cooperative period
The information transmitted of needs of relay node forwarding is retransmitted, then again to the information after merging into row decoding；
In transmission time slot 2, the forward relay node in current cooperative period is all by the current cooperative using decode-forward protocol
The information transmitted is needed to be sent to destination node in phase, while the current cooperative period is needed the information transmitted to be forwarded to by source node
In each relay node.
2. the low complex degree relay selection method in vehicle-carrying communication network according to claim 1, which is characterized in that step
2) source node is according to each S → R inkThe channel information of link and corresponding relay node RkDecoding feelings in previous cooperation cycle
The concrete operations that condition selects the forward relay node in current cooperative period are：
Source node S is to each relay node RkBroadcast pilot sequence, relay node RkEstimate outgoing link based on the pilot frequency sequence received
S→RkChannel gain, then link S → R for will estimatingkChannel gain feed back to source node S, source node S is according to estimating
Link S → RkChannel gain judge each S → RkThe SNR of link, and select the corresponding relay node R of maximum S/N Rk*As
Forward relay node.
3. the low complex degree relay selection method in vehicle-carrying communication network according to claim 1, which is characterized in that step
2) source node is according to each S → R inkThe channel information of link and corresponding relay node RkDecoding feelings in previous cooperation cycle
The concrete operations that condition selects the re-transmission relay node in current cooperative period are：
The relay node for the message that the needs that decoding success source node forwards in previous cooperation cycle are transmitted forms decoding set,
When the forward relay node in previous cooperation cycle belongs to the decoding set, and the forward relay node of the previous cooperation cycle
When not being the forward relay node in current cooperative period, then using the forward relay node of the previous cooperation cycle as current cooperative
The re-transmission relay node in period, otherwise, source node randomly choose the forward relay node except the current cooperative period from decoding set
Except any one relay node as retransmit relay node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510405428.9A CN104994555B (en) | 2015-07-10 | 2015-07-10 | A kind of low complex degree relay selection method in vehicle-carrying communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510405428.9A CN104994555B (en) | 2015-07-10 | 2015-07-10 | A kind of low complex degree relay selection method in vehicle-carrying communication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104994555A CN104994555A (en) | 2015-10-21 |
| CN104994555B true CN104994555B (en) | 2018-08-10 |
Family
ID=54306286
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510405428.9A Active CN104994555B (en) | 2015-07-10 | 2015-07-10 | A kind of low complex degree relay selection method in vehicle-carrying communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104994555B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105657776B (en) * | 2016-03-31 | 2017-12-29 | 安阳师范学院 | Collaboration communication method in honeycomb VANET heterogeneous networks |
| CN109327821B (en) * | 2018-11-16 | 2021-06-04 | 武汉科技大学 | Message propagation method combining social contact of vehicles in Internet of vehicles |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102333367A (en) * | 2011-10-25 | 2012-01-25 | 上海大学 | Transmission power allocation method for cooperative communication system |
| CN103561447A (en) * | 2013-11-08 | 2014-02-05 | 山东大学 | Increment mixing decoding amplification forwarding cooperation method based on opportunistic relaying |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9179468B2 (en) * | 2010-12-02 | 2015-11-03 | Lg Electronics Inc. | Method for avoiding inter-cell interference in wireless access system |
-
2015
- 2015-07-10 CN CN201510405428.9A patent/CN104994555B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102333367A (en) * | 2011-10-25 | 2012-01-25 | 上海大学 | Transmission power allocation method for cooperative communication system |
| CN103561447A (en) * | 2013-11-08 | 2014-02-05 | 山东大学 | Increment mixing decoding amplification forwarding cooperation method based on opportunistic relaying |
Non-Patent Citations (3)
| Title |
|---|
| A Simple Cooperative Diversity Method Based on Network Path Selection;BLETSAS,Aggelos 等;《IEEE Journal on Selected Areas in Communications》;20060306;全文 * |
| Amplify-and-Forward with Partial Relay Selection;KRIKIDIS,Ioannis 等;《IEEE Communications Letters》;20080415;全文 * |
| 一种增强型选择放大转发机会协作分集协议;任品毅 等;《西安交通大学学报》;20100831;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104994555A (en) | 2015-10-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104507144B (en) | Wireless take can junction network joint relay selection and resource allocation methods | |
| CN102438235B (en) | Method for selecting optimal distributed type interference source in mobile collaborative network | |
| CN103561447A (en) | Increment mixing decoding amplification forwarding cooperation method based on opportunistic relaying | |
| CN103763015B (en) | It is a kind of to have transmission antenna system of selection in the multiple antennas junction network of direct connected link | |
| CN101399583A (en) | Collaboration partner selection and pre-coding collaboration communication method in cellular communication system | |
| CN105375955A (en) | Cooperative transmission method in simultaneous wireless information and power transfer relay network | |
| CN103428803B (en) | A kind of chance method for routing of combination machine meeting network code | |
| CN101848060B (en) | Self-adaptive cooperation relay method through network coding | |
| CN101695056A (en) | Routing method based on inter-session network coding in underwater sound communication network | |
| CN103167587B (en) | A kind of relay node selecting method of relaying cooperation mobile communication system | |
| CN106533514B (en) | The working method of collaboration space modulating system based on IHDAF | |
| CN106921418A (en) | A kind of relay cooperative method for precoding based on imperfect channel state information | |
| CN103475441A (en) | Cooperative interference transmission method based on clusters in wireless multi-hop network | |
| CN102378122B (en) | The system of selection of self adaptation multicast transmission mechanism | |
| CN101174878B (en) | Method and system for implementing mixed self-adapting retransmission | |
| CN102545992A (en) | Optimal relay selection and power distribution method of DF (decode-forward) relay system | |
| CN101755395B (en) | Relay and method for transmitting data | |
| CN104994555B (en) | A kind of low complex degree relay selection method in vehicle-carrying communication network | |
| CN101364857A (en) | Wireless sensor network node collaboration method based on feedback channel | |
| CN102208962A (en) | Wireless data transmission method | |
| CN102300234B (en) | Novel multi-hop routing transmission method | |
| CN105430709A (en) | Relay selection and power distribution method in multisource and multi-objective wireless network | |
| CN103298139B (en) | Dynamic distributed cut-in method and the system of cooperating as required | |
| CN105119858A (en) | Interference avoiding method based on constellation rotation in collaborative D2D transmission system | |
| CN104852793A (en) | Virtual full-duplex relay transmission method based on half-duplex multipath cooperative system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |