WO2018032613A1 - Method, device and system for processing d2d throughput - Google Patents

Abstract

The present invention relates to the technical field of communications. A method, device and system for processing D2D throughput is disclosed, and the method comprises: acquiring buying information and/or selling information corresponding to respective users in a transaction network; sorting, in descending order, an absolute value of each unit price in the transaction network and arranging throughput packets corresponding to each unit price to obtain a first sequence, calculating a total amount of throughput M to be sold in the transaction network and calculating to obtain a balanced price according to the first sequence and the total amount of throughput M; determining a selling user and a buying user participating in a transaction in a first round according to the first sequence and the balanced price; and completing a transaction between the selling user and the buying user according to a preset policy. The present invention provides a fair method for processing D2D throughput, thus preventing a transaction user from profiting from publishing false information or hiding information; additionally, the present invention optimizes the scheme of network configuration and reduces a waste of resources by using a balanced price to achieve a balanced competition.

Description

Method, device and system for D2D traffic processing [Technical Field]

The present invention relates to the field of communications technologies, and in particular, to a method, apparatus, and system for D2D traffic processing.

【Background technique】

Since the birth of mobile communication, the rapid development of mobile Internet traffic has increased at a high speed every year. As the fastest-growing network technology, the mobile Internet needs to support a large number of different types of services. The service demand of various services for network resources has increased dramatically, making mobile networks allocate resources. And facing a lot of challenges in the rationality, fairness and efficiency of various business transmissions. Therefore, the reasonable and efficient allocation of network resources has become a research hotspot of current mobile networks.

In order to improve the above problems, this study proposes a resource allocation model and algorithm for game bidding based on D2D technology to ensure that buyers and sellers conduct normal valuation and allocate resources through price.

Lee K.D. proposed a node-based fair resource allocation algorithm (Lee algorithm). The algorithm divides the subcarrier and power allocation problem into two sub-problems, that is, first, the mesh router (meshrouter, MR) allocates the number of subcarriers for the mesh client (MC), and then each mesh client is connected to the other. All connections redistribute power and subcarriers. The algorithm models these two sub-problems into an algorithm model based on the Nash bargaining solution (NBS), and the second sub-problem transforms the nonlinear mixed integer programming problem into a time-division scheduling problem. This method is theoretically true, but it is more difficult to implement in practice because it involves additional time allocation issues and is therefore particularly unsuitable for real-time services.

Chen et al. conducted an in-depth study on the spectrum reuse problem in 802.16-based networks, and proposed an integrated framework including time slot allocation, bandwidth allocation and real-time service bandwidth guarantee, which solved the quality of each customer link and Resource allocation problem under conditions such as bandwidth requirements of the uplink/downlink of the base station. This kind of algorithm only solves the resource allocation problem from a certain angle, and does not fundamentally guarantee the resource allocation. Has a good utilization rate.

In view of this, overcoming the deficiencies of the prior art is an urgent problem to be solved in the art.

[Summary of the Invention]

The technical problem to be solved by the present invention is to solve the problem of low resource allocation utilization in the prior art.

The invention adopts the following technical solutions:

In a first aspect, the present invention provides a method for D2D traffic processing, including:

Obtaining the auction information and/or the auction information corresponding to each user in the transaction network, wherein the auction information includes the flow package to be purchased and the unit price of the purchase, and the auction information includes the flow package to be sold and the unit price of the sale;

According to the absolute value of each unit price in the transaction network, the flow packets corresponding to each unit price are arranged in a descending order, and a first sequence is obtained, and the total amount of traffic M to be sold in the transaction network is calculated, according to the first sequence and the total amount of traffic. M calculates the equilibrium price;

Determining, according to the first sequence and the equilibrium price, an auction user and a buyer who participate in the transaction in the first round;

The transaction between the auction user and the buyer user is completed according to a preset policy.

Preferably, the calculating the equilibrium price according to the first sequence and the total flow M, specifically includes:

According to the order of each unit price in the first sequence, the flow packets corresponding to the unit price are sequentially accumulated until the accumulated value reaches M+1, and the flow packet to which the traffic constituting the M+1 accumulated value belongs is confirmed, and then the flow packet is confirmed. The unit price corresponding to the traffic packet is the equilibrium price.

Preferably, determining, according to the first sequence and the equalization price, the first round of auction users and the auction users participating in the transaction, specifically comprising:

When the traffic packet to which the M+1 belongs belongs to the seller, determining that the auction user participating in the first round of the transaction is one or more sellers in the first sequence and selling the unit price greater than the equilibrium price, and The seller to which the M+1 belongs; determining that the first-round participating user of the transaction is the one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price;

