CN108901028A - The combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency - Google Patents

The combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency Download PDF

Info

Publication number
CN108901028A
CN108901028A CN201810662979.7A CN201810662979A CN108901028A CN 108901028 A CN108901028 A CN 108901028A CN 201810662979 A CN201810662979 A CN 201810662979A CN 108901028 A CN108901028 A CN 108901028A
Authority
CN
China
Prior art keywords
energy
user
sending node
time
collection
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201810662979.7A
Other languages
Chinese (zh)
Other versions
CN108901028B (en
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.)
Guangdong University of Technology
Original Assignee
Guangdong University of Technology
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 Guangdong University of Technology filed Critical Guangdong University of Technology
Priority to CN201810662979.7A priority Critical patent/CN108901028B/en
Publication of CN108901028A publication Critical patent/CN108901028A/en
Application granted granted Critical
Publication of CN108901028B publication Critical patent/CN108901028B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10Dynamic resource partitioning
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14Spectrum sharing arrangements between different networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W12/00Security arrangements; Authentication; Protecting privacy or anonymity
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to the technical fields of communication means to include the following steps more particularly, to the combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency:Each node transmission rate in cooperative cognitive radio net is calculated, secondary user's sending node sends power PRBound and collection of energy factor ρ value range;Take m equally distributed PRAnd n equally distributed ρ;By PRAnd ρ is substituted into, and all possible primary user's safe capacity R is calculated using the method for exhaustionSECAnd secondary user's sending node dump energyGiven weighting factor δ, is obtained by calculation RSECWithMaximum weighted andThe present invention considers that time user's sending node has the function of the executive mode of collaboration communication between collection of energy and primary user's network and secondary user's sending node, then combined optimization primary user in cognitive radio network safe capacity and time user's energy efficiency, while guaranteeing primary user's communication security capacity, the dump energy of user's sending node is maximized.

Description

The combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency
Technical field
The present invention relates to the technical fields of communication means, more particularly, to cooperative cognitive radio net safe capacity With the combined optimization method of energy efficiency.
Background technique
With the explosive increase of mobile communication equipment and the continuous expansion of cordless communication network scale, on the one hand, wireless Frequency spectrum resource becomes further rare;On the other hand, the utilization rate of allocated frequency spectrum resource waits to improve.As a kind of emerging skill Art, cognitive radio (Cognitive Radio, CR) allow time user (Secondary User, SU) to use primary user The idle frequency spectrum of (Primary User, PU) improves the utilization rate of frequency spectrum resource to effectively solve the problems, such as " frequency spectrum is hungry ". Due to the finite energy of conventional mobile device, single battery-powered mode is no longer satisfied the needs of wireless communication system. Collection of energy (Energy Harvesting, EH) technology by renewable energy, such as solar energy, wind energy etc., is drawn from environment Take energy for communicating, it is unlimited that the energy collected can be.Using EH technology, the utilization of clean energy resource can be greatly improved Rate extends the lifetime of wireless telecom equipment.Since primary user PU sends message using the forms of broadcasting in communication process, exist The risk being ravesdropping.Although can be with effective guarantee communication security, due to the meter of mobile device using cryptography encryption technology Calculation ability is limited, and the operation higher enciphering and deciphering algorithm of complexity is easy the more energy of consumption equipment, to reduce the continuous of equipment Boat ability.Existing program assumes that equipment possesses enough energy and communicated more at present, does not meet reality.In addition, existing scheme The safe capacity problem of more research primary users or the safe capacity problem of secondary user, have ignored time energy dose-effect of user's sending node Rate.
Summary of the invention
It is an object of the invention to overcome the deficiencies of the prior art and provide cooperative cognitive radio net safe capacity and energy The combined optimization method of amount efficiency, to primary user and time subscriber channel money in a collection of energy cooperative cognitive radio net The reasonable distribution in source makes primary user's sending node reach communication security capacity;And guaranteeing the same of primary user's communication security capacity When, time dump energy of user's sending node R is maximized, time user's sending node long time continuous working is enable.
In order to solve the above technical problems, the technical solution adopted by the present invention is that:
There is provided cooperative cognitive radio net safe capacity and energy efficiency combined optimization method, the cooperative cognitive without Gauze network includes primary user's sending node S, primary user's receiving node D, one user's sending node R, one time A user's receiving node O and listener-in E;The combined optimization method includes the following steps:
S1. the transmission rate of each node in cooperative cognitive radio net is calculated, and calculates time user's sending node Send power PRBound, calculate collection of energy factor ρ value range;
S2. the P being calculated from step S1RAnd m equally distributed P are taken out in the value range of ρRValue and n are a uniformly The ρ value of distribution;
S3. the P obtained based on step S2RAll possible primary user's safety is calculated using the method for exhaustion in value and ρ value Capacity RSECValue and secondary user's sending node dump energyValue, respectively be stored in two 1 × mn matrix in, the two it Between be one-to-one relationship, i.e. a RSECIt is one corresponding
S4. weighting factor δ is given, all R in step S3 are calculatedSECWithWeighted sum, obtain by comparing Weighted sum StradeoffMaximum value.
The combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency of the invention, in an energy It collects in cooperative cognitive radio net to the reasonable distribution of primary user and time subscriber channel resource, reaches primary user's sending node To communication security capacity;And while guaranteeing primary user's communication security capacity, time residual energy of user's sending node R is maximized Amount enables time user's sending node long time continuous working.
Preferably, the transmission power P of time user's sending node described in step S1RBound be:
In formula, VROThe minimum transmission rate needed between secondary user's sending node R and secondary user's receiving node O, β are association Make the communication factor, W is channel width, N0For single side power extension density, the collection of energy effect that ∈ is time user's sending node R Rate, hROThe fading channel factor between R and O.
The value range of collection of energy factor ρ described in step S1 is expressed as:
In formula, Q is the data volume (unit bit) that primary user's sending node S is sent, VpFor primary user's sending node S's Power is sent, T is the unit time.
Preferably, the method for exhaustion described in step S3 is included the following steps using the double-deck circulation, execution method:
S31. i=1 is enabled, outer loop is executed, remembers that the transmission power of secondary user's sending node at this time is
S32. j=1 is enabled, internal circulation is executed, remembers that the collection of energy factor at this time is ρj
S33. it substitutes intoAnd ρj, calculate primary user's safe capacity RSEC, it is stored in 1 × mn matrix;Calculate time user ENERGY E needed for sending node sends messageTXIf secondary user's sending node is unable to satisfy transmission demand, continue to collect energy, directly To meet demand, then calculate time user's sending node dump energyThe matrix that obtained result is stored in a 1 × mn is worked as In;
S34. j=j+1 is enabled, step S33 is jumped to, circulation inside next round is executed, when j > n, jumps out inside and follow Ring executes step S35;
S35. i=i+1 is enabled, step S32 is jumped to, executes next round outer loop, when i > m, outer loop is whole Only.
Preferably, ENERGY E needed for time user's sending node described in step S33 sends messageTXFor:
ETX=PR(1-ρ)T
ETXCollaboration communication is carried out including secondary user's sending node and sends own message to time energy of user's receiving node Amount consumption, after message is sent, secondary user's sending node dump energyIt is updated to:
In formula,For secondary user's sending node time slot T primary power,Disappear for secondary user's sending node in transmission Collected energy before breath, by updated dump energyPrimary power as time slot T+1.
Preferably, whether time user's sending node dump energy meets the judgment method of transmission demand and includes in step S33:
(1) whenWhen, it is believed that it is unsatisfactory for transmission demand at this time, secondary user's sending node will carry out collection of energy, directly To meet demand;By the collection of energy of n time slot, the primary power of secondary user's sending node is updated toT is time slot, and ∈ is the efficiency of energy collection of R;
(2) whenWhen, it is believed that it is unsatisfactory for transmission demand at this time, secondary user's sending node will continue energy receipts Collection, until meet demand;By the collection of energy of n time slot, the energy that secondary user's sending node is collected into is updated toT is time slot, and ∈ is the efficiency of energy collection of R;
(3) whenWhen, it is believed that it is unsatisfactory for transmission demand at this time, secondary user's sending node will continue Collection of energy, until meet demand;By the collection of energy of n time slot, the gross energy of secondary user's sending node is updated toT is time slot, and ∈ is the efficiency of energy collection of R.
Preferably, in step S4, weighted sum StradeoffFor:
In formula, Weightfactor of the δ between safe capacity and efficiency of energy collection, 0 < δ < 1.
Compared with prior art, the beneficial effects of the invention are as follows:
The combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency of the invention considers time user Sending node has the function of collection of energy, and the execution side of collaboration communication is used between primary user's network and secondary user's sending node Formula can weigh primary user in cognitive radio network safe capacity and time user's energy efficiency, in conjunction with collection of energy and association It communicates, classifying rationally is carried out to channel, primary user's sending node is enable to realize that secure communication, secondary user's sending node continue It works long hours, while guaranteeing primary user's communication security capacity, maximizes time dump energy of user's sending node.
Detailed description of the invention
Fig. 1 is one middle and small scale cover type cognitive radio networks illustraton of model of embodiment.
Fig. 2 is the working time slot dividing condition schematic diagram to primary user and time user.
Fig. 3 is the execution flow chart of small-scale cover type cognitive radio networks.
Fig. 4 is the flow chart of the combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency.
Fig. 5 is that fixed user's sending node sends power PRWhen, collaboration communication factor ρ and weighting factor δ are to target letter Several influence schematic diagrames.
When Fig. 6 is fixed collaboration communication factor ρ, secondary user's sending node sends power PRWith weighting factor δ to target letter Several influence schematic diagrames.
Specific embodiment
The present invention is further illustrated With reference to embodiment.Wherein, attached drawing only for illustration, What is indicated is only schematic diagram, rather than pictorial diagram, should not be understood as the limitation to this patent;Reality in order to better illustrate the present invention Example is applied, the certain components of attached drawing have omission, zoom in or out, and do not represent the size of actual product;To those skilled in the art For, the omitting of some known structures and their instructions in the attached drawings are understandable.
The same or similar label correspond to the same or similar components in the attached drawing of the embodiment of the present invention;It is retouched in of the invention In stating, it is to be understood that if the orientation or positional relationship for having the instructions such as term " on ", "lower", "left", "right" is based on attached drawing Shown in orientation or positional relationship, be merely for convenience of description of the present invention and simplification of the description, rather than indication or suggestion is signified Device or element must have a particular orientation, be constructed and operated in a specific orientation, therefore positional relationship is described in attached drawing Term only for illustration, should not be understood as the limitation to this patent, for the ordinary skill in the art, can To understand the concrete meaning of above-mentioned term as the case may be.
Embodiment 1
It is excellent for cooperative cognitive radio net safe capacity of the invention and combining for energy efficiency as shown in Figures 1 to 6 The embodiment of change method, includes the following steps:
S1. the transmission rate of each node in cooperative cognitive radio net is calculated, and calculates time user's sending node Send power PRBound, calculate collection of energy factor ρ value range;
S2. the P being calculated from step S1RAnd m equally distributed P are taken out in the value range of ρRValue and n are a uniformly The ρ value of distribution;
S3. the P obtained based on step S2RAll possible primary user's safety is calculated using the method for exhaustion in value and ρ value Capacity RSECValue and secondary user's sending node dump energyValue, respectively be stored in two 1 × mn matrix in, the two it Between be one-to-one relationship, i.e. a RSECIt is one corresponding
S4. weighting factor δ is given, all R in step S3 are calculatedSECWithWeighted sum, obtain by comparing Weighted sum StradeoffMaximum value.
Specifically, the method for exhaustion described in step S3 is included the following steps using the double-deck circulation, execution method:
S31. i=1 is enabled, outer loop is executed, remembers that the transmission power of secondary user's sending node at this time is
S32. j=1 is enabled, internal circulation is executed, remembers that the collection of energy factor at this time is ρj
S33. it substitutes intoAnd ρj, calculate primary user's safe capacity RSEC, it is stored in 1 × mn matrix;Calculate time user ENERGY E needed for sending node sends messageTXIf secondary user's sending node is unable to satisfy transmission demand, continue to collect energy, directly To meet demand, then calculate time user's sending node dump energyThe matrix that obtained result is stored in a 1 × mn is worked as In;
S34. j=j+1 is enabled, step S33 is jumped to, circulation inside next round is executed, when j > n, jumps out inside and follow Ring executes step S35;
S35. i=i+1 is enabled, step S32 is jumped to, executes next round outer loop, when i > m, outer loop is whole Only.
The present embodiment is illustrated by taking a small-scale cover type cognitive radio networks as an example, as shown in Figure 1, including one A primary user's sending node S, primary user's receiving node D, one user's sending node R, one user's receiving node O An and listener-in E.To realize that collaboration communication, the energy that R consumption is collected into help S to forward the message to D.In addition, E can be eavesdropped S, the communication between D and R, and attempt to obtain the raw information that they send.In figure, h indicates the fading channel factor.The present embodiment It is assumed that the communication between R to O be it is non-secret, i.e., do not consider the safe capacity of user network, while assuming that S and D possess enough Energy, and R is energy constraint, and should collect enough energy before work and be passed with carrying out collaboration communication and own message It is defeated.
As shown in Figure 2 to Figure 3, the executive mode of collaboration communication is used between primary user's network and secondary user's sending node. The working time slot of primary user and time user are divided first, ρ indicates time user's sending node as the collection of energy factor The ratio of collection of energy time;(1- β) is used as the collaboration communication factor, indicates collaboration communication time slot ratio shared by (1- ρ) T time Example.In [0, the ρ T] period, R first energy is collected in environment, for next stage assist S forward the message to D and oneself Send messages to O use;When R is collecting energy, S can not be assisted to forward message, S will directly transmit message to D at this time, be somebody's turn to do Partial information will be eavesdropped by E, and therefore, S can only send non-secret message to D in [0, the ρ T] period, and classified information is then being assisted Make communication time slot forwarding;If S has more classified information to be forwarded, but cannot forward completion completely in a time slot T, then It can continue to forward in nT time slot, wherein { 1,2,3 ... } n ∈.Then S and R carries out collaboration communication, wherein [ρ T, ρ T+ (1- α) (1- β) (1- ρ) T] first stage of the time slot as cooperation transmission, the classified information of oneself is sent to R by S.Due to being broadcast Form, D and E also will receive the message of S transmission.In second stage [ρ T+ (1- α) (1- β) (1- ρ) T, ρ the T+ (1- of cooperation transmission β) (1- ρ) T], R can help S to forward the message to D, and be listened to by E.Finally it is left β (1- ρ) T time slot and leaves R for as return Time slot, the authorized spectrum band that R can use S at this time send messages to O.In addition, present embodiment assumes that in this communication network, respectively Channel width when communicating between a user is W.
To calculate safe capacity, the transmission rate of different nodes is analyzed respectively.By shannon formula it is found that the wink of R When transmission rate VRFor:
In formula (1), P indicates the transmission power (P > 0) of node S, N0Indicate single side power extension density.Since D is cooperating The first stage of transmission all receives message with second stage, channel width when W is communicated between each user;By maximum Ratio combines the instantaneous transmission rate V it is found that DDFor:
Similarly, E has received message in 2 stages of cooperation transmission, therefore, the instantaneous transmission rate V of EEIt is represented by:
The present invention uses DF cooperation transmission mechanism, therefore the transmission rate that D and E is totalWithEqual to cooperation transmission two The minimum value in stage, i.e.,:
And
Association type (1)~(5) can obtain:
Being defined by safe capacity can obtain, primary user's safe capacity RSECFor:
In formula, [x]+It is defined asAssuming that β, ρ are it is known that as (1- α) VR≥αVDWhen, it is availableR at this timeSEC=α (1- β) (1- ρ) [VD-VE]+, it can be seen that this is a dull delivery function, therefore is maximized RSECIt is equivalent to and maximizes α, i.e.,As (1- α) VR< α VDWhen, it is availableR at this timeSEC= (1-β)(1-ρ)[VR-α(VR+VE)]+, by above-mentioned [x]+Definition is it is found that when α minimum, RSECObtain maximum value.
To sum up, the optimal value of α isAt this time:
Then collection of energy and energy consuming process are quantified.It is assumed that in each time slot T, S sends Q, and (unit is Bit) data, transmission rate Vp, then in [0, the ρ T] period, the data that S is sent are Vpρ T (unit bit) and the part number According to should be non-secret data.Remaining secret data (Q-Vpρ T) (unit bit) need to transmit by collaboration communication.In addition, ∈ is enabled to indicate the efficiency of energy collection of R, then in [0, the ρ T] period, the energy that R is collected into is ∈ ρ T, it is assumed that the transmission power of R For PR, then cooperation transmission consumption energy is PR(1-β)(1-ρ)T, dump energy ∈ ρ T-PR(1- β) (1- ρ) T will support R transmission to disappear Cease O.
By above-mentioned derivation it is found that the transmission rate between R and O isThe rate is not The rate V of demand can be less thanRO, it is expressed as:
In addition, after cooperation transmission, secondary user's sending node dump energy ∈ ρ T-PR(1- β) (1- ρ) T, and secondary user sends Energy needed for communicating between node and secondary user's receiving node is PRβ (1- ρ) T, therefore have:
Defining energy efficiency is time remaining energy of user's sending node, is expressed as:
Wherein:
ETX=PR(1-ρ)T (15)
In formula,Time user's sending node was indicated in the primary power of time slot T, by formula (13) it is found that its value and upper a period of time The value of gap T-1 dump energy is equal;Formula (14) indicates time user's sending node collected energy before facilitating communications next time, After some time slot, the energy that secondary user is possessed may be unable to satisfy collaboration communication next time, it is thus possible to can consume n A T time carries out collection of energy;Formula (15) indicates that time user's sending node carries out collaboration communication and sends own message to secondary The energy consumption of user's receiving node.
To make the safe capacity of primary user maximum, secondary user's sending node, which needs to improve, sends power, but it is continued a journey Ability can also decrease, and there is contradictory relation between the two.In order to guarantee the secure communication of primary user, while improving time user Cruising ability, the optimization aim of the present embodiment can be defined as:
Obj:
0 < α, β < 1
In formula, Weightfactor of the δ between safe capacity and efficiency of energy collection.User can change according to self-demand Then the value of δ is turned up if user it is expected to obtain higher safe capacity value for the value of δ;If it is expected that higher energy efficiency, Then 1- δ is turned up.
When judging that can time user's sending node meet message transmission demand, the present embodiment provides three kinds of judgment methods:
(1) whenWhen, it is believed that it is unsatisfactory for transmission demand at this time, secondary user's sending node will carry out collection of energy, until Meet demand.By the collection of energy of n time slot, the primary power of secondary user's sending node is updated to
(2) whenWhen, it is believed that it is unsatisfactory for transmission demand at this time, secondary user's sending node will continue energy receipts Collection, until meet demand.By the collection of energy of n time slot, the energy that secondary user's sending node is collected into is updated to
(3) whenWhen, it is believed that it is unsatisfactory for transmission demand at this time, secondary user's sending node will continue Collection of energy, until meet demand.By the collection of energy of n time slot, the gross energy of secondary user's sending node is updated to
By comparing experiment, influence of these three the available way of contrast to efficiency of energy collection.Note solves mesh The weighted sum of primary user's safe capacity and time user's dump energy is S in marktradeoff.As shown in figure 5, given PR=4, x-axis table Show collaboration communication factor ρ ∈ (0,1], y-axis indicate weighting factor δ ∈ (0,1], z-axis indicate solve target Stradeoff, can by figure Know, the tradeoff of primary user's safe capacity and time user efficiency of energy collection be it is achievable, variation tendency is in " multimodal " shape.Figure 5 (a-c) respectively indicate judgment mode (1)-(3) to solution target StradeoffInfluence, note maximum value beIt can by figure Know, it is available using judgment mode (1)It can be obtained using judgment mode (2)Using judgement Mode (3) can obtainIt follows that fixed PRWhen, employing mode (1) can obtain bigger benefit.In addition, When fixed ρ value, when employing mode (1) and (3) are judged, StradeoffThe linear increasing trend at ridge, elsewhere Linear decrease.And when employing mode (2), StradeoffAlways inversely with δ.
As shown in fig. 6, given ρ=0.2, x-axis indicates time transmission power P of user's sending nodeR∈ [Isosorbide-5-Nitrae], y-axis indicate Weighting factor δ ∈ (0,1], z-axis indicates to solve target Stradeoff.As seen from the figure, the trade-off problem that the present invention is studied is can be real Existing, variation tendency is also in " multimodal " shape.Fig. 6 (a-c) respectively indicates influence of judgment mode (1)~(3) to target is solved, It is wherein available using judgment mode (1)It can be obtained using judgment mode (2)Using sentencing Disconnected mode (3) can obtainIt follows that as fixed ρ, the available bigger benefit of employing mode (2).This Outside, when fixed ρ value, when employing mode (1) and (3) are judged, StradeoffThe linear increasing trend at ridge, on other ground Square linear decrease.And when employing mode (2), StradeoffAlways inversely with δ.
By above step, the present invention is for primary user in cognitive radio network safe capacity and time user's energy efficiency Trade-off problem classifying rationally is carried out to channel, primary user's sending node is made to realize peace in conjunction with collection of energy and collaboration communication Full communication, secondary user's sending node can work for a long time.
Obviously, the above embodiment of the present invention be only to clearly illustrate example of the present invention, and not be pair The restriction of embodiments of the present invention.For those of ordinary skill in the art, may be used also on the basis of the above description To make other variations or changes in different ways.There is no necessity and possibility to exhaust all the enbodiments.It is all this Made any modifications, equivalent replacements, and improvements etc., should be included in the claims in the present invention within the spirit and principle of invention Protection scope within.

