CN110856227B

CN110856227B - Data unloading method based on greedy algorithm and reverse auction

Info

Publication number: CN110856227B
Application number: CN201911132825.8A
Authority: CN
Inventors: 周欢; 陈鑫
Original assignee: China Three Gorges University CTGU
Current assignee: China Three Gorges University CTGU
Priority date: 2019-11-19
Filing date: 2019-11-19
Publication date: 2021-08-10
Anticipated expiration: 2039-11-19
Also published as: CN110856227A

Abstract

The embodiment of the invention provides a data unloading method based on a greedy algorithm and a reverse auction, which comprises the following steps: acquiring the tolerable maximum time delay of an application program in each mobile user MU; constructing a reverse auction optimization algorithm model based on the maximum time delay, wherein the reverse auction optimization algorithm model aims to maximize the profit of an operator MNO, and the constraint conditions of the reverse auction optimization algorithm model comprise that the transmission delay of each MU is not more than the corresponding maximum delay threshold; a winning WiFi access point is selected for assignment to the MU using a greedy winner selection algorithm. The data unloading method based on the greedy algorithm and the reverse auction converts the Wi-Fi unloading problem into the incentive problem based on the reverse auction from the commercial perspective, aims to maximize the benefit of MNO, and provides a new incentive mechanism based on delay constraint and reverse bidding to stimulate a Wi-Fi access point to participate in the data unloading process.

Description

Data unloading method based on greedy algorithm and reverse auction

Technical Field

The invention relates to the technical field of communication, in particular to a data unloading method based on a greedy algorithm and a reverse auction.

Background

In recent years, with the rapid spread of mobile devices (e.g., Ipad, notebook, smart phone), mobile internet services are undergoing explosive growth and providing various applications including video, audio, and image, etc. Cellular networks are today the most popular way of providing mobile internet services, especially with the advent of 5G networks. However, the explosive growth of mobile services and user demand is likely to overload and congest cellular networks in the near future. Especially during peak hours or urban areas, mobile users may face extreme conditions in terms of low network bandwidth, missed voice calls, poor signal coverage, etc. Therefore, Mobile Network Operators (MNOs) are urgently needed to provide effective and promising solutions to relieve the burden of cellular networks.

Mobile data offloading is the use of complementary network communication technologies to transport mobile traffic that was originally intended to be transported through a cellular network. As mobile network traffic continues to grow rapidly, it has become a key industrial segment. Cellular traffic may be offloaded through other complementary networks, such as Small Base Stations (SBS), opportunistic mobile networks, Wi-Fi Access Points (APs), or heterogeneous networks. Data offloaded through SBS (SBS offload) uses low power Small Base Stations (SBS) such as microcells, picocells and femtocells to offload cellular traffic in heterogeneous networks. Offloading mobile traffic from the cellular network using the opportunistic mobile network by offloading data from the opportunistic mobile network (opportunistic offloading). Offloading data over a Wi-Fi network (Wi-Fi offload), traffic is switched from a cellular network to a Wi-Fi AP when a mobile device enters a Wi-Fi coverage area, thereby reducing the cost and traffic load of the cellular network. In summary, the data offloading through the heterogeneous network is a combination of the three data offloading methods.

It is reported that Wi-Fi traffic for mobile devices and Wi-Fi only devices in 2017 will account for more than 60% of mobile data traffic. Due to the widespread deployment of Wi-Fi APs, offloading overloaded cellular traffic to Wi-Fi APs has become an effective and promising approach. Recent research has demonstrated the feasibility and effectiveness of Wi-Fi offloading in relieving the data traffic burden of cellular networks. However, Wi-Fi APs may be reluctant to participate in the data offloading process when not receiving appropriate economic incentives (e.g., payments or rewards). This is because providing data offload services for MNOs will inevitably result in additional resource consumption, such as energy consumption, bandwidth consumption, etc. Furthermore, when providing data offload services for mobile users, Wi-Fi APs may have to sacrifice their user benefits, such as bandwidth, transmission rate, quality of service, etc. Therefore, there is a pressing need to design an effective incentive mechanism to stimulate Wi-Fi APs to participate in the data offloading process.

Disclosure of Invention

The embodiment of the invention provides a data unloading method based on a greedy algorithm and a reverse auction, which is used for solving the technical problems in the prior art.

In order to solve the above technical problem, in one aspect, an embodiment of the present invention provides a data unloading method based on a greedy algorithm and a reverse auction, including:

