CN112822662B - D2D cache user safety cooperation method and system based on joint content transmission and interference blocking - Google Patents

D2D cache user safety cooperation method and system based on joint content transmission and interference blocking Download PDF

Info

Publication number
CN112822662B
CN112822662B CN202011333833.1A CN202011333833A CN112822662B CN 112822662 B CN112822662 B CN 112822662B CN 202011333833 A CN202011333833 A CN 202011333833A CN 112822662 B CN112822662 B CN 112822662B
Authority
CN
China
Prior art keywords
cooperative
area
cooperation
user
transmission
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
CN202011333833.1A
Other languages
Chinese (zh)
Other versions
CN112822662A (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.)
Xian Jiaotong University
Original Assignee
Xian Jiaotong University
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 Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN202011333833.1A priority Critical patent/CN112822662B/en
Publication of CN112822662A publication Critical patent/CN112822662A/en
Application granted granted Critical
Publication of CN112822662B publication Critical patent/CN112822662B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • 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 provides a D2D cache user safety cooperation method and a system based on joint content transmission and interference blocking, which comprises the following steps: step 1, constructing a cooperation area of an area where a certain requesting user is located in a current time slot; step 2, dividing the cooperation area constructed in the step 1 into a cooperation transmission area and a cooperation blocking area to construct a cooperation scheme; step 3, respectively calculating the connection interruption probability and the confidentiality interruption probability between the requesting user and the cooperative user according to the cooperation scheme constructed in the step 2; step 4, calculating to obtain an optimal solution of the confidential throughput according to the connection interruption probability and the confidential interruption probability obtained in the step 3; the invention effectively improves the throughput performance of the system while ensuring the confidentiality of information transmission.

Description