Claims (6)

1. the combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency, the cooperative cognitive wireless network It is connect including primary user's sending node S, primary user's receiving node D, one user's sending node R, one user Receive a node O and listener-in E;It is characterized in that, the combined optimization method includes the following steps:
S1. the transmission rate of each node in cooperative cognitive radio net is calculated, and calculates time transmission of user's sending node Power PRBound, calculate collection of energy factor ρ value range;
S2. the P being calculated from step S1RAnd m equally distributed P are taken out in the value range of ρRValue and n are uniformly distributed ρ value;
S3. the P obtained based on step S2RValue and ρ value, are calculated all possible primary user's safe capacity using the method for exhaustion RSECValue and secondary user's sending node dump energyValue, respectively be stored in two 1 × mn matrix in, between the two for One-to-one relationship, i.e. a RSECIt is one corresponding
S4. weighting factor δ is given, all R in step S3 are calculatedSECWithWeighted sum, obtain weighted sum by comparing StradeoffMaximum value.
2. the combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency according to claim 1, It is characterized in that, the transmission power P of time user's sending node described in step S1RBound be:
In formula, VROThe minimum transmission rate needed between secondary user's sending node R and secondary user's receiving node O, β are that cooperation is logical Believe the factor, W is channel width, N0For single side power extension density, ∈ is time efficiency of energy collection of user's sending node R, hRO The fading channel factor between R and O.
The value range of collection of energy factor ρ described in step S1 is expressed as:
In formula, Q is the data volume (unit bit) that primary user's sending node S is sent, VpFor the transmission function of primary user's sending node S Rate, T are the unit time.
3. the combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency according to claim 1, It is characterized in that, the method for exhaustion described in step S3, using the double-deck circulation, execution method includes the following steps:
S31. i=1 is enabled, outer loop is executed, remembers that the transmission power of secondary user's sending node at this time is
S32. j=1 is enabled, internal circulation is executed, remembers that the collection of energy factor at this time is ρj
S33. it substitutes intoAnd ρj, calculate primary user's safe capacity RSEC, it is stored in 1 × mn matrix;Time user is calculated to send ENERGY E needed for node sends messageTXIf secondary user's sending node is unable to satisfy transmission demand, continue to collect energy, Zhi Daoman Sufficient demand, then calculate time user's sending node dump energyObtained result is stored in the matrix of a 1 × mn;
S34. j=j+1 is enabled, step S33 is jumped to, circulation inside next round is executed, when j > n, jumps out internal circulation, hold Row step S35;
S35. i=i+1 is enabled, step S32 is jumped to, executes next round outer loop, when i > m, outer loop is terminated.
4. the combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency according to claim 3, It is characterized in that, ENERGY E needed for time user's sending node transmission message described in step S33TXFor:
ETX=PR(1-ρ)T
ETXThe energy for carrying out collaboration communication including secondary user's sending node and sending own message to secondary user's receiving node disappears Consumption, after message is sent, secondary user's sending node dump energyIt is updated to:
In formula,For secondary user's sending node time slot T primary power,Before the message for secondary user's sending node Collected energy, by updated dump energyPrimary power as time slot T+1.
5. the combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency according to claim 3, It is characterized in that, the judgment method that whether secondary user's sending node dump energy meets transmission demand in step S33 includes:
(1) whenWhen, it is believed that it is unsatisfactory for transmission demand at this time, secondary user's sending node will carry out collection of energy, Zhi Daoman Sufficient demand;By the collection of energy of n time slot, the primary power of secondary user's sending node is updated to T is time slot, and ∈ is the efficiency of energy collection of R;
(2) whenWhen, it is believed that it is unsatisfactory for transmission demand at this time, secondary user's sending node will continue collection of energy, Zhi Daoman Sufficient demand;By the collection of energy of n time slot, the energy that secondary user's sending node is collected into is updated to T is time slot, and ∈ is the efficiency of energy collection of R;
(3) whenWhen, it is believed that it is unsatisfactory for transmission demand at this time, secondary user's sending node will continue energy It collects, until meet demand;By the collection of energy of n time slot, the gross energy of secondary user's sending node is updated toT is time slot, and ∈ is the efficiency of energy collection of R.
6. the combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency according to claim 1, It is characterized in that, in step S4, weighted sum StradeoffFor:
In formula, weighting factor of the δ between safe capacity and efficiency of energy collection, 0 < δ < 1.
CN201810662979.7A 2018-06-25 2018-06-25 Cooperative cognitive radio network safety capacity and energy efficiency joint optimization method Active CN108901028B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810662979.7A CN108901028B (en) 2018-06-25 2018-06-25 Cooperative cognitive radio network safety capacity and energy efficiency joint optimization method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810662979.7A CN108901028B (en) 2018-06-25 2018-06-25 Cooperative cognitive radio network safety capacity and energy efficiency joint optimization method