Determining the first round of auction users participating in the transaction when the traffic packet to which the M+1 belongs belongs to the buyer a one or more sellers in the first sequence that are sold at a unit price greater than the equilibrium price; determining that the first round of the bidding user participating in the transaction is in the first sequence, and the purchased unit price is less than One or more buyers who balance the price.

Preferably, the completing the transaction between the auction user and the auction user according to the preset policy, specifically:

Step A) confirming that the first auction user who has the highest unit price among the current auction users and the first auction user who has the highest unit price purchased by the auction user completes the corresponding transaction according to the respective flow packets;

If the first auction user and the first auction user corresponding to the flow packet are exactly equal, the first auction user and the first auction user are excluded, and the remaining auction users and the auction user are performed again in step A);

If the traffic packets corresponding to the first auction user and the first auction user are not equal, the party with the smaller traffic packet is excluded, and the party with the remaining traffic packet after the transaction is regarded as one of the remaining auction users and the auction users. , perform step A) again.

Preferably, the auction information and the auction information include an attribute including a traffic packet and a unit price, and the attribute includes one or more of a network speed, a residence time, and a signal strength, and the The preset strategy completes the transaction between the auction user and the buyer user, and specifically includes:

And one or more of the network speed, the residence time and the signal strength are combined with the corresponding unit price to form a weighting factor;

Step B) confirming that the first auction user with the highest weight matching degree among the first auction user and the auction user with the highest unit price sold in the current auction user completes the corresponding transaction according to the respective traffic packets;

If the first auction user and the first auction user corresponding to the flow packet are exactly equal, the first auction user and the first auction user are excluded, and the remaining auction users and the auction user perform step B) again;

If the traffic packets corresponding to the first auction user and the first auction user are not equal, the party with the smaller traffic packet is excluded, and the party with the remaining traffic packet after the transaction is regarded as one of the remaining auction users and the auction users. , perform step B) again.

In a second aspect, the present invention provides a D2D traffic transaction method implemented by the method according to the first aspect, comprising:

The seller registers with the server, reports its unit price and the traffic package to be sold, and periodically monitors it. Measure the status information of the user and report the status information to the server;

The buyer registers with the server, reports his unit price and the traffic packet to be purchased; monitors the surrounding network signal, and sends the monitored network signal related information to the server;

The server performs the method of D2D traffic processing according to any one of claims 1-5, and returns the processing result to the buyer;

The buyer establishes a link with the seller and transmits the data;

Both parties calculate the transmitted traffic in real time and report it to the server for fee settlement.

Preferably, the method further includes:

After the data transmission is finished, a notification message is sent to the server, and both the buyer and the seller disconnect the link.

In a third aspect, the present invention provides an apparatus for D2D traffic processing, including:

a transaction information obtaining module, configured to acquire auction information and/or auction information corresponding to each user in the transaction network;

The equilibrium price calculation module is configured to arrange each flow packet corresponding to each unit price according to the absolute value of each unit price in the transaction network, to obtain a first sequence, and calculate a total amount of traffic M to be sold in the transaction network, according to the The first sequence and the total flow amount M are calculated to obtain an equilibrium price;

a transaction user confirmation module, configured to determine, according to the first sequence and the equilibrium price, an auction user and a buyer who participate in the transaction in the first round;

The transaction implementation module is configured to complete the transaction of the auction user and the buyer user according to a preset policy.

Preferably, the equalization price calculation module further includes an accumulation module and an equilibrium price confirmation module, specifically:

The accumulating module is configured to sequentially accumulate the flow packets corresponding to the unit price according to the unit price in the first sequence from high to low;

The equalization price confirmation module is configured to confirm, when accumulating to M+1, the flow packet to which the traffic constituting the M+1 accumulated value belongs, and the unit price corresponding to the confirmed traffic packet is the equilibrium price.

Preferably, the transaction user confirmation module includes an auction user confirmation module and a purchase user confirmation module, specifically:

When the traffic packet to which the M+1 belongs belongs to the seller,

The auction user confirmation module is configured to determine that the first round of auction users participating in the transaction is one or more sellers in the first sequence and the unit price sold is greater than the equilibrium price, and the M+1 Attributable seller;

The auction user confirmation module is configured to determine that the first-time bidding purchase user is one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price;

When the traffic packet to which the M+1 belongs belongs to the buyer,

The auction user confirmation module is configured to determine that the first round of auction users participating in the transaction is one or more sellers in the first sequence and the unit price sold is greater than the equilibrium price;

The auction user confirmation module is configured to determine that the first purchase of the bidding user participating in the transaction is one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price.

In a fourth aspect, the present invention provides an apparatus for D2D traffic processing, including:

a memory for storing one or more applications;

The processor is configured to execute one or more applications stored in the memory, such as the method of D2D traffic processing or the method of D2D traffic transaction of the first aspect or the second aspect.