D2D cache user safety cooperation method and system based on joint content transmission and interference blocking
Technical Field
The invention relates to the problem of wireless communication physical layer secure transmission, in particular to a D2D cache user secure cooperation method and system based on joint content transmission and interference blocking.
Background
The wireless communication brings great convenience to the life of people, and is widely applied to the aspects of the life of people at present. Global mobile data traffic presents an exponential growth trend that presents an unprecedented challenge to cellular network backhaul links, with backhaul link capacity and network latency becoming key performance bottlenecks in cellular networks. In this context, the wireless caching technology should be generated, and becomes an effective way to relieve the burden of the backhaul network. With wireless caching, portions of more popular content can be stored ahead of time at edge nodes (e.g., base stations and access points) of the wireless network so that it can be delivered in a timely manner when a user requests the content.
Information security is an unavoidable problem for wireless networks, as is the case for cache-enabled networks. Unlike earlier caching technologies applied to wired networks such as the internet, wireless caching technologies face more serious security challenges due to the openness of the physical medium of wireless networks. There are three major difficulties faced in protecting content from illegal interception using only traditional cryptographic methods. First, with the rapid development of quantum computing and big data analysis technologies, traditional cryptographic methods based on computational complexity face the risk of being easily decoded violently. Secondly, the encrypted content is specifically defined for each user request and cannot be reused by other user requests. Finally, due to the constant development of dynamic and large-scale network topologies, the storage, management, and distribution of keys in emerging wireless networks is costly to implement. The above disadvantages all compromise the advantages of wireless caching. Fortunately, physical layer security, i.e., signal bit level security using the inherent characteristics of the wireless medium (e.g., random noise, fluctuating channel, etc.) and by means of channel coding, is expected to be an effective complement to encryption security mechanisms.
On the other hand, in addition to the conventional caching of content by means of base stations and access points, the mobile terminal device may also cache content and enable resource sharing between end users through D2D communication technology. Therefore, the workload of the base station can be reduced, the advantages of short D2D communication distance and good channel quality can be achieved, and the communication targets of high speed, low time delay and low power consumption are achieved. D2D users can flexibly network and allocate resources under base station scheduling so that they can combine content transmission and interference blocking for secure cooperative transmission. Although the literature applies the idea of combining information transmission and interference blocking to physical layer secure transmission systems, it is mostly limited to point-to-point transmission.
The study on the safe transmission of a physical layer is more complicated due to the randomness of the geometric topology and the interference in a wireless network, and network modeling and performance analysis are often simplified by means of a random geometric mathematical tool and a random point process theory.
In addition, the adoption of the content caching technology and the D2D caching user cooperation mechanism introduces new problems in the aspects of physical layer secure transmission system modeling, performance analysis, parameter design and the like.
Therefore, it is necessary to study a stochastic geometry analysis framework that D2D caches user security collaboration policies and builds and is easy to mathematically process.
Disclosure of Invention
The invention aims to provide a D2D cache user security cooperation method and a system based on joint content transmission and interference blocking, which solve the problem of network security transmission in the existing D2D communication technology.
In order to achieve the purpose, the invention adopts the technical scheme that:
the invention provides a D2D cache user safety cooperation method based on joint content transmission and interference blocking, which comprises the following steps:
step 1, constructing a cooperation area of an area where a certain request user is located in a current time slot;
step 2, dividing the cooperation area obtained in the step 1 into a cooperation transmission area and a cooperation blocking area to obtain a cooperation scheme;
step 3, respectively calculating the connection interruption probability and the confidentiality interruption probability between the requesting user and the cooperative user according to the cooperation scheme obtained in the step 2;
step 4, calculating to obtain an optimal solution of the confidential throughput according to the connection interruption probability and the confidential interruption probability obtained in the step 3;
and 5, reasonably distributing node deployment and optimizing wireless resources according to the optimal solution of the secret throughput obtained in the step 4.
Preferably, in step 1, a circular area with the requesting user as a circle center and a radius of R is set as a cooperation area; setting the number of the collaboration users in the collaboration area as L, wherein the positions of the L collaboration users are uniformly distributed in the collaboration area;
the cooperative user is a file requested by a requested user in a cache; and the base station acquires the channel state information of the cooperative user through channel training and sets the reciprocity of the uplink and downlink channels.
Preferably, in step 2, the user will be requestedAs a circle center and has a radius of DRThe circular area of the data transmission line is used as a cooperative transmission area, and the rest part is a cooperative blocking area; wherein D isR≤R；
Setting T cooperative transmission nodes in a cooperative transmission area, wherein T is less than or equal to L; the transmission power of the cooperative transmission node is Pa；
Setting the transmitting power of the cooperative blocking node in the cooperative blocking area to be Pb。
Preferably, in step 3, a connection interruption probability between the requesting user and the collaborating user is calculated, specifically: firstly, setting a Wyner security coding scheme to carry out channel coding on private information bits; then calculated by:
Figure RE-GDA0002989005530000031
wherein p isT(T) is the distribution probability of the number T of cooperative transmission nodes; p is a radical ofco(T) a connection interruption probability of a given number T of cooperative transmission nodes; p is a radical ofT(0) The probability that the number of the cooperative transmission nodes is 0 is obtained.
Preferably, in step 3, the probability of privacy interruption between the requesting user and the collaborating user is calculated by the following formula:
Figure RE-GDA0002989005530000032
wherein the content of the first and second substances,
Figure RE-GDA0002989005530000033
is shown at ekSignal to interference plus noise ratio of an eavesdropper at the location;
Figure RE-GDA0002989005530000034
representing the signal to interference plus noise ratio threshold of the privacy interrupt.
Preferably, in step 4, the optimal solution of the secure throughput is calculated by the specific method:
the method for constructing the secret throughput optimization problem comprises the following specific steps:
with the secret throughput under the maximized secret constraint as the optimization objective, the secret throughput optimization problem is represented by the following formula:
Figure RE-GDA0002989005530000041
wherein R issIs the secret rate; Ψ is the secret throughput; e is a threshold value, e is (0, 1); (ii) a
Figure RE-GDA0002989005530000042
Is the probability of a privacy interruption between the requesting user and the collaborating user;
solving the problem of optimizing the confidential throughput, the specific method is as follows:
converting the optimization problem formula (1) into two subproblems, wherein the two subproblems are represented by formula (2) and formula (3):
Figure RE-GDA0002989005530000043
Figure RE-GDA0002989005530000044
and respectively solving the two sub-problems to obtain a global optimal solution of the secret throughput optimization problem.
A joint content delivery and interference blocking based D2D cache user secure collaboration system comprising a controller and a memory storing a computer program operable on the processor, the processor when executing the computer program implementing the method of any of claims 1-6.
A computing device, comprising:
one or more processors, memory, and one or more programs stored in the memory and configured for execution by the one or more processors, the one or more programs including instructions for performing any of the methods of claims 1-6.
Compared with the prior art, the invention has the beneficial effects that:
the D2D cache user safety cooperation method based on joint content transmission and interference blocking divides the constructed cooperation area into a cooperation transmission area and a cooperation blocking area, wherein, the D2D cache user is used as a cooperation node, one part of cooperation nodes are used for jointly transmitting files requested by the user, the other part of cooperation nodes transmit manual blocking signals to interfere an eavesdropper, the cooperation transmission area and the cooperation blocking area are divided to control the proportion of cooperation transmission and blocking nodes, and the joint optimization code word transmission rate and the geometric area division are used for reasonably distributing node deployment and optimizing wireless resources, thereby effectively improving the throughput performance of the system while ensuring the confidentiality of information transmission; meanwhile, the wireless network is combined with the D2D cache security cooperation scheme, so that the load of a base station and a return link is greatly reduced, and the flexibility of system implementation is improved;
meanwhile, by using the idea of distributed cooperation, the cooperative users only need to know the CSI of the cooperative users, but do not need to know the global CSI, so that good safe communication performance can be realized; in addition, the base station only needs to store the position information or the distance information of the user, and does not need to store the CSI of the user, so the invention has the advantages of lower additional cost of the system and lower realization complexity; a stochastic geometry analysis framework is constructed that is easy to mathematically process.
Drawings
FIG. 1 is a schematic diagram of a system model to which the present invention relates;
FIG. 2 is a simulation diagram of the secret throughput at different cooperative transmission powers in the present invention;
FIG. 3 is a diagram illustrating an optimal cooperative transmission radius D under different total number of cooperative users in the present inventionRAnd a secret throughput Ψ simulation graph.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings.
The invention provides a D2D cache user safety cooperation method based on joint content transmission and interference blocking aiming at the safety transmission problem of a D2D network, which is based on the following system model:
in the cooperation area, a plurality of D2D users are arranged, and each user has caching capacity and can cache one file. When a user requests a file, other users which cache the file cooperate to complete file delivery, and randomly distributed eavesdroppers try to intercept the file information in the network.
All D2D users and eavesdroppers were equipped with a single antenna.
The invention provides a D2D cache user safety cooperation method based on joint content transmission and interference blocking, which comprises the following steps:
firstly, setting a circular area with the requesting user as the center of a circle and a radius of R as a cooperation area, setting the number of cooperation users in the cooperation area as L, and uniformly distributing the positions of the L cooperation users in the cooperation area.
When a requesting user o requests a certain file at the current time slot, setting all D2D users caching the file as cooperative users;
setting position information of a known cooperative user of a base station, acquiring channel state information of the cooperative user through channel training, and setting reciprocity of an uplink channel and a downlink channel;
and a second step of combining cooperative transmission and cooperative blocking to construct a cooperative scheme, which specifically comprises the following steps:
the base station defines the radius D by taking the requesting user as the center of a circleR，DRThe circular area less than or equal to R is used as a cooperative transmission area, in the area, a cooperative transmission node is used for transmitting the requested file to the requesting user o, and the transmission power is Pa；
Taking an annular area outside the cooperative transmission area as a cooperative blocking area, wherein a cooperative blocking node is used for sending an artificial interference signal in the area, and the transmission power is Pb。
Assuming that there are T (T is less than or equal to L) cooperative transmission nodes in the cooperative transmission region, the received signal to interference plus noise ratio of the requesting user o can be expressed as:
Figure RE-GDA0002989005530000061
in the formula, hx,yRepresenting the channel fading coefficients between nodes at x and y, subject to a Rayleigh channel fading model, rx,yIs the distance between the nodes at x and y, alpha is the path fading index, sigma2Is the terminal noise power.
Thirdly, calculating the connection interruption probability COP between the request user and the cooperative user under the cooperative scheme;
firstly, setting a Wyner security coding scheme to carry out channel coding on private information bits, wherein the code word rate is recorded as RtThe secret rate is denoted RsRate redundancy Re＝Rt-RsRepresenting the rate of redundant information additionally introduced against eavesdropping.
Secondly, calculating the connection interruption probability under the number T of the established cooperative transmission nodes, wherein the connection interruption probability is defined as follows:
Figure RE-GDA0002989005530000062
in the formula (I), the compound is shown in the specification,
Figure RE-GDA0002989005530000063
a signal to interference plus noise ratio threshold representing a connection interruption;
consider the general case of Pa＞＞PbAnd calculating and sorting to obtain:
Figure RE-GDA0002989005530000071
then, since the cooperative transmission nodes are uniformly distributed in the cooperative area, the probability density function of the distance from the cooperative transmission nodes to the center of the area is as follows:
Figure RE-GDA0002989005530000072
wherein r represents the distance from the cooperative transmission node to the center of the area.
Then, the probability distribution of the number T of cooperative transmission nodes is:
Figure RE-GDA0002989005530000073
wherein the content of the first and second substances,
Figure RE-GDA0002989005530000074
finally, the overall connection interruption probability can be expressed as:
Figure RE-GDA0002989005530000075
in the formula, pT(0) Representing the probability that the number of cooperative transmission nodes is 0,
Figure RE-GDA0002989005530000076
and fourthly, examining the secret interruption probability under the cooperation scheme. The method specifically comprises the following steps:
the eavesdropper signal-to-interference-and-noise ratio is first calculated. Recording the set of eavesdropper positions as phieThen is located at ek∈ΦeThe signal-to-noise ratio of the eavesdropper can be expressed as:
Figure RE-GDA0002989005530000077
the following calculates the privacy break probability, which is defined as:
Figure RE-GDA0002989005530000081
wherein the content of the first and second substances,
Figure RE-GDA0002989005530000082
SINR threshold, R, representing a privacy interruptioneIs rate redundancy;
Figure RE-GDA0002989005530000083
a transmission weight coefficient representing a cooperative blocking node;
Figure RE-GDA0002989005530000084
representing the transmit weight coefficients of the cooperative transmission node.
And (3) calculating and sorting to obtain:
Figure RE-GDA0002989005530000085
in the formula, λeFor the eavesdropper density, the value is generally 0.001-0.1.
Fifthly, secret throughput optimization problem description; the method specifically comprises the following steps:
perfect privacy cannot be achieved considering that the eavesdropper's instantaneous CSI is unknown. To guarantee a certain level of security, a security requirement is proposed: the SOP should be less than the threshold ∈ E (0,1) set by the system, i.e.
Figure RE-GDA0002989005530000086
The present invention aims at maximizing the privacy throughput under privacy constraints, and the optimization problem can be described as follows:
Figure RE-GDA0002989005530000087
wherein R issIs the secret rate; Ψ is the secret throughput.
And sixthly, optimizing a problem solving scheme. In an objective function taking into account an optimization problem (10), DROnly appear in
Figure RE-GDA0002989005530000088
In, the problem canThis is solved by solving the following two sub-problems.
Figure RE-GDA0002989005530000089
Figure RE-GDA00029890055300000810
Ψ*Representing a globally optimal solution to the secure throughput optimization problem.
1) When solving problem (11), D is setRTo be known, then R is optimizedsAnd ReObtaining the optimal secret throughput psi*(DR)。
In view of
Figure RE-GDA0002989005530000091
Is Rt＝Rs+ReToo small or too large RsNone achieve a high Ψ, and therefore, R should be carefully selectedsTo balance throughput and connection disruption.
And if RsDetermining that the secret throughput Ψ follows ReMonotonically decreasing, therefore, to maximize Ψ, R should be takeneThe smaller the setting, the better; then the minimum R will beeRecord as
Figure RE-GDA0002989005530000092
And due to
Figure RE-GDA0002989005530000093
Is ReA decreasing function of
Figure RE-GDA0002989005530000094
Need to satisfy
Figure RE-GDA0002989005530000095
Will be provided with
Figure RE-GDA0002989005530000096
And
Figure RE-GDA0002989005530000097
are combined to obtain
Figure RE-GDA0002989005530000098
In turn according to
Figure RE-GDA0002989005530000099
The subproblem (11) is rewritten as:
Figure RE-GDA00029890055300000910
wherein, betasIs the privacy rate threshold.
Substituting (13) with the formula (6), and calculating and sorting to obtain:
Figure RE-GDA00029890055300000911
wherein
Figure RE-GDA00029890055300000912
Calculating Ψ with respect to βsDerivative of (a):
Figure RE-GDA00029890055300000913
obtained from formula (15)
Figure RE-GDA00029890055300000914
With betasMonotonically decreasing, i.e. Ψ is with respect to βsA concave function of (d); and also
Figure RE-GDA00029890055300000915
At betasWhen being equal to 0, the constant isN is at betasIs negative → infinity, so
Figure RE-GDA00029890055300000916
There is a single root, which is exactly the solution of the optimization problem (11), noted
Figure RE-GDA00029890055300000917
Thus, solving equation (15) using Newton's iteration results in a given DROptimum secret throughput of Ψ*(DR)。
2) Solving a sub-problem (12), i.e. solving an optimum DRMake Ψ*(DR) The maximization is achieved:
since psi cannot be obtained*(DR) With respect to DRSo as to achieve the maximum Ψ*(DR) Optimum D ofRThen the sub-problem (11) will be solved to obtain the optimal secret throughput Ψ*(DR) In the formula (12), the formula (12) is solved by using a one-dimensional search method to obtain a global optimal solution psi of the secret throughput optimization problem*。
In yet another embodiment of the present invention, a terminal device is provided that includes a processor and a memory for storing a computer program comprising program instructions, the processor being configured to execute the program instructions stored by the computer storage medium. The Processor may be a Central Processing Unit (CPU), or may be other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable gate array (FPGA) or other Programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc., which is a computing core and a control core of the terminal, and is adapted to implement one or more instructions, and is specifically adapted to load and execute one or more instructions to implement a corresponding method flow or a corresponding function; the processor according to the embodiment of the present invention may be configured to execute the above-mentioned D2D cache user security cooperation method based on joint content delivery and interference blocking.
In still another embodiment of the present invention, the present invention further provides a storage medium, specifically a computer-readable storage medium (Memory), which is a Memory device in a terminal device and is used for storing programs and data. It is understood that the computer readable storage medium herein may include a built-in storage medium in the terminal device, and may also include an extended storage medium supported by the terminal device. The computer-readable storage medium provides a storage space storing an operating system of the terminal. Also, the memory space stores one or more instructions adapted to be loaded and executed by the processor, which may be one or more computer programs (including program code). It should be noted that the computer-readable storage medium may be a high-speed RAM memory, or may be a non-volatile memory (non-volatile memory), such as at least one disk memory.
The processor can load and execute one or more instructions stored in the computer-readable storage medium to realize the corresponding steps of the checking method related to the long-term maintenance plan in the power grid in the embodiment; one or more instructions in the computer-readable storage medium are loaded by the processor and perform one of the above-described methods of D2D cache user security collaboration based on joint content delivery and interference blocking.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The advantages of the invention are as follows:
(1) the invention adopts a D2D cache user safety cooperation scheme based on joint content transmission and interference blocking, deploys and optimizes wireless resources through reasonably distributing nodes, and effectively improves the throughput performance of the system while ensuring the information transmission confidentiality.
(2) The invention utilizes D2D user to buffer content and carry out cooperative transmission, thereby greatly reducing the load of the base station and the return link and simultaneously increasing the flexibility of system realization.
The feasibility and the effectiveness of the invention are verified by simulation experiments.
The parameter settings in fig. 2 and 3 are as follows: eavesdropper density lambdae0.001 pieces/m2The SOP threshold e is 0.3, the cooperation radius R is 100m, and the terminal noise power σ2Normalized to 1.
Fig. 2 shows the power P transmitted with cooperationaVarying optimal secret throughput Ψ*. It can be seen that with PaIncrease, Ψ*Increasing first and then tending to be gentle, visible, PaNot the larger the better. This is because, when P is presentaWhen the signal strength is increased, the signal strength of both a legitimate user and an eavesdropper in the transmission process is increased, so that although the COP is reduced, the SOP is increased at the same time, and thus the security is impaired. When P is presentaWhen smaller, the gain from COP drop outweighs the loss from SOP increase; when P isaLarger, eavesdropping becomes easier, and connection interruption is less likely to occur, so that P is increased at this timeaThe losses are already insignificant compared to the gains, where the COP approaches 0 and RsAnd will not increase all the time, so the final value will tend to be constant as can be seen from the definition of Ψ.
In addition, the same PaIn the following, a larger total number L of cooperative transmission nodes can be adopted to obtain a larger psi*. The reason is that the total power of the transmitted file information and the transmitted interference signal can be increased by more cooperative transmission nodes, which is beneficial to improving the signal-to-interference-and-noise ratio of the receiving end of a legal user and reducing the signal-to-interference-and-noise ratio of the eavesdropping end, so that psi is enabled*And is increased. At the same time psi at different path attenuation indices alpha*When P is different from the otheraSmaller, larger psi can be achieved with smaller α*When P isaLarger psi can be achieved with larger alpha*。
Fig. 3 shows the optimal cooperative transmission radius D as a function of the number L of cooperative transmission nodesRAnd secret throughput Ψ*. As can be seen from FIG. 3, DRAs L monotonically decreases, Ψ*As L monotonically increases. For DRWith respect to the decreasing relationship of L, this is due toIn the actual transmission process, P is often satisfieda＞＞PbThus P isaVariation of (2) to DRHas little effect, but it causes the number of cooperating transmission nodes to need to be controlled within a small range to ensure against eavesdropping, and therefore D needs to be reduced as L increasesRTo reduce the number of cooperative transmission users. For Ψ*Regarding the increasing relation of L, this is mainly because the larger the node density in the cooperation area is, the more the wireless resources are reasonably scheduled, so that the energy of the file transmitted by the distributed beamforming technology is significantly increased, and the energy of the interference signal generated by the eavesdropper is also significantly enhanced, so that the quality of the main channel and the quality of the eavesdropper are significantly deteriorated, and the security throughput performance as a whole tends to increase.

Claims (3)

1. A D2D cache user security cooperation method based on combined content transmission and interference blocking is characterized by comprising the following steps:
step 1, constructing a cooperation area of an area where a certain request user is located in a current time slot;
step 2, dividing the cooperation area obtained in the step 1 into a cooperation transmission area and a cooperation blocking area to obtain a cooperation scheme;
step 3, respectively calculating the connection interruption probability and the confidentiality interruption probability between the requesting user and the cooperative user according to the cooperation scheme obtained in the step 2;
step 4, calculating to obtain an optimal solution of the confidential throughput according to the connection interruption probability and the confidential interruption probability obtained in the step 3;
step 5, reasonably allocating node deployment and optimizing wireless resources according to the optimal solution of the confidential throughput obtained in the step 4;
in the step 1, a circular area with a requesting user as a circle center and a radius of R is set as a cooperation area; setting the number of the collaboration users in the collaboration area as L, wherein the positions of the L collaboration users are uniformly distributed in the collaboration area;
the cooperative user is a file requested by a requested user in a cache; the base station acquires channel state information of the cooperative user through channel training and sets reciprocity of an uplink channel and a downlink channel;
in step 2, the requesting user is taken as the circle center and the radius is DRThe circular area of the data transmission line is used as a cooperative transmission area, and the rest part is a cooperative blocking area; wherein D isR≤R；
Setting T cooperative transmission nodes in a cooperative transmission area, wherein T is less than or equal to L; the transmission power of the cooperative transmission node is Pa；
Setting the transmitting power of the cooperative blocking node in the cooperative blocking area to be Pb；
In step 3, calculating a connection interruption probability between the requesting user and the collaborating user, specifically: firstly, setting a Wyner security coding scheme to carry out channel coding on private information bits; then calculated by:
Figure FDA0003539180120000011
wherein p isT(T) is the distribution probability of the number T of cooperative transmission nodes; p is a radical ofco(T) a connection interruption probability of a given number T of cooperative transmission nodes; p is a radical ofT(0) The probability that the number of the cooperative transmission nodes is 0 is obtained;
in step 3, calculating the privacy interruption probability between the requesting user and the cooperative user according to the following formula:
Figure FDA0003539180120000021
wherein, the first and the second end of the pipe are connected with each other,
Figure FDA0003539180120000022
is shown at ekSignal to interference plus noise ratio of an eavesdropper at the location;
Figure FDA0003539180120000023
a signal to interference plus noise ratio threshold representing a privacy interrupt; for eavesdroppingPosition set as phie；hx,yRepresenting the channel fading coefficients between the nodes at x and y, and obeying a Rayleigh channel fading model; r isx,yRepresenting the distance between the nodes at x and y; α represents a path loss exponent; sigma2Is the terminal noise power; reRate redundancy;
Figure FDA0003539180120000024
representing a transmission weight coefficient of the cooperative blocking node;
Figure FDA0003539180120000025
representing the transmission weight coefficient of the cooperative transmission node;
in step 4, calculating the optimal solution of the confidential throughput, wherein the specific method comprises the following steps:
the method for constructing the secret throughput optimization problem comprises the following specific steps:
with the secret throughput under the maximized secret constraint as the optimization objective, the secret throughput optimization problem is represented by the following formula:
Figure FDA0003539180120000026
wherein R issIs the privacy rate; Ψ is the secret throughput; e is a threshold value, e is (0, 1);
Figure FDA0003539180120000027
the probability of the privacy interruption between the requesting user and the cooperative user is determined;
solving the problem of optimizing the confidential throughput, the specific method is as follows:
converting the optimization problem formula (1) into two subproblems, wherein the two subproblems are represented by formula (2) and formula (3):
Figure FDA0003539180120000028
Figure FDA0003539180120000029
therein, Ψ*Is shown at given DR(ii) an optimal secure throughput;
and respectively solving the two sub-problems to obtain a global optimal solution of the secret throughput optimization problem.
2. A joint content delivery and interference blocking based D2D cache user secure collaboration system comprising a processor which when executed performs the method of claim 1.
3. A computing device, comprising:
one or more processors, memory, and one or more programs stored in the memory and configured for execution by the one or more processors, the one or more programs including instructions for performing the method of claim 1.
CN202011333833.1A 2020-11-24 2020-11-24 D2D cache user safety cooperation method and system based on joint content transmission and interference blocking Active CN112822662B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011333833.1A CN112822662B (en) 2020-11-24 2020-11-24 D2D cache user safety cooperation method and system based on joint content transmission and interference blocking

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011333833.1A CN112822662B (en) 2020-11-24 2020-11-24 D2D cache user safety cooperation method and system based on joint content transmission and interference blocking

Publications (2)

Publication Number Publication Date
CN112822662A CN112822662A (en) 2021-05-18
CN112822662B true CN112822662B (en) 2022-05-20

Family

ID=75853377

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011333833.1A Active CN112822662B (en) 2020-11-24 2020-11-24 D2D cache user safety cooperation method and system based on joint content transmission and interference blocking

Country Status (1)

Country Link
CN (1) CN112822662B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104581960A (en) * 2015-01-26 2015-04-29 西安交通大学 Multi-user collaboration jamming power distribution method under restraint of confidentiality interrupt probability
US10069592B1 (en) * 2015-10-27 2018-09-04 Arizona Board Of Regents On Behalf Of The University Of Arizona Systems and methods for securing wireless communications
CN110381503A (en) * 2019-06-21 2019-10-25 西安交通大学 The interference blocking scheme switching method of millimeter wave cellular network uplink safe transmission
CN111555836A (en) * 2020-04-27 2020-08-18 西安交通大学 Wireless covert communication model and method based on multi-node cooperative interference blocking
CN111885546A (en) * 2020-07-28 2020-11-03 桂林理工大学 Vehicle-mounted physical layer safe transmission method based on cooperative interference and artificial noise

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110225579B (en) * 2019-06-12 2021-02-02 西安电子科技大学 Cooperative interference physical layer secure transmission method based on wireless energy supply
CN111447611B (en) * 2020-03-06 2021-08-10 华南理工大学 Transmission method for protecting information security through cooperation in wireless network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104581960A (en) * 2015-01-26 2015-04-29 西安交通大学 Multi-user collaboration jamming power distribution method under restraint of confidentiality interrupt probability
US10069592B1 (en) * 2015-10-27 2018-09-04 Arizona Board Of Regents On Behalf Of The University Of Arizona Systems and methods for securing wireless communications
CN110381503A (en) * 2019-06-21 2019-10-25 西安交通大学 The interference blocking scheme switching method of millimeter wave cellular network uplink safe transmission
CN111555836A (en) * 2020-04-27 2020-08-18 西安交通大学 Wireless covert communication model and method based on multi-node cooperative interference blocking
CN111885546A (en) * 2020-07-28 2020-11-03 桂林理工大学 Vehicle-mounted physical layer safe transmission method based on cooperative interference and artificial noise

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
窃听环境下协作通信网络的机会中继选择方法;李国兵等;《计算机工程》;20150515(第05期);全文 *

Also Published As

Publication number Publication date
CN112822662A (en) 2021-05-18

Similar Documents

Publication Publication Date Title
Xia et al. Outage performance analysis for the advanced SIC receiver in wireless NOMA systems
Baştuǧ et al. Cache-enabled small cell networks: Modeling and tradeoffs
Zhou et al. Offloading optimization for low-latency secure mobile edge computing systems
Ko et al. Probabilistic caching based on maximum distance separable code in a user-centric clustered cache-aided wireless network
Zhang et al. Physical layer security in large–scale probabilistic caching: Analysis and optimization
CN112911587B (en) Method for safely unloading anti-eavesdropping task by using physical layer under MEC-D2D environment
Elias et al. Optimal geographic caching in cellular networks with linear content coding
CN112788764A (en) Method and system for task unloading and resource allocation of NOMA ultra-dense network
Cui et al. Energy-efficient RSMA for multigroup multicast and multibeam satellite communications
Liu et al. Deep reinforcement learning-based MEC offloading and resource allocation in uplink NOMA heterogeneous network
CN112822662B (en) D2D cache user safety cooperation method and system based on joint content transmission and interference blocking
Li et al. Latency and task loss probability for NOMA assisted MEC in mobility-aware vehicular networks
CN112115499A (en) Safe transmission method based on block chain and edge cache
CN112399482B (en) Mobile edge calculation method, storage medium and equipment
Zhou et al. Physical-layer security for cache-enabled C-RANs via rate splitting
CN109005234B (en) Safety probability cache strategy and generation method thereof
CN111211896A (en) Integrated quantum key encryption method, system and storage medium suitable for power business
Alibeigi et al. Improving secrecy rate and social welfare by NOMA technique in D2D communications network
Tong et al. FedTO: Mobile-aware task offloading in multi-base station collaborative MEC
Benghabrit et al. Optimizing the capacity of cognitive radio networks with power control and variable spectrum allocation
Sharifi et al. Underlay device to device communication with imperfect interference channel knowledge
Chuan et al. Belief propagation based distributed content delivery scheme in caching-enabled D2D networks
CN111225363B (en) Power distribution method and device based on imperfect CSI distributed D2D system
CN111246460B (en) Low-complexity and low-time-delay secure transmission method
Du et al. Energy-efficient user clustering and resource management for NOMA based MEC systems

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