CN108495307A - A kind of data safety shunting transmission method based on simulated annealing - Google Patents

A kind of data safety shunting transmission method based on simulated annealing Download PDF

Info

Publication number
CN108495307A
CN108495307A CN201810227568.5A CN201810227568A CN108495307A CN 108495307 A CN108495307 A CN 108495307A CN 201810227568 A CN201810227568 A CN 201810227568A CN 108495307 A CN108495307 A CN 108495307A
Authority
CN
China
Prior art keywords
tpm
sub
power
data
follows
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
Application number
CN201810227568.5A
Other languages
Chinese (zh)
Inventor
吴远
杨晓维
石佳俊
陈相旭
钱丽萍
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University of Technology ZJUT
Original Assignee
Zhejiang University of Technology ZJUT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201810227568.5A priority Critical patent/CN108495307A/en
Publication of CN108495307A publication Critical patent/CN108495307A/en
Priority to CN201811598145.0A priority patent/CN109548011A/en
Withdrawn legal-status Critical Current

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 simulated annealing, includes the following steps：(1) in the wireless network, from the perspective of a smart machine, a part of data transmission is to base station BS, some is diverted to low-power wireless access node AP, however, there are also the such case for being eavesdropped data by a hiding listener-in, the optimization problem that system total power consumption is minimized in the case where ensureing that data transfer demands and safety overflow limitation is described as a nonconvex property optimization problem；(2) it is bilevel optimization problem by TPM problem 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) it is directed to top layer problem, the method for proposing simulated annealing advanced optimizes the power of system wastage in bulk or weight；(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

A kind of data safety shunting transmission method based on simulated annealing
Technical field
The invention belongs to field of wireless, are related to a kind of data safety shunting transmission method based on simulated annealing.
Background technology
A large amount of growths of smart machine SD bring huge challenge to the following Internet of Things (IoT) system.Nowadays, to It during 5G/LTE technologies develop, cellular network can provide huge handling capacity and reliable for a large amount of smart machines Switching performance.In the wireless network system, some are accessed to realize that data distribution is operated in low-power wireless in unauthorized frequency range Node, 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 simulated annealing 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 simulated annealing, includes 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) refers 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 SD to AP handling capacity and SD to the handling capacity of base station BS, Pout,i(riA,piA) generation Table overflow 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 and asks TPM-E is inscribed, 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 problem TPM-E-Top：
(TPM-E-Top):minpsub,all(z),
subject to:0≤z≤εi, (3-9)
variable:z
To solve the problems, such as 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, is solved with the method for simulated annealing；
(4) it is calculated by algorithm SA-Algorithm optimalProcess is as follows：
Step 4.1：Initialize z=z0, zmax=εi, initial count index t=0, initial temperature Tini=100；
Step 4.2：It is calculated according to (3-12)Initial psub,all(z0)；
Step 4.3：Into cycle, safe overflow probability is randomly choosed in [Δ, εi], calculate psub,all(zi)；
Step 4.4：Judge psub,all(z0)≥psub,all(zi), set up update CBV=psub,all(zi)；
Step 4.5：Otherwise, probability is usedIt is selected, θ=psub,all(zi)-psub,all(z0),
Step 4.6：Judge whether to obtain more excellent solution according to probability, if obtaining more excellent solution, updates CBV=psub,all(zi), CBS1=zi, execute step 4.8；
Step 4.7：Otherwise, t=t+1 executes step 4.2；
Step 4.8：End loop obtains
Further, the method is further comprising the steps of：(5) basis is found out aboveCalculating go wrong TPM other Part optimal solution it 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 simulated annealing 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 simulated annealing 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) problem is 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 in problem is made an explanation by lower mask body：
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) problem, from the angle of SD, the requirement of AP and BS safe transmissions is arrived simultaneously meeting it, it is real Existing 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 riAIt can be by z and piAIt indicates：
It can be 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), indicate as follows:
z≤εi, (3-4)
variables:piA,z
Problem (TPM-E) is still about piAIt the problem of with the non-convex optimization of z, to solve this problem can be by z for the time being Regard a setting optimization p asiA：
variable:piA
In conjunction with (1-4), p is foundiALower boundThe upper bound and
By (3-7), (3-8) can be seen thatBe the function about z, thus optimize z come into One step simplifies 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-Sub)It is represented as：
So far problem (TPM-E-Top) is only related with z, can be solved with the method for simulated annealing.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).It is simulating In annealing algorithm, pass through more all p acquired of probability selectionsub,all(z), it can be deduced that the z* of global optimum, to solve Problem (TPM-E), to which initial problem also just solves.Based on principles above, the present invention proposes SA-Algorithm Algorithm.
(4) algorithm SA-Algorithm is used for calculating optimalProcess is as follows：
Step 4.1：Initialize z=z0, zmax=εi, initial count index t=0, initial temperature Tini=100；
Step 4.2：It is calculated according to (3-12)Initial psub,all(z0)；
Step 4.3：Into cycle, safe overflow probability is randomly choosed in [Δ, εi], calculate psub,all(zi)；
Step 4.4：Judge psub,all(z0)≥psub,all(zi), set up update CBV=psub,all(zi)；
Step 4.5：Otherwise, probability is usedIt is selected, θ=psub,all(zi)-psub,all(z0),
Step 4.6：Judge whether to obtain more excellent solution according to probability, if obtaining more excellent solution, updates CBV=psub,all(zi), CBS1=zi, execute step 4.8；
Step 4.7：Otherwise, t=t+1 executes step 4.2；
Step 4.8：End loop obtains
(5) basis is found out aboveCalculating go wrong (TPM) other part optimal solution it 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 simulated annealing 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 simulated annealing 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 SD to AP handling capacity and SD to the handling capacity of base station BS, Pout,i(riA,piA) represent and overflow 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 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 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 problem 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 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 problem TPM-E-Top：
To solve the problems, such as 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-SubIt is represented as：
So far problem TPM-E-Top is only related with z, is solved with the method for simulated annealing；
(4) it is calculated by algorithm SA-Algorithm optimalProcess is as follows：
Step 4.1：Initialize z=z0, zmax=εi, initial count index t=0, initial temperature Tini=100；
Step 4.2：It is calculated according to (3-12)Initial psub,all(z0)；
Step 4.3：Into cycle, safe overflow probability is randomly choosed in [Δ, εi], calculate psub,all(zi)；
Step 4.4：Judge psub,all(z0)≥psub,all(zi), set up update CBV=psub,all(zi)；
Step 4.5：Otherwise, probability is usedIt is selected, θ=psub,all(zi)-psub,all(z0),
Step 4.6：Judge whether to obtain more excellent solution according to probability, if obtaining more excellent solution, updates CBV=psub,all(zi), CBS1= Zi, execute step 4.8；
Step 4.7：Otherwise, t=t+1 executes step 4.2；
Step 4.8：End loop obtains
2. a kind of data safe transmission method based on simulated annealing as described in claim 1, which is characterized in that the method It 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：
CN201810227568.5A 2018-03-20 2018-03-20 A kind of data safety shunting transmission method based on simulated annealing Withdrawn CN108495307A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201810227568.5A CN108495307A (en) 2018-03-20 2018-03-20 A kind of data safety shunting transmission method based on simulated annealing
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
CN201810227568.5A CN108495307A (en) 2018-03-20 2018-03-20 A kind of data safety shunting transmission method based on simulated annealing