In a fifth aspect, the present invention provides a system for D2D traffic processing, the system comprising one or more buyer terminals, one or more seller terminals, and a server, specifically:

The seller terminal is configured to register with the server, report its own unit price and the traffic packet to be sold, and periodically monitor its own status information, and report the status information to the server;

The buyer terminal is configured to register with the server, report its own unit price and the traffic packet to be purchased; monitor the surrounding network signal, and send the monitored network signal related information to the server;

The server is configured to acquire the auction information and/or the auction information corresponding to each user in the transaction network; and arrange each flow packet corresponding to each unit price according to the absolute value of each unit price in the transaction network. a first sequence of calculating a total amount of traffic M to be sold in the transaction network, calculating an equilibrium price based on the first sequence and the total amount of traffic M; determining an auction of the first round of participating transactions based on the first sequence and the equilibrium price The user and the buyer are purchased; the transaction of the auction user and the buyer is completed according to a preset policy.

Compared with the prior art, the present invention has the beneficial effects that the present invention provides a fair (preventing policy manipulation) D2D traffic processing method, so that a transaction user cannot obtain revenue by publishing false information or hiding information. By balancing the price to achieve a competitive equilibrium effect, when a resource in the market is priced as P, the total supply Q _S (P) and total demand Q _D (P) of the resource are equal, optimizing the network configuration. The program reduces the waste of resources.

[Description of the Drawings]

1 is a schematic flowchart of a method for processing D2D traffic according to an embodiment of the present invention;

2 is a schematic flowchart of a method for processing D2D traffic according to an embodiment of the present invention;

3 is a schematic flowchart of a method for processing D2D traffic according to an embodiment of the present invention;

4 is a schematic flowchart of a method for processing D2D traffic according to an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of a neural network algorithm according to an embodiment of the present invention; FIG.

6 is a schematic diagram of a partial architecture of a neural network algorithm according to an embodiment of the present invention;

7 is a schematic flowchart of a method for D2D traffic transaction according to an embodiment of the present invention;

FIG. 8 is a schematic structural diagram of an apparatus for processing D2D traffic according to an embodiment of the present invention;

FIG. 9 is a schematic structural diagram of an apparatus for processing D2D traffic according to an embodiment of the present invention;

FIG. 10 is a schematic structural diagram of an apparatus for processing D2D traffic according to an embodiment of the present invention;

FIG. 11 is a schematic structural diagram of an apparatus for processing D2D traffic according to an embodiment of the present invention;

FIG. 12 is a schematic structural diagram of a D2D traffic processing system according to an embodiment of the present invention;

FIG. 13 is a schematic structural diagram of a server for processing D2D traffic according to an embodiment of the present disclosure;

FIG. 14 is a schematic flowchart of a method for processing D2D traffic according to an embodiment of the present invention.

【detailed description】

The present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It is understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

In the description of the present invention, the orientations or positional relationships of the terms "inner", "outer", "longitudinal", "transverse", "upper", "lower", "top", "bottom", etc. are based on the drawings. The orientation or positional relationship shown is for the purpose of describing the present invention and is not intended to be a limitation of the invention.

Further, the technical features involved in the various embodiments of the present invention described below may be combined with each other as long as they do not constitute a conflict with each other.

D2D technology refers to the technology that the mobile terminal directly communicates when it is assisted by the cellular network or when there is no cellular network coverage. The application of this technology substantially reduces the dependence of mobile letters on traditional base stations, has a broad commercial model and practical significance, and is therefore supported by several national operators.

The embodiment of the invention provides an auction model with independent, private bidding, competitive equilibrium and fair bidirectional. The method, apparatus, and system for D2D traffic processing are described by the auction model from different dimensions. In the auction model, each of the preferred trading users only knows their own quotation for the auction item, and does not know the quotation of other people, and each user's quotation is independent of each other and does not depend on the quotation of others. The content of the present invention will be specifically described below in several dimensions of the method, apparatus and system of D2D traffic processing. In various embodiments of the present invention, it is assumed that the unit price of the purchase of the buyer is less than zero in the program, and the unit price of the seller's sale in the program is a value greater than zero.

Example 1:

Embodiment 1 of the present invention provides a method for processing D2D traffic, as shown in FIG. 1, including:

In step 201, the auction information and/or auction information corresponding to each user in the transaction network is acquired.

The auction information includes a flow package to be purchased and a unit price purchased, and the auction information includes a flow package to be sold and a unit price for sale.

In step 202, according to the absolute value of each unit price in the transaction network, the flow packets corresponding to each unit price are arranged in a descending order, to obtain a first sequence, and the total amount of traffic M to be sold in the transaction network is calculated, according to the first A sequence and total flow M are calculated to obtain an equilibrium price.

