CN108901028B - Cooperative cognitive radio network safety capacity and energy efficiency joint optimization method - Google Patents

Cooperative cognitive radio network safety capacity and energy efficiency joint optimization method Download PDF

Info

Publication number
CN108901028B
CN108901028B CN201810662979.7A CN201810662979A CN108901028B CN 108901028 B CN108901028 B CN 108901028B CN 201810662979 A CN201810662979 A CN 201810662979A CN 108901028 B CN108901028 B CN 108901028B
Authority
CN
China
Prior art keywords
energy
secondary user
node
sending
sending node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810662979.7A
Other languages
Chinese (zh)
Other versions
CN108901028A (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

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14—Spectrum sharing arrangements between different networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • 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)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to the technical field of communication methods, in particular to a joint optimization method for safety capacity and energy efficiency of a cooperative cognitive radio network, which comprises the following steps: calculating the sending rate of each node in the cooperative cognitive radio network and the sending power P of the secondary user sending nodeRThe upper and lower bounds of (c) and the value range of the energy collection factor ρ; taking m uniformly distributed PRAnd n uniformly distributed ρ; will PRSubstituting rho, and calculating to obtain the safe capacity R of all possible main users by adopting an exhaustion methodSECAnd secondary user transmitting node residual energy
Figure DDA0001706936660000011
Given a trade-off factor δ, R is calculatedSECAnd
Figure DDA0001706936660000012
maximum weighted sum of
Figure DDA0001706936660000013
According to the method, the secondary user sending node has an energy collecting function and an execution mode of cooperative communication between the primary user network and the secondary user sending node is considered, then the safety capacity of the primary user and the energy efficiency of the secondary user in the cognitive radio network are jointly optimized, and the residual energy of the user sending node is maximized while the safety capacity of the communication of the primary user is ensured.

Description