Publications (1)

Publication Number Publication Date
CN108495307A true CN108495307A (en) 2018-09-04

Family

ID=63318455

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810227568.5A Withdrawn CN108495307A (en) 2018-03-20 2018-03-20 A kind of data safety shunting transmission method based on simulated annealing

Country Status (1)

Country Link
CN (1) CN108495307A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109104768A (en) * 2018-09-06 2018-12-28 浙江工业大学 A kind of non-orthogonal multiple access joint bandwidth and method of rate allocation based on simulated annealing
CN109996227A (en) * 2019-03-15 2019-07-09 浙江工业大学 A kind of multiple access calculating shunt method based on simulated annealing with safety guarantee

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109104768A (en) * 2018-09-06 2018-12-28 浙江工业大学 A kind of non-orthogonal multiple access joint bandwidth and method of rate allocation based on simulated annealing
CN109996227A (en) * 2019-03-15 2019-07-09 浙江工业大学 A kind of multiple access calculating shunt method based on simulated annealing with safety guarantee

Similar Documents

Publication Publication Date Title
Yin et al. Joint spectrum and power allocation for D2D communications underlaying cellular networks
CN107947878A (en) A kind of cognitive radio power distribution method based on efficiency and spectrum effect combined optimization
CN106413052A (en) Method of distributing uplink power, equipment and system thereof
CN108064077B (en) The power distribution method of full duplex D2D in cellular network
CN107682935A (en) A kind of wireless self-feedback resource regulating method based on the stability of a system
TWI440377B (en) Communication control method, communication system, and management server
CN110493854A (en) A kind of WPT-MEC network up and down resource allocation and power control mechanism based on optimum theory
CN108495307A (en) A kind of data safety shunting transmission method based on simulated annealing
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
CN105657700A (en) Wireless anti-eavesdropping communication method based on cooperation of multiple source nodes
CN108462996A (en) A kind of non-orthogonal multiple network resource allocation method
CN108282822A (en) User-association and Cooperative Optimization Algorithm of the power control in isomery cellular network
CN104883727B (en) The maximized power distribution method of D2D user rates in honeycomb heterogeneous network
Chen et al. Resource allocation for energy harvesting-powered D2D communications underlaying NOMA-based networks
CN105813189A (en) D2D distributed power optimization method in cellular network
CN105142224A (en) Fast optimization algorithm of D2D power distribution in case of single-channel cellular users
CN108551673A (en) A kind of data safety shunting transmission method based on gradient search
CN108495308A (en) A kind of data safety shunting transmission method based on linear search
CN108282788A (en) A kind of resource allocation methods of the Energy Efficient based on quasi- newton interior point method
CN108601083B (en) Resource management method based on non-cooperative game in D2D communication
CN105227222B (en) A kind of extensive MIMO beam-forming method of high energy efficiency using statistical channel status information
CN105007585B (en) Power distribution method based on outage probability efficiency maximum
CN109548011A (en) A kind of data safety shunting transmission method
Lu et al. Resource and trajectory optimization for UAV-relay-assisted secure maritime MEC

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