CN105682211A - User access and power joint scheduling method based on packet switching in cellular traffic unloading network - Google Patents

Abstract

The invention relates to a user access and power joint scheduling method based on packet switching in a cellular traffic unloading network. The user access and power joint scheduling method comprises the following steps that: (1), to enable more users to be accessed to an AP and enable the transmitting power of the users to be low as much as possible, a benefit function is given, such that whether a current network is good or bad can be judged; (2), because the benefit function is only related to the access conditions of the users, the optimal system benefit can be determined only in need of searching the optimal user access; and (3), the access selection of the users can become difficult along with increasing of the number of the users; a user packet switching method based on a simulated annealing algorithm is adopted; accesses of the users are continuously replaced; a solution for enabling a target function to become good is accepted; simultaneously, a poor solution is accepted at a certain probability; furthermore, the poor solution acceptation probability is continuously reduced; and finally, a near-optimal solution is obtained through algorithm convergence. According to the invention, the optimal user access can also be found rapidly and effectively while the efficiency of the system is increased; and simultaneously, the power distribution of the users is determined.

Description

Based on user's access of packet switching and power combined scheduling method in a kind of honeycomb flow offloading network

Technical field

The present invention relates to cellular network field, especially a kind of user's access power combined scheduling method based on packet switching.

Background technology

In recent years, along with the development of mobile equipment, required mobile data traffic also constantly increases. Therefore, operators must seek better method and meet consumers' demand. The flow of user is unloaded on base station will be and a kind of compares the method having prospect. The benefit that the shunting of this kind of data brings mainly contains two aspects. First, from the angle of user, compared by these little base stations expense of spending of service beat base station much smaller. Meanwhile, owing to these little base stations are closer from user, so the power consumed when user communicates is also smaller. On the other hand, from the angle of operator, the flow of certain customers is unloaded on little base station and can effectively alleviate the congested of flow; It also avoid simultaneously and dispose more expensive large-scale base station.

Summary of the invention

Interference mutually is there is between the user of same AP owing to accessing in order to overcome in prior art, the transmitted power between user is caused to be coupled, therefore it is required that going out optimum user's access is compare difficult deficiency with power division, the present invention provides in a kind of honeycomb flow offloading network the user's access power combined scheduling method based on packet switching, preferably user's access is found based on simulated annealing user access method, each AP will share the task of leading subscriber, optimum user's access can also be found fast and effectively to determine the power division of user in the efficiency improving system simultaneously simultaneously.

The technical solution adopted for the present invention to solve the technical problems is:

Based on user's access of packet switching and power combined scheduling method in a kind of honeycomb flow offloading network, it is characterised in that: described combined scheduling method comprises the steps:

(1) in the network of communication of reality, it is assumed that there is I mobile subscriber, the set being made up of them isWherein i represents user i;Having K AP, they constitute setWherein k represents APk; There is a base station, for the restriction of equipment own hardware, user by selecting access a certain AP or base station to communicate, thus can only obtain the throughput capacity desired by them simultaneouslyWhen user i accesses APk, at given transmitted power p_ikWhen, the throughput capacity that user i obtains isWhen user's i access base station, at given transmitted power p_iBWhen, the throughput capacity of acquisition is $R_{iB}={\mathrm{\α}}_{iB}{W}_B{\log }_2(1+\frac{p_{iB}{g}_{iB}}{n_B}),$

Wherein:

a_ikRepresent the index of user i with or without access APk, a_ik=1 expression user i is selected access, on the contrary a_ik=0 expression user i is not chosen to access APk;

a_iBRepresent the index of user i with or without access base station, a_iB=1 expression user i is selected access base station; Otherwise a_iB=0 expression user i is not by selection access base station;

W_kRepresent the bandwidth on APk channel;

W_B: represent the bandwidth on BTS channel;

n_k: represent the Background Noise Power on APk channel;

n_B: represent the Background Noise Power on BTS channel

g_ik: the channel gain representing user i to APk;

g_iB: represent the channel gain of user i to base station;

p_ik: the transmitted power representing user i to APk;

p_iB: represent the transmitted power of user i to base station;

(2) in the network scene of reality, to each user unified definition benefit expression formula:Wherein, π_BWhen representing user's access base station, base station is to the expense of his receipts; π_kRepresenting when user accesses APk, the expense that it is collected by APk, for the benefit function of user, carries out maximumization system benefit to this network of communicationFor the gross earnings that the user of all access APk produces, wherein,For all users set that each APk accesses,The gross earnings produced for not taking over all users of what AP, from benefit function it will be seen that it only withRelevant, onceGiven, benefit function value also can be tried to achieve;

(3) for the benefit function described in (2), user i accesses the power p that APk launches_ikByRepresent, and when user throughput gives timing, derive by the expression formula of user throughput:

MeetTherefore the restricted condition C of user's access is obtained₁And C₂:

C₁:

C₂:

According to described restricted condition C₁And C₂, combining in (2) objective function given simultaneously, select the benefit of the whole system of user mode access maximumization, step is as follows:

Step 2.1: initialization definitions user gathers variableRepresent the user not taking over what AP, definitionRepresent the gross earnings produced on the user of access APk,Represent the income produced on the user of access base station,Representing current gross earnings, CBV is current optimum income, and CBS is current optimum solution

Step 2.2: base station initialize temperature value t, the iteration number of times L of the condition T that outer circulation terminates and internal recycle, and initialize variable internal recycle counting variable n=1, outer circulation counting variable acct=0;

Step 2.3: base station random choose two AP, and represent with APk and APk ';

Step 2.4:APk gathers from the user accessing oneselfPicking out a user i, APk ' gathers from the user accessing oneselfIn pick out a user j;

Step 2.5:APk and APk ' exchanges user i and the user j that they select, and APk upgrades correspondenceCorresponding with APk'

Step 2.6: inspectionWithWhether all meet restricted condition C₁,C₂If not meeting, then arrange and accept indexed variable accept=0, and jump to step 2.13, otherwise continue to perform step 2.7;

It is poor that step 2.7:APk calculates the income after user's exchangeAs k=0,

It is poor that step 2.8:APk' calculates the income after user's exchange

Step 2.9: obtain total income difference Δ=Δ_k+Δ_k′;

Step 2.11: if Δ > 0, arrange and accept indexed variable accept=1, and jump to step 2.13; Otherwise generate one and obey 0～1 equally distributed randomized number β, and continue to perform step 2.12;

Step 2.12: compareWith the size of β, ifArrange and accept indexed variable accept=1; Otherwise, arrange and accept indexed variable accept=0;

Step 2.13: if accepting indexed variable accept=1, performs step 2.14; If accepting indexed variable accept=0, jumping to step 2.17 and continuing to perform;

Step 2.14:APk upgradesAPk ' renewalIf during k=0, then base station upgrades

Step 2.15: base station upgrades CV=CV+ Δ, and reset outer circulation counting variable acct=0;

Step 2.16: base station judges condition C V > whether CBV set up, if setting up, base station upgradesJump to step 2.19;

User is gathered by step 2.17:APkReturn to the state before not exchanging:User is gathered by APk 'Return to the state before not exchanging:

Step 2.18: base station upgrades outer circulation counting variable acct=acct+1;

Step 2.19: base station upgrades internal recycle counting variable n=n+1;

Step 2.20: if internal recycle counting variable n < L, then jump to step 2.3;

Step 2.21: reset internal recycle counting variable n=1;

Step 2.22: upgrade temperature parameter t=t* β;

Step 2.23: if outer circulation counting variable acct > T, whole algorithm terminates, and exports optimum solution CBS, otherwise jump to step 2.3 and continue to perform.

The design technology of the present invention is: customer flow is unloaded to AP and a kind of can alleviate the method that base station pressure improves system benefit and efficiency simultaneously, because each AP will share the task of leading subscriber. But there is interference mutually between the user of same AP owing to accessing, when given customer need, power between each user is coupled. Therefore it is required that the user's access that must meet maximal benefit of system is compared difficult with user power distribution. For the user power of coupling, due to when given user accesses, the power of user can be in the hope of. Therefore we devise a kind of user based on simulated annealing and access selection method: first divide to multiple AP by the task of the leading subscriber undertaken of base station, manage the user getting involved them by AP. Then collect the information of all AP by base station, thus choose good user mode access and select as the access of active user.