Cooperative cognitive radio network safety capacity and energy efficiency joint optimization method
Technical Field
The invention relates to the technical field of communication methods, in particular to a joint optimization method for safety capacity and energy efficiency of a cooperative cognitive radio network.
Background
With the explosive growth of mobile communication devices and the increasing scale of wireless communication networks, on the one hand, wireless spectrum resources become increasingly scarce; on the other hand, the utilization of the allocated spectrum resources is still to be improved. As a new technology, Cognitive Radio (CR) allows a Secondary User (SU) to use an idle spectrum of a Primary User (PU), thereby effectively solving the problem of "spectrum starvation" and improving the utilization rate of spectrum resources. Due to the limited power of conventional mobile devices, a single battery powered approach has not been able to meet the needs of wireless communication systems. Energy Harvesting (EH) technology draws Energy from the environment for communication by means of renewable Energy sources, such as solar, wind, etc., the Energy harvested can be unlimited. By utilizing the EH technology, the utilization rate of clean energy can be greatly improved, and the life cycle of the wireless communication equipment is prolonged. As the main user PU sends the message in a broadcasting mode in the communication process, the risk of interception exists. Although the communication security can be effectively guaranteed by using the cryptographic encryption technology, the computing capacity of the mobile equipment is limited, and the encryption and decryption algorithm with higher running complexity easily consumes more energy of the equipment, so that the cruising ability of the equipment is reduced. The existing scheme does not meet the practical requirement that the equipment has enough energy for communication. In addition, the existing scheme mostly researches the safety capacity problem of a primary user or the safety capacity problem of a secondary user, and ignores the energy efficiency of a secondary user sending node.
Disclosure of Invention
The invention aims to overcome the defects of the prior art, provides a joint optimization method of the safety capacity and the energy efficiency of a cooperative cognitive radio network, and reasonably distributes channel resources of a primary user and a secondary user in an energy collection cooperative cognitive radio network to ensure that a transmitting node of the primary user achieves the communication safety capacity; and the residual energy of the secondary user sending node R is maximized while the safe communication capacity of the primary user is ensured, so that the secondary user sending node can continuously work for a long time.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows:
the cooperative cognitive radio network comprises a main user sending node S, a main user receiving node D, a secondary user sending node R, a secondary user receiving node O and an eavesdropper E; the joint optimization method comprises the following steps:
s1, calculating the sending rate of each node in the cooperative cognitive radio network and calculating the sending power P of a secondary user sending nodeRCalculating the value range of the energy collection factor rho;
s2. P calculated from step S1RAnd m uniformly distributed P are taken out in the value range of rhoRValues and n uniformly distributed ρ values;
s3, P obtained based on step S2RCalculating the values and rho values to obtain the safe capacity R of all possible main users by adopting an exhaustion methodSECValue and secondary user transmit node residual energy
Figure GDA0003657723740000021
The values are stored in two 1 xmn matrices in a one-to-one correspondence, i.e. one RSECCorresponds to one
Figure GDA0003657723740000022
S4, given a weighing factor delta, calculating to obtain all R in the step S3SECAnd
Figure GDA0003657723740000023
by comparison to obtain a weighted sum StradeoffIs measured.
The invention relates to a combined optimization method of safe capacity and energy efficiency of a cooperative cognitive radio network, which reasonably distributes channel resources of a primary user and a secondary user in an energy collection cooperative cognitive radio network to ensure that a transmitting node of the primary user reaches the safe communication capacity; and the residual energy of the secondary user sending node R is maximized while the safe communication capacity of the primary user is ensured, so that the secondary user sending node can continuously work for a long time.
Preferably, the transmission power P of the secondary user transmitting node in step S1RThe upper and lower bounds of (A) are:
Figure GDA0003657723740000024
in the formula, VROThe minimum sending rate required between a secondary user sending node R and a secondary user receiving node O, beta is a cooperative communication factor, W is a channel bandwidth, N0The density is a single-sided power spreading density,
Figure 100002_DEST_PATH_IMAGE002
sending the energy collection efficiency, h, of node R for the secondary userROIs the channel attenuation factor between R and O.
In step S1, the value range of the energy collection factor ρ is represented as:
Figure GDA0003657723740000025
in the formula, Q is the data volume (bit) sent by the master user sending node S, and V ispAnd sending the sending power of the node S for the main user, wherein T is unit time.
Preferably, the exhaustive enumeration method in step S3 employs a two-layer loop, and the execution method includes the following steps:
s31, making i equal to 1, executing outer circulation, and recording the transmission power of the user transmission node at the time as
Figure GDA0003657723740000026
S32, enabling j to be 1, executing an internal loop, and recording an energy collection factor at the moment as rhoj；
S33. substitution
Figure GDA0003657723740000027
And ρjCalculating the safe capacity R of the master userSECStoring the data into a 1 × mn matrix; calculating the energy E required by the secondary user sending node to send the messageTXIf the secondary user sending node can not meet the sending requirement, the energy is continuously collected until the requirement is met, and the residual energy of the secondary user sending node is calculated
Figure GDA0003657723740000031
Storing the obtained result into a 1 x mn matrix;
s34, enabling j to be j +1, jumping to the step S33, executing the next round of internal loop, jumping out of the internal loop when j is larger than n, and executing the step S35;
s35, let i equal to i +1, go to step S32, and execute the next round of external loop until i > m, where the external loop is terminated.
Preferably, in step S33, the energy E required by the secondary user sending node to send the message isTXComprises the following steps:
ETX＝PR(1-ρ)T
ETXthe method comprises the steps that a secondary user sending node carries out cooperative communication and sends self information to a secondary user receiving node, and after the information is sent, the secondary user sending node carries out residual energy
Figure GDA0003657723740000032
The updating is as follows:
Figure GDA0003657723740000033
in the formula (I), the compound is shown in the specification,
Figure GDA0003657723740000034
the secondary user transmits the initial energy of the node in time slot T,
Figure GDA0003657723740000035
the updated residual energy is the energy collected by the secondary user sending node before sending the message
Figure GDA0003657723740000036
As the initial energy of slot T + 1.
Preferably, the method for determining whether the remaining energy of the secondary user transmitting node in step S33 satisfies the transmission requirement includes:
(1) when in use
Figure GDA0003657723740000037
When the secondary user sending node does not meet the sending requirement, the secondary user sending node collects energy until the requirement is met; after the energy collection of n time slots, the initial energy of the secondary user transmitting node is updated to
Figure GDA0003657723740000038
n∈Z+And T is a time slot,
Figure 100002_DEST_PATH_IMAGE004
an energy collection efficiency of R;
(2) when in use
Figure GDA0003657723740000039
When the secondary user sending node does not meet the sending requirement, the secondary user sending node continues to collect energy until the requirement is met; after the energy collection of n time slots, the energy collected by the secondary user sending node is updated to
Figure GDA00036577237400000310
n∈Z+T is a time slot,
Figure 100002_DEST_PATH_IMAGE006
an energy collection efficiency of R;
(3) when the temperature is higher than the set temperature
Figure GDA00036577237400000311
When the secondary user sending node does not meet the sending requirement, the secondary user sending node continues to collect energy until the requirement is met; after the energy collection of n time slots, the total energy of the transmitting node of the secondary user is updated to
Figure GDA00036577237400000312
n∈Z+T is a time slot,
Figure 850613DEST_PATH_IMAGE002
the energy collection efficiency is R.
Preferably, in step S4, the sum S is weightedtradeoffComprises the following steps:
Figure GDA00036577237400000313
in the formula, delta is a trade-off factor between the safe capacity and the energy collection efficiency, and delta is more than 0 and less than 1.
Compared with the prior art, the invention has the beneficial effects that:
according to the joint optimization method for the safety capacity and the energy efficiency of the cooperative cognitive radio network, the secondary user sending node is considered to have an energy collecting function, an execution mode of cooperative communication is adopted between the primary user network and the secondary user sending node, the safety capacity of the primary user and the energy efficiency of the secondary user in the cooperative cognitive radio network can be balanced, the channel is reasonably divided by combining the energy collection and the cooperative communication, the safety communication of the primary user sending node is realized, the secondary user sending node can work continuously for a long time, and the residual energy of the secondary user sending node is maximized while the safety capacity of the primary user communication is ensured.
Drawings
Fig. 1 is a diagram of a small-scale coverage cognitive radio network model according to an embodiment.
Fig. 2 is a schematic diagram illustrating the division of the working time slots of the primary user and the secondary user.
Fig. 3 is an execution flow chart of the small-scale overlay type cognitive radio network.
Fig. 4 is a flowchart of a joint optimization method of the safety capacity and the energy efficiency of the cooperative cognitive radio network.
FIG. 5 shows the transmission power P of a fixed secondary user transmitting nodeRAnd (4) illustrating the influence of the cooperative communication factor rho and the balance factor delta on the objective function.
FIG. 6 shows the transmission power P of the transmitting node of the secondary user at a fixed cooperative communication factor ρRAnd the influence of the factor delta on the objective function is illustrated schematically.
Detailed Description
The present invention will be further described with reference to the following embodiments. Wherein the showings are for the purpose of illustration only and are shown by way of illustration only and not in actual form, and are not to be construed as limiting the present patent; to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The same or similar reference numerals in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there is an orientation or positional relationship indicated by the terms "upper", "lower", "left", "right", etc. based on the orientation or positional relationship shown in the drawings, it is only for convenience of describing the present invention and simplifying the description, but it is not intended to indicate or imply that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and therefore, the terms describing the positional relationship in the drawings are only used for illustrative purposes and are not to be construed as limiting the present patent, and the specific meaning of the terms may be understood by those skilled in the art according to specific circumstances.
Example 1
Fig. 1 to fig. 6 show an embodiment of the joint optimization method for the safety capacity and energy efficiency of the cooperative cognitive radio network according to the present invention, which includes the following steps:
s1, calculating the sending rate of each node in the cooperative cognitive radio network and calculating the sending power P of a secondary user sending nodeRCalculating the value range of the energy collection factor rho;
s2. P calculated from step S1RAnd m uniformly distributed P are taken out in the value range of rhoRValues and n uniformly distributed ρ values;
s3, P obtained based on step S2RThe values and the rho value are calculated by adopting an exhaustion method to obtain the safe capacity R of all possible main usersSECValue and secondary user transmit node residual energy
Figure GDA0003657723740000051
The values are stored in two 1 xmn matrices, which are in a one-to-one correspondence, i.e., one RSECCorresponds to one
Figure GDA0003657723740000052
S4, given a weighing factor delta, calculating to obtain all R in the step S3SECAnd
Figure GDA0003657723740000053
by comparison to obtain a weighted sum StradeoffIs measured.
Specifically, the exhaustive enumeration method in step S3 adopts a double-layer loop, and the execution method includes the following steps:
s31, making i equal to 1, executing outer circulation, and recording the transmission power of the user transmission node at the time as
Figure GDA0003657723740000054
S32, enabling j to be 1, executing an internal loop, and recording an energy collection factor at the moment as rhoj；
S33. substitution
Figure GDA0003657723740000055
And ρjCalculating the safe capacity R of the master userSECStoring the data into a 1 × mn matrix; calculating the energy E required by the secondary user sending node to send the messageTXIf the secondary user sending node can not meet the sending requirement, the energy is continuously collected until the requirement is met, and the residual energy of the secondary user sending node is calculated
Figure GDA0003657723740000056
Storing the obtained result into a 1 x mn matrix;
s34, enabling j to be j +1, jumping to the step S33, executing the next round of internal loop, jumping out of the internal loop when j is larger than n, and executing the step S35;
s35, let i equal to i +1, go to step S32, and execute the next round of external loop until i > m, where the external loop is terminated.
The present embodiment is described by taking a small-scale overlay cognitive radio network as an example, and as shown in fig. 1, the small-scale overlay cognitive radio network includes a primary user transmitting node S, a primary user receiving node D, a secondary user transmitting node R, a secondary user receiving node O, and an eavesdropper E. To implement cooperative communication, R consumes the collected energy to help S forward the message to D. In addition, E could eavesdrop S, D on the communication between R and attempt to obtain the original information they sent. In the figure, h denotes a channel attenuation factor. The present embodiment assumes that the communication between R to O is non-confidential, i.e. without regard to the security capabilities of the user network, while assuming that S and D possess sufficient energy, while R is energy limited and should collect sufficient energy for cooperative communication and self message transmission before working.
As shown in fig. 2 to 3, a cooperative communication implementation is adopted between the primary user network and the secondary user sending node. Firstly, dividing the working time slots of a primary user and a secondary user, wherein rho is used as an energy collection factor and represents the proportion of energy collection time of a secondary user sending node; and the (1-beta) is used as a cooperative communication factor and represents the proportion of the cooperative communication time slot in the (1-rho) T time. In the [0, rho ] time period, R collects energy from the environment first for assisting S to forward the message to D and sending the message to O by itself in the next stage; when R is collecting energy, the S cannot be assisted to forward the message, the S directly transmits the message to D, and the partial information is intercepted by E, so that the S can only send non-secret messages to D in the [0, rho T ] time period, and the secret messages are forwarded in the cooperative communication time slot; if S has more secret messages to be forwarded but can not be completely forwarded within a time slot T, then forwarding can be continued within an nT time slot, wherein n belongs to {1,2,3, L }. And then S and R carry out cooperative communication, wherein [ rho T, rho T + (1-alpha) (1-beta) (1-rho) T ] time slots are used as a first stage of cooperative transmission, and S sends own secret information to R. D and E will also receive the message sent by S due to the broadcast format. In the second phase of cooperative transmission [ ρ T + (1- α) (1- β) (1- ρ) T, ρ T + (1- β) (1- ρ) T ], R will help S forward the message to D and be listened to by E. And finally, reserving the beta (1-rho) T time slot for R as a return time slot, wherein the R can utilize the authorized frequency band of the S to send a message to the O. In addition, the present embodiment assumes that the channel width when communication is performed between the respective users in this communication network is W.
In order to calculate the safety capacity, the sending rates of different nodes are analyzed respectively. The instantaneous transmission rate V of R can be known from Shannon's formulaRComprises the following steps:
Figure GDA0003657723740000061
in the formula (1), P represents the transmission power of the node S (P > 0), and N0Showing the single face power spreading density. Because D receives messages in the first stage and the second stage of cooperative transmission, W is the channel width of communication among all users; from the maximum ratio combination, the instantaneous transmission rate V of DDComprises the following steps:
Figure GDA0003657723740000062
similarly, E receives messages in 2 stages of cooperative transmission, and therefore, the instantaneous sending rate V of EECan be expressed as:
Figure GDA0003657723740000063
the invention adopts DF cooperative transmission mechanism, so the total sending rate of D and E
Figure GDA0003657723740000064
And
Figure GDA0003657723740000065
equal to the minimum of the two phases of cooperative transmission, namely:
Figure GDA0003657723740000066
and
Figure GDA0003657723740000071
the following formulas (1) to (5) are combined to obtain:
Figure GDA0003657723740000072
Figure GDA0003657723740000073
defined by the safety capacity, the safety capacity R of the primary userSECComprises the following steps:
Figure GDA0003657723740000074
wherein [ x ]]+Is defined as
Figure GDA0003657723740000075
Assuming that beta and rho are known, when (1-alpha) VR≥αVDCan be obtained
Figure GDA0003657723740000076
At this time RSEC＝α(1-β)(1-ρ)[VD-VE]+It can be seen that this is a monotonically decreasing function, thus maximizing RSECCorresponding to a maximization of a, i.e.
Figure GDA0003657723740000077
When (1-. alpha.) VR＜αVDThen can obtain
Figure GDA0003657723740000078
At this time RSEC＝(1-β)(1-ρ)[VR-α(VR+VE)]+From [ x ] above]+As defined, when α is minimized, RSECA maximum value is obtained.
In summary, the optimal value of α is
Figure GDA0003657723740000079
At this time:
Figure GDA00036577237400000710
the energy harvesting and energy consumption processes are then quantified. Suppose that in each time slot T S transmits Q (in bits) data at a transmission rate VpThen at [0, ρ T]Time period, S sent data is Vpρ T (in bits) and the portion of data should be non-secret data. The remaining secret data (Q-V)pρ T) (in bits) needs to be transmitted by cooperative communication. In addition, let
Figure 100002_DEST_PATH_IMAGE008
Representing the energy collection efficiency of R, is at [0, rho T]Time period, R energy collected is
Figure 502174DEST_PATH_IMAGE008
ρ T, assuming that the transmission power of R is PRThen cooperative transmission consumes P energyR(1-. beta.) (1-. rho.) T, residual energy
Figure 16332DEST_PATH_IMAGE002
ρT-PR(1-beta) (1-rho) T will support R to send messages to O.
From the above derivation, the transmission rate between R and O is
Figure GDA00036577237400000711
The rate cannot be less than the required rate VROExpressed as:
Figure GDA0003657723740000081
in addition, after cooperative transmission, the secondary user sends the node residual energy
Figure 145962DEST_PATH_IMAGE008
ρT-PR(1-beta) (1-rho) T, and the energy required for communication between the secondary user transmitting node and the secondary user receiving node is PRβ (1- ρ) T, and thus:
Figure GDA0003657723740000082
defining energy efficiency as the remaining energy of the secondary user transmitting node, expressed as:
Figure GDA0003657723740000083
wherein:
Figure GDA0003657723740000084
Figure GDA0003657723740000085
ETX＝PR(1-ρ)T (15)
in the formula (I), the compound is shown in the specification,
Figure GDA0003657723740000086
the initial energy of the secondary user transmitting node in the time slot T is represented, and the value of the initial energy is equal to the value of the residual energy in the last time slot T-1 as can be known from the formula (13); equation (14) represents the energy collected by the secondary user sending node before the next cooperative communication, and after a certain time slot is over, the energy owned by the secondary user may not satisfy the next cooperative communication, so that n T times may be consumed for energy collection; equation (15) represents the energy consumption of the secondary user transmitting node for cooperative communication and transmitting the self message to the secondary user receiving node.
If the safety capacity of the primary user is maximized, the secondary user transmitting node needs to increase the transmitting power, but the cruising ability of the secondary user transmitting node is reduced, and a contradiction relationship exists between the primary user transmitting node and the secondary user transmitting node. In order to ensure the secure communication of the primary user and improve the cruising ability of the primary user, the optimization objective of this embodiment may be defined as:
Figure GDA0003657723740000087
where δ is a trade-off factor between safe capacity and energy harvesting efficiency. The user can change the value of delta according to the self requirement, and if the user expects to obtain a higher safe capacity value, the value of delta is increased; if higher energy efficiency is desired, the 1- δ is adjusted higher.
When judging whether the secondary user sending node can meet the message sending requirement, the embodiment provides three judging methods:
(1) when in use
Figure GDA0003657723740000091
And considering that the sending requirement is not met at the moment, and the secondary user sending node collects energy until the requirement is met. After the energy collection of n time slots, the initial energy of the secondary user transmitting node is updated to
Figure GDA0003657723740000092
n∈Z+。
(2) When in use
Figure GDA0003657723740000093
And considering that the sending requirement is not met at the moment, and continuing energy collection by the secondary user sending node until the requirement is met. After the energy collection of n time slots, the energy collected by the secondary user sending node is updated to
Figure GDA0003657723740000094
n∈Z+。
(3) When the temperature is higher than the set temperature
Figure GDA0003657723740000095
And considering that the sending requirement is not met at the moment, and continuing energy collection by the secondary user sending node until the requirement is met. After the energy collection of n time slots, the total energy of the transmitting node of the secondary user is updated to
Figure GDA0003657723740000096
n∈Z+。
Through carrying out comparative experiments, the influence of the three comparison modes on the energy collection efficiency can be obtained. The weighted sum of the safe capacity of the primary user and the residual energy of the secondary user in the target is recorded as Stradeoff. As shown in FIG. 5, given PR4, the x-axis represents the cooperative communication factor ρ e (0, 1)]The y-axis represents the trade-off factor delta e (0, 1)]The z-axis represents the solution objective StradeoffIt can be seen from the figure that the trade-off between the primary user safety capacity and the secondary user energy collection efficiency is achievable, and the variation trend is in a 'multi-peak' shape. FIGS. 5(a-c) show the judgment methods (1) - (3) for the solution target StradeoffIs recorded as maximum
Figure GDA0003657723740000097
As can be seen from the figure, the judgment method (1) can be used to obtain
Figure GDA0003657723740000098
Adopts a judgment mode (2)) Can obtain the product
Figure GDA0003657723740000099
Can be obtained by adopting the judgment method (3)
Figure GDA00036577237400000910
Thus, P is fixedRWhen the method (1) is adopted, greater benefit can be obtained. Further, when the ρ value is fixed and the judgment is made by the methods (1) and (3), StradeoffThe linear increasing trend is shown at the ridge, and the linear decreasing trend is shown at other places. When the mode (2) is adopted, StradeoffAlways in an inverse relationship with δ.
As shown in fig. 6, given ρ 0.2, the x-axis represents the transmission power P of the secondary user transmission nodeR∈[1,4]The y-axis represents the trade-off factor δ ∈ (0, 1)]The z-axis represents the solution objective Stradeoff. It can be seen that the trade-off problem studied in the present invention is achievable, and the trend is also "multimodal". FIG. 6(a-c) shows the influence of the judgment methods (1) to (3) on the solution target, respectively, wherein the judgment method (1) can be used to obtain
Figure GDA00036577237400000911
By adopting the judgment method (2)
Figure GDA00036577237400000912
Can be obtained by adopting the judgment method (3)
Figure GDA00036577237400000913
It is understood that the method (2) can obtain a greater effect when ρ is fixed. In addition, when the ρ value is fixed and the judgment is made by the methods (1) and (3), StradeoffThe linear increasing trend is shown at the ridge, and the linear decreasing trend is shown at other places. When the mode (2) is adopted, StradeoffAlways in an inverse relationship with δ.
Through the steps, aiming at the balance problem of the safety capacity of the primary user and the energy efficiency of the secondary user in the cognitive radio network, the method reasonably divides the channel by combining energy collection and cooperative communication, so that the transmitting node of the primary user realizes safety communication, and the transmitting node of the secondary user can continuously work for a long time.
It should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. This need not be, nor should it be exhaustive of all embodiments. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.