In step 203, based on the first sequence and the equilibrium price, an auction user and a buyer who participate in the transaction in the first round are determined.

In the embodiments of the present invention, the auction user and the auction user specifically refer to the transaction users determined in step 203, and the buyers and sellers in the embodiments are used to collectively refer to the transaction users in the entire transaction network.

In step 204, the transaction between the auction user and the auction user is completed in accordance with a preset policy.

Embodiments of the present invention provide a fair (preventing policy control) D2D traffic processing method, so that a transaction user cannot obtain revenue by publishing false information or hiding information, and on the other hand, achieving a competitive equilibrium effect by balancing the price, so that the market When a resource in a resource is priced P, the total supply Q _S (P) and the total demand Q _D (P) of the resource are equal, optimizing the network configuration scheme and reducing the waste of resources.

Example 2:

With reference to the first embodiment of the present invention, the calculation of the equilibrium price according to the first sequence and the total flow rate M, there is a preferred implementation, which specifically includes:

According to the order of each unit price in the first sequence, the flow packets corresponding to the unit price are sequentially accumulated until the accumulated value reaches M+1, and the flow packet to which the traffic constituting the M+1 accumulated value belongs is confirmed, and then the flow packet is confirmed. The unit price corresponding to the traffic packet is the equilibrium price.

When the above preferred implementation is converted into a program implementation, the first sequence has an optional implementation manner, as shown in FIG. 2, that is, in step 202, “in accordance with the absolute value of each unit price in the transaction network, from large to small. In order, each flow packet corresponding to each unit price is arranged to obtain a first sequence. The specific execution is as follows:

In step 2021, each flow packet is split into sub-flows of unit magnitude (eg, on the order of 1M), and each sub-flow corresponds to a respective unit offer.

Suppose there are m sellers in the trading network, the total amount of traffic sold is M, and there are n buyers in the trading network, and the total amount of traffic purchased is N. l=m+n is the total number of trading users. In each round of trading, the trading user must report his sold traffic packet (purchased traffic packet) K _i ∈ [1, l] and his own bid p _i ∈ [1, l] to the system. We define sorting all bids to get the following price set:

among them. K _i represents a package deal flow attributable to users in the unit price of i p _i, p _i is the unit price.

In step 2022, the sub-flows split from the respective flow packets are arranged in descending order of the absolute values of the unit prices in the transaction network.

The sorting process may be performed by the following program code 1 to complete the sorting process:

Program code 1:

For(i=1;1<=M;i++)do

p[i]=|p[i]|;;//

End for

//where p[1...L] represents an array of all sub-flows in the set (1)

Sort p[1...L]in a descending order

Return p[M+1];

Among them, sort p[1...L]in a descending order uses the sorting function to complete the acquisition of the first sequence.

Then another part of step 202 "calculates the total amount of traffic M to be sold in the transaction network, and calculates the equilibrium price according to the first sequence and the total flow M", which can be directly completed by return p[M+1] in the above execution code. .

It should be emphasized that the above-mentioned set 1 is only for convenience of explanation, and the unit price given by different transaction users is defaulted to one value. In actual applications, a seller may provide multiple sales packets, and each traffic package may have a different unit price. The Kx user is the seller, and three different unit price flow packets are specified. After completing the step 2021, the following set (2) is shown:

The case similar to the above set (2) is also suitable for the embodiment of the present invention.

Example 3:

With reference to the first embodiment of the present invention, there is a preferred implementation. According to the first sequence and the equalization price, the first round of auction users and the auction users participating in the transaction are determined, including:

When the total amount of traffic to which the M+1 belongs belongs to the seller, determining that the auction user of the first round of participating transactions is one or more sellers in the first sequence and selling the unit price greater than the equilibrium price, and The seller to which the M+1 belongs; determining that the first-round participating user of the transaction is the one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price;

When the total amount of traffic to which the M+1 belongs belongs to the buyer, determining that the auction user of the first round of participating transactions is one or more sellers in the first sequence and selling the unit price greater than the equilibrium price; It is determined that the first round of the bidding user participating in the transaction is one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price.

Wherein, determining that the first round of auction users participating in the transaction is one or more sellers in the first sequence and selling the unit price greater than the equilibrium price; determining that the first round of participating users of the transaction is the One or more buyers in a sequence and purchased at a unit price less than the equilibrium price may be implemented by subordinate program code 2:

Program code 2:

Among them, J is a confirmed collection containing the auction user and the buyer.

Example 4:

With reference to the foregoing embodiments of the present invention, the transaction of the auction user and the auction user is completed according to a preset policy, as shown in FIG. 3, which specifically includes:

In step 2041, it is confirmed that the first auction user who has the highest unit price sold in the current auction user and the first auction user who has the highest unit price purchased in the auction user complete the corresponding transaction according to the respective traffic packets.