acquiring the tolerable maximum time delay of an application program in each mobile user MU;

constructing a reverse auction optimization algorithm model based on the maximum time delay, wherein the reverse auction optimization algorithm model aims to maximize the profit of an operator MNO, and the constraint conditions of the reverse auction optimization algorithm model comprise that the transmission delay of each MU is not more than the corresponding maximum delay threshold;

a winning WiFi access point is selected for assignment to the MU using a greedy winner selection algorithm.

Further, before constructing the reverse auction optimization algorithm model based on the maximum time delay, the method further includes:

and acquiring the resources and the bids reported by each WiFi access point.

and acquiring the available WiFi access points reported by each MU.

Further, the constraints of the reverse auction optimization algorithm model further include ensuring that the spectrum bandwidth leased by the AP to the MU matches the maximum available spectrum resource block.

Further, the constraints of the reverse auction optimization algorithm model also include that only winners can be allocated to assist MU data offloading.

Further, the selecting a winning WiFi access point to allocate to the MU using a greedy winner selection algorithm specifically includes:

calculating the difference value of subtracting the total bid from the marginal contribution values of all WiFi access points, and determining the WiFi access point with the largest difference value to obtain the index of the WiFi access point;

selecting a winning WiFi access point based on the difference rankings until the total bid of the selected WiFi access points is greater than or equal to its marginal contribution.

Further, after selecting the winning WiFi access point, the MNO determines the reward paid for each WiFi access point using standard VCG mechanisms.

In another aspect, an embodiment of the present invention provides a data unloading apparatus based on a greedy algorithm and a reverse auction, including:

the acquisition module is used for acquiring the tolerable maximum time delay of the application program in each mobile user MU;

a model construction module, configured to construct a reverse auction optimization algorithm model based on the maximum time delay, where a goal of the reverse auction optimization algorithm model is to maximize an income of an operator MNO, and a constraint condition of the reverse auction optimization algorithm model includes ensuring that a transmission delay of each MU does not exceed a corresponding maximum delay threshold;

an assignment module to select a winning WiFi access point to assign to the MU using a greedy winner selection algorithm.

In another aspect, an embodiment of the present invention provides an electronic device, including: a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the above method when executing the computer program.

In yet another aspect, the present invention provides a non-transitory computer readable storage medium, on which a computer program is stored, which when executed by a processor implements the steps of the above method.

The data unloading method based on the greedy algorithm and the reverse auction converts the Wi-Fi unloading problem into the incentive problem based on the reverse auction from the commercial perspective, aims to maximize the benefit of MNO, and provides a new incentive mechanism based on delay constraint and reverse bidding to stimulate a Wi-Fi access point to participate in the data unloading process.

Drawings

FIG. 1 is a schematic diagram of a data offloading method based on a greedy algorithm and a reverse auction according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of a Wi-Fi offload network scenario provided by an embodiment of the invention;

fig. 3 is a schematic diagram of the profit of an MNO under different numbers of APs according to an embodiment of the present invention;

fig. 4 is a schematic view of a traffic load of an MNO according to an embodiment of the present invention, where the traffic load is different for different APs;

fig. 5 is a diagram illustrating the profit of an MNO at different MU numbers according to an embodiment of the present invention;

fig. 6 is a schematic view of a traffic load of an MNO according to an embodiment of the present invention, where the traffic load is different for different MUs;

FIG. 7 is a schematic diagram of a greedy algorithm and reverse auction based data offloading apparatus according to an embodiment of the present invention;

fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present invention without making any creative effort, shall fall within the protection scope of the present invention.

Fig. 1 is a schematic diagram of a data unloading method based on a greedy algorithm and a reverse auction, which is provided by the embodiment of the present invention, and as shown in fig. 1, the embodiment of the present invention provides a data unloading method based on a greedy algorithm and a reverse auction. The method comprises the following steps:

step S101, obtaining the tolerable maximum time delay of an application program in each mobile user MU;

step S102, constructing a reverse auction optimization algorithm model based on the maximum time delay, wherein the reverse auction optimization algorithm model aims to maximize the profit of an operator MNO, and the constraint condition of the reverse auction optimization algorithm model comprises the step of ensuring that the transmission delay of each MU does not exceed the corresponding maximum delay threshold;

and S103, selecting a winning WiFi access point to be distributed to the MU by utilizing a greedy winner selection algorithm.

