CN108495308A - A kind of data safety shunting transmission method based on linear search - Google Patents
A kind of data safety shunting transmission method based on linear search Download PDFInfo
- Publication number
- CN108495308A CN108495308A CN201810227586.3A CN201810227586A CN108495308A CN 108495308 A CN108495308 A CN 108495308A CN 201810227586 A CN201810227586 A CN 201810227586A CN 108495308 A CN108495308 A CN 108495308A
- Authority
- CN
- China
- Prior art keywords
- tpm
- power
- data
- steps
- safety
- 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.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
- H04W52/0206—Power saving arrangements in the radio access network or backbone network of wireless communication networks in access points, e.g. base stations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of data safety shunting transmission method based on linear search, includes the following steps：(1) in the wireless network, from the perspective of a smart machine SD, a part of data transmission is to base station BS, some is diverted to low-power wireless access node AP, however, there are also such cases that data are eavesdropped by a hiding listener-in, and it is bilevel optimization problem that the optimization problem that system total power consumes is minimized in the case where ensureing that data transfer demands overflow limitation with safety to be described as a nonconvex property optimization problem (2) by problem TPM orthogonal decompositions；(3) according to bottom problem, it is proposed that the Poewr control method of monotonicity optimization optimizes the transimission power of SD；(4) top layer problem, the method for proposing linear search, the power of further energy saving optimizing system wastage in bulk or weight are directed to；(5) by the interactive iteration of bottom problem and top layer problem, finally TPM is solved the problems, such as.The present invention has higher safety and reliability.
Description
Technical field
The invention belongs to field of wireless, are related to a kind of data safety shunting transmission method based on linear search.
Background technology
A large amount of growths of smart machine bring huge challenge to the following Internet of Things (IoT) system.Nowadays, towards
During 5G/LTE technologies develop, cellular network can provide huge handling capacity for a large amount of smart machines and reliably connect
Connect performance.In the wireless network system, some are saved to realize that data distribution is operated in low-power wireless access in unauthorized frequency range
Point, it is easy to be maliciously eavesdropped so as to cause safe overflow problem.
Invention content
In order to which overcome existing wireless network easy is maliciously eavesdropped so as to cause safe overflow problem, safety and reliable
Property lower deficiency, the present invention provides a kind of reductions to be maliciously eavesdropped so as to cause safe overflow problem, safety and reliable
Property higher data safety based on linear search shunt transmission method.
The technical solution adopted by the present invention to solve the technical problems is：
A kind of data safety shunting transmission method based on linear search, the described method comprises the following steps：
(1) in the wireless network, from the perspective of with a smart machine SD (Smart Device), a part of data pass
Defeated to arrive base station BS, some is diverted to low-power wireless access node AP, and however, there are also hiding stolen by one
Hearer eavesdrops such case of data, and system total work is minimized in the case where ensureing that data transfer demands and safety overflow limitation
The nonconvex property optimization TPM problems that the optimization problem description of rate consumption is as follows, TPM refer to Total power
minimization：
(TPM)minpall=piA+piB
subject to:Pout,i(riA,piA)≤εi (1-1)
riB+(1-Pout,i(riA,piA))riA=Ri (1-2)
riA≥0 (1-5)
riB≥0 (1-6)
variables:(riB,piB)and(riA,piA)
In TPM problems, pallRepresent the general power of SD consumption, piARepresent the transimission power of SD to AP, piBSD is represented to arrive
The transimission power of BS, riA,riBRespectively represent the handling capacity of SD to AP and the handling capacity of SD to BS, Pout,i(riA,piA) represent and overflow
Go out probability, is about variable riA,piAFunction.
Each variable declaration in problem is as follows：
wA:AP channel widths/MHz；
riA:Handling capacity/Mbps of SD to AP；
riB:Handling capacity/Mbps of SD to BS；
piA:Transimission power/W of SD to AP；
piB:Transimission power/W of SD to BS；
n0:SD channel noise powers/W；
Ri:Safe handling capacity/Mbps of SD demands；
εi:Maximum overflow probability demand；
γiA:The signal-to-noise ratio of SD to AP；
γiE:Signal-to-noise ratio of the SD to listener-in；
giA:The channel power gain of SD to AP；
giE:Channel power gains of the SD to listener-in；
giB:The channel power gain of SD to BS；
The average channel gain of SD to AP；
Channel power gains of the SD to listener-in；
Maximum transmission power/W of SD to AP；
Maximum transmission power/W of SD to BS；
In TPM problems, from the angle of SD, arrives the requirement of AP and BS safe transmissions simultaneously meeting it, to realize
Its transimission power minimum just must take into consideration the problem of safety is overflowed；
(2) overflow probability function Pout,i(riA,piA) expression formula is as follows：
Before simplification (TPM) problem, assume that the channel gain of SD to AP arrives listener-in more than SD according to actual conditions,
I.e.Therefore (2-1) abbreviation is:
From the angle of BS, it is assumed that BS's is authorized spectrum band, therefore do not consider eavesdropping the case where, so obtaining：
It is as follows being obtained in formula (2-2), (2-3) substitution (1-2)：
In order to solve the problems, such as TPM, an auxiliary variable z is introduced：
Z=Pout,i(riA,piA) (2-5)
Such riABy z and piAIt indicates：
It is obtained in conjunction with (1-2)：
W to simplify the calculationB, it is unit 1 in next calculating, is obtained in conjunction with (2-3)：
(3) due to introducing variable z, piBIt is converted into z and piAFor the expression formula of variable, therefore problem TPM is converted into
TPM-E is indicated as follows:
z≤εi, (3-4)
variables:piA,z
Problem TPM-E is still about piAThe problem of with the non-convex optimization of z, regard z as one for the time being to solve this problem
A setting optimization piA：
variable:piA
In conjunction with (1-4), p is foundiALower boundThe upper bound and
By (3-7), (3-8) finds outIt is the function about z, therefore optimizes z and come into one
Step simplifies problem TPM-E-Sub, obtains TPM-E-Top：
To solve TPM-E-Top, optimal z is still found to minimize psub,all(z), p in (3-5)sub,all
(z) it regards as about piAFunction and it is asked about piAFirst derivative obtain：
Enable first derivative F (piA) it is equal to 0, obtain its zero
It is obtained as a result, when z is regarded as definite value, optimal value in problem (TPM-E-Sub)It is represented as：
So far problem (TPM-E-Top) is only related with z；
(4) it is used for calculating by SolTPM-Algorithm algorithms optimalProcess is as follows：
Step 4.1：Upper bound ε is overflowed in the safety shunting for inputting primary data SDiWith step delta=10-7；
Step 4.2：The current consumption energy CBV=∞, current optimal solution CBS of setting1And CBS2It is 0；
Step 4.3：Z is shunted from Δ to safety overflows upper bound εi, enumerated by step-length of Δ；
Step 4.4：It is calculated according to (3-7)It is calculated according to (3-8)According to (3-11)
It is calculated
Step 4.5：JudgeIt is whether true, if so, then follow the steps 4.6, it is no to then follow the steps
4.7；
Step 4.6：Setting
Step 4.7：JudgeIt is whether true, if so, then follow the steps 4.8, it is no to then follow the steps
4.9；
Step 4.8：Setting
Step 4.9：Setting
Step 4.11：Setting
Step 4.12：Judge current optimal value CBV >=psub,allIt is whether true, if so, 4.13 are thened follow the steps, otherwise
Execute step 4.14；
Step 4.13:Enable CBV=psub,all, CBS1=z,
Step 4.14：End loop；
Step 4.15：Judge whether CBV=∞ are true, step 4.16 is executed if setting up, it is no to then follow the steps 4.17；
Step 4.16:Output problem TPM is infeasible；
Step 4.17：Output
Further, the method is further comprising the steps of：
(5) basis is found out aboveThe optimal solution for calculating the TPM other parts that go wrong is as follows：
The technical concept of the present invention：First, consider that a part of data transmission to base station is another in the wireless network system
Partial data is diverted to the radio access node of low-power, because the data transmission of low-power wireless access node is to be operated in not
Authorized spectrum band, so in the presence of the possibility being maliciously eavesdropped, this has resulted in data spilling.Therefore in view of the handling capacity of SD demands
After the requirement of safe transmission, then realize minimum energy expenditure.Then by the analysis to problem characteristic, problem equivalent is turned
Two layers of problem is turned to, is two bottom problems, one top layer problem respectively to solve, in conjunction with the analysis for subproblem, proposes base
In the algorithm of object function monotonicity and linear search, under the demand data for ensureing SD, realize and minimize energy expenditure.
Beneficial effects of the present invention are mainly manifested in:1, from the point of view of whole Radio Network System, linear search method is advantageous
In reduction overall energy consumption；2, the reduction of energy consumption means the raising of efficiency for small base station AP, can both transmit more
More data can also mitigate the pressure of base station to a certain extent；3, it from the perspective of SD, is realized with linear search algorithm
Optimal data shunts safety, the reliability that ensure that transmission.
Description of the drawings
Fig. 1 is the schematic diagram of a scenario of single smart machine data distribution.
Specific implementation mode
The invention will be further described below in conjunction with the accompanying drawings.
Referring to Fig.1, a kind of data safety based on linear search shunts transmission method, and carrying out this method can meet at the same time
Under the premise of demand data so that system energy consumption is minimum, improves the wireless resource utility efficiency of whole system.Scene as shown in Figure 1
In.The optimization method of problem is included the following steps for the target design：
(1) in the wireless network, from the perspective of with a smart machine, a part of data transmission to base station BS, also
A part is diverted to low-power wireless access node AP, however, there are also by a hiding listener-in eavesdrop data this
Kind situation minimizes the optimization problem of system total power consumption in the case where ensureing that data transfer demands and safety spilling limit
The nonconvex property being as follows optimization TPM problems are described：
(TPM)minpall=piA+piB
subject to:Pout,i(riA,piA)≤εi (1-1)
riB+(1-Pout,i(riA,piA))riA=Ri (1-2)
riA≥0 (1-5)
riB≥0 (1-6)
variables:(riB,piB)and(riA,piA)
In TPM problems, pallRepresent the general power of SD consumption, piARepresent the transimission power of SD to AP, piBSD is represented to arrive
The transimission power of BS, riA,riBRespectively represent the handling capacity of SD to AP and the handling capacity of SD to BS, Pout,i(riA,piA) represent and overflow
Go out probability, is about variable riA,piAFunction.
Each variable declaration in problem is as follows：
wA:AP channel widths/MHz；
riA:Handling capacity/Mbps of SD to AP；
riB:Handling capacity/Mbps of SD to BS；
piA:Transimission power/W of SD to AP；
piB:Transimission power/W of SD to BS；
n0:SD channel noise powers/W；
Ri:Safe handling capacity/Mbps of SD demands；
εi:Maximum overflow probability demand；
γiA:The signal-to-noise ratio of SD to AP；
γiE:Signal-to-noise ratio of the SD to listener-in；
giA:The channel power gain of SD to AP；
giE:Channel power gains of the SD to listener-in；
giB:The channel power gain of SD to BS；
The average channel gain of SD to AP；
Channel power gains of the SD to listener-in；
Maximum transmission power/W of SD to AP；
Maximum transmission power/W of SD to BS；
In TPM problems, from the angle of SD, arrives the requirement of AP and BS safe transmissions simultaneously meeting it, to realize
Its transimission power minimum just must take into consideration the problem of safety is overflowed.
(2) overflow probability function Pout,i(riA,piA) expression formula is as follows：
Before simplifying TPM problems, assume that the channel gain of SD to AP arrives listener-in more than SD according to actual conditions, i.e.,Therefore (2-1) abbreviation is:
From the angle of BS, it is assumed that BS's is authorized spectrum band, therefore do not consider eavesdropping the case where, so obtaining：
It is as follows being obtained in formula (2-2), (2-3) substitution (1-2)：
In order to solve the problems, such as TPM, an auxiliary variable z is introduced：
Z=Pout,i(riA,piA) (2-5)
Such riABy z and piAIt indicates：
It is obtained in conjunction with (1-2)：
W to simplify the calculationB, it is unit 1 in next calculating, is obtained in conjunction with (2-3)：
(3) due to introducing variable z, piBIt is converted into z and piAFor the expression formula of variable, therefore problem TPM is converted into
TPM-E is indicated as follows:
z≤εi, (3-4)
variables:piA,z
Problem TPM-E is still about piAThe problem of with the non-convex optimization of z, z can be seen for the time being to solve this problem
At a setting optimization piA：
variable:piA
In conjunction with (1-4), p is foundiALower boundThe upper bound and
By (3-7), (3-8) finds outIt is the function about z, therefore z can be optimized
It is further simplified problem TPM-E-Sub, obtains TPM-E-Top：
(TPM-E-Top):minpsub,all(z),
subject to:0≤z≤εi, (3-9)
variable:z
To solution (TPM-E-Top), optimal z is still found to minimize psub,all(z), the handle in (3-5)
psub,all(z) it regards as about piAFunction and it is asked about piAFirst derivative obtain：
Enable first derivative F (piA) it is equal to 0, obtain its zero
It is obtained as a result, when z is regarded as definite value, optimal value in problem TPM-E-SubIt is represented as：
So far problem (TPM-E-Top) is only related with z, can be solved with the method for linear search.For arbitrary z ∈
[0,εi], it can be found out by (3-8)P can be found out in (TPM-E-Sub) accordinglysub,all(z).Linear
In searching algorithm, all p acquired of comparison are enumerated by the way that step delta is arrangedsub,all(z), it can be deduced that the z of global optimum*, from
And solve the problems, such as (TPM-E), to which initial problem also just solves.Based on principles above, the present invention proposes SolTPM-
Algorithm algorithms.
(4) it is used for calculating by SolTPM-Algorithm algorithms optimalProcess is as follows：
Step 4.1：Upper bound ε is overflowed in the safety shunting for inputting primary data SDiWith step delta=10-7；
Step 4.2：The current consumption energy CBV=∞, current optimal solution CBS of setting1And CBS2It is 0；
Step 4.3：Z is shunted from Δ to safety overflows upper bound εi, enumerated by step-length of Δ；
Step 4.4：It is calculated according to (3-7)It is calculated according to (3-8)According to (3-11)
It is calculated
Step 4.5：JudgeIt is whether true, if so, then follow the steps 4.6, it is no to then follow the steps
4.7；
Step 4.6：Setting
Step 4.7：JudgeIt is whether true, if so, then follow the steps 4.8, it is no to then follow the steps
4.9；
Step 4.8：Setting
Step 4.9：Setting
Step 4.11：Setting
Step 4.12：Judge current optimal value CBV >=psub,allIt is whether true, if so, 4.13 are thened follow the steps, otherwise
Execute step 4.14；
Step 4.13:Enable CBV=psub,all, CBS1=z,
Step 4.14：End loop；
Step 4.15：Judge whether CBV=∞ are true, step 4.16 is executed if setting up, it is no to then follow the steps 4.17；
Step 4.16:Output problem (TPM) is infeasible；
Step 4.17：Output
(5) basis is found out aboveThe optimal solution for calculating the TPM other parts that go wrong is as follows：
In the implementation case, Fig. 1 is in the wireless network that considers of the present invention comprising there are one BS, and SD's and AP is
System.Within the system, main to consider not include interference, but can take into account SD to AP and BS and SD to the channel of listener-in difference
The case where being overflowed with existing probability.There is very big guarantee in order to enable system obtains a service quality while reaching energy consumption minimum
Target proposes that the solution for the problem is realized in invention.
The present embodiment is conceived under the premise of meeting the service quality demand QoS of SD, minimum based on linear search algorithm
The energy consumption of small base station AP and base station BS in change system realize wireless money to improve effect of the small base station in system transmission data
The raising of source utilization rate.The present invention has benefited from reduction of the optimization algorithm for computation complexity during implementation.
Claims (2)
1. a kind of data safety based on linear search shunts transmission method, which is characterized in that the described method comprises the following steps：
(1) in the wireless network, from the perspective of with a smart machine SD, a part of data transmission to base station BS, also one
It is diverted partially to low-power wireless access node AP, however, there are also eavesdrop this of data by a hiding listener-in
Situation, the optimization problem that system total power consumption is minimized in the case where ensureing that data transfer demands and safety overflow limitation are retouched
State the nonconvex property optimization TPM problems being as follows：
(TPM) minpall=piA+piB
subject to:Pout,i(riA,piA)≤εi (1-1)
riB+(1-Pout,i(riA,piA))riA=Ri (1-2)
riA≥0 (1-5)
riB≥0 (1-6)
variables:(riB,piB)and(riA,piA)
In TPM problems, pallRepresent the general power of SD consumption, piARepresent the transimission power of SD to AP, piBRepresent the biography of SD to BS
Defeated power, riA,riBRespectively represent the handling capacity of SD to AP and the handling capacity of SD to BS, Pout,i(riA,piA) overflow probability is represented,
It is about variable riA,piAFunction.
Each variable declaration in problem is as follows：
wA:AP channel widths/MHz；
riA:Handling capacity/Mbps of SD to AP；
riB:Handling capacity/Mbps of SD to BS；
piA:Transimission power/W of SD to AP；
piB:Transimission power/W of SD to BS；
n0:SD channel noise powers/W；
Ri:Safe handling capacity/Mbps of SD demands；
εi:Maximum overflow probability demand；
γiA:The signal-to-noise ratio of SD to AP；
γiE:Signal-to-noise ratio of the SD to listener-in；
giA:The channel power gain of SD to AP；
giE:Channel power gains of the SD to listener-in；
giB:The channel power gain of SD to BS；
The average channel gain of SD to AP；
Channel power gains of the SD to listener-in；
Maximum transmission power/W of SD to AP；
Maximum transmission power/W of SD to BS；
In TPM problems, from the angle of SD, arrives the requirement of AP and BS safe transmissions simultaneously meeting it, to realize its biography
Defeated minimum power just must take into consideration the problem of safety is overflowed；
(2) overflow probability function Pout,i(riA,piA) expression formula is as follows：
Before simplification (TPM) problem, assume that the channel gain of SD to AP arrives listener-in more than SD according to actual conditions, i.e.,Therefore (2-1) abbreviation is:
From the angle of BS, it is assumed that BS's is authorized spectrum band, therefore do not consider eavesdropping the case where, so obtaining：
It is as follows being obtained in formula (2-2), (2-3) substitution (1-2)：
In order to solve the problems, such as TPM, an auxiliary variable z is introduced：
Z=Pout,i(riA,piA) (2-5)
Such riABy z and piAIt indicates：
It is obtained in conjunction with (1-2)：
W to simplify the calculationB, it is unit 1 in next calculating, is obtained in conjunction with (2-3)：
(3) due to introducing variable z, piBIt is converted into z and piAFor the expression formula of variable, therefore problem TPM is converted into TPM-E,
It indicates as follows:
z≤εi, (3-4)
variables:piA,z
Problem TPM-E is still about piAThe problem of with the non-convex optimization of z, z is regarded as the time being to solve this problem one it is fixed
Value optimization piA：
variable:piA
In conjunction with (1-4), p is foundiALower boundThe upper bound and
By (3-7), (3-8) finds outIt is the function about z, therefore optimizes z to be further simplified
Problem TPM-E-Sub, obtains TPM-E-Top：
To solve TPM-E-Top, optimal z is still found to minimize psub,all(z), p in (3-5)sub,all(z)
It regards as about piAFunction and it is asked about piAFirst derivative obtain：
Enable first derivative F (piA) it is equal to 0, obtain its zero
It is obtained as a result, when z is regarded as definite value, optimal value in problem (TPM-E-Sub)It is represented as：
So far problem (TPM-E-Top) is only related with z；
(4) it is used for calculating by SolTPM-Algorithm algorithms optimalProcess is as follows：
Step 4.1：Upper bound ε is overflowed in the safety shunting for inputting primary data SDiWith step delta=10-7；
Step 4.2：The current consumption energy CBV=∞, current optimal solution CBS of setting1And CBS2It is 0；
Step 4.3：Z is shunted from Δ to safety overflows upper bound εi, enumerated by step-length of Δ；
Step 4.4：It is calculated according to (3-7)It is calculated according to (3-8)It is calculated according to (3-11)
It obtains
Step 4.5：JudgeIt is whether true, if so, then follow the steps 4.6, it is no to then follow the steps 4.7；
Step 4.6：Setting
Step 4.7：JudgeIt is whether true, if so, then follow the steps 4.8, it is no to then follow the steps 4.9；
Step 4.8：Setting
Step 4.9：Setting
Step 4.11：Setting
Step 4.12：Judge current optimal value CBV >=psub,allIt is whether true, if so, 4.13 are thened follow the steps, is otherwise executed
Step 4.14；
Step 4.13:Enable CBV=psub,all, CBS1=z,
Step 4.14：End loop；
Step 4.15：Judge whether CBV=∞ are true, step 4.16 is executed if setting up, it is no to then follow the steps 4.17；
Step 4.16:Output problem TPM is infeasible；
Step 4.17：Output
2. a kind of data safety based on linear search as described in claim 1 shunts transmission method, which is characterized in that described
Method is further comprising the steps of：
(5) basis is found out aboveThe optimal solution for calculating the TPM other parts that go wrong is as follows：
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810227586.3A CN108495308A (en) | 2018-03-20 | 2018-03-20 | A kind of data safety shunting transmission method based on linear search |
| CN201811598145.0A CN109548011A (en) | 2018-03-20 | 2018-12-26 | A kind of data safety shunting transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810227586.3A CN108495308A (en) | 2018-03-20 | 2018-03-20 | A kind of data safety shunting transmission method based on linear search |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108495308A true CN108495308A (en) | 2018-09-04 |
Family
ID=63318504
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810227586.3A Withdrawn CN108495308A (en) | 2018-03-20 | 2018-03-20 | A kind of data safety shunting transmission method based on linear search |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108495308A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110213822A (en) * | 2019-04-26 | 2019-09-06 | 浙江工业大学 | A kind of non-orthogonal multiple access system downlink linear search formula power distribution optimization method based on data safety |
-
2018
- 2018-03-20 CN CN201810227586.3A patent/CN108495308A/en not_active Withdrawn
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110213822A (en) * | 2019-04-26 | 2019-09-06 | 浙江工业大学 | A kind of non-orthogonal multiple access system downlink linear search formula power distribution optimization method based on data safety |
| CN110213822B (en) * | 2019-04-26 | 2023-01-31 | 浙江工业大学 | Data security-based linear search type power distribution optimization method for downlink of non-orthogonal multiple access system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107947878B (en) | Cognitive radio power distribution method based on energy efficiency and spectrum efficiency joint optimization | |
| Wu et al. | Optimal power control for energy efficient D2D communication and its distributed implementation | |
| CN103889061B (en) | D2D user resource distribution method based on multicarrier communication | |
| CN103716869B (en) | A kind of distributed power control method optimized based on efficiency in D2D communication | |
| CN111031547B (en) | Multi-user D2D communication resource allocation method based on spectrum allocation and power control | |
| CN106413052A (en) | Method of distributing uplink power, equipment and system thereof | |
| CN104581904B (en) | A kind of base station dormancy method based on energy-conservation in isomery cellular network | |
| CN106211302A (en) | Non-orthogonal multiple accesses isomery UNE resource allocation methods | |
| CN107302766A (en) | Energy efficiency and the algorithm of spectrum efficiency balance optimization in a kind of distributing antenna system | |
| CN107026684A (en) | A kind of cognitive communications safety of physical layer efficiency optimization method based on man made noise | |
| Kai et al. | Joint uplink and downlink resource allocation for NOMA-enabled D2D communications | |
| CN108282822A (en) | User-association and Cooperative Optimization Algorithm of the power control in isomery cellular network | |
| Chen et al. | Resource allocation for energy harvesting-powered D2D communications underlaying NOMA-based networks | |
| Stephen et al. | Green OFDMA resource allocation in cache-enabled CRAN | |
| CN110190981B (en) | Multitask computing migration energy consumption optimization method based on non-orthogonal multiple access | |
| CN108495307A (en) | A kind of data safety shunting transmission method based on simulated annealing | |
| CN108495308A (en) | A kind of data safety shunting transmission method based on linear search | |
| Liu et al. | Joint resource block-power allocation for NOMA-enabled fog radio access networks | |
| CN107241799A (en) | The resource allocation of Energy Efficient and interference alignment integrated processes in heterogeneous network | |
| Zhao et al. | Energy-Efficient Federated Learning Over Cell-Free IoT Networks: Modeling and Optimization | |
| CN108551673A (en) | A kind of data safety shunting transmission method based on gradient search | |
| CN107426775B (en) | Distributed multi-user access method for high-energy-efficiency heterogeneous network | |
| CN105142224A (en) | Fast optimization algorithm of D2D power distribution in case of single-channel cellular users | |
| CN110167042B (en) | Computing task distribution joint execution time and computing resource consumption optimization method based on non-orthogonal multiple access | |
| CN105007585B (en) | Power distribution method based on outage probability efficiency maximum |
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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20180904 |
|
| WW01 | Invention patent application withdrawn after publication |