In step 2042, it is confirmed whether the size of the traffic packet corresponding to the first auction user and the first auction user is equal. If they are equal, step 2043 is performed; if not, step 2044 is performed.

In step 2043, the first auction user and the first auction user are excluded, and it is confirmed whether the auction user and the auction user transaction are completed. If not, the step 2041 is performed again in the remaining auction users and the auction users. Finished the transaction;

In step 2044, the party having the smaller total amount of traffic is excluded, and the party having the total amount of remaining traffic after the transaction is regarded as one of the remaining auction users and the auction users, and step 2041 is executed again.

Example 5:

In conjunction with the above embodiments of the present invention, the auction information and the auction information include an attribute including a total amount of traffic and a unit price, and the attribute includes one or more of a network speed, a residence time, and a signal strength. The transaction of the auction user and the buyer user is completed according to the preset policy, as shown in FIG. 4, and specifically includes:

And one or more of the network speed, the residence time and the signal strength are combined with the corresponding unit price to form a weighting factor;

In step 2041', it is confirmed that the first auction user with the highest weight matching degree among the first auction user and the auction user who have the highest unit price sold in the current auction user completes the corresponding transaction according to the respective traffic packets;

In step 2042', it is confirmed that the size of the traffic packet corresponding to the first auction user and the first auction user are exactly equal, and the first auction user and the first auction user are excluded, and whether the transaction between the auction user and the auction user is completed is confirmed. If the remaining auction users and the buyer are not completed, the step 2041' is executed again, and if the completion is completed, the transaction is ended;

In step 2043', it is confirmed that the size of the traffic packet corresponding to the first auction user and the first auction user is not equal, the party with the smaller total traffic amount is excluded, and the party with the remaining total traffic after the transaction is regarded as the remaining auction user and the shooter. To buy one of the users, perform step 2041' again.

In the embodiment of the present invention, the transaction algorithm based on auction bilateral is proposed for the above embodiments in consideration of only the price, and the transaction model based on the recommendation algorithm is proposed for the case of multiple attributes.

In the case of considering multiple attributes, each time the user gives a true score, the weight is updated at each level of the neural network after the solution is completed. How to solve the weight for updating is explained below.

First define the error function in the neural network as:

Where o _k is the output of neuron k, t _k is the target output of neuron k, and outputs is the set of all neurons of the output layer. According to an embodiment of the invention, the error function (3) can be converted into the following formula:

To reduce the error, the weight update function can be defined as:

Where w _ji is the weight of the input i of neuron j.

The solution process is:

5.1, for the output layer, as shown in Figure 5:

among them:

Simplified:

Therefore, Δw _ji can be expressed as:

5.2. For the hidden layer, as shown in Figure 6:

among them:

therefore:

Δw _ji =ηδ _j x _ji (15)

So for the output layer of the neuron k:

δ _k ←o _k (1-o _k )(t _k -o _k ) (16)

For the hidden layer of neurons h:

When calculating the weight of each layer, the δ of the corresponding layer is substituted into the following formula.

w _ji ←w _ji +Δw _ji =w _ji +ηδ _j x _ji (18)

Where x _ji is the input i of neuron j;

Net _j =∑w _ji x _ji is the weighted sum of all inputs to neuron j;

o _j is the output of neuron j;

t _j is the target output of neuron j;

σ is the sigmod function;

Outputs all sets of neurons for the output layer;

DownStream(j) is a collection of all neurons that have the output of neuron j as input;

Example 6

In conjunction with the foregoing embodiments, the embodiment of the present invention further provides a D2D traffic transaction method, as shown in FIG. 7, including:

In step 21, the seller registers with the server, reports its own unit price and the total amount of traffic to be sold, and periodically monitors its own status information, and reports the status information to the server.

The status information includes network status, geographic location, and the like.

In step 22, the buyer registers with the server, reports its own unit price and the total amount of traffic to be purchased; monitors the surrounding network signals, and transmits the monitored network signal related information to the server.

The network signal related information includes an SSID and a MAC address of the hot spot.

In step 23, the server executes the method of D2D traffic processing described in the above embodiment, and returns the processing result to the buyer.

In step 24, the buyer establishes a link with the seller and performs data transfer.

In step 25, the two parties calculate the transmitted traffic in real time and report it to the server for fee settlement.

Embodiments of the present invention provide a fair (preventing policy control) D2D traffic processing method, so that a transaction user cannot obtain revenue by publishing false information or hiding information, and on the other hand, achieving a competitive equilibrium effect by balancing the price, so that the market When a resource in a resource is priced P, the total supply Q _S (P) and the total demand Q _D (P) of the resource are equal, optimizing the network configuration scheme and reducing the waste of resources.