The useful effect of the present invention is: each AP will share the task of leading subscriber, optimum user's access can also be found fast and effectively to determine the power division of user in the efficiency improving system simultaneously simultaneously.

Accompanying drawing explanation

Fig. 1 utilizes user to combine access with power division to optimize the schematic diagram of mobile load shedding in cellular network.

Embodiment

Below in conjunction with accompanying drawing, the present invention is described in further detail.

With reference to Fig. 1, based on user's access of packet switching and power combined scheduling method in a kind of honeycomb flow offloading network, user can be undertaken communicating by AP or BS thus meet their throughput demand separately. The user that each Self management of each AP has accessed simultaneously, obtains the transmission of data compared to all users from base station, and owing to AP has shared the task of leading subscriber, this kind of mode will improve overall efficiency and the efficiency of system. Accessing simultaneously and can there is interference between the user of same AP, as AP same compared with multiple access, the user power under this AP will greatly improve, it is possible to exceedes the emission maximum power that user is given.Therefore the access select permeability of user must be paid attention to. But the access selection of user can become very complicated along with increasing of number of users. The user based on simulated annealing that we design for this problem accesses and selects will effectively to calculate good user mode access and corresponding transmitted power to power division method.

The described user based on packet switching access and power combined scheduling method, comprise the steps:

(1) in the network of communication of reality, it is assumed that there is I mobile subscriber, the set being made up of them isWherein i represents user i; Having K AP, they constitute setWherein k represents APk; There is a base station, for the restriction of equipment own hardware, user by selecting access a certain AP or base station to communicate, thus can only obtain the throughput capacity desired by them simultaneouslyWhen user i accesses APk, at given transmitted power p_ikWhen, the throughput capacity that user i obtains isWhen user's i access base station, at given transmitted power p_iBWhen, the throughput capacity of acquisition is $R_{iB}=a_{iB}{W}_B{\log }_2(1+\frac{p_{iB}{g}_{iB}}{n_B}),$

Wherein:

a_ik: represent the index of user i with or without access APk, a_ik=1 expression user i is selected access, on the contrary a_ik=0 expression user i is not chosen to access APk;

a_iB: represent the index of user i with or without access base station, a_iB=1 expression user i is selected access base station; Otherwise a_iB=0 expression user i is not by selection access base station;

W_k: represent the bandwidth on APk channel;

W_B: represent the bandwidth on BTS channel;

n_k: represent the Background Noise Power on APk channel;

n_B: represent the Background Noise Power on BTS channel

g_ik: the channel gain representing user i to APk;

g_iB: represent the channel gain of user i to base station;

p_ik: the transmitted power representing user i to APk;

p_iB: represent the transmitted power of user i to base station;

(2) in the network scene of reality, to each user unified definition benefit expression formula:Wherein, π_BWhen representing user's access base station, base station is to the expense of his receipts; π_kRepresenting when user accesses APk, the expense that it is collected by APk, for the benefit function of user, carries out maximumization system benefit to this network of communication For the gross earnings that the user of all access APk produces, wherein,For all users set that each APk accesses,The gross earnings produced for not taking over all users of what AP, from benefit function it will be seen that it only withRelevant, onceGiven, benefit function value also can be tried to achieve;

(3) for the benefit function described in (2), user i accesses the power p that APk launches_ikByRepresent, and when user throughput gives timing, derive by the expression formula of user throughput:

MeetTherefore the restricted condition C of user's access is obtained₁And C₂:

C₁:

C₂:

According to described restricted condition C₁And C₂, combining in (2) objective function given simultaneously, select the benefit of the whole system of user mode access maximumization, step is as follows:

Step 2.1: initialization definitions user gathers variableRepresent the user not taking over what AP, definitionRepresent the gross earnings produced on the user of access APk,Represent the income produced on the user of access base station,Representing current gross earnings, CBV is current optimum income, and CBS is current optimum solution

Step 2.2: base station initialize temperature value t, the iteration number of times L of the condition T that outer circulation terminates and internal recycle, and initialize variable internal recycle counting variable n=1, outer circulation counting variable acct=0;

Step 2.3: base station random choose two AP, and represent with APk and APk ';

Step 2.4:APk gathers from the user accessing oneselfPicking out a user i, APk ' gathers from the user accessing oneselfIn pick out a user j;

Step 2.5:APk and APk ' exchanges user i and the user j that they select, and APk upgrades correspondenceWith APk ' correspondence

Step 2.6: inspectionWithWhether all meet restricted condition C₁,C₂If not meeting, then arrange and accept indexed variable accept=0, and jump to step 2.13, otherwise continue to perform step 2.7;

It is poor that step 2.7:APk calculates the income after user's exchangeAs k=0,

It is poor that step 2.8:APk' calculates the income after user's exchange

Step 2.9: obtain total income difference Δ=Δ_k+Δ_k′;

Step 2.11: if Δ > 0, arrange and accept indexed variable accept=1, and jump to step 2.13; Otherwise generate one and obey 0～1 equally distributed randomized number β, and continue to perform step 2.12;

Step 2.12: compareWith the size of β, ifArrange and accept indexed variable accept=1; Otherwise, arrange and accept indexed variable accept=0;

Step 2.13: if accepting indexed variable accept=1, performs step 2.14; If accepting indexed variable accept=0, jumping to step 2.17 and continuing to perform;

Step 2.14:APk upgradesAPk' upgradesIf during k=0, then base station upgrades

Step 2.15: base station upgrades CV=CV+ Δ, and reset outer circulation counting variable acct=0;

Step 2.16: base station judges condition C V > whether CBV set up, if setting up, base station upgradesJump to step 2.19;

User is gathered by step 2.17:APkReturn to the state before not exchanging:User is gathered by APk 'Return to the state before not exchanging:

Step 2.18: base station upgrades outer circulation counting variable acct=acct+1;

Step 2.19: base station upgrades internal recycle counting variable n=n+1;

Step 2.20: if internal recycle counting variable n < L, then jump to step 2.3;

Step 2.21: reset internal recycle counting variable n=1;

Step 2.22: upgrade temperature parameter t=t* β

Step 2.23: if outer circulation counting variable acct > T, whole algorithm terminates, and exports optimum solution CBS, otherwise jump to step 2.3 and continue to perform.

The present embodiment is conceived to current social hotspots demand, and the characteristic advantage of the social network of ingenious combination, fully excavates the potentiality of little base station, allow them also undertake the task of part of service user. Compared to only allowing base station serve user, by the flow of user suitably distributes little base station, that the benefit of system will be made to obtain is maximum, improves the efficiency of system simultaneously. Our work can make network operator obtain more interests, serve more user, also make user reach the object obtaining and saving corresponding discharge rate while data resource, effectively improve the utilization ratio of data resource, finally make network operator and the user can doulbe-sides' victory.

Claims (1)

1. based on user's access of packet switching and power combined scheduling method in a honeycomb flow offloading network, it is characterised in that: described combined scheduling method comprises the steps:

(1) in the network of communication of reality, it is assumed that there is I mobile subscriber, the set being made up of them isWherein i represents user i; Having K AP, they constitute setWherein k represents APk; There is a base station, for the restriction of equipment own hardware, user by selecting access a certain AP or base station to communicate, thus can only obtain the throughput capacity desired by them simultaneouslyWhen user i accesses APk, at given transmitted power p_ikWhen, the throughput capacity that user i obtains isWhen user's i access base station, at given transmitted power p_iBWhen, the throughput capacity of acquisition isWherein:

a_ik: represent the index of user i with or without access APk, a_ik=1 expression user i is selected access, on the contrary a_ik=0 expression user i is not chosen to access APk;

a_iB: represent the index of user i with or without access base station, a_iB=1 expression user i is selected access base station; Otherwise a_iB=0 expression user i is not by selection access base station;