Publications (2)

Publication Number Publication Date
CN108901028A true CN108901028A (en) 2018-11-27
CN108901028B CN108901028B (en) 2022-06-24

Family

ID=64346130

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810662979.7A Active CN108901028B (en) 2018-06-25 2018-06-25 Cooperative cognitive radio network safety capacity and energy efficiency joint optimization method

Country Status (1)

Country Link
CN (1) CN108901028B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109769254A (en) * 2018-12-10 2019-05-17 南京邮电大学 A kind of cognition wireless supply network resource allocation methods based on weighted-fair
CN110266704A (en) * 2019-06-25 2019-09-20 河南科技大学 Based on the authoring system safety of physical layer communication means for assisting cognitive user selection
WO2020143769A1 (en) * 2019-01-11 2020-07-16 Mediatek Inc. Electronic devices and methods for determining energy efficiency

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017160723A1 (en) * 2016-03-15 2017-09-21 Northeastern University Distributed wireless charging system and method
CN107454603A (en) * 2017-07-19 2017-12-08 广东工业大学 Collection of energy cooperative cognitive radio net safe capacity optimization method
CN107659991A (en) * 2017-10-09 2018-02-02 西北工业大学 A kind of energy distributing method in double bounce collection of energy junction network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017160723A1 (en) * 2016-03-15 2017-09-21 Northeastern University Distributed wireless charging system and method
CN107454603A (en) * 2017-07-19 2017-12-08 广东工业大学 Collection of energy cooperative cognitive radio net safe capacity optimization method
CN107659991A (en) * 2017-10-09 2018-02-02 西北工业大学 A kind of energy distributing method in double bounce collection of energy junction network

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
LONG CHEN等: "primary secrecy is achievable:optimal secrecy rate in overlay CRNs with an energy harvesting secondary transmitter", 《2015 24TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND NETWORKS (ICCCN)》 *
SIXING YIN等: "optimal cooperation strategy in cognitive radio systems with energy harvesting", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》 *
SUZHI BI等: "Computation rate maximization for wireless powered mobile-edge computing with binary computation offloading", 《EEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》 *
刘杰群等: "能量收集全双工中继网络中的中继选择策略研究", 《信号处理》 *
郭艳艳等: "基于能量收集的认知无线电资源分配研究", 《测试技术学报》 *
雷维嘉等: "能量收集协同干扰中继系统保密速率优化", 《电子科技大学学报》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109769254A (en) * 2018-12-10 2019-05-17 南京邮电大学 A kind of cognition wireless supply network resource allocation methods based on weighted-fair
CN109769254B (en) * 2018-12-10 2021-12-14 南京邮电大学 Cognitive wireless power supply network resource allocation method based on weighted fairness
WO2020143769A1 (en) * 2019-01-11 2020-07-16 Mediatek Inc. Electronic devices and methods for determining energy efficiency
US11160019B2 (en) 2019-01-11 2021-10-26 Mediatek Inc. Electronic devices and methods for determining energy efficiency
CN110266704A (en) * 2019-06-25 2019-09-20 河南科技大学 Based on the authoring system safety of physical layer communication means for assisting cognitive user selection
CN110266704B (en) * 2019-06-25 2021-05-28 河南科技大学 Authorization system physical layer secure communication method based on assisted cognitive user selection