In conjunction with the embodiment of the present invention, there is a preferred implementation, wherein after performing step 25, the method further includes:

In step 26, after the data transmission is finished, a notification message is sent to the server, and both the buyer and the seller disconnect the link.

Example 7

The embodiment of the invention further provides a device for processing D2D traffic, as shown in FIG. 8, comprising:

a transaction information obtaining module, configured to acquire auction information and/or auction information corresponding to each user in the transaction network;

The equilibrium price calculation module is configured to arrange the total amount of each flow corresponding to each unit price according to the absolute value of each unit price in the transaction network, to obtain the first sequence, and calculate the total amount of traffic M to be sold in the transaction network, according to the The first sequence and the total flow amount M are calculated to obtain an equilibrium price;

a transaction user confirmation module, configured to determine, according to the first sequence and the equilibrium price, an auction user and a buyer who participate in the transaction in the first round;

The transaction implementation module is configured to complete the transaction of the auction user and the buyer user according to a preset policy.

In conjunction with the embodiments of the present invention, there is a preferred implementation. The equalization price calculation module further includes an accumulation module and an equilibrium price confirmation module, as shown in FIG.

The accumulating module is configured to accumulate the total amount of the traffic corresponding to each unit price according to the order of each unit price in the first sequence from high to low;

The equalization price confirmation module is configured to confirm the total amount of the traffic to which the M+1 belongs when accumulating the M+1, and the unit price corresponding to the confirmed total traffic is the equilibrium price.

In conjunction with the embodiments of the present invention, there is a preferred implementation, the transaction user confirmation module, including an auction user confirmation module and a purchase user confirmation module, as shown in FIG. 10, specifically:

When the total amount of traffic to which the M+1 belongs belongs to the seller,

The auction user confirmation module is configured to determine that the first round of auction users participating in the transaction is one or more sellers in the first sequence and the unit price sold is greater than the equilibrium price, and the M+1 Attributable seller;

The auction user confirmation module is configured to determine that the first-time bidding purchase user is one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price;

When the total amount of traffic to which the M+1 belongs belongs to the buyer,

The auction user confirmation module is configured to determine that the first round of auction users participating in the transaction is one or more sellers in the first sequence and the unit price sold is greater than the equilibrium price;

The auction user confirmation module is configured to determine that the first purchase of the bidding user participating in the transaction is one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price.

Example 8

The embodiment of the invention further provides a device for processing D2D traffic, as shown in FIG. 11, comprising:

a memory for storing one or more applications;

The processor is configured to execute one or more applications stored in the memory, such that the method of D2D traffic processing or the method of D2D traffic transaction described in any of the above embodiments is completed.

Example 9

The embodiment of the invention further provides a system for D2D traffic processing, the system comprising one or more buyer terminals, one or more seller terminals, and a server, wherein the buyer is in need of using network traffic, but lacks traffic Resources or no carrier signals can't link to the state of the network; sellers can link to the network (via the network provided by the carrier, or wifi), hoping to exchange network traffic for revenue. Different sellers may link to different carrier networks, and their own self-pay is also different, so the seller will provide different traffic prices, as shown in Figure 12, specific:

The seller terminal is configured to register with the server, report its own unit price and the total amount of traffic to be sold, and periodically monitor its own status information, and report the status information to the server;

The status information includes network status, geographic location, and the like.

The buyer terminal is configured to register with the server, report its own unit price and the total amount of traffic to be purchased; monitor surrounding network signals, and send the monitored network signal related information to the server;

The network signal related information includes an SSID and a MAC address of the hot spot.

The server is configured to acquire the auction information and/or the auction information corresponding to each user in the transaction network; and arrange the total traffic volume corresponding to each unit price according to the absolute value of each unit price in the transaction network. a first sequence of calculating a total amount of traffic M to be sold in the transaction network, calculating an equilibrium price based on the first sequence and the total amount of traffic M; determining an auction of the first round of participating transactions based on the first sequence and the equilibrium price User and shoot buyer; complete the auction user and buy according to the preset strategy User's transaction.

In the embodiment of the present invention, in addition to the D2D traffic processing method described in Embodiment 1, the server is also responsible for performing identity verification, matching control, fee settlement, data collection, and the like for the buyer and the seller.

Example 10:

In addition to the D2D traffic processing device described in Embodiment 7, the present invention also provides a server based on a distributed architecture design, and the matching seller device and buyer device are shown in FIG. 13, the server includes:

Account Center: The Account Center manages the account information of buyers and sellers and provides certification services. The buyer and the seller must register with the account center before conducting the transaction, and then conduct the transaction after the account center is authenticated;

