CN111641991B - Multi-relay two-hop network secure transmission method based on data caching - Google Patents
Multi-relay two-hop network secure transmission method based on data caching Download PDFInfo
- Publication number
- CN111641991B CN111641991B CN202010378262.7A CN202010378262A CN111641991B CN 111641991 B CN111641991 B CN 111641991B CN 202010378262 A CN202010378262 A CN 202010378262A CN 111641991 B CN111641991 B CN 111641991B
- Authority
- CN
- China
- Prior art keywords
- relay
- node
- link
- probability
- 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.)
- Active
Links
Images
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
- H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
-
- 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 a multi-relay two-hop network security transmission method based on data caching, which comprises the steps of obtaining a channel security threshold from a source node to a relay node according to the link interruption probability from the source node to the relay node; obtaining a channel safety threshold from a source node to a relay node according to the link interruption probability from the relay node to a destination node; formulating a link selection strategy according to the relay cache state and the number of the safe links; and analyzing the channel transfer matrix and the steady-state probability of the network according to the determined link selection strategy to obtain the safety interruption probability of the network and realize transmission. The invention considers the interruption probability of the channel during the link selection, can further improve the network security, and is superior to the traditional safe transmission scheme based on the data cache.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a multi-relay two-hop network secure transmission method based on data caching.
Background
The rapid development of wireless technology and devices has brought about a great deal of personal private information interaction, such as bank account information, personal health information, and the like. The security of such information presents a significant challenge to the development of wireless communication networks. Although the upper-layer key encryption technology can protect information security, the upper-layer key technology assumes that the capacity of an eavesdropping node is limited and an encryption algorithm is complex, and cannot be applied to a communication network with good equipment capacity. The physical layer security technology utilizes the wireless channel characteristics to encrypt, and can well supplement the defects. Cooperative relaying techniques may utilize relaying to improve the security of the network, but the fixed relaying mode limits the network performance to the worst one hop. The relay network based on the cache can well solve the problems, and although work has been carried out to research the security of the cooperative relay network based on the cache, the link selection strategy of the network does not consider the information security interruption probability, so the performance improvement is limited.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a multi-relay two-hop network secure transmission method based on data caching to optimize the performance of the conventional scheme, aiming at the defects in the prior art.
The invention adopts the following technical scheme:
a multi-relay two-hop network security transmission method based on data caching comprises the following steps:
s1, obtaining a channel safety threshold from the source node to the relay node according to the link interruption probability from the source node to the relay node; obtaining a channel safety threshold from a source node to a relay node according to the link interruption probability from the relay node to a destination node;
s2, formulating a link selection strategy according to the relay buffer state and the number of the safe links;
and S3, analyzing the channel transfer matrix and the steady-state probability of the network according to the link selection strategy determined in the step S2 to obtain the safety interruption probability of the network, and realizing transmission.
Specifically, in step S1, the probability of the safety interruption of the first hop in the tth time slotWhen the temperature of the water is higher than the set temperature,is at mostAllowing safe outage probability, source node and relay RiThe link between the source node and the relay R is safeiMust satisfyWhereinAs source node and relay RiChannel power gain, y, at the t-th time slotarA minimum threshold of information security between the source node and the relay;
probability of safe interruption of second hop in t time slotTime, relay RiThe connection with the destination node is realized through the link; the link selection policy is:
therein, Ψ (Q)k) Is RkIn the buffer state of (a) to (b),indicating that the link between the source node and the relay is secure;indicating link security between relay and destination node, relay RiAnd the link between the destination node must satisfyIs a relay RiAnd the channel power gain, y, of the destination node at the t-th time slotrbRelay RiAnd a minimum threshold for information security between the destination node.
Specifically, in step S2, the link selection policy specifically includes:
wherein R isoptFor the selected optimal relay, RkFor the kth relay, Ψ (Q)k) Is RkCache Q ofkL is the maximum data cache,as source node and relay RiThe channel power gain of (a) is,is a relay RiAnd channel power gain, λ, of the destination nodeaeIs the channel variance, lambda, between the source node and the eavesdropping nodereIs the channel variance between the relay node and the eavesdropping node;indicating that the link between the selected source node and the relay is safe and the channel power gain is maximum;indicating that the link between the selected relay node and the destination node is safe and the channel power gain is maximal.
Further, the probability that there is no secure link in the network is:
wherein λ isarIs the channel variance, lambda, between the source node and the relay noderbIs the channel variance between the relay node and the destination node.
Further, according to the link selection scheme, there is M between the source node and the relay node1The probability of a legitimate link being
Where M is the number of relays.
Further, according to the link selection scheme, there is M between the relay node and the destination node2The probability of a legal link being validated is:
setting the state space of the network asWherein s isnIndicating the network status of the nth slot,indicating the buffer status of the ith relay;
specifically, in step S3, the system slave state S is selected according to the link selection policynIs transmitted to the state slHas a probability ofn,lThe steady state of the network is then:
π=(A-I+B)-1b
where A is a transition matrix, B is a vector whose elements are all 1, I is an identity matrix, and B is a matrix whose elements are all 1.
Further, according to the system state, the safety interruption probability of the network is:
Compared with the prior art, the invention has at least the following beneficial effects:
the invention relates to a multi-relay two-hop network security transmission method based on data caching, and provides a link selection strategy based on security interruption; constructing a Markov chain state transition matrix according to an available and safe link set, and deriving a steady-state probability; deducing a closed expression of the safety interruption probability of the proposed scheme according to the steady-state probability; finally, the numerical result shows that the interrupt-driven safe transmission scheme provided by the invention is superior to the traditional cache auxiliary safe transmission scheme.
Furthermore, the invention firstly analyzes the channel safety rate from the source node to the relay and from the relay to the destination node and analyzes the corresponding safety interruption probability. And according to the obtained safety interruption probability, deducing the channel safety thresholds from the source node to the relay and from the relay to the destination node.
Further, based on the threshold and the relay cache state, the invention provides a new link selection strategy based on the safety interruption probability, and the information safety and reliability are considered so as to improve the network performance.
Further, according to the above link selection strategy, the present invention utilizes a Markov chain to characterize the state transition probabilities in the system and to derive the state transition matrix, and then obtains the steady state probabilities of the system, which provides a mathematical tool for performance analysis.
Further, according to the steady-state probability, the information security interruption probability of the scheme is analyzed, and an expression in a closed form is obtained.
In summary, the present invention considers the channel interruption probability during link selection, and can further improve the network security, which is superior to the conventional data cache-based secure transmission scheme.
The technical solution of the present invention is further described in detail by the accompanying drawings and embodiments.
Drawings
FIG. 1 is a diagram of a buffer assisted secure transfer according to the present invention;
FIG. 2 shows the equation gsr≥grdTime, privacy outage probability and average channel power gain grdA relationship diagram of (1);
FIG. 3 is a graph of security break probability versus target security rate Rsec;
FIG. 4 is a graph of the probability of secret interruption versus the upper bound of the probability of licensed secret interruption.
Detailed Description
Referring to fig. 1, the invention provides a multi-relay two-hop network secure transmission method based on data caching, a source node lice wants to transmit information to a destination node Bob safely and reliably, and a eavesdropping node Eve eavesdrops on Alice's transmission data. The direct channel quality between Alice and Bob is poor due to large-scale fading or interference. For secure transmission between Alice and Bob, assistance of the relay is required, but an eavesdropper can receive private information from Alice and the relay;
each relay has only one antenna and operates in half-duplex mode, each relay has a data buffer, using QiRepresents; the length of the data cache is L; in the present system, each frame is equally divided into a series of slots, each slot having a duration T. In each time slot, only one relay receives or forwards private information; the system experiences rayleigh flat block fading, which means that the channel state information remains unchanged in each time slot and varies independently in adjacent time slots.
Referring to fig. 1, the present invention provides a data cache-based multi-relay two-hop network secure transmission method, which includes the following steps:
s1, designing a link selection strategy to maximize the probability of privacy interruption;
at the t-th time slot, if relay RiSelected to receive Alice's private information, the received information is:
wherein p isaIs Alice's transmit power;is Alice and RiChannel coefficients at the t-th slot; x is the number ofa[t]Is the private of the t-th time slot AliceSecret information;is RiNoise is received in the t-th time slot, and the private information is decoded and stored in RiIn the cache, the private information intercepted at the same time is:
wherein h isae[t]Is the channel system between Alice and eavesdropper in the t-th time slot, ne[t]Is the noise received by the eavesdropper on the t-th slot.
After k slots, if RiForwarding the private information, the signal received by Bob is:
wherein, PrIs RiThe transmit power of (a);is RiAnd Bob at the (k + t) th time slot; x is the number ofri[t+k]Is the (t + k) th time slot RiForwarding private information; n isb[t+k]Is the noise accepted by the (t + k) time slot Bob.
Likewise, the private information eavesdropped by the eavesdropper is:
wherein the content of the first and second substances,is RiAnd the channel system of the eavesdropper at the (t + k) th time slot, ne[t+k]Is the noise that an eavesdropper receives in the (t + k) slot.
When relay R is selectediAt the t-th time slotWhen receiving Alice's private information, RiThe information rate of (a) is:
wherein the content of the first and second substances,is Alice and RiChannel power gain at t-th time slot, N0Is the noise variance.
The eavesdropping rate of the eavesdropper is:
t time slots Alice and RiThe safe rate is:
wherein (a)+Max (a,0), since the channel state information of the eavesdropping channel cannot be acquired, the security performance is measured by the security outage probability.
The safe outage probability is therefore:
wherein R issFor a target safe outage probability, λaeIs the channel variance from Alice to the eavesdropping node. Setting the maximum allowed safe interruption probability asIn the t-th time slot, Alice and RiOnly the link between themIs then safe, and thus can obtain
In t + k time slot, RiForwarding the security information, the received information rate of Bob is
The eavesdropping rate of the eavesdropper at the t + k moment is as follows:
thus, the secret ratio of the second hop at the t + k slot is:
according to a target safety rate RsThe probability of a safety interruption for the second hop can be found to be:
wherein λ isreIs the channel variance from the relay node to the eavesdropping node.
Given a maximum safe outage probability thresholdThen is atUnder the condition of (1), RiThe link with Bob is secure, i.e.:
according to the available links of the network and the data caching state, the invention provides the following link selection strategies:
therein, Ψ (Q)k) Is a relay RkThe cache state of (c).The link between Alice and the relay is safe and the channel quality is good, and the cache of the corresponding relay has a space for storing private information;indicating that the link between the relay and Bob is secure and the channel quality is good and that the buffer of the respective relay has private information to transmit.
S2, according to the selected strategy, when the link satisfies gari≥ΥarOr grib≥ΥrbThe time is safe; otherwise, there will be no available secure transmission link, and the probability at this time is:
wherein, PnullThe subscript of (a) indicates the probability that the secure transmission has no available links, λarRepresents the variance, λ, of the channel between Alice and the RelayrbRepresenting the variance of the channel between the relay and Bob.
In this case, the system has at least one secure link with a probability of 1-Pnull. There is M between Alice and the Relay in the t-th time slot1Of a linkPerformance:
similarly, there is M between the relay and Bob in the t-th time slot2Probability of a link:
in the t-th time slot, the state space of the network is represented as:
wherein the content of the first and second substances,represents RiIn a state snThe cache state of (c). The system state is probabilistically selected from s according to the proposed link selection strategynTransition to the next state slThe probability of (c) is:
wherein, PsrIs the probability, P, of selecting a link from Alice to the Relay Link setrbIs the probability, Ω, of a relay selecting a link collectively with Bob links+Is at snThe case of time selection Alice transmission, omega-Is at snRelay forwarding is selected.
PsrIs the probability of selecting a link from Alice to the relay link set:
then P isrb=1-Psr
Then, according to the state space of the system, the steady state derivation of the system is:
π=(A-I+B)-1b
where A is a transition matrix, B is a vector whose elements are all 1, I is an identity matrix, and B is a matrix whose elements are all 1.
S3, deriving the expression of the secret interruption in a closed form and the probability and the secrecy rate of the scheme, and establishing a queuing theory to calculate the information time delay;
referring to FIG. 4, according to the eavesdropping encoding theory, if the system security rate is less than RsThe private information will suffer a security break. Therefore, in the proposed link selection strategy, the system outage probability is:
wherein the content of the first and second substances,is state snThe probability of a safe outage of (c):
where M is the number of relays in the network, λarRepresents the variance, λ, of the channel between Alice and the RelayrbRepresenting the variance of the channel between the relay and Bob,
in the invention, all the link selection strategies take the interruption condition of the link into consideration, and the safety interruption condition can be avoided during the link selection, thereby improving the network safety. According to the safe interruption probability of the system, the safe interruption condition which can be obtained by the scheme can be obtained, so that guidance is provided for the practical use of the scheme.
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. The components of the embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Simulation verification
1. Fig. 2 presents a graph of the probability of a safety outage between the relay and Bob versus the average channel power gain. It can be observed that the theoretical results are very consistent with the simulation results. In addition, the safe outage probability is grdIs reduced. grdA larger value indicates that the source node and the relay have more power to guarantee safe transmission in the first and second hops. Thus, the probability of a safety interruption follows grdIs reduced. More relays will increase the diversity of the selection and the probability of a safety interruption will decrease. In the conventional maximum ratio scheme, link security is not considered and the probability of a security disruption will increase.
2. FIG. 3 shows the probability of a security outage versus a target secret ratio RsA relationship diagram of (1); in the figure the probability of a safe interruption is RsAn increasing function of; rsA larger value of (a) indicates that it is challenging to securely transmit private information and the available links will be reduced. Thus, the possibility of a safety interruption will follow RsIs increased with an increase in; the increase of the buffer size and the increase of the relay number can increase the diversity of link selection and reduce the possibility of safety interruption; for conventional maximum ratio schemes, it is not considered whether the transmission link is available for secure transmission, which results in an increased probability of a security outage.
In summary, the invention relates to a multi-relay two-hop network security transmission method based on data caching, which includes firstly analyzing the security interruption probability of two-hop transmission to obtain the minimum threshold of information security transmission; subsequently, a link selection strategy based on the safety interruption probability is provided, namely, the information safety and the high efficiency of information transmission are guaranteed. And analyzing the state transition probability of the system and obtaining the steady-state probability according to the proposed strategy, and then analyzing the safety interruption probability of the system and obtaining a corresponding closed-form solution. The simulation result shows that the scheme provided by the invention can improve the safety of the system.
The above-mentioned contents are only for illustrating the technical idea of the present invention, and the protection scope of the present invention is not limited thereby, and any modification made on the basis of the technical idea of the present invention falls within the protection scope of the claims of the present invention.
Claims (3)
1. A multi-relay two-hop network security transmission method based on data caching is characterized by comprising the following steps:
s1, obtaining a channel safety threshold from the source node to the relay node according to the link interruption probability from the source node to the relay node; obtaining the interruption threshold from the relay node to the destination node according to the interruption probability of the link from the relay node to the destination node, and the safe interruption probability of the first hop in the t-th time slotWhen the temperature of the water is higher than the set temperature,for maximum allowed safe outage probability, source node and relay RiThe link between the source node and the relay R is safeiMust satisfyWhereinAs source node and relay RiChannel power gain at t-th time slot, gammaarA minimum threshold of information security between the source node and the relay;
probability of safe interruption of second hop in t time slotTime, relay RiThe connection with the destination node is realized through the link; the link selection policy is:
therein, Ψ (Q)k) Is RkIn the buffer state of (a) to (b),indicating that the link between the source node and the relay is secure;indicating link security between relay and destination node, relay RiAnd the link between the destination node must satisfyWherein the content of the first and second substances,is a relay RiAnd the channel power gain, gamma, of the destination node in the t-th time slotrbRelay RiAnd the minimum threshold of information security between the destination node;
s2, according to the relay buffer state and the number of the safe links, a link selection strategy is formulated, and the link selection strategy specifically comprises the following steps:
wherein,RoptFor the selected optimal relay, RkFor the kth relay, Ψ (Q)k) Is RkCache Q ofkL is the maximum data cache,as source node and relay RiThe channel power gain of (a) is,is a relay RiAnd channel power gain, λ, of the destination nodeaeIs the channel variance, lambda, between the source node and the eavesdropping nodereIs the channel variance between the relay node and the eavesdropping node;indicating that the link between the selected source node and the relay is safe and the channel power gain is maximum;indicating that the link between the selected relay node and the destination node is safe and the channel power gain is maximum; according to the link selection scheme, there is M between the source node and the relay node1The probability of a legitimate link being
Wherein M is the number of relays;
according to the link selection scheme, there is M between the relay node and the destination node2The probability of a legal link being validated is:
setting the state space of the network asWherein s isnIndicating the network status of the nth slot,indicating the buffer status of the ith relay;
s3, according to the link selection strategy determined in the step S2, analyzing the channel transfer matrix and the steady-state probability of the network to obtain the safe interruption probability of the network, realizing transmission, and according to the link selection strategy, the system is in a state SnIs transmitted to the state slHas a probability ofn,lThe steady state of the network is then:
π=(A-I+B)-1b
where A is a transition matrix, B is a vector whose elements are all 1, I is an identity matrix, and B is a matrix whose elements are all 1.
2. The method for secure transmission in a multi-relay two-hop network based on data caching of claim 1, wherein in step S2, the probability that there is no secure link in the network is:
wherein λ isarIs the channel variance, lambda, between the source node and the relay noderbIs the channel variance between the relay node and the destination node.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010378262.7A CN111641991B (en) | 2020-05-07 | 2020-05-07 | Multi-relay two-hop network secure transmission method based on data caching |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010378262.7A CN111641991B (en) | 2020-05-07 | 2020-05-07 | Multi-relay two-hop network secure transmission method based on data caching |
Publications (2)
Publication Number | Publication Date |
---|---|
CN111641991A CN111641991A (en) | 2020-09-08 |
CN111641991B true CN111641991B (en) | 2022-02-08 |
Family
ID=72331939
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010378262.7A Active CN111641991B (en) | 2020-05-07 | 2020-05-07 | Multi-relay two-hop network secure transmission method based on data caching |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111641991B (en) |
Citations (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101217301A (en) * | 2008-01-10 | 2008-07-09 | 北京邮电大学 | A collaborative transmission method realized in isomerization wireless network with cooperating relay nodes |
EP2059911A2 (en) * | 2006-09-15 | 2009-05-20 | Itron, Inc. | Metering rf lan protocol and cell/node utilization and management |
CN102244913A (en) * | 2010-05-12 | 2011-11-16 | 华为技术有限公司 | Multi-hop routing cooperation method of wireless network and realization apparatus thereof |
CN103298084A (en) * | 2013-05-17 | 2013-09-11 | 山东大学 | Coordinated multi-relay selection and power distribution method based on energy efficiency criteria |
CN104507136A (en) * | 2014-12-22 | 2015-04-08 | 哈尔滨工业大学 | Relay node selection method |
CN105228189A (en) * | 2015-10-26 | 2016-01-06 | 西安电子科技大学 | Wireless-access mode in isomerism cooperative network and relay selection method |
CN105375956A (en) * | 2015-10-26 | 2016-03-02 | 西安电子科技大学 | Queue cache relay transmission method in physical layer safety communication |
CN106358215A (en) * | 2016-08-31 | 2017-01-25 | 上海交通大学 | Data caching based relay network cooperation method |
CN106900030A (en) * | 2017-02-27 | 2017-06-27 | 西安交通大学 | Based on repetition policy selection and resource allocation safe transmission method in relaying OFDM networks |
CN107124749A (en) * | 2017-05-09 | 2017-09-01 | 北京汇通金财信息科技有限公司 | The relay selection method and device of a kind of full duplex relaying system |
CN107396346A (en) * | 2017-08-15 | 2017-11-24 | 广州大学 | One kind caching cellular network safety of physical layer data transmission method and system |
CN109089273A (en) * | 2018-09-26 | 2018-12-25 | 西南科技大学 | Relay selection method based on state transition probability in a kind of Ad-Hoc network |
CN109547140A (en) * | 2019-01-15 | 2019-03-29 | 华北电力大学(保定) | Double medium mixing fading communication system performance analysis methods based on AF agreement |
WO2019067617A1 (en) * | 2017-09-27 | 2019-04-04 | Trellisware Technologies, Inc. | Methods and systems for improved communication in multi-hop networks |
CN110267294A (en) * | 2019-06-18 | 2019-09-20 | 西安电子科技大学 | Random relay selection method based on energy cooperation |
CN110290558A (en) * | 2019-06-24 | 2019-09-27 | 西安交通大学 | It is a kind of to cache the safe transmission method based on time delay in the more relay transmission systems assisted |
CN110708736A (en) * | 2019-10-24 | 2020-01-17 | 东南大学 | Dynamic routing method and system based on energy efficiency relay selection |
CN111064665A (en) * | 2019-12-24 | 2020-04-24 | 杭州电子科技大学 | Wireless body area network low-delay transmission scheduling method based on Markov chain |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9629063B2 (en) * | 2012-05-09 | 2017-04-18 | Trellisware Technologies, Inc. | Method and system for global topology discovery in multi-hop ad hoc networks |
US10264407B2 (en) * | 2015-06-25 | 2019-04-16 | The Board Of Trustees Of The University Of Alabama | Intelligent multi-bean medium access control in ku-band for mission-oriented mobile mesh networks |
CN106922009A (en) * | 2015-12-28 | 2017-07-04 | 镇江坤泉电子科技有限公司 | Multisensor node-node transmission system of selection based on outage probability |
CN106714263B (en) * | 2016-12-01 | 2020-03-17 | 中国南方电网有限责任公司调峰调频发电公司 | Wireless sensor network AODV routing protocol implementation system and method |
CN106656814A (en) * | 2017-02-23 | 2017-05-10 | 广东电网有限责任公司茂名供电局 | Routing method for power line carrier communication network |
CN106954244B (en) * | 2017-03-03 | 2020-03-20 | 西安电子科技大学 | Low-complexity relay selection method oriented to 5G large-scale physical layer security |
CN107734588A (en) * | 2017-09-18 | 2018-02-23 | 哈尔滨工程大学 | One kind is based on the safe and efficient cooperating relay system of selection of network code |
CN107659991B (en) * | 2017-10-09 | 2020-07-03 | 西北工业大学 | Energy distribution method in two-hop energy collection relay network |
CN110213793B (en) * | 2019-04-15 | 2020-06-16 | 浙江大学 | Relay system safety throughput optimization method based on rate control |
CN112039574B (en) * | 2020-06-10 | 2022-03-22 | 合肥工业大学 | Method and system for quickly reconstructing unmanned aerial vehicle cooperative relay network under communication interference |
CN113395738B (en) * | 2021-08-18 | 2021-11-30 | 南京天际易达通信技术有限公司 | Transmission link determination method, system and medium for satellite-ground converged network |
-
2020
- 2020-05-07 CN CN202010378262.7A patent/CN111641991B/en active Active
Patent Citations (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2059911A2 (en) * | 2006-09-15 | 2009-05-20 | Itron, Inc. | Metering rf lan protocol and cell/node utilization and management |
CN101217301A (en) * | 2008-01-10 | 2008-07-09 | 北京邮电大学 | A collaborative transmission method realized in isomerization wireless network with cooperating relay nodes |
CN102244913A (en) * | 2010-05-12 | 2011-11-16 | 华为技术有限公司 | Multi-hop routing cooperation method of wireless network and realization apparatus thereof |
EP2487845A1 (en) * | 2010-05-12 | 2012-08-15 | Huawei Technologies Co., Ltd. | Multi-hop routing cooperation method of wireless network and implementation apparatus thereof |
CN103298084A (en) * | 2013-05-17 | 2013-09-11 | 山东大学 | Coordinated multi-relay selection and power distribution method based on energy efficiency criteria |
CN104507136A (en) * | 2014-12-22 | 2015-04-08 | 哈尔滨工业大学 | Relay node selection method |
CN105228189A (en) * | 2015-10-26 | 2016-01-06 | 西安电子科技大学 | Wireless-access mode in isomerism cooperative network and relay selection method |
CN105375956A (en) * | 2015-10-26 | 2016-03-02 | 西安电子科技大学 | Queue cache relay transmission method in physical layer safety communication |
CN106358215A (en) * | 2016-08-31 | 2017-01-25 | 上海交通大学 | Data caching based relay network cooperation method |
CN106900030A (en) * | 2017-02-27 | 2017-06-27 | 西安交通大学 | Based on repetition policy selection and resource allocation safe transmission method in relaying OFDM networks |
CN107124749A (en) * | 2017-05-09 | 2017-09-01 | 北京汇通金财信息科技有限公司 | The relay selection method and device of a kind of full duplex relaying system |
CN107396346A (en) * | 2017-08-15 | 2017-11-24 | 广州大学 | One kind caching cellular network safety of physical layer data transmission method and system |
WO2019067617A1 (en) * | 2017-09-27 | 2019-04-04 | Trellisware Technologies, Inc. | Methods and systems for improved communication in multi-hop networks |
CN109089273A (en) * | 2018-09-26 | 2018-12-25 | 西南科技大学 | Relay selection method based on state transition probability in a kind of Ad-Hoc network |
CN109547140A (en) * | 2019-01-15 | 2019-03-29 | 华北电力大学(保定) | Double medium mixing fading communication system performance analysis methods based on AF agreement |
CN110267294A (en) * | 2019-06-18 | 2019-09-20 | 西安电子科技大学 | Random relay selection method based on energy cooperation |
CN110290558A (en) * | 2019-06-24 | 2019-09-27 | 西安交通大学 | It is a kind of to cache the safe transmission method based on time delay in the more relay transmission systems assisted |
CN110708736A (en) * | 2019-10-24 | 2020-01-17 | 东南大学 | Dynamic routing method and system based on energy efficiency relay selection |
CN111064665A (en) * | 2019-12-24 | 2020-04-24 | 杭州电子科技大学 | Wireless body area network low-delay transmission scheduling method based on Markov chain |
Non-Patent Citations (3)
Title |
---|
"S3-172095_TR_33899_130_clear".《3GPP tsg_sa\WG3_Security》.2017, * |
Cooperative Jamming with Untrusted SUs forSecure Communication of Two-Hop Primary System;Dawei Wang,;《IEEE XPLORE》;20150728;全文 * |
双向中继系统传输策略与性能研究;史士杰;《中国博士学位论文全文数据库(电子期刊)信息科技辑》;20160623;全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN111641991A (en) | 2020-09-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Hu et al. | Covert transmission with a self-sustained relay | |
Zou et al. | Intercept probability analysis of cooperative wireless networks with best relay selection in the presence of eavesdropping attack | |
Jeong et al. | Optimal power allocation for secure multicarrier relay systems | |
Sun et al. | Covert rate maximization in wireless full-duplex relaying systems with power control | |
Tang et al. | Secrecy outage analysis of buffer-aided cooperative MIMO relaying systems | |
Jameel et al. | Secrecy analysis and learning-based optimization of cooperative NOMA SWIPT systems | |
Khan et al. | Opportunistic relaying and random linear network coding for secure and reliable communication | |
Cao et al. | Relay selection for improving physical-layer security in hybrid satellite-terrestrial relay networks | |
CN110087278A (en) | A kind of safe transmission method wirelessly taken in energy collaborative network with cooperation interference | |
Abd El-Malek et al. | New bandwidth efficient relaying schemes in cooperative cognitive two-way relay networks with physical layer security | |
Chen et al. | Physical layer security in cognitive untrusted relay networks | |
Dimitriou et al. | Performance analysis of a cooperative wireless network with adaptive relays | |
Zou et al. | Physical-layer security for cooperative relay networks | |
Zhang et al. | Graph theory based cooperative transmission for physical-layer security in 5G large-scale wireless relay networks | |
Khuntia et al. | A bidirectional relay-assisted underlay device-to-device communication in cellular networks: An IoT application for FinTech | |
Xu et al. | Proactive eavesdropping for wireless information surveillance under suspicious communication quality-of-service constraint | |
Gao et al. | Cooperative jamming and relay selection for covert communications in wireless relay systems | |
Osorio et al. | On the secrecy performance and power allocation in relaying networks with untrusted relay in the partial secrecy regime | |
CN111641991B (en) | Multi-relay two-hop network secure transmission method based on data caching | |
Sheikholeslami et al. | Energy-efficient secrecy in wireless networks based on random jamming | |
Hu et al. | A fast forward full-duplex cooperative relay scheme for securing wireless communications | |
Xu et al. | Secrecy-enhancing design for two-way energy harvesting cooperative networks with full-duplex relay jamming | |
Sasaki et al. | Cooperative jamming in a two-hop relay wireless network with buffer-aided relays | |
CN110430566B (en) | Two-hop multi-relay network secure transmission method based on energy collection | |
Kundu et al. | Effects of CSI knowledge on secrecy of threshold-selection decode-and-forward relaying |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |