Content sharing-oriented D2D (Device-to-Device) service supply mechanism implementation method and system
By constructing a network and spectrum reuse model, and combining a stable matching algorithm and a minimum cost flow algorithm, the matching between cellular users and D2D providers is optimized, solving the power control and spectrum allocation problems in the D2D content distribution system, and achieving stable, fair, and efficient content distribution.
Patent Information
- Application Number
- CN202411023768.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-29
- Publication Date
- 2024-11-22
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
Existing D2D content distribution systems suffer from defects in power control and spectrum allocation, which fail to effectively alleviate base station traffic pressure and improve user experience.
We construct network and spectrum reuse models, optimize the matching of cellular users and D2D providers through a stable matching algorithm, and combine a preference model and a minimum cost flow algorithm for power control and spectrum allocation to design a stable, fair, and efficient D2D distribution mechanism.
It alleviates the traffic pressure on base stations, improves user experience, ensures the stability and fairness of data transmission, and reduces the energy consumption of mobile devices.
Smart Images

Figure CN119012232A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of service computing and D2D (Device-to-Device) communication, and in particular to a method and system for implementing a D2D service provision mechanism for content sharing. Background Art
[0002] At present, wireless data transmission is showing an explosive growth trend. Multimedia services, mainly download services such as high-definition video streaming and high-quality music, are gradually occupying half of the data distribution business. It is predicted that in the next 20 years, the data traffic carried by mobile communication networks will continue to grow by 10,000 times. As multimedia services gradually occupy half of the mobile network traffic, multimedia content distribution based on D2D networks is considered to be an effective key measure to respond to large-scale user requests. At present, most of the literature on D2D content distribution issues focuses on caching strategy research, ignoring the design of reasonable content distribution algorithms.
[0003] The existing invention patent application document "Resource Scheduling Optimization Method Based on Channel Signature in D2D Communication Network" with publication number CN108093411A, the existing method includes: using time reversal technology to perform channel signature design for cellular users and D2D users respectively; using the Stackelberg game model to set the optimal price for cellular users and allocate the optimal transmission power to D2D user pairs; according to the planning target of D2D user capacity gain, a capacity gain area restriction mechanism is used to allocate candidate cellular user link resources to D2D user pairs; according to the requirements of fairness of D2D user resource reuse, a resource reuse threshold is used to limit the number of D2D user reused resources; in order to make full use of cellular user link resources, D2D user pairs are allocated to idle cellular users to maximize system throughput. The aforementioned prior art focuses on solving the D2D communication problem, and considers that in a system where cellular users and D2D user pairs coexist, the interference elimination technology in various wireless communication systems eliminates the mutual interference between users, etc. The goal of this prior art solution is to suppress the mutual interference between users while ensuring the QoS of cellular users; at the same time, this prior art is oriented to user equipment, and its purpose is to suppress the mutual interference between users while ensuring the communication quality of cellular users in a system where D2D user pairs and cellular users coexist. From the specific implementation content of this prior art, it can be seen that this solution uses time reversal technology to perform channel signature design on cellular users and D2D users respectively, and obtains the cellular user signal-to-noise ratio and the D2D user signal-to-noise ratio respectively. According to the cellular user signal-to-noise ratio and the D2D user signal-to-noise ratio, the throughput of the cellular user and the D2D user pair that reuses the cellular user link resources is obtained; thereby obtaining the total throughput of the system, and then taking the total throughput as the goal, according to the cellular user spectrum resource reuse relationship, the cellular user signal-to-noise ratio threshold and the D2D user pair signal-to-noise ratio threshold, the system capacity is maximized. However, the existing solution ignores the protection mechanism for cellular users in the cellular system.
[0004] The existing invention patent application document "A deployment optimization and resource management method for maritime emergency communications" with publication number CN116916287A, in which the deployment optimization and resource management problems are formalized into optimization problems related to power allocation, spectrum reuse, and low-altitude platform position optimization, with the goal of maximizing the network sum rate, combined with graphical methods, graph theory, and intelligent optimization algorithms for iterative solution, and the sum rate of the air-sea integrated network can be effectively improved through deployment optimization and resource management. From the specific implementation content of the existing scheme, it can be seen that the existing method uses graph theory to rewrite the objective function and transform P3 into a minimum cost maximum flow problem. According to the minimum cost maximum flow problem P3, the Ford-Fulkerson algorithm is used to solve it, thereby obtaining the optimal spectrum reuse strategy. From the specific implementation content of the prior art, it can be seen that the existing scheme proposes an air-sea integrated network architecture that enables D2D communication technology to support emergency communications. Then, the deployment optimization and resource management problems are formalized into optimization problems related to power allocation, spectrum reuse, and low-altitude platform position optimization, with the goal of maximizing the network sum rate. Afterwards, the graphical method, graph theory, and intelligent optimization algorithm are combined to iteratively solve the problem. However, the application scenario of the aforementioned prior art is emergency communications at sea, and its purpose is to maximize the network and rate. The characteristics that need to be considered are that emergency communications at sea usually need to face unfavorable conditions such as the lack of basic communications facilities at sea and the harsh working environment at sea. They usually have specific scenario characteristics such as sudden incidents, short emergency response windows, and serious consequences. This existing solution cannot be directly used to use low-altitude platforms as platforms for building communication relay systems. According to the characteristics of low-altitude platforms, it is difficult to achieve the location deployment and resource management of low-altitude platforms. At the same time, this existing solution is aimed at all parties involved in emergency communications at sea, among which there are no base stations on land. What is considered is the low-altitude platform at sea. Its goal is to maximize the network and rate. What is ultimately solved is the location deployment of equipment and the allocation of communication resources. Power consumption is not considered for emergency scenarios.
[0005] In summary, the D2D content distribution system in the prior art has technical problems of power control defects and spectrum allocation defects. Summary of the invention
[0006] The technical problem to be solved by the present invention is: how to solve the technical problems of power control defects and spectrum allocation defects in the D2D content distribution system in the prior art.
[0007] The present invention adopts the following technical solutions to solve the above technical problems: A method for implementing a D2D service provision mechanism for content sharing includes:
[0008] S1. Construct a network model, wherein the network model includes: a requester, a cellular user, and a D2D provider, wherein the requester is represented by a preset request quintuple, the cellular user is represented by a preset quadruple, and the D2D provider is represented by a preset provision quintuple;
[0009] S2. Build a spectrum reuse model, set the signal-to-noise ratio decoding threshold condition for the pairing process between cellular users and D2D providers, and decode the same spectrum communication data; set the transmission power range between cellular users and D2D providers, and calculate the power when the D2D provider is paired with different cellular users to obtain the transmission power between the D2D provider and the cellular user;
[0010] S3, establishing a preference model based on the requester preference information and the provider preference information;
[0011] S4. Perform problem definition operation, obtain matching results by performing stable matching, minimize the ranking of the preference sequence of the final matched D2D provider in the preference model, calculate and minimize the sum of all requester costs, and express the problem of maximizing the benefits of all D2D providers; in the stable matching process, match the requester and the D2D provider for the stable matching problem between the D2D provider and the requester;
[0012] S5. Perform spectrum reuse operations, wherein the total transmission power of corresponding devices is determined, and the spectrum reuse problem is abstracted into a transmission power problem; the spectrum reuse problem of D2D providers and cellular users is converted into a minimum cost maximum flow problem.
[0013] S6. According to the spectrum allocation between the cellular user and the D2D provider, the transmission rate when the D2D provider matches with different requesters is determined, so as to match the requester and the provider according to the preference model, and perform content distribution operations according to the matching results.
[0014] In the face of massive content download requests, the present invention proposes a D2D service provision mechanism for content sharing, which can alleviate the traffic pressure faced by base stations and improve user experience. The specific application scenario of the present invention is content sharing. It focuses on the distribution stage of cache-distribution in the content sharing scenario, considers factors such as the stability, fairness and power consumption of the distribution mechanism, and is committed to designing a stable, fair and efficient D2D distribution mechanism. For the aforementioned application scenarios, the present invention aims to design a stable D2D content distribution mechanism, proposes a stable matching algorithm based on preference establishment, and simultaneously solves the power control and spectrum allocation problems in the D2D content distribution system.
[0015] In a more specific technical solution, in S2, the decoding threshold condition of the signal-to-noise ratio is determined using the following logic:
[0016]
[0017] In the formula, p k and p j represents the transmission power of cellular users and D2D users, σ represents the noise power, G k,B represents the channel gain from cellular user k to the base station, G j,B represents the channel gain from D2D provider j to the base station, G j,i represents the channel gain between the D2D provider and the D2D requester; γ k and γ j denote the decoding thresholds of cellular users and D2D providers respectively.
[0018] In a more specific technical solution, in S2, the transmission power of the cellular user and the D2D provider must be within their respective power ranges and satisfy the following formula:
[0019]
[0020] In a more specific technical solution, in S2, the transmission power range of the cellular user and the D2D provider is set using the following logic:
[0021] Min p k +p j
[0022]
[0023] C3:p j_min ≤p j ≤p j_max
[0024] C4:p k_min ≤p j ≤p k_max .
[0025] In a more specific technical solution, in S2, the following logic is used to obtain the transmission power of the D2D provider and the cellular user:
[0026]
[0027] The present invention proposes a spectrum reuse model with joint power control, the purpose of which is to maximize the total data transmission of the D2D content distribution system while saving the energy consumption of mobile devices. Therefore, the present invention proposes a spectrum reuse model with joint power control for the D2D content distribution problem, which transforms the spectrum allocation problem of D2D users and cellular users into a problem of maximizing the number of D2D users connected while minimizing the transmission power of cellular users and D2D users, and further maps it to the minimum cost flow problem in graph theory, and solves it through the minimum cost flow algorithm.
[0028] In a more specific technical solution, S3 includes:
[0029] S31. Determine the response time when different D2D providers j complete request i using the following logic:
[0030]
[0031] Where D i is the amount of data transmitted, R j Data transfer rate for D2D providers to transfer files;
[0032] The following logic is used to calculate the data transmission rate R of the D2D provider transmitting the file: j :
[0033]
[0034] S32. Using the following logic, obtain the preference value of requester i for D2D provider j:
[0035]
[0036] S33. Using the following logic, according to the file data volume and the remaining resources of the D2D provider, calculate the upper limit of the number of requests received by each D2D provider j: j :
[0037]
[0038] In the formula, q j is the available resources of the provider, p j is the transmission power of the provider.
[0039] S34. Determine the benefits of the D2D provider using the following logic, and construct a provider preference model accordingly:
[0040]
[0041] In the formula, v r The revenue from completing the request, p j *t i,j The resource consumption required to complete request r for provider j.
[0042] In order to improve the fairness and stability of the D2D content distribution system, the present invention refers to the delayed acceptance algorithm, and designs a stable content distribution algorithm by establishing a preference model of requesters and providers.
[0043] In a more specific technical solution, S4 includes:
[0044] S41, defining a stable matching operation;
[0045] S42: Based on the definition information of stable matching, the following logic is used to minimize the ranking of the preference sequence of the final matched D2D provider in the preference model:
[0046]
[0047] In the formula, rank μ (r i ) is the requester r i The ranking of the matched providers in the matching result μ in their preference sequence.
[0048] S43. According to the global effectiveness objective function, the following logic is used to calculate the minimum sum of all requester costs:
[0049]
[0050] In the formula, On behalf of the provider p j With the requester i match;
[0051] S44. Use the following logic to express the revenue maximization problem of all D2D providers:
[0052]
[0053] In the formula, l j Indicates p j The maximum number of requests that can be received.
[0054] The present invention is oriented to all parties involved in content distribution, and takes into account the needs of base stations and mobile devices. The goal is to maximize the total amount of data transmission and minimize the power consumption of devices, and on this basis, a stable provider-requester matching is designed. In order to enhance the stability of the D2D content distribution system, the present invention proposes a stable matching algorithm based on a preference model. The algorithm fully considers the utility of the requester and the provider, and obtains a stable matching result by referring to the delayed acceptance algorithm.
[0055] In a more specific technical solution, S41 includes:
[0056] S411, calculating spectrum reuse between D2D providers and cellular users;
[0057] S412, determining the data transmission rate of the D2D provider according to the spectrum reuse situation;
[0058] S413: For the D2D provider and the requester, a preference sequence is established between the two parties to complete a stable match between the requester and the provider.
[0059] In a more specific technical solution, S5 includes:
[0060] S51, Modeling transmission power problems;
[0061] S52, at the D2D provider p j With cellular users c k When matching, the following logic is used to determine the total transmission power of the corresponding devices:
[0062]
[0063] S53. Use the following logic to abstract the spectrum reuse problem into a transmission power problem:
[0064]
[0065] x j,k ={0,1}
[0066] In the formula, is the maximum transmission power among all D2D providers, It is the maximum transmission power of all cellular users.
[0067] The present invention considers the spectrum reuse of D2D providers and cellular users, thereby ensuring the correctness of data transmission, and performing power control to reduce the energy consumption of mobile devices. The present invention obtains the spectrum allocation by matching cellular users with D2D providers, thereby obtaining the data transmission rate of the D2D provider.
[0068] In a more specific technical solution, the D2D service provision mechanism implementation system for content sharing includes:
[0069] A network model building module is used to build a network model, wherein the network model includes: a requester, a cellular user, and a D2D provider, wherein the requester is represented by a preset request quintuple, the cellular user is represented by a preset quadruple, and the D2D provider is represented by a preset provision quintuple;
[0070] The reuse model building module is used to build a spectrum reuse model. During the pairing process between cellular users and D2D providers, the signal-to-noise ratio decoding threshold condition is set for decoding the same spectrum communication data; the transmission power range between cellular users and D2D providers is set, and the power when the D2D provider is paired with different cellular users is calculated to obtain the transmission power between the D2D provider and the cellular user. The reuse model building module is connected to the network model building module;
[0071] A preference model building module is used to build a preference model according to the requester preference information and the provider preference information;
[0072] The matching processing module performs problem definition operations and obtains matching results by performing stable matching, so as to minimize the ranking of the preference sequence of the final matched D2D provider in the preference model, calculate and minimize the sum of the costs of all requesters, and express the problem of maximizing the benefits of all D2D providers; in the stable matching process, for the stable matching problem between D2D providers and requesters, the matching processing requester and the D2D provider are matched, and the matching processing module is connected with the preference model building module and the network model building module;
[0073] A problem conversion module is used to perform spectrum reuse operations, wherein the sum of the transmission powers of the corresponding devices is determined, and the spectrum reuse problem is abstracted into a transmission power problem; the spectrum reuse problem of the D2D provider and the cellular user is converted into a minimum cost maximum flow problem, and the problem conversion module and the reuse model construction module;
[0074] The content distribution module is used to determine the transmission rate when the D2D provider matches different requesters according to the spectrum allocation between the cellular users and the D2D provider, to match the requesters and the providers according to the preference model, and to perform content distribution operations according to the matching results. The content distribution module is connected to the question conversion module and the matching processing module.
[0075] Compared with the prior art, the present invention has the following advantages:
[0076] In the face of massive content download requests, the present invention proposes a D2D service provision mechanism for content sharing, which can alleviate the traffic pressure faced by base stations and improve user experience. The present invention aims to design a stable D2D content distribution mechanism, proposes a stable matching algorithm based on preference establishment, and simultaneously solves the power control and spectrum allocation problems in the D2D content distribution system.
[0077] Aiming at the D2D content distribution problem, the present invention proposes a spectrum reuse model with joint power control, which transforms the spectrum allocation problem between D2D users and cellular users into the problem of maximizing the number of accessed D2D users while minimizing the transmission power of cellular users and D2D users, and further maps it to the minimum cost flow problem in graph theory and solves it by the minimum cost flow algorithm.
[0078] In order to improve the fairness of the D2D content distribution system, the present invention refers to the delayed acceptance algorithm, and designs a stable content distribution algorithm by establishing a preference model of requesters and providers.
[0079] In order to enhance the stability of the D2D content distribution system, the present invention proposes a stable matching algorithm based on a preference model. The algorithm fully considers the utility of the requester and the provider, and obtains a stable matching result by referring to the delayed acceptance algorithm.
[0080] The present invention considers the spectrum reuse of D2D providers and cellular users, thereby ensuring the correctness of data transmission, and performing power control to reduce the energy consumption of mobile devices. The present invention obtains the spectrum allocation by matching cellular users with D2D providers, thereby obtaining the data transmission rate of the D2D provider.
[0081] The present invention solves the technical problems of power control defect and spectrum allocation defect existing in the D2D content distribution system in the prior art. BRIEF DESCRIPTION OF THE DRAWINGS
[0082] Figure 1 This is a schematic diagram of basic steps of a method for implementing a content sharing-oriented D2D service provision mechanism according to Embodiment 1 of the present invention;
[0083] Figure 2 This is a schematic diagram of a content sharing system model according to Embodiment 1 of the present invention;
[0084] Figure 3 This is a schematic diagram of the power analysis principle of Example 1 of the present invention;
[0085] Figure 4 This is a schematic diagram of a spectrum allocation model according to Embodiment 1 of the present invention;
[0086] Figure 5 This is a schematic diagram of the effect of the number of requesters on the requester cost in Example 1 of the present invention;
[0087] Figure 6 This is a schematic diagram of the effect of the number of requesters on the provider's revenue according to Example 1 of the present invention;
[0088] Figure 7 This is a schematic diagram of the effect of the number of requests on the average ranking of providers matched with the requester according to Example 1 of the present invention;
[0089] Figure 8 This is a schematic diagram of the effect of the number of providers on the requester cost in Example 1 of the present invention;
[0090] Fig. 9 This is a schematic diagram of the effect of the number of providers on provider revenue according to Example 1 of the present invention;
[0091] Fig.10 This is a schematic diagram of the effect of the number of providers on the average ranking of providers matched to the requester according to Example 1 of the present invention;
[0092] Fig.11 This is a schematic diagram of the effect of the number of requests on the number of algorithm iterations in Example 1 of the present invention;
[0093] Fig.12 This is a schematic diagram of the impact of the number of requests on the execution time in Example 1 of the present invention. DETAILED DESCRIPTION
[0094] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in combination with the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0095] Example 1
[0096] like Figure 1 and Figure 2 As shown, the D2D service provision mechanism implementation method for content sharing provided by the present invention includes the following basic steps:
[0097] S1. constructing a network model, wherein the roles involved in the network model include but are not limited to: a requester, a cellular user, and a provider;
[0098] In this embodiment, the roles involved in the network model include:
[0099] In this embodiment, requester: The requester can be represented as a five-tuple (i, f, D, v, L), where i is the identifier of the requester; f is the requested file; D is the amount of data requested to be transferred; v is the maximum price the requester can pay; and L is the location of the requester.
[0100] In this embodiment, cellular users: A cellular user can be represented as a four-tuple (k, L, p min ,p max ), where k is the identity of the cellular user; L is the location of the cellular user; p min is the minimum transmission power of a cellular user; p max It is the maximum transmission power of cellular users.
[0101] In this embodiment, provider: The provider can be represented as a five-tuple (j, L, q, p min ,p max ), where j is the identity of the provider; L is the location of the provider; q is the amount of available resources of the provider; p min is the provider's minimum transmission power; p max is the maximum transmit power of the provider.
[0102] S2. Construct a spectrum reuse model and set the decoding threshold conditions of the signal-to-noise ratio of paired cellular users and D2D providers to ensure that when both parties communicate in the same spectrum, the information can be correctly decoded by the receiver; set the transmission power range of cellular users and D2D providers, calculate the power of the D2D provider when paired with different cellular users, and obtain the transmission power of the D2D provider and the cellular user, see Figure 3 ;
[0103] In this embodiment, a D2D mode based on non-orthogonal multiple access (NOMA) technology is adopted. NOMA technology is applicable to scenarios with a large number of connections. Unlike OMA (Northogonal Multiple Access), the receiver in the NOMA network can use SIC (Successive Interference Cancellation) technology to handle strong cross-layer interference between D2D users and cellular users, so that more spectrum sharing modes can be used.
[0104] like Figure 4 As shown, in this embodiment, in NOMA mode, both cellular users and D2D users will cause weak interference to each other's data receivers. In this embodiment, the cellular user is paired with a D2D provider. Therefore, the signal-to-noise ratio of the paired cellular user and D2D provider must meet their respective decoding thresholds. Only when the above conditions are met can the information be correctly decoded by the receiver when the cellular user and the D2D provider communicate using the same spectrum. This constraint can be expressed as:
[0105]
[0106] Among them, p k and p j represents the transmission power of cellular users and D2D users, σ represents the noise power, G k,B represents the channel gain from cellular user k to the base station, G j , B represents the channel gain from D2D provider j to the base station, G j , i Represents the channel gain between the D2D provider and the D2D requester. γ k and γ j Denote the decoding thresholds of cellular users and D2D providers respectively. Define X = {x j , k |k∈C,j∈D} represents the matching strategy between cellular users and D2D providers, x j , k=1 indicates that cellular user k matches D2D provider j, otherwise cellular user k does not match D2D provider j. The first inequality indicates that data transmission between cellular users and base stations can proceed normally, and the second inequality indicates that data transmission between D2D users can proceed normally.
[0107] In this embodiment, the transmission power of the cellular user and the D2D provider must be within their respective power ranges and satisfy the following formula:
[0108]
[0109] In this embodiment, since the D2D provider and the cellular user in the D2D environment are mostly mobile terminals with limited resources, in order to save device energy consumption and minimize the power sum of the cellular user and the D2D provider, the power of each D2D provider when paired with different cellular users is calculated as the target, as shown in the following formula:
[0110] Min p k +p j
[0111]
[0112] C3:p j_min ≤p j ≤p j_max
[0113] C4:p k_min ≤p j ≤p k_max
[0114] Based on this, the transmission power of the D2D provider and the cellular user can be obtained respectively, namely:
[0115]
[0116] S3, establishing a preference model based on the requester preference information and the provider preference information;
[0117] like Figure 5 As shown, in the process of establishing the requester preference in this embodiment, each requester i hopes to get a faster response speed. The response time when different providers j complete request i is:
[0118]
[0119] Among them, D i is the amount of data transmitted, R j R is the data transfer rate of the provider transferring files. j It can be calculated by the following formula:
[0120]
[0121] Based on this, we can get the preference value of requester i for provider j as:
[0122]
[0123] So for a requester i If and only if t i,j <t i,j ′.
[0124] In the provider preference establishment operation process of this embodiment, for the providers in the system, the maximum number of requests l that each provider j can receive can be calculated based on the file data volume and the remaining resources of the provider. j :
[0125]
[0126] Among them, q j is the available resources of the provider, p j is the transmission power of the provider.
[0127] like Figure 6 As shown, in this embodiment, the provider's income is defined as the income obtained by completing a request minus the cost consumed to complete the request, specifically as follows:
[0128]
[0129] Among them, v r The revenue from completing the request, p j *t i,j The resource consumption required for provider j to complete request r. Therefore, for a provider, If and only if
[0130] S4. Perform problem definition operations, obtain matching results by performing stable matching to minimize the ranking of the final matching provider in its preference sequence; calculate and minimize the cost of all requesters; express the problem of maximizing the benefits of all providers in the system; perform matching operations between requesters and providers for the problem of stable matching between providers and requesters;
[0131] In the D2D model, both parties hope to match with more satisfactory objects to obtain higher benefits. In order to continuously motivate both parties to participate in the D2D model, the matching stability is taken as the goal during matching, and an attempt is made to obtain a matching result that satisfies both parties and is stable.
[0132] like Figure 7As shown, in the stable matching process of this embodiment, it is defined that a matching μ is stable if and only if there is no blocking pair {(p j ,r i )|p j ∈P,r i ∈R} such that there exists and Where μ(r i ) indicates that the current match is with r i Matching providers, μ(p j ) indicates that the current match is with p j Matched requester. According to the definition of stable matching, the final matching result should ensure that no requester or provider can obtain a better match than the current match. For requesters, each requester hopes to obtain content at the lowest cost, so the goal is to minimize the ranking of the final matching provider in its preference sequence:
[0133]
[0134] Among them, rank μ (r i ) is the requester r i The ranking of the matched providers in the matching result μ in their preference sequence. The objective function considering global effectiveness is to minimize the sum of the costs of all requesters:
[0135]
[0136] like Figure 8 , Fig. 9 and Fig.10 As shown, On behalf of the provider p j With the requester i Match, otherwise The first constraint states that each request can match at most one provider. For providers, each provider hopes to obtain higher profits through content distribution, so each provider hopes to match the top l requesters to maximize its own profits. The profit maximization problem of all providers in the system can be expressed as:
[0137]
[0138]
[0139] Among them, l j Indicates p jThe maximum number of requests that can be received, so the first constraint indicates that the number of requests received by the provider cannot exceed the maximum number of requests it can accept. The content distribution problem that takes stability into account will consider the preferences of both the requester and the provider in the matching process, rather than optimizing only the benefits or costs of one side.
[0140] In this embodiment, for the problem of stable matching between providers and requesters, the spectrum reuse between D2D providers and cellular users is first calculated to determine the data transmission rate of the provider, and then a preference sequence of both parties is established to complete the matching between the requester and the provider.
[0141] S5, spectrum reuse, determine the total transmission power of corresponding devices; abstract the spectrum reuse problem into the problem of maximizing the number of D2D users connected while minimizing the transmission power of cellular users and D2D providers; convert the spectrum reuse problem of D2D providers and cellular users into the minimum cost maximum flow problem;
[0142] Each D2D provider has multiple selectable cellular users around it. j With cellular users c k If they match, the total transmission power of the corresponding devices is:
[0143]
[0144] In order to maximize the total amount of data transmission in the D2D content distribution system while saving energy consumption of mobile devices, in this embodiment, the spectrum reuse problem is abstracted into the problem of maximizing the number of D2D users accessed while minimizing the transmission power of cellular users and D2D providers, as shown in the following formula:
[0145]
[0146] x j,k ={0,1}
[0147] in, is the maximum transmission power among all D2D providers, It is the maximum transmission power of all cellular users.
[0148] In this embodiment, the value range of the variable α indicates that increasing the number of accessed D2D pairs has a greater impact on the objective function than reducing the transmission power of the D2D pair-cellular user matching. Therefore, it is ensured that the goal of maximizing the number of accessed D2D pairs takes precedence over minimizing the transmission power.
[0149] Furthermore, the spectrum allocation problem can be abstracted into the minimum cost flow (also called minimum cost maximum flow) problem. Figure 4 The spectrum allocation model in Figure 4Separate the D2D providers and cellular users to both sides, add source S and sink D, add lines from the source to each provider and lines from the cellular user to the sink. For each line, define the weight of the line segment as capacity and unit capacity cost. In this problem, since a provider can only match one cellular user and a cellular user can only match one D2D provider, the capacity of each line segment is 1. The line segments connected to the source and the line segments connected to the sink do not affect the solution of the problem, so they are set to 0 for ease of calculation. For each line between the provider and the cellular user, the capacity is 1, and the cost per unit capacity is defined as the sum of the power of both parties p j,k At this point, the spectrum reuse problem between D2D providers and cellular users is converted into the minimum cost maximum flow problem as shown in the spectrum allocation model diagram.
[0150] In this embodiment, during the operation of converting to obtain the minimum cost maximum flow problem,
[0151] Definition of minimum cost maximum flow problem: Given a network G = (V, A) where V is the set of vertices in the graph, including a specified source point v s and the meeting point v t , A is the set of directed edges in the graph. Each directed edge (v i ,v j ) corresponds to a capacity c ij (c ij >=0) and transmission fee b ij (b ij >=0), recorded as capacity-cost network G=(V,A,C,B). To find v in the capacity-cost network G s to v t The maximum flow and the minimum total cost of the flow. Regarding the minimum cost flow problem, its solutions can be roughly divided into two categories: one is to use the relevant theoretical methods of graph theory, such as the negative cost loop algorithm and the augmented path algorithm. The other is to use linear programming theory to first convert the minimum cost flow problem into a linear programming problem, and then solve it through the primal dual algorithm. The relevant algorithms of graph theory are simpler to calculate than the relevant algorithms of linear programming, and therefore are widely used in practice. The present invention adopts an algorithm based on graph theory for solution. In order to explain the algorithm of the present invention, relevant definitions are first given.
[0152] Define the forward arc: Let (v p ,v q ) is a chain of p in the network, stipulating v p to v q is the positive direction of p. Under this rule, arcs on p can be divided into two categories: arcs in the same direction as the positive direction of p are called positive arcs (edges); arcs in the opposite direction to the positive direction of p are called reverse arcs (edges).
[0153] Define an augmented chain: f is a feasible flow in the capacity-cost network G, p is v s to v t If all forward arcs in p are unsaturated arcs and all backward arcs are non-zero flow arcs, then p is called an augmenting path (or augmenting chain) with respect to the feasible flow f.
[0154] Define the residual network: There is a feasible flow f in the capacity-cost network G, and the residual capacity c is calculated for all edges in f f (u,v)=c(u,v)-f(u,v), and add the reverse edges (v,u) of all edges on flow f. The capacity of the reverse edge (v,u) is the flow value of the corresponding forward edge (u,v) in flow f. The new graph obtained is the residual network G′ of the original graph G
[0155] In this embodiment, firstly, a feasible flow f with the minimum cost (such as zero flow) is selected, a residual network with a flow value of f is constructed, and then the Ford algorithm is used to find the shortest (v s ,v t ) path, which is the minimum cost path. Then, the augmentation is performed along the minimum cost path, and the augmented flow value is δ=min{c f (p),v0-v(f)}, where c f (p) is the minimum value of the capacity of all arcs on the augmented chain p (denoted as the capacity of p). The augmented feasible flow is still denoted as f, and the above process is repeated until there is no augmentable path in the graph, that is, the maximum flow and minimum cost path are obtained.
[0156] S6. According to the spectrum allocation between the cellular user and the D2D provider, the transmission rate when the D2D provider matches with different requesters is determined, and the requester and the provider are matched according to the preference model to perform content distribution operations.
[0157] like Fig.11 and Fig.12 As shown, in this embodiment, in order to improve the efficiency of D2D content distribution, the present invention designs a distributed matching algorithm, which fully considers the stability of matching to achieve a win-win situation between content requesters and providers. Before content distribution, it is necessary to first calculate the preference sequence of the requester and the provider. First, according to the spectrum allocation between the cellular user and the D2D provider in the aforementioned step S5, the transmission power corresponding to the cellular user and the D2D provider can be obtained, and then the transmission rate when the D2D provider matches different requesters can be calculated; for each requester, a model is established according to the preference, and the requester r is calculated. i Preference values for each provider Then r i Sort the preference values of each provider from low to high to get the preference sequence S(0) (r i ). Similarly, for each provider, the preference values for different requesters are obtained according to the preference model. Then according to p j Sort the preference values of each requester from high to low to get the preference sequence S (0) (p j ), and initialize the provider to accept the request collection An empty set, a set of provider candidate requests is an empty set. After establishing preferences, requesters and providers enter the matching process. First, each requester makes a request to the provider with the highest ranking in the preference sequence according to the preference sequence of the current round. Then the provider places the currently received requests into the temporary request set in turn according to the ranking in the preference sequence. For In the request, first check whether there is a request that ranks first in the preference sequence. j If there is a request for a location, the provider directly puts it into the accepted collection and remove it from If the number of requests in the accepted set is less than the maximum number of requests l j , which means that the provider has remaining resources to accept other requests, then the currently received request (set Request in) and candidate set The requests in the preference sequence are sorted in the order of preference, and the requests ranked first are The request is put into the candidate set (in Indicates acceptance of collection ) and remove it from Remove from the collection. Put into the collection The requests in represent the requests that the provider must accept and are placed in the collection The request in represents the current round accepted by the provider, but it will be rejected if a higher-ranked request is received later. The requests ranked lower in the set The request in only means that it has not been rejected in the current round, but it may be rejected or accepted in the future. After completing the above two steps, you can update the provider p of the current round j The set of matching requests is The request in The union of the requests in . Then check the current Is the set an empty set? If it is not an empty set, these requests are rejected in turn, that is, the current provider p is deleted from the preference sequence of the corresponding request. j, because the current provider has rejected the request. The algorithm terminates when all requests are matched or the matching results of the previous and next rounds are the same.
[0158] In summary, facing the massive content download requests, the present invention proposes a D2D service provision mechanism for content sharing, which can alleviate the traffic pressure faced by the base station and improve the user experience. The present invention aims to design a stable D2D content distribution mechanism, proposes a stable matching algorithm based on preference establishment, and solves the power control and spectrum allocation problems in the D2D content distribution system at the same time.
[0159] Aiming at the D2D content distribution problem, the present invention proposes a spectrum reuse model with joint power control, which transforms the spectrum allocation problem between D2D users and cellular users into the problem of maximizing the number of accessed D2D users while minimizing the transmission power of cellular users and D2D users, and further maps it to the minimum cost flow problem in graph theory and solves it by the minimum cost flow algorithm.
[0160] In order to improve the fairness of the D2D content distribution system, the present invention refers to the delayed acceptance algorithm, and designs a stable content distribution algorithm by establishing a preference model of requesters and providers.
[0161] In order to enhance the stability of the D2D content distribution system, the present invention proposes a stable matching algorithm based on a preference model. The algorithm fully considers the utility of the requester and the provider, and obtains a stable matching result by referring to the delayed acceptance algorithm.
[0162] The present invention considers the spectrum reuse of D2D providers and cellular users, thereby ensuring the correctness of data transmission, and performing power control to reduce the energy consumption of mobile devices. The present invention obtains the spectrum allocation by matching cellular users with D2D providers, thereby obtaining the data transmission rate of the D2D provider.
[0163] The present invention solves the technical problems of power control defect and spectrum allocation defect existing in the D2D content distribution system in the prior art.
[0164] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A method for implementing a content sharing-oriented D2D service provision mechanism, characterized in that: The method comprises: S1. Constructing a network model, wherein the network model includes: a requester, a cellular user, and a D2D provider, wherein the requester is represented by a preset request quintuple, the cellular user is represented by a preset quadruple, and the D2D provider is expressed by a preset provision quintuple; S2. Construct a spectrum reuse model, set a signal-to-noise ratio decoding threshold condition for the pairing process between the cellular user and the D2D provider, for decoding the same spectrum communication data; set the transmission power range between the cellular user and the D2D provider, calculate the power when the D2D provider is paired with different cellular users, so as to obtain the transmission power between the D2D provider and the cellular user; S3, establishing a preference model based on the requester preference information and the provider preference information; S4, performing a problem definition operation, obtaining a matching result by performing a stable matching, minimizing the ranking of the preference sequence of the finally matched D2D provider in the preference model, calculating and minimizing the sum of all requester costs, and expressing the problem of maximizing the benefits of all the D2D providers; in the stable matching process, matching the requester with the D2D provider for the stable matching problem between the D2D provider and the requester; S5. Perform spectrum reuse operations, wherein the total transmission power of corresponding devices is determined, and the spectrum reuse problem is abstracted into a transmission power problem; the spectrum reuse problem of D2D providers and cellular users is converted into a minimum cost maximum flow problem. S6. According to the spectrum allocation between the cellular user and the D2D provider, determine the transmission rate when the D2D provider matches different requesters, match the requester and the provider according to the preference model, and perform content distribution operations according to the matching results.
2. The method for implementing a content sharing-oriented D2D service provision mechanism according to claim 1, characterized in that: In S2, the decoding threshold condition of the signal-to-noise ratio is determined using the following logic: In the formula, p k and p j represents the transmission power of cellular users and D2D users, σ represents the noise power, G k,B represents the channel gain from cellular user k to the base station, G j,B represents the channel gain from D2D provider j to the base station, G j,i represents the channel gain between the D2D provider and the D2D requester; γ k and γ j denote the decoding thresholds of cellular users and D2D providers respectively.
3. The method for implementing a content sharing-oriented D2D service provision mechanism according to claim 1, characterized in that: In S2, the transmission power of the cellular user and the D2D provider must be within their respective power ranges and satisfy the following formula:
4. The method for implementing a content sharing-oriented D2D service provision mechanism according to claim 1, characterized in that: In S2, the transmission power range of the cellular user and the D2D provider is set using the following logic: My name is k +p j C3:p j_min ≤p j ≤p j_max C4:p k_min ≤p j ≤p k_max 。 5. The method for implementing a content sharing-oriented D2D service provision mechanism according to claim 1, characterized in that: In S2, the transmission power between the D2D provider and the cellular user is obtained using the following logic:
6. The method for implementing a content sharing-oriented D2D service provision mechanism according to claim 1, characterized in that: The S3 includes: S31. Determine the response time when different D2D providers j complete the request i by using the following logic: Where D i is the amount of data transmitted, R j a data transmission rate for transmitting files for the D2D provider; The following logic is used to calculate the data transmission rate R of the D2D provider transmitting the file: j : S32. Using the following logic, obtain the preference value of the requester i for the D2D provider j: S33: Using the following logic, according to the file data volume and the remaining resources of the D2D provider, calculate the upper limit of the number of requests received by each D2D provider j: j : In the formula, q j is the available resources of the provider, p j is the transmission power of the provider. S34. Determine the revenue of the D2D provider using the following logic, and construct a provider preference model accordingly: In the formula, v r The revenue from completing the request, p j *t i,j The resource consumption required to complete request r for provider j.
7. The method for implementing a content sharing-oriented D2D service provision mechanism according to claim 1, characterized in that: The S4 includes: S41, defining the stable matching operation; S42: According to the definition information of the stable match, the ranking of the preference sequence of the finally matched D2D provider in the preference model is minimized by using the following logic: In the formula, rank μ (r i ) is the requester r i The ranking of the matched providers in the matching result μ in their preference sequence. S43. According to the global effectiveness objective function, the following logic is used to calculate the minimum sum of all requester costs: In the formula, On behalf of the provider p j With the requester i match; S44. Use the following logic to express the revenue maximization problem of all the D2D providers: In the formula, l j Indicates p j The maximum number of requests that can be received.
8. The method for implementing a content sharing-oriented D2D service provision mechanism according to claim 7, characterized in that: The S41 includes: S411, calculating spectrum reuse between the D2D provider and the cellular user; S412, determining a data transmission rate of the D2D provider according to the spectrum reuse situation; S413: establishing a preference sequence for the D2D provider and the requester, and completing the stable matching between the requester and the provider.
9. The method for implementing a content sharing-oriented D2D service provision mechanism according to claim 1, characterized in that: The S5 includes: S51, modeling the transmission power problem; S52, in the D2D provider p j With the cellular user c k When matching, the sum of the transmission powers of the corresponding devices is determined using the following logic: S53. The spectrum reuse problem is abstracted into a transmission power problem by using the following logic: x j,k ={0,1} In the formula, is the maximum transmission power among all D2D providers, It is the maximum transmission power of all cellular users.
10. A D2D service provision mechanism implementation system for content sharing, characterized in that: The system comprises: A network model construction module, used to construct a network model, wherein the network model includes: a requester, a cellular user and a D2D provider, wherein the requester is represented by a preset request quintuple, the cellular user is represented by a preset quadruple, and the D2D provider is expressed by a preset provision quintuple; A reuse model construction module is used to construct a spectrum reuse model, and in the process of pairing a cellular user with a D2D provider, a decoding threshold condition of a signal-to-noise ratio is set for decoding the same spectrum communication data; a transmission power range of the cellular user and the D2D provider is set, and the power of the D2D provider when pairing with different cellular users is calculated to obtain the transmission power of the D2D provider and the cellular user. The reuse model construction module is connected to the network model construction module; A preference model building module is used to build a preference model according to the requester preference information and the provider preference information; The matching processing module performs a problem definition operation, obtains a matching result by performing a stable matching, minimizes the ranking of the preference sequence of the finally matched D2D provider in the preference model, calculates and minimizes the cost of all requesters, and expresses the problem of maximizing the benefits of all the D2D providers; in the stable matching process, the requester and the D2D provider are matched for the stable matching problem between the D2D provider and the requester, and the matching processing module is connected with the preference model building module and the network model building module; A problem conversion module is used to perform spectrum reuse operations, wherein the sum of transmission powers of corresponding devices is determined, and the spectrum reuse problem is abstracted into a transmission power problem; the spectrum reuse problem of D2D providers and cellular users is converted into a minimum cost maximum flow problem, and the problem conversion module and the reuse model construction module; The content distribution module is used to determine the transmission rate when the D2D provider matches with different requesters according to the spectrum allocation between the cellular user and the D2D provider, so as to match the requester and the provider according to the preference model, and perform content distribution operations according to the matching results. The content distribution module is connected to the question conversion module and the matching processing module.
Citation Information
Patent Citations
D2D (Device-to-Device) communication content distribution scheme based on social network
CN106454700A
D2D-based wireless cache network system throughput optimization method
CN112367644A
D2d communication resource multiplexing selection method, base station and terminal
WO2017024967A1
Online power control in d2d networks
WO2020053781A1