Settlement Center: Responsible for the settlement of the expenses incurred during the transaction process between the buyer and the seller. In the process of traffic sharing, both the buyer and the seller run the billing module. After the traffic sharing is completed, the fee is cleared after the two parties submit the confirmation, so as to avoid the billing error caused by the abnormal network disconnection;

Data collection: Timed collection and user information, including geographic location, current network speed, current signal strength, etc. Used by the control center for matching decisions;

Control Center: The core module of the system, running matching algorithms, matching buyers and sellers. Before using the network, the buyer needs to send the SSID and mac address of the WI-FI hotspot list that he has searched to the control module. The control module runs a matching algorithm according to the data collected by the data acquisition module, and matches the most suitable seller to the buyer;

API server: Provides the server interface called by the mobile device, and issues the request to each service module, reducing the coupling degree of the system and improving the scalability.

The seller terminal/buyer terminal includes:

Account module: responsible for registering with the client server, and logging in. Manage account rates, etc.

Detection module: Detect current network status, geographic location information, surrounding wifi hotspot list and other information. And reported to the server;

Billing module: responsible for traffic statistics during the transaction process;

Link management: report the server request, and link to the corresponding node according to the matching result of the server;

The method for implementing the D2D traffic transaction described in the embodiment 6 is specifically implemented in the server of the distributed architecture according to the embodiment, and is not specifically described herein.

It should be noted that the content interaction between the modules and the units in the above-mentioned device and the system, the execution process, and the like are based on the same concept as the embodiment of the processing method of the present invention. For details, refer to the description in the method embodiment of the present invention. , will not repeat them here.

A person skilled in the art can understand that all or part of the various methods of the embodiments can be completed by a program to instruct related hardware, and the program can be stored in a computer readable storage medium, and the storage medium can include: Read memory (ROM, Read Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk.

The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection of the present invention. Within the scope.

Claims (12)

1. A method for D2D traffic processing, comprising:

   Obtaining the auction information and/or the auction information corresponding to each user in the transaction network, wherein the auction information includes the flow package to be purchased and the unit price of the purchase, and the auction information includes the flow package to be sold and the unit price of the sale;

   According to the absolute value of each unit price in the transaction network, the flow packets corresponding to each unit price are arranged in a descending order, and a first sequence is obtained, and the total amount of traffic M to be sold in the transaction network is calculated, according to the first sequence and the total amount of traffic. M calculates the equilibrium price;

   Determining, according to the first sequence and the equilibrium price, an auction user and a buyer who participate in the transaction in the first round;

   The transaction between the auction user and the buyer user is completed according to a preset policy.
2. The method for processing D2D traffic according to claim 1, wherein the calculating the equilibrium price according to the first sequence and the total amount of traffic M comprises:

   According to the order of each unit price in the first sequence, the flow packets corresponding to the unit price are sequentially accumulated until the accumulated value reaches M+1, and the flow packet to which the traffic constituting the M+1 accumulated value belongs is confirmed, and then the flow packet is confirmed. The unit price corresponding to the traffic packet is the equilibrium price.
3. The D2D traffic processing method according to claim 2, wherein the first round of the auction user and the auction user participating in the transaction are determined according to the first sequence and the equalization price, which specifically includes:

   When the traffic packet to which the M+1 belongs belongs to the seller, determining that the auction user participating in the first round of the transaction is one or more sellers in the first sequence and selling the unit price greater than the equilibrium price, and The seller to which the M+1 belongs; determining that the first-round participating user of the transaction is the one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price;

   When the traffic packet to which the M+1 belongs belongs to the buyer, determining that the first round of auction users participating in the transaction is one or more sellers in the first sequence and selling the unit price greater than the equilibrium price; It is determined that the first round of the bidding user participating in the transaction is one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price.
4. The method for processing D2D traffic according to any one of claims 1-3, wherein the completing the transaction between the auction user and the buyer user according to the preset policy comprises:

   Step A) confirming that the first auction user who has the highest unit price among the current auction users and the first auction user who has the highest unit price purchased by the auction user completes the corresponding transaction according to the respective flow packets;

   If the first auction user and the first auction user corresponding to the flow packet are exactly equal, the first auction user and the first auction user are excluded, and the remaining auction users and the auction user are performed again in step A);

   If the traffic packets corresponding to the first auction user and the first auction user are not equal, the party with the smaller traffic packet is excluded, and the party with the remaining traffic packet after the transaction is regarded as one of the remaining auction users and the auction users. , perform step A) again.