W_k: represent the bandwidth on APk channel;

W_B: represent the bandwidth on BTS channel;

n_k: represent the Background Noise Power on APk channel;

n_B: represent the Background Noise Power on BTS channel

g_ik: the channel gain representing user i to APk;

g_iB: represent the channel gain of user i to base station;

p_ik: the transmitted power representing user i to APk;

p_iB: represent the transmitted power of user i to base station;

(2) in the network scene of reality, to each user unified definition benefit expression formula:Wherein, π_BWhen representing user's access base station, base station is to the expense of his receipts; π_kRepresenting when user accesses APk, the expense that it is collected by APk, for the benefit function of user, carries out maximumization system benefit to this network of communication For the gross earnings that the user of all access APk produces, wherein,For all users set that each APk accesses,The gross earnings produced for not taking over all users of what AP, from benefit function it will be seen that it only withRelevant, onceGiven, benefit function value also can be tried to achieve;

(3) for the benefit function described in (2), user i accesses the power p that APk launches_ikByRepresent, and when user throughput gives timing, derive by the expression formula of user throughput:

MeetTherefore the restricted condition C of user's access is obtained₁And C₂:

C1:

C2:

According to described restricted condition C₁And C₂, combining in (2) objective function given simultaneously, select the benefit of the whole system of user mode access maximumization, step is as follows:

Step 2.1: initialization definitions user gathers variableRepresent the user not taking over what AP, definitionRepresent the gross earnings produced on the user of access APk,Represent the income produced on the user of access base station,Representing current gross earnings, CBV is current optimum income, and CBS is current optimum solution

Step 2.2: base station initialize temperature value t, the iteration number of times L of the condition T that outer circulation terminates and internal recycle, and initialize variable internal recycle counting variable n=1, outer circulation counting variable acct=0;

Step 2.3: base station random choose two AP, and represent with APk and APk ';

Step 2.4:APk gathers from the user accessing oneselfPicking out a user i, APk ' gathers from the user accessing oneselfIn pick out a user j;

Step 2.5:APk and APk ' exchanges user i and the user j that they select, and APk upgrades correspondenceWith APk ' correspondence

Step 2.6: inspectionWithWhether all meet restricted condition C₁, C₂If not meeting, then arrange and accept indexed variable accept=0, and jump to step 2.13, otherwise continue to perform step 2.7;

It is poor that step 2.7:APk calculates the income after user's exchangeAs k=0,

It is poor that step 2.8:APk ' calculates the income after user's exchange

Step 2.9: obtain total income difference Δ=Δ_k+A_k′;

Step 2.11: if Δ > 0, arrange and accept indexed variable accept=1, and jump to step 2.13; Otherwise generate one and obey 0～1 equally distributed randomized number β, and continue to perform step 2.12;

Step 2.12: compareWith the size of β, ifArrange and accept indexed variable accept=1; Otherwise, arrange and accept indexed variable accept=0;

Step 2.13: if accepting indexed variable accept=1, performs step 2.14;If accepting indexed variable accept=0, jumping to step 2.17 and continuing to perform;

Step 2.14:APk upgradesAPk ' renewalIf during k=0, then base station upgrades

Step 2.15: base station upgrades CV=CV+ Δ, and reset outer circulation counting variable acct=0;

Step 2.16: base station judges whether condition C V > CBV sets up, if setting up, base station upgradesJump to step 2.19;

User is gathered by step 2.17:APkReturn to the state before not exchanging:User is gathered by APk 'Return to the state before not exchanging:

Step 2.18: base station upgrades outer circulation counting variable acct=acct+1;

Step 2.19: base station upgrades internal recycle counting variable n=n+1;

Step 2.20: if internal recycle counting variable n < L, then jump to step 2.3;

Step 2.21: reset internal recycle counting variable n=1;

Step 2.22: upgrade temperature parameter t=t* β;

Step 2.23: if outer circulation counting variable acct > T, whole algorithm terminates, and exports optimum solution CBS, otherwise jump to step 2.3 and continue to perform.