Specifically, fig. 2 is a schematic view of a Wi-Fi offload Network scenario provided in an embodiment of the present invention, and as shown in fig. 2, the embodiment of the present invention considers a scenario of Mobile data offload in a single cellular Network, where the Network is composed of a Base Station (BS) of a Mobile Network Operator (MNO), a plurality of Wi-Fi Access Points (APs) and a group of Mobile Users (MUs). Here, the BS is deployed by an MNO and the AP is deployed by a different third party company. It is further assumed that all MUs are within the service coverage of the BS, while each AP only covers a portion of MUs due to its small transmission power, and that MUs are evenly distributed in the coverage area. Each MU may download its favorite content from the BS. Since the BS has limited backhaul and radio access capacity, the MNO may select some MUs served by the AP to maximize network throughput and improve overall network performance, especially when network congestion occurs.

However, APs belong to different third party companies, and since they are self-contained and rational, data offloaded through APs is not usually free. To stimulate these selfish and rational APs to participate in the data offloading process, the MNO needs to provide some payment to the AP to compensate for its resource consumption. Furthermore, the MU may run different applications, so the maximum latency that the different applications can tolerate should be considered when the MNO makes the offloading decision. The AP leases its available spectrum resource blocks to the MNO in exchange for consideration. Through the leased spectrum resource blocks, the MU may transmit data in different spectrum bandwidths. Specifically, each AP periodically reports its available spectrum resource blocks and provides a bid to the MNO, and the MNO selects some APs to participate in the data offloading process and pays them a corresponding reward based on the collected information.

The correlation model is as follows:

1) mobile operator revenue model: in the above network, the MNO obtains revenue by providing content services to the MUs. The embodiment of the present invention assumes that the MU requests a total mobile data traffic q in the system, where the traffic that the AP can assist in offloading is f. Thus, the total flow transmitted by the BS is (q-f). Since the cost invested by the MNO to build and maintain the BS at an early stage is fixed, the cost of single-bit movement data can be set to e and the price to d. The revenue that the MNO receives from the unit traffic may then be found to be (d-e).

If consideration is not taken into account for payment to the AP participating in the data offload process, the revenue function of the MNO is expressed as follows:

U(q，f)＝(d-e)(q-f)+df (1)

where U (q, f) is MNO revenue, (d-e) (q-f) is revenue generated by traffic transmitted by the BS, df is revenue generated by traffic offloaded by the AP, d is the price of MNO-unit mobile data, e is cost of MNO-unit mobile data, q is total mobile data traffic requested by the MU, and f is traffic that the AP can assist in offloading.

The embodiment of the invention divides the data unloading process into a plurality of time slots, wherein each time slot is at least larger than the maximum tolerant delay of MU. The MNO initiates an auction and collects bids for the AP at each time period. Based on the request information of the surrounding MUs, the MNO may evaluate the offloading potential of each AP based on its available spectrum resource blocks. The MNO then selects the most valuable AP to participate in data offloading. When the MU requests the content service, the MNO first checks if they can be served by a nearby available AP. If there is no AP available, the MU is still able to directly access the cellular network to download the content.

2) And (3) transmission model: suppose that

Represents a set of MUs, and each MU

The following attributes are available:

flow demand s_j: each MU in the system has its own traffic requirements, which need to be based on different types of applications and have specified transmission delay limits.

Maximum delay threshold delta_j: this depends on the type of service of each MU, with different types of applications with MUs tolerating different maximum delays. For example, file transfer programs (e.g., webdisks) have a higher tolerance delay than video applications (e.g., webcasts).

Channel transmission rate R_ij: for the channel model between each AP and MU, embodiments of the present invention take into account path loss and small-scale fading. The channel transmission rate between AP i ∈ K and MU j ∈ N may be expressed as follows:

wherein, B_ijIs the bandwidth of the leased transmission channel between AP i and MU j, N₀Is the channel noise power, d_ijIs the distance between AP i and MU j, α is the path loss index, h_jSmall scale channel fading, which represents a rayleigh distribution. For ease of analysis, embodiments of the present invention assume that all APs use fixed power transmission, and let P be_i＝P_t，

3) Competitive bidding model of AP: suppose that

Represents a set of APs, and each

The following attributes are available:

available spectrum resource block

Since each AP owned by a third party company has its own role, the APs may have different spare spectrum resource blocks available for performing data offloading.