5. The method for processing D2D traffic according to any one of claims 1 to 3, wherein the auction information and the auction information comprise attributes in addition to respective traffic packets and unit prices, and the attributes include a network speed. And one or more of the retention time and the signal strength, the transaction of the auction user and the buyer user is completed according to a preset policy, and specifically includes:

   And one or more of the network speed, the residence time and the signal strength are combined with the corresponding unit price to form a weighting factor;

   Step B) confirming that the first auction user with the highest weight matching degree among the first auction user and the auction user with the highest unit price sold in the current auction user completes the corresponding transaction according to the respective traffic packets;

   If the first auction user and the first auction user corresponding to the flow packet are exactly equal, the first auction user and the first auction user are excluded, and the remaining auction users and the auction user perform step B) again;

   If the traffic packets corresponding to the first auction user and the first auction user are not equal, the party with the smaller traffic packet is excluded, and the party with the remaining traffic packet after the transaction is regarded as one of the remaining auction users and the auction users. , perform step B) again.
6. A D2D traffic transaction method according to claim 1, characterized in that it comprises:

   The seller registers with the server, reports its unit price and the traffic packet to be sold, and periodically monitors its own status information, and reports the status information to the server;

   The buyer registers with the server, reports his unit price and the traffic packet to be purchased; monitors the surrounding network signal, and sends the monitored network signal related information to the server;

   The server performs the method of D2D traffic processing according to any one of claims 1-5, and returns the processing result to the buyer;

   The buyer establishes a link with the seller and transmits the data;

   Both parties calculate the transmitted traffic in real time and report it to the server for fee settlement.
7. The D2D traffic transaction method according to claim 6, further comprising:

   After the data transmission is finished, a notification message is sent to the server, and both the buyer and the seller disconnect the link.
8. A device for processing D2D traffic, characterized in that it comprises:

   a transaction information obtaining module, configured to acquire auction information and/or auction information corresponding to each user in the transaction network;

   The equilibrium price calculation module is configured to arrange each flow packet corresponding to each unit price according to the absolute value of each unit price in the transaction network, to obtain a first sequence, and calculate a total amount of traffic M to be sold in the transaction network, according to the The first sequence and the total flow amount M are calculated to obtain an equilibrium price;

   a transaction user confirmation module, configured to determine, according to the first sequence and the equilibrium price, an auction user and a buyer who participate in the transaction in the first round;

   The transaction implementation module is configured to complete the transaction of the auction user and the buyer user according to a preset policy.
9. The apparatus for processing D2D traffic according to claim 8, wherein the equalization price calculation module further comprises an accumulation module and an equilibrium price confirmation module, specifically:

   The accumulating module is configured to accumulate the orders in order of each unit price in the first sequence from high to low The traffic packet corresponding to the price;

   The equalization price confirmation module is configured to confirm, when accumulating to M+1, the flow packet to which the traffic constituting the M+1 accumulated value belongs, and the unit price corresponding to the confirmed traffic packet is the equilibrium price.
10. The device for processing D2D traffic according to claim 8, wherein the transaction user confirmation module comprises an auction user confirmation module and a purchase user confirmation module, specifically:

    When the traffic packet to which the M+1 belongs belongs to the seller,

    The auction user confirmation module is configured to determine that the first round of auction users participating in the transaction is one or more sellers in the first sequence and the unit price sold is greater than the equilibrium price, and the M+1 Attributable seller;

    The auction user confirmation module is configured to determine that the first-time bidding purchase user is one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price;

    When the traffic packet to which the M+1 belongs belongs to the buyer,

    The auction user confirmation module is configured to determine that the first round of auction users participating in the transaction is one or more sellers in the first sequence and the unit price sold is greater than the equilibrium price;

    The auction user confirmation module is configured to determine that the first purchase of the bidding user participating in the transaction is one or more buyers in the first sequence and the purchased unit price is less than the equilibrium price.
11. A device for processing D2D traffic, characterized in that it comprises:

    a memory for storing one or more applications;

    A processor for running one or more applications stored in the memory, such that the method of D2D traffic processing or the method of D2D traffic transaction of any of claims 1-7 is completed.
12. A system for D2D traffic processing, characterized in that the system comprises one or more buyer terminals, one or more seller terminals, and a server, specifically:

    The seller terminal is configured to register with the server, report its own unit price and the traffic packet to be sold, and periodically monitor its own status information, and report the status information to the server;

    The buyer terminal is configured to register with the server, report its own unit price and the traffic packet to be purchased; monitor the surrounding network signal, and send the monitored network signal related information to the server;

    The server is configured to acquire the auction information and/or the auction information corresponding to each user in the transaction network; and arrange each flow packet corresponding to each unit price according to the absolute value of each unit price in the transaction network. a first sequence of calculating a total amount of traffic M to be sold in the transaction network, calculating an equilibrium price based on the first sequence and the total amount of traffic M; determining an auction of the first round of participating transactions based on the first sequence and the equilibrium price The user and the buyer are purchased; the transaction of the auction user and the buyer is completed according to a preset policy.

Images