Claims (2)

1. The cooperative cognitive radio network comprises a master user sending node S, a master user receiving node D, a secondary user sending node R, a secondary user receiving node O and an eavesdropper E; the joint optimization method is characterized by comprising the following steps:
s1, calculating the sending rate of each node in the cooperative cognitive radio network and calculating the sending power P of a secondary user sending nodeRCalculating the value range of the energy collection factor rho;
s2. P calculated from step S1RAnd m uniformly distributed P are taken out in the value range of rhoRValues and n uniformly distributed ρ values;
s3, P obtained based on step S2RCalculating the values and rho values to obtain the safe capacity R of all possible main users by adopting an exhaustion methodSECValue and secondary user transmit node residual energy
Figure FDA0003657723730000011
The values are stored in two 1 xmn matrices in a one-to-one correspondence, i.e. one RSECCorresponds to one
Figure FDA0003657723730000012
S4. supplyDetermining a trade-off factor delta, and calculating all R in the step S3SECAnd with
Figure FDA0003657723730000017
By comparison to obtain a weighted sum StradeoffMaximum value of (d);
the transmission power P of the secondary user transmitting node in step S1RThe upper and lower bounds of (A) are:
Figure FDA0003657723730000013
in the formula, VROThe minimum sending rate required between a secondary user sending node R and a secondary user receiving node O, beta is a cooperative communication factor, W is a channel bandwidth, N is0The density is a single-sided power spreading density,
Figure DEST_PATH_IMAGE002
sending the energy collection efficiency, h, of node R for the secondary userROIs the channel attenuation factor between R and O;
in step S1, the value range of the energy collection factor ρ is represented as:
Figure FDA0003657723730000014
in the formula, Q is the data volume sent by the master user sending node S, and the unit is bit and VpSending the sending power of a node S for a master user, wherein T is unit time;
the exhaustion method in step S3 adopts a double-layer loop, and the execution method includes the following steps:
s31, making i equal to 1, executing outer circulation, and recording the transmission power of the user transmission node at the time as
Figure FDA0003657723730000015
S32, enabling j to be 1, executing an internal loop, and recording an energy collection factor at the moment asρj；
S33. substitution
Figure FDA0003657723730000016
And ρjCalculating the safe capacity R of the master userSECStoring the data into a 1 × mn matrix; calculating the energy E required by the secondary user sending node to send the messageTXIf the secondary user sending node can not meet the sending requirement, the energy is continuously collected until the requirement is met, and the residual energy of the secondary user sending node is calculated
Figure FDA0003657723730000021
Storing the obtained result into a 1 x mn matrix;
s34, enabling j to be j +1, jumping to the step S33, executing the next round of internal loop, jumping out of the internal loop when j is larger than n, and executing the step S35;
s35, making i equal to i +1, jumping to step S32, and executing the next round of external loop until i is greater than m, and terminating the external loop;
in step S33, the energy E required for the secondary user sending node to send the messageTXComprises the following steps:
ETX＝PR(1-ρ)T
ETXthe method comprises the steps that a secondary user sending node carries out cooperative communication and sends self information to a secondary user receiving node, and after the information is sent, the secondary user sending node carries out residual energy
Figure FDA0003657723730000022
The updating is as follows:
Figure FDA0003657723730000023
in the formula (I), the compound is shown in the specification,
Figure FDA0003657723730000024
the secondary user transmits the initial energy of the node in time slot T,
Figure FDA0003657723730000025
the updated residual energy is the energy collected by the secondary user sending node before sending the message
Figure FDA0003657723730000026
As the initial energy of slot T + 1;
in step S4, the sum S is weightedtradeoffComprises the following steps:
Figure FDA0003657723730000027
in the formula, delta is a trade-off factor between the safe capacity and the energy collection efficiency, and delta is more than 0 and less than 1.
2. The method for jointly optimizing the safety capacity and the energy efficiency of the cooperative cognitive radio network according to claim 1, wherein the method for determining whether the remaining energy of the secondary user transmitting node meets the transmission requirement in step S33 comprises:
(1) when in use
Figure FDA0003657723730000028
When the secondary user sending node does not meet the sending requirement, the secondary user sending node collects energy until the requirement is met; after the energy collection of n time slots, the initial energy of the secondary user transmitting node is updated to
Figure FDA0003657723730000029
T is a time slot, and T is a time slot,
Figure DEST_PATH_IMAGE004
an energy collection efficiency of R;
(2) when in use
Figure FDA00036577237300000210
Then, the sending node of the secondary user will continue to enter the process if the sending requirement is not satisfied at the momentCollecting energy until the requirement is met; after the energy collection of n time slots, the energy collected by the secondary user sending node is updated to
Figure FDA00036577237300000211
T is a time slot, and T is a time slot,
Figure DEST_PATH_IMAGE006
an energy collection efficiency of R;
(3) when the temperature is higher than the set temperature
Figure FDA00036577237300000212
When the secondary user sending node does not meet the sending requirement, the secondary user sending node continues to collect energy until the requirement is met; after the energy collection of n time slots, the total energy of the transmitting node of the secondary user is updated to
Figure FDA00036577237300000213
T is a time slot, and T is a time slot,
Figure DEST_PATH_IMAGE008
the energy collection efficiency is R.
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 CN108901028A (en) 2018-11-27
CN108901028B true 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)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109769254B (en) * 2018-12-10 2021-12-14 南京邮电大学 Cognitive wireless power supply network resource allocation method based on weighted fairness
US11160019B2 (en) * 2019-01-11 2021-10-26 Mediatek Inc. Electronic devices and methods for determining energy efficiency
CN110266704B (en) * 2019-06-25 2021-05-28 河南科技大学 Authorization system physical layer secure communication method based on assisted cognitive user selection

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
Computation rate maximization for wireless powered mobile-edge computing with binary computation offloading;Suzhi Bi等;《EEE Transactions on Wireless Communications》;20180409;第17卷(第06期);4177-4190 *
optimal cooperation strategy in cognitive radio systems with energy harvesting;Sixing Yin等;《IEEE Transactions on Wireless Communications》;20140701;第13卷(第09期);4693-4707 *
primary secrecy is achievable:optimal secrecy rate in overlay CRNs with an energy harvesting secondary transmitter;Long Chen等;《2015 24th International Conference on Computer Communication and Networks (ICCCN)》;20151005;全文 *
基于能量收集的认知无线电资源分配研究;郭艳艳等;《测试技术学报》;20170430;第31卷(第02期);153-157 *
能量收集全双工中继网络中的中继选择策略研究;刘杰群等;《信号处理》;20170125;第33卷(第01期);116-125 *
能量收集协同干扰中继系统保密速率优化;雷维嘉等;《电子科技大学学报》;20151130;第44卷(第06期);801-807 *