True value v of a unit leased spectrum resource block_i: it represents the true value of consumption caused by helping the MNO service data offload process. And v is_iIs private information of AP i and is unknown to any other AP or MNO.

Bidding phi of unit leased spectrum resource block_i: this is the reward or payment that the AP i wants to receive from the MNO to compensate for the ongoing dataResource consumption due to offloading. However, if AP i can get a higher reward by asking other prices, bid φ_iMay not equal consumption v_iThe true value of (d). Communication cost of MU j and bandwidth B of leased spectrum_ijAnd duration t of occupancy_ij＝s_j/R_ijAssociated, denoted ε_ijThe calculation is as follows:

ε_ij＝φ_iB_ijt_ij (3)

wherein epsilon_ijIs the communication cost of MU j, phi_iBidding for a unit of leased spectrum resource blocks, B_ijFor leasing the bandwidth of the spectrum, t_ijIs the occupied time.

During the auction process, each AP i will have its bid vector

Submitted to MNO, where phi_iBid on its behalf, and available spectrum resource blocks

In order to make the auction process fair and the transactions between APs are reciprocal, an appropriate incentive mechanism should be designed to encourage the participation of the APs.

4) Reverse auction model: the present invention uses a reverse auction to incentivize the participation of APs in data offloading processes, where an MNO acts as an auctioneer to purchase AP capacity, while an AP acts as a seller that provides its available spectrum resources to serve offload traffic. Specifically, each AP reports its available capacity and bids on the MNO, and the MNO selects some APs to participate in the data offload process and pays their respective rewards based on the collected information (i.e., the available resources and bids for all APs). The whole auction program comprises three steps:

1. each AP will bid vector with

Submitted to the MNO.

2. Each MU reports to the MNO the Wi-Fi connections available in its vicinity and the maximum delay tolerable for the requested dataAnd data size (i.e., s)_jAnd delta_j，

). From the reported information, the MNO may generate an AP-MU association set

This reflects the set of MUs in each AP coverage, where F_iRepresenting the set of MUs covered by AP i. For example, as shown in fig. 2, MUs 6, 8, and 10 are covered by AP 3. That is, the set of MUs in the coverage of AP 3 is

Likewise, the set of MUs in the coverage area of AP 4 is

3. The MNO determines a subset of APs that will participate in the data offload process and calculates a reward to each AP.

Embodiments of the present invention assume that all channel state information and the transmit power of the MUs are known at the MNO. Now, the embodiments of the present invention will x_iE {0, 1} and a_ijE {0, 1} is defined as two indicator variables to indicate whether AP i is ultimately selected to assist in offloading data traffic and whether AP i is selected to assist MU j in offloading data traffic, respectively. If AP i is selected to perform the offload task, x_i1 is ═ 1; otherwise, x _i0. Similarly, if MU j is connected to AP i, a_ij1 is ═ 1; otherwise, a_ij＝0。

Then, the revenue function for the MNO can be found as follows:

wherein the content of the first and second substances,

is the total revenue and winner of the data offloadThe difference between the total payments, U (-) is the MNO's revenue function, as shown in equation (1), x_iTo indicate a variable, x_i∈{0，1}，a_ijTo indicate a variable, a_ij∈{0，1}，s_jIs the flow demand of MU j, epsilon_ijIs the communication cost of MU j.

From the MNO's perspective, it aims to obtain as much revenue as possible by reducing payments. The overall problem of maximizing MNO revenue is as follows:

the constraints in the above formula have the following meanings:

the constraint (6) ensures that the spectrum bandwidth leased by the AP to the MU matches the maximum available spectrum resource blocks.

Constraint (7) ensures that MU transmission delay does not exceed its maximum delay threshold.

Constraint (8) indicates that only winners can be assigned to assist MU data offloading.

The constraint (9) guarantees the integer nature of the binary variable.

Solving the problem of operations with integer constraints and variable fractions is difficult to handle. The objective function (5) is a mixed integer nonlinear programming problem (MINLP), which is typically an NP-hard problem. To make the problem easier to deal with, embodiments of the present invention first analyze the objective function. In order to obtain an optimal solution to the AP selection problem in the above formula, the existing branch-and-bound (BNB) method is widely used. However, the time complexity of the BNB approach always grows exponentially when there are a large number of APs. Therefore, the embodiment of the present invention proposes the following method for solving the problem:

