CN103096413A - Multi-interface multi-hop wireless network lower-distribution type cooperation route method - Google Patents
Multi-interface multi-hop wireless network lower-distribution type cooperation route method Download PDFInfo
- Publication number
- CN103096413A CN103096413A CN 201310055368 CN201310055368A CN103096413A CN 103096413 A CN103096413 A CN 103096413A CN 201310055368 CN201310055368 CN 201310055368 CN 201310055368 A CN201310055368 A CN 201310055368A CN 103096413 A CN103096413 A CN 103096413A
- Authority
- CN
- China
- Prior art keywords
- node
- data flow
- capacity
- network
- path section
- 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 discloses a multi-interface multi-hop wireless network lower-distribution type cooperation route method. The method comprises a multi-interface multi-hop cooperation wireless network, cooperation transmission and direct transmission between nodes of the cooperation wireless network can be used, a distributed type cooperation route method is designed in the multi-interface multi-hop cooperation wireless network, by means of the method, a cooperation route way can be found for each data stream, network interfaces can be reasonably distributed in multiple data streams, and therefore the effect of maximum smallest network data stream handling capacity can be achieved.
Description
Technical field
The present invention relates to field of wireless, particularly relate to the wireless network of supporting cooperative communication technology, be specially distributed collaborative method for routing under a kind of many interfaces multi-hop wireless network.
Background technology
MIMO(Multiple Input Multiple Output) technology utilizes many antennas to suppress channel fading, is the main flow Performance Optimization technique of Next-Generation Wireless Communication Systems.But the MIMO Technology Need is installed many antennas on network node, has brought the problems such as high complexity, expensive and high energy consumption.Due to wireless network (as multi-hop wireless mesh network, multi-hop wireless ad hoc network, multi-hop wireless sensor network) equipment volume of node and the restriction of hardware cost, the MIMO technology can't directly apply to multi-hop wireless network.
Compare with the MIMO technology, the cooperative communication technology of physical layer (Cooperative Communication) is the space diversity reception to communicate that is suitable for the single antenna user.It utilizes the broadcast characteristic of wireless channel, and the physical resource that allows single antenna terminal equipment to share them in multi-user environment communicates, and forms virtual antenna array.The equipment of participation collaboration communication is forwarding information mutually, and a plurality of duplicates of same information can arrive receiving terminal by separate wireless channel, thereby obtains space diversity gain-collaboration diversity gain.
Simple 3 node cooperation traffic models as Fig. 1.Information source S and cooperative node R form separate communication channel.A plurality of signal duplicates that transmitting terminal sends arrive receiving terminal by separate channel, just can produce diversity gain.According to the Different treatments of cooperative node to signal, mainly there are at present 2 kinds of collaboration diversity schemes: amplify-forward (AF, amplify and forward), decoding-forwarding (D F, decode and forward).As a kind of effective ways that can overcome channel fading, improve transmission capacity and reliability, extended coverage range and the consumption of reduction energy, the advantage of collaboration communication in the single-hop wireless network confirmed, yet collaboration communication is applied to multi-hop wireless network, remains and have challenging problem.
Physical layer cooperative communication technology and network layer Route Selection in conjunction with design cross-layer routing scheme-cooperation route, are become the solution that collaboration communication is applied to multi-hop wireless network.This scheme takes full advantage of the broadcast characteristic of wireless channel, a plurality of nodes is formed the collaboration communication module select optimal path, makes same information can arrive by different independent wireless channels the down hop of route.Like this, even in the situation that channel condition is more abominable, still can guarantee the high reliability of network, keep good network performance.Be illustrated in figure 2 as a kind of typical cooperation routing plan, data are from source node S process multi-hop transmission to destination node D.Wherein cooperation transmission (CT) and direct transmission (DT) have consisted of the elementary cell of route, as node 3,4,5 consist of a collaboration communication module (node 3 can pass through 3-〉5 and 3-4-5 two-way transmit data to node 5), node 6,7,8,9 also consist of a collaboration communication module.
The cooperation route more and more causes researcher's attention as exploring the trial of cooperative communication technology in multihop network.Realize the difference of purpose according to it, existing cooperation route mainly can be divided into energy-optimised cooperation route, the cooperation route that Transmission is optimized, the cooperation route of propagation delay time optimization and the cooperation route that transmission rate is optimized etc.
The multi-interface wireless network can be equipped with many interfaces for each radio node.Existing studies show that, than single interface network, many interface networks can improve transmission performance and reliability.Yet existing cooperative routing method mainly concentrates on single interface multi-hop wireless network, and the cooperative routing method under many interfaces of research multihop network environment has challenge.
The multi-interface wireless network can provide more resource for collaboration communication and cooperation route, makes node can have larger space to select down hop forward node and collaboration relay node in the process that sends data.In many interfaces cooperative wireless network network, a plurality of interfaces of node both can have been served some data flow and directly transmitted, and can be that the other data flow is carried out the collaboration communication service as collaboration relay node again.How in the situation that a plurality of data flow exist, reasonably the interface in node is carried out interface assignment in a plurality of data flow, joint relay selection designs distributed collaborative method for routing under many interface networks, become and have challenging problem, also become the key and the difficult point that realize collaboration communication in the many interface networks of multi-hop.
Summary of the invention
Technical problem to be solved by this invention is, not enough for prior art, distributed collaborative method for routing under a kind of many interfaces multi-hop wireless network is provided, distributed earth is that many data flow in network are selected optimum cooperation route, determine simultaneously the reasonable distribution of a plurality of interfaces in many data flow of wireless network, thereby maximize the end-to-end throughput of minimal network data flow.
For solving the problems of the technologies described above, the technical solution adopted in the present invention is: distributed collaborative method for routing under a kind of many interfaces multi-hop wireless network, and the method is:
1) calculate the link capacity that carries out direct transmission between each network node i and its each neighbor node j, calculate each network node i and its neighbor node j and adopt the link capacity of cooperation transmission by node k, wherein, j ∈ N (i), N (i) is all neighbor node set of node i, k ∈ N (i) and k ≠ j;
The maximum of 2) getting all capability values that step 1) calculates is link (i, j) link capacity, if the capacity of link (i, j) adopts cooperation transmission to reach by node k, node i, j, k consists of the cooperation transmission module, and link (i, j) adopts the cooperation transmission mode, otherwise link (i, j) just adopts direct mode;
3) source node and the destination node of data-oriented stream are with step 2) in the link capacity of (i, the j) that calculate be applied in distributed Bellman-Ford shortest path first, in network, each node i iteration is carried out
Obtain node i to the end-to-end capacity of destination node, wherein P
jThe end-to-end capacity of representative from node j to destination node, P
I, jStep 2) link capacity of the link (i, j) that calculates, after too much wheel iteration, the source node of data flow has just obtained maximum path end to end and capacity, and selecting this path is initial cooperation routed path;
4) each network node i statistics participates in the number of times of data flow cooperation route, be designated as L (i), the size that compares L (i) and R (i), wherein R (i) is the number of the network interface of node i configuration, if L (i)＜R (i), node i is network interface of distribution of flows of every process; Otherwise enter step 5);
5) for any data flow p by network node i, initial cooperation routed path selected according to step 3) determined the upper hop node j of node i
pWith next-hop node k
p, the current path of note data flow is Opt
p(j
p, k
p), at node j
pWith node k
pBetween select a not backup path section Can by node i
p(j
p, k
p), and the node in this backup path section do not comprise the number of times that participates in data flow cooperation route greater than the node of the network interface number that configures, p ∈ Flow (i) wherein, and Flow (i) expression is by the set of data flows of node i;
6) statistics is through the data flow number of the middle backup path section capacity of all data flow Flow (i) of network node i greater than the end-to-end capacity of this data flow, be designated as n1, statistics equals the data flow number of the end-to-end capacity of this data flow through backup path section capacity in all Flow (i) of network node i, be designated as n2, statistics less than the data flow number of the end-to-end capacity of this data flow, is designated as n3 through backup path section capacity in all Flow (i) of network node i;
7) if 0≤n2+n3≤R (i), network node i selects L(i in all Flow (i) set)-R (i) bar backup path section capacity switches greater than the data flow of the end-to-end capacity of this data flow, with this data flow from current path section Opt
p(j
p, k
p) switch to corresponding backup path section Can
p(j
p, k
p), otherwise n2+n3 R (i), enter step 8);
8) network node i is at first with all backup path section Can
p(j
p, k
p) capacity switches to corresponding backup path section greater than the data flow of the end-to-end capacity of this data flow, then remaining n2+n3 bar data flow is carried out ascending order by corresponding backup path section capacity and arrange, n2+n3-R(i the preceding then will sort) the bar data flow is from current path section Opt
p(j
p, k
p) switch to corresponding backup path section Can
p(j
p, k
p).
Compared with prior art, the beneficial effect that the present invention has is: method of the present invention can distributed earth be the cooperation routes of many data flow selection optimums in network, determine simultaneously the reasonable distribution of a plurality of interfaces in many data flow of wireless network, thereby maximize the end-to-end throughput of minimal network data flow.
Description of drawings
Fig. 1 is collaboration communication model schematic diagram;
Fig. 2 is cooperation routing principle schematic diagram;
Fig. 3 is that in inventive method, step 3) obtains initially to cooperate routed path by alternative manner; Fig. 3 (a) obtains the network diagram after link capacity; Fig. 3 (b) first round iteration; Fig. 3 (c) second takes turns iteration; Fig. 3 (d) third round iteration; Fig. 3 (e) fourth round iteration; Fig. 3 (f) the 5th takes turns iteration; Fig. 3 (g) the 6th takes turns iteration; Fig. 3 (h) the 7th takes turns iteration;
Fig. 4 is that the data flow path section is adjusted example 1; Before Fig. 4 (a) cooperation route is adjusted; The backup path section of each route of Fig. 4 (b); After Fig. 4 (c) cooperation route is adjusted;
Fig. 5 is that the data flow path section is adjusted example 2; Before Fig. 5 (a) cooperation route is adjusted; The backup path section of each route of Fig. 5 (b); After Fig. 5 (c) cooperation route is adjusted;
Fig. 6 is the route results schematic diagram of same network topology under the different experiments configuration; Fig. 6 (a) is CFRRA-MR-CC route results schematic diagram; Fig. 6 (b) is DFRRA-MR-CC route results schematic diagram; Fig. 6 (c) is CRS-TDMA-MR-CC route results schematic diagram.
Embodiment
Method of the present invention comprises the following steps:
Step 1: each network node i calculate it with each neighbor node j between carry out the link capacity that directly transmits, here j ∈ N (i), N (i) is all neighbor node set of node i, each network node i also need calculate it in addition and neighbor node j adopts the link capacity of cooperation transmission, k ∈ N (i) and k ≠ j here by node k;
Step 2: link (i, j) the link capacity value between is the maximum of all capability values of calculating of step 1, if the capacity of link (i, j) helps lower employing cooperation transmission to reach by other node k, node i, j, k consists of the cooperation transmission module, and link (i, j) adopts the cooperation transmission mode, otherwise link (i, j) just adopts direct mode;
Step 3: source node and the destination node of data-oriented stream, the link capacity that calculates in step 2 is applied in distributed Bellman-Ford shortest path first, because the end-to-end capacity of network data flow depends on the minimum link capacity of multi-hop link in this data flow, therefore, in network, each node i iteration is carried out
Obtain node i to the end-to-end capacity of destination node, P here
jThe end-to-end capacity of representative from node j to destination node, P
I, jBe the link capacity of the link (i, j) that calculates of step 2, after too much wheel iteration, the source node of data flow has just obtained path and the capacity of maximum end-to-end arrival destination node, and selecting this path is initial cooperation routed path;
Step 4: each network node i statistics participates in the number of times of data flow cooperation route, be designated as L (i), the size that compares L (i) and R (i), wherein R (i) is the number of the network interface of node i configuration, if L (i)＜R (i), node i can be network interface of distribution of flows of every process, otherwise enters step 5;
Step 5: for any data flow p ∈ Flow (i) by node i, Flow (i) expression is by the set of data flows of node i, and initial cooperation route selected according to step 3 determined the upper hop node j of node i
pWith next-hop node k
p, the current path of note data flow is Opt
p(j
p, k
p), at node j
pWith node k
pBetween select a not backup path section Can by node i
p(j
p, k
p), and the node in this backup path section does not comprise the number of times of participation data flow cooperation route greater than the node of the network interface number that configures;
Step 6: statistics is through the data flow number of the middle backup path section capacity of all data flow Flow (i) of node i greater than the end-to-end capacity of this data flow, be designated as n1, statistics equals the data flow number of the end-to-end capacity of this data flow through backup path section capacity in all Flow (i) of i, be designated as n2, statistics less than the data flow number of the end-to-end capacity of this data flow, is designated as n3 through backup path section capacity in all Flow (i) of i;
Step 7: if 0≤n2+n3≤R (i), node i is selected L(i in all Flow (i) set)-R (i) bar backup path section capacity switches greater than the data flow of the end-to-end capacity of this data flow, with this data flow from current path section Opt
p(j
p, k
p) switch to corresponding backup path section Can
p(j
p, k
p), otherwise n2+n3 R (i), enter step 8;
Step 8: node i is at first with all backup path section Can
p(j
p, k
p) capacity switches to corresponding backup path section greater than the data flow of the end-to-end capacity of this data flow, then remaining n2+n3 bar data flow is carried out ascending order by corresponding backup path section capacity and arranges, then will sort at front n2+n3-R(i) the bar data flow is from current current path section Opt
p(j
p, k
p) switch to corresponding backup path section Can
p(j
p, k
p).
Fig. 3 is that operating procedure of the present invention 3 obtains cooperate the at first process of route of data flow, and the value of every hop link mark is exactly the heap(ed) capacity of this hop link communication.Fig. 3 (a) has represented the init state of network.Fig. 3 (b)-Fig. 3 (h) has shown each iterative process in step 3.In each iterative process, around node, red value just represents present node i to the end-to-end capacity of the maximum of destination node d, and arrow represents optimal path.Fig. 3 (h) is for executing the operation result of cooperation route selection method after last node.
When node participated in data flow cooperation routing times greater than this node interface number, node interface was regulated example 1 and is seen Fig. 4.
In the example of Fig. 4 (a), three data streams are arranged through node w, r
1-r
2(w), r
3-w-r
4, r
5-r
6(w). node w in article one and the 3rd stream as the cooperating relay transmission node, in second stream as forward node.The end-to-end capacity of these three data flow is respectively 25.3,23.8,23.We suppose that the interface data of node w configuration is that therefore we just need one of them data of conversion to flow to its backup path section to R (w)=2..Be depicted as the backup path section of three links as Fig. 4 (b), be respectively r
1-r
2(r7), r
3-r
5(r
8)-r
6-r
4, r
5-r
6, the capacity of corresponding backup path section is respectively 24.1,21.5,22, the end-to-end capacity that flows less than current data respectively.Route segment set-up procedure 4-step 8 according to the present invention, we are with the r of converting data streams 1
1-r
2(w) link is to its backup path section r
1-r
2(r
7), as shown in Fig. 4 (c).After EOC, the capacity of these three data flow is respectively 24.1,23.8,23.
When node participated in data flow cooperation routing times greater than this node interface number, node interface was regulated example 2 and is seen Fig. 5.
In the example of Fig. 5 (a), three data streams are arranged through node w, r
1-r
2(w), r
3-w-r
4, r
5-r
6(w). node w in article one and the 3rd stream as the cooperating relay transmission node, in second stream as forward node.The end-to-end capacity of these three data flow is respectively 25.3,25,24.We suppose that the interface data of node w configuration is that therefore we just need one of them data of conversion to flow to its backup path section to R (w)=2..Be depicted as the backup path section of three links as Fig. 5 (b), be respectively r
1-r
2(r
7), r
3-r
5(r
8)-r
6(r
9)-r
4, r
5-r
6(r
9), the capacity of corresponding backup path section is respectively 27,25.5,25.6, the end-to-end capacity that flows greater than current data respectively.Route segment set-up procedure 4-step 8 according to the present invention, we can select in three data flow to transform at random, the r of converting data streams 3
5-r
6(w) link is to its backup path section r
5-r
6(r
9), as shown in Fig. 5 (c).After EOC, the capacity of these three data flow still is respectively 25.3,25,24.
In multi-hop multi-interface wireless network, also there is no at present ready-made cooperative routing method, so we compare method proposed by the invention in the present embodiment from different network settings.The method one that compares together with method of the present invention has three kinds, the first adopts centralized approach, in the method, the problem that proposes in the present invention is modeled as an integral linear programming problem, and utilize mathematic programming methods to find the solution this problem acquisition optimum cooperation routed path and relay distribution, be designated as CFRRA-MR-CC.Second method is the distributed collaborative method for routing that the present invention proposes, and is designated as DFRRA-MR-CC.In the third method, at first process in accordance with the present invention 1-step 3 is found out initial cooperation routed path, for the number of data streams of nodes service greater than the number of ports destination node that configures, adopt the mode of TDMA that a plurality of interface assignment are used to a plurality of data flow, be designated as CRS-TDMA-MR-CC.
In experiment, network topology as shown in Figure 6, is 1000*1000m in size
2Scope in random generate 18 nodes.Four data flow are arranged here.Table 1 has been listed the speed of many data flow under different experiments.Streaming rate minimum in the distinct methods lower network is respectively 34.83Mb/s, 31.09Mb/s, 22.57Mb/s.
Table 1 experimental result (Mb/s)
As can be seen from Table 1, CFRRA-MR-CC and DFRRA-MR-CC have maximum minimum-rate.The resulting minimum-rate value of distributed collaborative method for routing DFRRA-MR-CC that the present invention proposes is almost close to the minimum-rate of centralized algorithm.Centralized approach can obtain optimal performance, but because centralized approach needs a centralized node to carry out coordination and information gathering that method is carried out, can't effectively implement in multihop network.So the distributed method that the present invention carries has very strong practicality.The minimum-rate of CRS-TDMA-MR-CC only has 75% of DFRRA-MR-CC minimum-rate.This has illustrated that also the interface assignment method of step 4-step 8 in the present invention can effectively solve the resource contention problem between many data flow, and can guarantee the minimum throughout of each data flow.
Claims (1)
1. distributed collaborative method for routing under the interface multi-hop wireless network more than a kind, is characterized in that the method
For:
1) calculate the link capacity that carries out direct transmission between each network node i and its each neighbor node j, calculate each network node i and its neighbor node j and adopt the link capacity of cooperation transmission by node k, wherein, j ∈ N (i), N (i) is all neighbor node set of node i, k ∈ N (i) and k ≠ j;
2) get step 1) maximum of all capability values of calculating is link (i, j) link capacity, if the capacity of link (i, j) adopts cooperation transmission to reach by node k, node i, j, k consists of the cooperation transmission module, and link (i, j) adopts the cooperation transmission mode, otherwise link (i, j) just adopts direct mode;
3) source node and the destination node of data-oriented stream are with step 2) in the link capacity of the link (i, j) that calculates be applied in distributed Bellman-Ford shortest path first, in network, each node i iteration is carried out
Obtain node i to the end-to-end capacity of destination node, wherein P
jThe end-to-end capacity of representative from node j to destination node, P
I, jStep 2) link capacity of the link (i, j) that calculates, after too much wheel iteration, the source node of data flow has just obtained maximum path end to end and capacity, and selecting this path is initial cooperation routed path;
4) each network node i statistics participates in the number of times of data flow cooperation route, be designated as L (i), the size that compares L (i) and R (i), wherein R (i) is the number of the network interface of node i configuration, if L (i)＜R (i), node i is network interface of distribution of flows of every process; Otherwise enter step 5);
5) for any data flow p by network node i, according to step 3) selected initial cooperation routed path, determine the upper hop node j of node i
pWith next-hop node k
p, the current path of note data flow is Opt
p(j
p, k
p), at node j
pWith node k
pBetween select a not backup path section Can by node i
p(j
p, k
p), and the node in this backup path section do not comprise the number of times that participates in data flow cooperation route greater than the node of the network interface number that configures, p ∈ Flow (i) wherein, and Flow (i) expression is by the set of data flows of node i;
6) statistics is through the data flow number of the middle backup path section capacity of all data flow Flow (i) of network node i greater than the end-to-end capacity of this data flow, be designated as n1, statistics equals the data flow number of the end-to-end capacity of this data flow through backup path section capacity in all Flow (i) of network node i, be designated as n2, statistics less than the data flow number of the end-to-end capacity of this data flow, is designated as n3 through backup path section capacity in all Flow (i) of network node i;
7) if 0≤n2+n3≤R (i), network node i selects (L (i)-R (i)) bar backup path section capacity to switch greater than the data flow of the end-to-end capacity of this data flow in all Flow (i) set, with this data flow from current path section Opt
p(j
p, k
p) switch to corresponding backup path section Can
p(j
p, k
p), otherwise (n2+n3) R (i), enter step 8);
8) network node i is at first with all backup path section Can
p(j
p, k
p) capacity switches to corresponding backup path section greater than the data flow of the end-to-end capacity of this data flow, then remaining (n2+n3) bar data flow is carried out ascending order by corresponding backup path section capacity and arrange, (n2+n3-R (i)) the bar data flow that then will sort the preceding is from current path section Opt
p(j
p, k
p) switch to corresponding backup path section Can
p(j
p, k
p).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310055368.3A CN103096413B (en) | 2013-02-21 | 2013-02-21 | Distributed collaborative method for routing under a kind of multiplex roles multi-hop wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310055368.3A CN103096413B (en) | 2013-02-21 | 2013-02-21 | Distributed collaborative method for routing under a kind of multiplex roles multi-hop wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103096413A true CN103096413A (en) | 2013-05-08 |
| CN103096413B CN103096413B (en) | 2016-06-22 |
Family
ID=48208399
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310055368.3A Active CN103096413B (en) | 2013-02-21 | 2013-02-21 | Distributed collaborative method for routing under a kind of multiplex roles multi-hop wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103096413B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103281310A (en) * | 2013-05-09 | 2013-09-04 | 汕头大学 | Cooperative network security transmission method |
| CN103874161A (en) * | 2014-04-03 | 2014-06-18 | 上海扬梓投资管理有限公司 | Path selection method and node device |
| CN104144461A (en) * | 2014-03-12 | 2014-11-12 | 湖南大学 | Multithread cooperation routing method for sensing interference |
| CN104486800A (en) * | 2014-12-09 | 2015-04-01 | 上海交通大学 | Moderate service-based adaptive cooperative transmission method and system in wireless network |
| CN106304394A (en) * | 2016-09-19 | 2017-01-04 | 华南师范大学 | A kind of adaptive scheduling optimization method based on MIMO heterogeneous ad hoc network |
| CN109802773A (en) * | 2019-02-26 | 2019-05-24 | 重庆邮电大学 | A kind of cooperative wireless network network data transmission method of social activity degree of belief perception |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459948B (en) * | 2009-01-04 | 2010-10-13 | 北京航空航天大学 | Cooperative routing method |
| CN102790950B (en) * | 2011-05-18 | 2016-06-01 | 中兴通讯股份有限公司 | Multi-interface terminal neighbours' Topology Discovery, collaboration communication method and multi-interface terminal |
-
2013
- 2013-02-21 CN CN201310055368.3A patent/CN103096413B/en active Active
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103281310A (en) * | 2013-05-09 | 2013-09-04 | 汕头大学 | Cooperative network security transmission method |
| CN103281310B (en) * | 2013-05-09 | 2016-01-20 | 汕头大学 | A kind of collaborative network safe transmission method |
| CN104144461A (en) * | 2014-03-12 | 2014-11-12 | 湖南大学 | Multithread cooperation routing method for sensing interference |
| CN104144461B (en) * | 2014-03-12 | 2017-12-01 | 湖南大学 | It is a kind of to disturb the multithread cooperative routing method perceived |
| CN103874161A (en) * | 2014-04-03 | 2014-06-18 | 上海扬梓投资管理有限公司 | Path selection method and node device |
| CN104486800A (en) * | 2014-12-09 | 2015-04-01 | 上海交通大学 | Moderate service-based adaptive cooperative transmission method and system in wireless network |
| CN104486800B (en) * | 2014-12-09 | 2018-05-04 | 上海交通大学 | Based on the adaptive cooperation retransmission method moderately serviced and system in wireless network |
| CN106304394A (en) * | 2016-09-19 | 2017-01-04 | 华南师范大学 | A kind of adaptive scheduling optimization method based on MIMO heterogeneous ad hoc network |
| CN106304394B (en) * | 2016-09-19 | 2019-11-19 | 华南师范大学 | A kind of adaptive scheduling optimization method based on MIMO heterogeneous ad hoc network |
| CN109802773A (en) * | 2019-02-26 | 2019-05-24 | 重庆邮电大学 | A kind of cooperative wireless network network data transmission method of social activity degree of belief perception |
| CN109802773B (en) * | 2019-02-26 | 2021-12-14 | 重庆邮电大学 | Social trust perception cooperative wireless network data transmission method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103096413B (en) | 2016-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | Distributed power splitting for SWIPT in relay interference channels using game theory | |
| Sheng et al. | Cooperative wireless networks: from radio to network protocol designs | |
| CN103096413B (en) | Distributed collaborative method for routing under a kind of multiplex roles multi-hop wireless network | |
| Halford et al. | Barrage relay networks | |
| CN103685025A (en) | Cross-layer dynamic self-adapting routing method based on LEO satellite network | |
| Sun et al. | Opportunistic communications based on distributed width-controllable braided multipath routing in wireless sensor networks | |
| CN1996920A (en) | Novel method for wireless communication networking based on the cooperation mechanism | |
| CN102932866A (en) | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network | |
| CN104394569B (en) | The method that QoS routing is set up based on angle and interference control in wireless D2D networks | |
| CN102612109A (en) | Wireless Mesh network routing channel union distribution method based on topology optimization and interference reduction | |
| Liu et al. | Power allocation for virtual MIMO-based three-stage relaying in wireless ad hoc networks | |
| Deng et al. | Diversity of multi-hop cluster-based routing with arbitrary relay selection | |
| Chen et al. | Cross layer design of heterogeneous virtual MIMO radio networks with multi-optimization | |
| Dziri et al. | Performance analysis of MIMO cooperative relays for wireless sensor networks | |
| CN104144461B (en) | It is a kind of to disturb the multithread cooperative routing method perceived | |
| CN101982994B (en) | Method for optimizing transmission path based on multi-hop clustering coding forward pass relay network | |
| Ge et al. | Cooperative geographic routing in wireless sensor networks | |
| Guan et al. | CSR: Cooperative source routing using virtual MISO in wireless ad hoc networks | |
| CN102665250A (en) | Method and device for determining transmission manner through wireless sensor network | |
| Srinivas et al. | Performance evaluation of network coding-aware neighbor based topology control protocols in MANETs | |
| Sasikala et al. | Performance evaluation of improving network capacity with optimized cooperative (COCO) topology control scheme in MANETS | |
| CN109890063B (en) | A kind of multi-hop relay transmission method based on the channel that partly overlaps | |
| CN102377523A (en) | Network coding method of time division duplex (TDD) wireless relay cellular network and communication method | |
| Wang et al. | Spectrum-efficient routing algorithms with successive interference cancellation in multi-hop wireless networks | |
| Fan et al. | Application of chain-type multi-hop networks for unmanned aerial vehicle in the mine |
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 |