Also Published As

Publication number Publication date
CN108901028B (en) 2022-06-24

Similar Documents

Publication Publication Date Title
Yang et al. Heterogeneous cellular network with energy harvesting-based D2D communication
Elsmany et al. EESRA: Energy efficient scalable routing algorithm for wireless sensor networks
Xiao et al. Energy-efficient mobile association in heterogeneous networks with device-to-device communications
CN108901028A (en) The combined optimization method of cooperative cognitive radio net safe capacity and energy efficiency
Xiong et al. Energy-efficient resource allocation in OFDMA networks
Ouyang et al. An effective early message ahead join adaptive data aggregation scheme for sustainable IoT
CN105744629B (en) A kind of time-optimized distribution method of energy acquisition relay system based on relay selection
Wang et al. Primary privacy preserving with joint wireless power and information transfer for cognitive radio networks
Xu et al. Energy-aware power control in energy cooperation aided millimeter wave cellular networks with renewable energy resources
CN107172705A (en) The wireless beam optimization method and system for taking energy heterogeneous network
Zhang et al. Utility-and fairness-based spectrum allocation of cellular networks by an adaptive particle swarm optimization algorithm
Liu et al. Nonorthogonal multiple access for wireless-powered IoT networks
CN101610517A (en) Cognitive network resource management system and management method
Hao et al. Power control and channel allocation optimization game algorithm with low energy consumption for wireless sensor network
Rajiullah et al. An energy-aware periodical data gathering protocol using deterministic clustering in wireless sensor networks (WSN)
Hu et al. α–β AoI penalty in wireless-powered status update networks
Jiang et al. Joint link scheduling and routing in two-tier rf-energy-harvesting iot networks
Lee et al. Opportunistic power scheduling for multi-server wireless systems with minimum performance constraints
Chen et al. A LEACH-based WSN energy balance routing algorithm
Yang et al. Power control and resource allocation for multi-cell OFDM networks
CN105960005B (en) The Poewr control method of user fairness is ensured in super-intensive network
CN102438245B (en) Allying method for acknowledging radio communication alliance
CN108810855A (en) Sub-clustering D2D resource allocation methods based on energy constraint and interference restricted area
Yao et al. Increasing throughput in energy-based opportunistic spectrum access energy harvesting cognitive radio networks
CN105704722B (en) Spectrum resource allocation method based on grouping game exchange and optimization power control

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