the embodiment of the invention solves the optimization problem by using a heuristic algorithm and reduces the calculation complexity. A simple way to solve the above optimization problem is to select the AP that adds the most revenue to the MNO. Thus, embodiments of the present invention first introduce a Greedy Winner Selection algorithm (GWSM).

First, the present invention introduces some definitions. Then, the AP selection rule proposed in the GWSM is explained in detail.

Definition 1 (contribution value of AP):

is defined as the revenue increment of the MNO after selecting AP i to assist data offloading, and is calculated as follows:

wherein u is_iIs the contribution value of AP i, T_iRepresents an optimal set of MUs served by AP i that maximizes the amount of data offloaded by AP i in each slot. s_jAnd d is the price of the MNO unit mobile data, which is the flow demand of the MU j.

Definition 2 (total bid for AP):

is defined as the sum of communication costs of the MUs served by the AP i under the bid of its unit leased spectrum resource block, and is calculated as follows:

wherein, b_iTotal bid, T, for AP i_iRepresents the optimal set, ε, of MUs served by AP i_ijIndicating the communication cost of MU j and AP i.

Definition 3 (winner set contribution value): by using

To represent a set of winning APs, a set of winners

Is defined as

The sum of the contributions of all APs in (a) is calculated as follows:

definition 4 (marginal contribution of AP): by using

To indicate a set of winning APs,

is defined as the increment of the winner-set contribution value after it is selected as the winning AP, which is calculated as follows:

when MN0 selects a group of APs to participate in the data offloading process, and the goal is to maximize the benefit of the MNO, according to the above definition, it can be expressed as:

wherein

Indicating a set of MUs serviced by the winning AP.

To effectively solve the optimization problem, the embodiments of the present invention design a greedy algorithm to select the most valuable APs. The APs are ranked according to their marginal contribution value minus the total bid. The winning AP may be ranked as:

where θ (n) represents the nth AP index in the ordering. Because of the set of winners in each while loop

Are updated and thus the present invention is used in equation (17)

To simplify the presentation

The invention obtains the index of the AP by calculating the largest AP in the difference value of the marginal contribution value of all the APs minus the total bid. The winning AP is then selected based on its marginal contribution value minus the ranking of the total bids until the total bid of the selected AP is greater than or equal to its marginal contribution.

After selecting the winning AP, MN0 should determine payment for them. Due to the nature of selfishness and rationality, each AP may cheat higher rewards by announcing unrealistic bids. Therefore, the invention proposes a novel payment scheme based on the standard Vickrey-Clarke-Groves (VCG) mechanism. The payment scheme can encourage selfish and rational APs to participate in the data offloading process and ensure the reasonability and authenticity of individuals.

In the standard VCG scheme, each winner will pay the "opportunity cost" of the other participants. The "opportunity cost" of bidder i is defined as: the sum of the bids of all bidding winners is subtracted from the sum of the bids of all other actual bidders without participation of bidder i. According to definition 1 and definition 2, u is known_iRepresents the increase in MNO revenue after selection of AP i, b_iRepresenting the sum of the communication costs incurred by AP i to assist data offloading.

To express in a mathematical form, will

Defined as the optimal solution without considering the contribution value of AP i, can be formulated as:

and use

Representing an optimal solution without regard to the participation of AP i in the data offloading process. The reward paid to AP i may then be expressed as follows:

order to

Representing the real value consumed by AP i in participating in the data offloading process. Thus, each one

Can obtainExpressed as:

μ_i＝p_i-γ_i (20)

in addition, will pay

The reward of (2) is defined as 0.

The method in the above example is described below with reference to specific experimental data:

in experiments, embodiments of the present invention consider randomly arranging several transmission distances of [50, 100 ] within the coverage of the BS]And m is the AP. Bids of unit frequency spectrum resource block are uniformly distributed in [0.2, 0.5 ]]Monetary units (e.g., dollars or rmb)/(MHzsec). The maximum delay of each MU is uniformly distributed in [0.1, 1 ]]In sec. The value of the MU number is in the range of [0, 100 ]]The value range of the AP number is [0, 30 ]]And maximum available spectrum resource block B of AP^maxHas a value range of [0, 80 ]]. The path loss exponent is 2.5. The embodiment of the invention compares the performance of the proposed GWSM (s.1) with a random winner selection method (s.2) which selects a set of APs to randomly participate in the data offloading process. For fairness, the total number of selected APs in the random winner selection method is the same as the method proposed by the present invention, which uses the benefit (or benefit) of an MNO and the traffic load of the MNO as evaluation indexes. Here, the profit of the MNO is defined as formula (4), and the traffic load of the MNO represents the total data amount transmitted by the BS.