Also Published As

Publication number Publication date
CN108901028A (en) 2018-11-27

Similar Documents

Publication Publication Date Title
Jiang et al. An energy-efficient framework for internet of things underlaying heterogeneous small cell networks
Liu et al. A cooperative SWIPT scheme for wirelessly powered sensor networks
Chi et al. Minimization of transmission completion time in wireless powered communication networks
CN108901028B (en) Cooperative cognitive radio network safety capacity and energy efficiency joint optimization method
Li et al. Secrecy energy efficiency maximization in UAV-enabled wireless sensor networks without eavesdropper’s CSI
Yetgin et al. Cross-layer network lifetime maximization in interference-limited WSNs
Hao et al. Energy-efficient multi-user mobile-edge computation offloading in massive MIMO enabled HetNets
Guo et al. Fairness-aware energy-efficient resource allocation in D2D communication networks
Li et al. Energy-efficient resource sharing scheme with out-band D2D relay-aided communications in C-RAN-based underlay cellular networks
Yu et al. Energy provision minimization in wireless powered communication networks with node throughput requirement
Gao et al. Heterogeneous statistical QoS provisioning over wireless powered sensor networks
Liu et al. Nonorthogonal multiple access for wireless-powered IoT networks
Baknina et al. Online scheduling for energy harvesting channels with processing costs
Baknina et al. Online policies for multiple access channel with common energy harvesting source
Xu et al. Joint relay selection and power allocation for maximum energy efficiency in hybrid satellite-aerial-terrestrial systems
Anees et al. Harvested energy scavenging and transfer capabilities in opportunistic ring routing
Zheng et al. Energy provision minimization of energy-harvesting cognitive radio networks with minimal throughput demands
Abuzainab et al. Robust Bayesian learning for wireless RF energy harvesting networks
Jiang et al. Joint link scheduling and routing in two-tier rf-energy-harvesting iot networks
Jiang et al. Transmission capacity analysis for underlay relay-assisted energy harvesting cognitive sensor networks
Zeng et al. Power allocation for energy harvesting-based D2D communication underlaying cellular network
Lee et al. Opportunistic power scheduling for multi-server wireless systems with minimum performance constraints
Yao et al. Hybrid small cell base station deployment in heterogeneous cellular networks with wireless power transfer
Geng et al. Network coding for wireless ad hoc cognitive radio networks
Li et al. Cross-layer transmission and energy scheduling under full-duplex energy harvesting wireless OFDM joint transmission

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