Fig. 3 is a schematic diagram of the benefit of the MNO under different numbers of APs according to an embodiment of the present invention, where fig. 3 shows a variation of the benefit of the MNO with an increase in the number of APs in the GWSM (s.1) and the random winner selection method (s.2) when the number of MUs is set to | N | > 100 and the available spectrum resource block of the AP is 20 MHz. As the number of APs increases, more APs may help MNOs offload traffic, and thus the benefit of MNOs will continue to increase. It can be found that GWSM performs better than the random winner selection method when the number of APs increases, especially when the number of APs is larger.

Fig. 4 is a schematic view of traffic load of an MNO under different numbers of APs according to an embodiment of the present invention, where fig. 4 shows a variation of traffic load of the MNO with an increase in the number of APs in a GWSM (s.1) and a random winner selection method (s.2) when the number of MUs is set to | N | > 100 and an available spectrum resource block of an AP is 20 MHz. As the number of APs increases, more APs may help MNOs offload traffic, and thus the traffic load of MNOs is constantly decreasing. It can be seen that as the number of APs increases, the traffic load of MNOs in the GWSM decreases significantly, indicating that the GWSM performs best, compared to the random winner selection approach.

Fig. 5 is a schematic diagram of the benefit of the MNO under different MU numbers according to an embodiment of the present invention, where fig. 5 shows a variation of the benefit of the MNO with an increase in the number of MUs in the GWSM (s.1) and the random winner selection method (s.2) when the number of APs is set to | K | > 30 and the available spectrum resource block of the AP is 20 MHz. As the number of MUs increases, the total traffic that the MUs will request increases, which means that the traffic that the AP can offload also increases. Accordingly, the benefit of MNO will increase continuously. Similarly, it can be found that as the number of MUs increases, the GWSM still performs better than the random winner selection method, especially when the number of APs is larger.

Fig. 6 is a schematic view of the traffic load of the MNO under different numbers of MUs according to the embodiment of the present invention, where fig. 6 shows a change situation of the traffic load of the MNO with an increase of the number of MUs in the GWSM (s.1) and the random winner selection method (s.2) when the number of APs is set to | K | > 30 and the available spectrum resource block of the AP is 20 MHz. As the number of MUs increases, the MUs demand more traffic and therefore the traffic load of the MNO will increase continuously. It can be seen that the traffic load of MNOs in GWSM increases slowest as the number of MUs increases, compared to the random winner selection method, indicating that GWSM performs best.

The embodiment of the invention models the optimization problem into a nonlinear integer programming problem by considering delay constraints of different applications, and introduces a low-complexity algorithm: a Greedy Winner Selection algorithm (GWSM) to solve the optimization problem.

The embodiment of the invention provides a novel payment rule based on a standard Vickrey-Clarke-Groves (VCG) mechanism, and the rule can ensure the individual reasonability and authenticity of GWSM.

Simulation experiments show that the GWSM provided by the invention has better performance than a random winner selection algorithm in the aspects of MNO benefit and traffic load under different scenes.

Based on any of the above embodiments, fig. 7 is a schematic diagram of a data unloading device based on a greedy algorithm and a reverse auction, which is provided by the embodiment of the present invention, and as shown in fig. 7, the embodiment of the present invention provides a data unloading device based on a greedy algorithm and a reverse auction, which includes an obtaining module 701, a model building module 702, and an allocating module 703, where:

the obtaining module 701 is configured to obtain a maximum tolerable delay of an application program in each MU of the mobile user; the model construction module 702 is configured to construct a reverse auction optimization algorithm model based on the maximum latency, where a goal of the reverse auction optimization algorithm model is to maximize the revenue of the operator MNO, and a constraint of the reverse auction optimization algorithm model includes ensuring that the transmission delay of each MU does not exceed a corresponding maximum delay threshold; the assignment module 703 is configured to select a winning WiFi access point to assign to the MU using a greedy winner selection algorithm.

The data unloading device based on the greedy algorithm and the reverse auction converts the Wi-Fi unloading problem into the incentive problem based on the reverse auction from the commercial perspective, aims to maximize the benefit of MNO, and provides a new incentive mechanism based on delay constraint and reverse bidding to stimulate a Wi-Fi access point to participate in the data unloading process.

Fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present invention, and as shown in fig. 8, the electronic device includes: a processor (processor)801, a communication Interface (Communications Interface)802, a memory (memory)803 and a communication bus 804, wherein the processor 801, the communication Interface 802 and the memory 803 complete communication with each other through the communication bus 804. The processor 801 and the memory 802 communicate with each other via a bus 803. The processor 801 may call logic instructions in the memory 803 to perform the following method:

In addition, the logic instructions in the memory may be implemented in the form of software functional units and may be stored in a computer readable storage medium when sold or used as a stand-alone product. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.

Further, embodiments of the present invention provide a computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program comprising program instructions which, when executed by a computer, enable the computer to perform the steps of the above-described method embodiments, for example, including:

Further, an embodiment of the present invention provides a non-transitory computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the computer program implements the steps in the above method embodiments, for example, including:

The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.

Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.

Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims

1. A data unloading method based on a greedy algorithm and a reverse auction is characterized by comprising the following steps:

constructing a reverse auction optimization algorithm model based on the maximum time delay, wherein the reverse auction optimization algorithm model aims to maximize the profit of an operator MNO, and the constraint conditions of the reverse auction optimization algorithm model comprise that the transmission delay of each MU is not more than the corresponding maximum delay threshold; in the reverse auction optimization algorithm model, the MNO acts as an auctioneer to purchase WiFi access point capacity; the WiFi access point acts as a vendor that provides MNO-available spectrum resources to serve offload traffic; each WiFi access point reports the available capacity of the WiFi access point and bids for the MNO, and the MNO selects the WiFi access points to participate in the data unloading process according to the collected available resources and bids of all the WiFi access points and pays corresponding returns;

determining a winning WiFi access point using a greedy winner selection algorithm for an MU to offload data to the winning WiFi access point;

the determining a winning WiFi access point using a greedy winner selection algorithm specifically includes:

selecting a winning WiFi access point based on the difference rankings until a total bid for the selected WiFi access point is greater than or equal to its marginal contribution, determining the winning WiFi access point.

2. The greedy algorithm and reverse auction based data offloading method of claim 1, wherein before constructing the reverse auction optimization algorithm model based on the maximum time delay, further comprising:

and acquiring the resources and the bids reported by each WiFi access point.

3. The greedy algorithm and reverse auction based data offloading method of claim 1, wherein before constructing the reverse auction optimization algorithm model based on the maximum time delay, further comprising:

and acquiring the available WiFi access points reported by each MU.

4. The greedy algorithm and reverse auction based data offloading method of claim 1, wherein constraints of the reverse auction optimization algorithm model further comprise ensuring that a spectrum bandwidth leased by an AP to an MU matches a maximum available spectrum resource block.

5. The greedy and reverse auction based data offloading method of claim 1, wherein the constraints of the reverse auction optimization algorithm model further comprise that only winners can be allocated to assist MU data offloading.

6. The greedy and reverse auction based data offloading method of claim 1, wherein after selecting a winning WiFi access point, the MNO determines a reward paid for each WiFi access point using standard VCG mechanisms.

7. A data offloading device based on a greedy algorithm and a reverse auction, comprising:

a model construction module, configured to construct a reverse auction optimization algorithm model based on the maximum time delay, where a goal of the reverse auction optimization algorithm model is to maximize an income of an operator MNO, and a constraint condition of the reverse auction optimization algorithm model includes ensuring that a transmission delay of each MU does not exceed a corresponding maximum delay threshold; in the reverse auction optimization algorithm model, the MNO acts as an auctioneer to purchase WiFi access point capacity; the WiFi access point acts as a vendor that provides MNO-available spectrum resources to serve offload traffic; each WiFi access point reports the available capacity of the WiFi access point and bids for the MNO, and the MNO selects the WiFi access points to participate in the data unloading process according to the collected available resources and bids of all the WiFi access points and pays corresponding returns;

an allocation module to determine a winning WiFi access point using a greedy winner selection algorithm for an MU to offload data to the winning WiFi access point;

8. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor when executing the computer program performs the steps of the greedy algorithm and reverse auction based data offloading method of any of claims 1-6.

9. A non-transitory computer readable storage medium having stored thereon a computer program for implementing the steps of the greedy algorithm and reverse auction based data offloading method according to any of claims 1 to 6 when the computer program is executed by a processor.