CN104284433B - Heterogeneous network energy per bit based on rate limit minimizes resource allocation methods - Google Patents
Heterogeneous network energy per bit based on rate limit minimizes resource allocation methods Download PDFInfo
- Publication number
- CN104284433B CN104284433B CN201410536581.0A CN201410536581A CN104284433B CN 104284433 B CN104284433 B CN 104284433B CN 201410536581 A CN201410536581 A CN 201410536581A CN 104284433 B CN104284433 B CN 104284433B
- Authority
- CN
- China
- Prior art keywords
- gen
- bee
- heterogeneous network
- nectar source
- source
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of heterogeneous network energy per bit minimum resource allocation methods based on rate limit, the following steps are included: step 1, intelligent Centralized Controller collects available bandwidth resources in heterogeneous network, and bandwidth resources are the total flow bandwidth of radio frequency resources in heterogeneous network;Step 2, intelligent Centralized Controller collects the resource request for utilization of user equipment;Step 3, intelligent Centralized Controller is allocated the frequency resource in heterogeneous network using artificial bee colony algorithm.Resource allocation methods provided by the invention efficiently, reliably, can significantly improve the energy utilization efficiency in heterogeneous network, and reduce its energy consumption.
Description
Technical field
The invention belongs to technical field of the computer network, the every bit energy of especially a kind of heterogeneous network based on rate limit
Amount minimizes resource allocation methods.
Background technique
The purpose of green wireless communication is in a wireless communication system using power-save operation, to be directed in cellular network increasingly
The energy consumption of growth.Today, global mobile phone user's quantity is close to 6,000,000,000, and wherein wireless device and equipment consume about total information
9% (being namely up to 6.1 hundred million kilowatt hours) of Technology Energy.Nearest investigation shows that the operation of cellular network takes around always
The 80% of energy, including base station, the energy of user equipment and core network consumption.In addition, the quantity of mobile subscriber equipment and every
User capacity demand is all in sustainable growth.Therefore, the research of next generation mobile networks design has focused on green wireless communication,
In this, high energy efficiency radio resource allocation plays an important role.
Another major issue of next generation wireless network design is the fusion of heterogeneous wireless network, including as 3GPP-LTE
(third generation partner program-long term evolution) and WiMAX (worldwide interoperability for microwave accesses) utilize orthogonal frequency division multiple access skill like that
The WLAN and Cellular Networks of art.There are two types of different methods to handle heterogeneous wireless network, i.e. network selection and more ownership: net
Most suitable access net is chosen in network selection in all available selections, and belongs to more, accesses multiple wireless networks simultaneously and connects
Mouthful.Generally speaking, more ownership advantageously, utilize the diversity of network to use multiple interfaces because it permits user equipment.
More ownership functions allow each user equipment clothes required for obtaining it in all available Radio Access Networks
Business quality.It has the advantage that it is possible, firstly, to polymerize the available resources of different radio access network, to support high data speed
The application of rate.Second, it can support mobility, because at least one interface used can be kept during servicing offer
It is active.Third, the concepts that belong to balance the internetwork business load of different radio access more.Therefore, belong to access capability more
Heterogeneous network has the ability to solve the problems, such as to minimize energy ratio and transmitted bit optimization.
(network resource scheduling method and radio resource controller under heterogeneous network, Beijing University of Post & Telecommunication are open for patent 1
Number CN102143589A, application number CN201110076874.1, applying date 2011.03.29) it discloses under a kind of heterogeneous network
Network resource scheduling method and radio resource controller.This method multi-medium data suitable for heterogeneous network transmits, comprising: each
Mobile terminal measures every the first predetermined time and determines respectively desired terminal binding sublayer number, by its desired end
End binding sublayer number and its mobile terminal style report, and radio resource controller is every the second predetermined space according to mobile terminal
The information reported determines the forwarding sublayer information of network's coverage area, and sends net locating for the mobile terminal to mobile terminal
The forwarding sublayer information of network overlay area;Mobile terminal is according to its mobile terminal style and the forwarding sublayer information received come really
Terminal sublayer binding number is determined, to execute the decoding of multi-medium data according to identified terminal sublayer binding number and return
It puts, wherein forwarding sublayer information indicates to need to forward the related information of which data sub-layer with the network's coverage area.Patent 2
(a kind of heterogeneous network downlink resource allocation method, Beijing Jiaotong University, publication number CN102711262A, application number
CN201210228395.1, applying date 2012.07.02) disclose under macrocell and Femto cell hybrid network communication money
One of source control technical field heterogeneous network downlink resource allocation method.Including setting up user's set and available resources
Set of blocks calculates and forms User Priority list;Calculate the resource block quantity of user demand;It is selected from User Priority list
It selects the highest user of priority and the resource block for selecting channel quality best from available resources set of blocks distributes to the priority
Highest user, until the resource block for distributing to the user of the highest priority is equal to the money of the user demand of the highest priority
Source block quantity or available resources set of blocks are sky;It calculates and updates macrocell/Femto cell base station and use available resources
Transimission power when block is communicated with user in the available resource block.But above two method does not account in heterogeneous network
The problem of energy utilization, is not able to satisfy the growing power consumption requirements of heterogeneous network in this way.
Summary of the invention
For overcome the deficiencies in the prior art, the present invention provide it is a kind of efficiently, reliably based on the heterogeneous network of rate limit
Network energy per bit minimizes resource allocation methods, to significantly improve the energy utilization efficiency in heterogeneous network, and reduces its energy
Amount consumption.
A kind of heterogeneous network energy per bit minimum resource allocation methods based on rate limit, comprising the following steps:
Step 1, intelligent Centralized Controller collects available bandwidth resources in heterogeneous network, and bandwidth resources are in heterogeneous network
The total flow bandwidth of radio frequency resources, is denoted as YMHz, wherein [16,32] Y ∈;
Step 2, intelligent Centralized Controller collects the resource request for utilization of user equipment, including the time needed for user equipment
Minimum-rate needed for ratio, user equipment;
Step 3, intelligent Centralized Controller is allocated the frequency resource in heterogeneous network using artificial bee colony algorithm:
Step 3.1, the parameter of intelligent Centralized Controller initialization artificial bee colony algorithm;
Step 3.2, honeybee is divided into gathering honey bee by population's fitness size and follows bee, the corresponding original of every gathering honey bee
Nectar source;
Step 3.3, its fitness value is searched near green molasses source and calculated to every gathering honey bee, if its fitness value is less than original
Nectar source then replaces green molasses source;
Step 3.4, the nectar source that bee is small according to probability selection fitness value is followed, and is converted into and adopts honeybee producting honey, while in honey
Source is nearby searched for, and the lesser nectar source position of fitness value is recorded;
Step 3.5, judge whether searching times are greater than maximum search number, if more than then abandon generating in step 3.3
Nectar source, and a new nectar source is randomly generated in the range of solution;3.6 are gone to step if being less than or equal to;
Step 3.6, the smallest nectar source of fitness value and the corresponding fitness function value in the nectar source are recorded;
Step 3.7, step 3.2~3.6N is repeatedgSecondary, the smallest fitness function value is the every of heterogeneous network minimum
Bit energy value, NgIndicate the maximum number of iterations of artificial bee colony algorithm.
Compared with prior art, the present invention its remarkable advantage is: (1) heterogeneous network is based on artificial bee colony algorithm and carries out void
Quasi- resource allocation meets the requirement of heterogeneous network optimal resource allocation;(2) available frequency money in heterogeneous network has sufficiently been excavated
Source has ensured that heterogeneous network energy per bit minimizes;It (3) is to significantly improve heterogeneous network energy utilization efficiency, reduce isomery
Network energy consumption provides technical support.
The invention will be further described with reference to the accompanying drawings of the specification.
Detailed description of the invention
Fig. 1 is that the present invention is based on the processes that the heterogeneous network energy per bit of rate limit minimizes resource allocation methods
Figure;
Fig. 2 is heterogeneous network frequency resource allocation schematic diagram of the present invention;
Fig. 3 is that the present invention is based on the resource allocation methods flow charts of artificial bee colony algorithm.
Specific embodiment
In conjunction with Fig. 1, the present invention is based on the heterogeneous network energy per bits of rate limit to minimize resource allocation methods, including
Following steps:
Step 1, intelligent Centralized Controller collects available bandwidth resources in heterogeneous network, and bandwidth resources are in heterogeneous network
The total flow bandwidth of radio frequency resources, is denoted as YMHz, wherein [16,32] Y ∈.
In conjunction with Fig. 2, step 2, intelligent Centralized Controller collects the resource request for utilization of user equipment, including user equipment institute
The time scale that needs, minimum-rate needed for user equipment.
In conjunction with Fig. 3, step 3, intelligent Centralized Controller using artificial bee colony algorithm to the frequency resource in heterogeneous network into
Row distribution, detailed process is as follows:
Step 3.1, the parameter of intelligent Centralized Controller initialization artificial bee colony algorithm, comprising: honeybee sum Limit ∈
[100,150], bee numbers N is adoptedg∈ [500,600], maximum search number Limit ∈ [100,150] and artificial bee colony algorithm
Maximum number of iterations Ng∈ [500,600], and enable the number of iterations serial number gen=1;Total base station power consumptionM-th
The accessible data rate of user equipment k in access pointsWherein,
Wherein, wireless access access point quantity is denoted as M, heterogeneous network number of subcarriers is denoted as N, subcarrier bandwidth is denoted as W,
Number of user equipment is denoted as K, noise spectral density is denoted as σ2、αnkFor molecular group when user equipment k on heterogeneous network sub-carriers n,
pnkFor user equipment k average transmission power, g on subcarrier nnkFor on subcarrier n user equipment k channel gain,For base
It stands static power consumption, 1/ ξBSFor base station power amplifier efficiency, c be determine based on snr threshold can reach data rate,For access points output power,For in m-th of access points user equipment k channel income,For WLAN letter
Road noise variance, wherein m ∈ M, n ∈ N, k ∈ K;
The parameter of collection further include: minimum-rate needed for user equipment k in heterogeneous networkIt is true using formula (3)
The accessible maximum data rate r of user equipment k on subcarrier nnk:
Bee colony is initialized, N is randomly generated using formula (4)pThe initial solution of a artificial bee colony algorithm Indicate i-th
The time scale that user equipment k is assigned in m-th of access points of honeybee, wherein i ∈ [1, Np],It is that user is assigned to
The lower limit of time scale,It is the upper limit that user is assigned to time scale, the random number between s ∈ [0,1],Initial solution needs
Meet formula (5), (6) and (7),
Step 3.2, honeybee is divided into gathering honey bee by population's fitness size and follows bee, the corresponding original of every gathering honey bee
Nectar source, detailed process be,
The size that i-th honeybee fitness function value is calculated using formula (8), functional value is arranged from small to large, takes letter
N before numerical rankseSolution regard the green molasses source of the gen times circulation, wherein N aseValue be NpHalf, each green molasses source is corresponding
One gathering honey bee, remaining solution, which then corresponds to, follows bee position, whereinIndicate that i-th honeybee follows at gen times
Fitness function value when ring
Step 3.3, its fitness value is searched near green molasses source and calculated to every gathering honey bee, if its fitness value is less than original
Nectar source then replaces green molasses source, and detailed process is,
Step 3.3.1 is set searching times v (h, gen)=0, generates the h gathering honey bee at the gen times using formula (9)
The new nectar source of circulationWhereinIndicate the green molasses source that the h gathering honey bee recycles at the gen times,
The wherein random number of r ∈ [- 1,1], h ∈ { 1,2 ..., Ne},j∈{1,2,...,Ne, j ≠ h, wherein j gives birth at random
At;
Step 3.3.2 calculates the adaptation in the new nectar source of the h gathering honey bee in the gen times circulation using the method for step 3.2
Spend functional valueCompareWithSize;If Then replace green molasses source, enables searching times v (h, gen)=0;Otherwise, give up new nectar source, enable v (h, gen) ← v (h,
gen)+1。
Step 3.4, the nectar source that bee is small according to probability selection fitness value is followed, and is converted into and adopts honeybee producting honey, while in honey
Source is nearby searched for, and the lesser nectar source position of fitness value is recorded, and detailed process is,
Step 3.4.1 calculates h-th of probability for following bee to select nectar source in the gen times circulation using formula (10)
P(h,gen), and by P(h,gen)Compared with rand, if rand < P(h,gen), then bee is followed to be converted to gathering honey bee by h-th, and in h
The corresponding nectar source of a gathering honey bee is nearby searched for, the random number between rand ∈ (0,1),
Step 3.4.2 is determined in the gen times circulation using formula (11) by the h gathering honey bee for only following bee to convert
New nectar source,
The wherein random number of r ∈ [- 1,1], h ∈ { 1,2 ..., Ne},j∈{1,2,...,Ne, j ≠ h, wherein j gives birth at random
At;
Step 3.4.3 is calculated in the gen times circulation using the method for step 3.3Corresponding fitness function
ValueCompare fitness function valueNectar source (Xinmi City source or the green molasses generated with step 3.3
Source) fitness function value size;IfLess than the nectar source fitness function value that step 3.3 generates, then replace
The nectar source that step 3.3 generates, enables searching times v (h, gen)=0;Otherwise, give up the new nectar source for the gathering honey bee for following bee to convert,
Enable searching times v (h, gen) ← v (h, gen)+1.
Step 3.5, judge whether searching times are greater than maximum search number, if more than then abandon generating in step 3.3
Nectar source, and a new nectar source is randomly generated in the range of solution;3.6 are gone to step if being less than or equal to.
Step 3.6, the nectar source corresponding to minimum value in all fitness function values into step 3.5 of recording step 3.2, note
ForAnd the corresponding fitness function value in the nectar source
Step 3.7, gen ← gen+1 is enabled, step 3.2~3.6N is repeatedgIt is secondary, from recordMiddle selection is most
It is small to be worth corresponding nectar source, it is denoted as Corresponding fitness function valueAs every ratio of heterogeneous network minimum
Special energy value.
Embodiment one
Step 1, intelligent Centralized Controller collects available radio resource in heterogeneous network.The base stations in heterogeneous network position
In the center of cell, service radius 600m, 4 access points are symmetrically located at the 450m of base station, total stream of heterogeneous network
Amount bandwidth is 16MHz, is divided into 15kHz between total flow bandwidth sub-carriers.
Step 2, intelligent Centralized Controller collects the resource request for utilization of user equipment.User equipment in access points
Time scale is [2,4,3,3], and minimum-rate needed for user equipment is 3.5Mbps.Fig. 2 is heterogeneous network frequency of the invention
Resource allocation schematic diagram.
Step 3, intelligent Centralized Controller is allocated the frequency resource in heterogeneous network using artificial bee colony algorithm.
Firstly, the parameter of intelligent Centralized Controller initialization artificial bee colony algorithm, initializes NL=1, Np=10, Ne=5,
Limit=100, Ng=500, gen=1 is enabled, M, N, W, K, σ are initialized2、αnk、pnk、gnk、1/ξBS、c、 rnk, bee colony is initialized, N is randomly generatedpThe initial solution of a optimization problem
Then, honeybee is divided into gathering honey bee by population's fitness size and follows bee, calculate the size of fitness function value,
Functional value is arranged from small to large, takes the solution of functional value ranking the first half to regard nectar source as, and it is corresponded to gathering honey bee;After ranking
The solution of half, which then corresponds to, follows bee position.
Subsequently, nearby its fitness value is searched for and is calculated in nectar source to gathering honey bee, is computed its fitness value less than green molasses
Source replaces green molasses source, generates new nectar sourceAnd it calculatesEnable searching times v (h, gen)=0.
Subsequently, the nectar source that bee is small according to probability selection fitness value is followed, and is converted into and adopts honeybee producting honey, while in nectar source
Search nearby records the lesser nectar source position of fitness value, first calculates the probability for following bee selection nectar source and is converted into and adopts
Honeybee, then generate new nectar sourceIt calculatesIfThen replace
New nectar source
Record new nectar sourceFor optimal nectar sourceAnd the nectar source is correspondingEvery ratio
Special energy value is
Finally, enabling gen ← gen+1, repeat the above steps, the maximum number of iterations until reaching artificial bee colony algorithm, from
RecordThe corresponding nectar source of middle selection minimum value, is denoted as Corresponding fitness function value
The as energy per bit value of heterogeneous network minimum, exports optimal energy per bit value
Embodiment two
Step 1, intelligent Centralized Controller collects available radio resource in heterogeneous network.The base stations in heterogeneous network position
In the center of cell, service radius 600m, 4 access points are symmetrically located at the 450m of base station, total stream of heterogeneous network
Amount bandwidth is 16MHz, is divided into 15kHz between total flow bandwidth sub-carriers.
Step 2, intelligent Centralized Controller collects the resource request for utilization of user equipment.User equipment in access points
Time scale is [2,4,3,3], and minimum-rate needed for user equipment is 3.5Mbps.Fig. 2 is heterogeneous network frequency of the invention
Resource allocation schematic diagram.
Step 3, intelligent Centralized Controller is allocated the frequency resource in heterogeneous network using artificial bee colony algorithm.
Firstly, the parameter of intelligent Centralized Controller initialization artificial bee colony algorithm, initializes NL=1, Np=16, Ne=8,
Limit=150, Ng=600, gen=1 is enabled, M, N, W, K, σ are initialized2、αnk、pnk、gnk、1/ξBS、c、 rnk, bee colony is initialized, N is randomly generatedpThe initial solution of a optimization problem
Then, honeybee is divided into gathering honey bee by population's fitness size and follows bee, calculate the size of fitness function value,
Functional value is arranged from small to large, takes the solution of functional value ranking the first half to regard nectar source as, and it is corresponded to gathering honey bee;After ranking
The solution of half, which then corresponds to, follows bee position.
Subsequently, nearby its fitness value is searched for and is calculated in nectar source to gathering honey bee, is computed its fitness value and is more than or equal to
New nectar source is given up in green molasses sourceEnable v (h, gen) ← v (h, gen)+1 (in maximum search numbers range).
Subsequently, the nectar source that bee is small according to probability selection fitness value is followed, and is converted into and adopts honeybee producting honey, while in nectar source
Search nearby records the lesser nectar source position of fitness value, first calculates the probability for following bee selection nectar source and is converted into and adopts
Honeybee, then generate new nectar sourceIt calculatesIfGive up with
With the new nectar source of the gathering honey bee of bee conversion, searching times v (h, gen) ← v (h, gen)+1 is enabled.
Record green molasses sourceFor optimal nectar sourceAnd the nectar source is correspondingEnergy per bit
Value is
Finally, enabling gen ← gen+1, repeat the above steps, the maximum number of iterations until reaching artificial bee colony algorithm, from
RecordThe corresponding nectar source of middle selection minimum value, is denoted as Corresponding fitness function value
The as energy per bit value of heterogeneous network minimum, exports optimal energy per bit value
Embodiment three
Step 1, intelligent Centralized Controller collects available radio resource in heterogeneous network.The base stations in heterogeneous network position
In the center of cell, service radius 600m, 4 access points are symmetrically located at the 450m of base station, total stream of heterogeneous network
Amount bandwidth is 16MHz, is divided into 15kHz between total flow bandwidth sub-carriers.
Step 2, intelligent Centralized Controller collects the resource request for utilization of user equipment.User equipment in access points
Time scale is [2,4,3,3], and minimum-rate needed for user equipment is 3.5Mbps.Fig. 2 is heterogeneous network frequency of the invention
Resource allocation schematic diagram.
Step 3, intelligent Centralized Controller is allocated the frequency resource in heterogeneous network using artificial bee colony algorithm.
Firstly, the parameter of intelligent Centralized Controller initialization artificial bee colony algorithm, initializes NL=1, Np=10, Ne=5,
Limit=100, Ng=500, gen=1 is enabled, M, N, W, K, σ are initialized2、αnk、pnk、gnk、1/ξBS、c、 rnk, bee colony is initialized, N is randomly generatedpThe initial solution of a optimization problem
Then, honeybee is divided into gathering honey bee by population's fitness size and follows bee, calculate the size of fitness function value,
Functional value is arranged from small to large, takes the solution of functional value ranking the first half to regard nectar source as, and it is corresponded to gathering honey bee;After ranking
The solution of half, which then corresponds to, follows bee position.
Subsequently, nearby its fitness value is searched for and is calculated in nectar source to gathering honey bee, is computed its fitness value and is more than or equal to
New nectar source is given up in green molasses sourceEnable v (h, gen) ← v (h, gen)+1 (in maximum search numbers range).
Subsequently, the nectar source that bee is small according to probability selection fitness value is followed, and is converted into and adopts honeybee producting honey, while in nectar source
Search nearby records the lesser nectar source position of fitness value, first calculates the probability for following bee selection nectar source and is converted into and adopts
Honeybee, then generate new nectar sourceIt calculatesIfGive up
The new nectar source for the gathering honey bee for following bee to convert, enables searching times v (h, gen) ← v (h, gen)+1.
Record green molasses sourceFor optimal nectar sourceAnd the nectar source is correspondingEnergy per bit
Value is
Gen ← gen+1 is enabled, is repeated the above steps.As v (h, gen)=99, step 3.3 is repeated, its fitness value is computed
More than or equal to green molasses source, give up new nectar sourceEnable v (h, gen) ← v (h, gen)+1=100;Step 3.4, bee is followed
It according to the small nectar source of probability selection fitness value, and is converted into and adopts honeybee producting honey, while being searched near nectar source, record fitness value
Lesser nectar source position first calculates the probability for following bee selection nectar source and is converted into gathering honey bee, then generates new nectar sourceIt calculatesIfGive up the gathering honey bee for following bee to convert
New nectar source, enable searching times v (h, gen) ← v (h, gen)+1=101.
Searching times are greater than maximum search number Limit=100 at this time, abandon the nectar source generated in step 3.3, and solving
In the range of a new nectar source is randomly generated.
The nectar source corresponding to minimum value in all fitness function values into step 3.5 of recording step 3.2, is denoted asAnd the corresponding fitness function value in the nectar source
From recordThe corresponding nectar source of middle selection minimum value, is denoted as Corresponding fitness function
ValueThe as energy per bit value of heterogeneous network minimum, exports optimal energy per bit value
Claims (3)
1. a kind of heterogeneous network energy per bit based on rate limit minimizes resource allocation methods, which is characterized in that including
Following steps:
Step 1, intelligent Centralized Controller collects available bandwidth resources in heterogeneous network, and bandwidth resources are wireless in heterogeneous network
The total flow bandwidth of frequency resource, is denoted as YMHz, wherein [16,32] Y ∈;
Step 2, intelligent Centralized Controller collects the resource request for utilization of user equipment;
Step 3, intelligent Centralized Controller is allocated the frequency resource in heterogeneous network using artificial bee colony algorithm;
Resource request for utilization described in step 2 includes time scale needed for user equipment, the speed of minimum needed for user equipment
Rate;
Intelligent Centralized Controller described in step 3 is allocated the frequency resource in heterogeneous network using artificial bee colony algorithm,
Specific step is as follows:
Step 3.1, the parameter of intelligent Centralized Controller initialization artificial bee colony algorithm;
Step 3.2, honeybee is divided into gathering honey bee by population's fitness size and follows bee, the corresponding green molasses of every gathering honey bee
Source;
Step 3.3, its fitness value is searched near green molasses source and calculated to every gathering honey bee, if its fitness value is less than green molasses
Source then replaces green molasses source;
Step 3.4, the nectar source that bee is small according to probability selection fitness value is followed, and is converted into and adopts honeybee producting honey, while is attached in nectar source
Nearly search, records the lesser nectar source position of fitness value;
Step 3.5, judge whether searching times are greater than maximum search number, if more than the nectar source for then abandoning generating in step 3.3,
And a new nectar source is randomly generated in the range of solution;3.6 are gone to step if being less than or equal to;
Step 3.6, the smallest nectar source of fitness value and the corresponding fitness function value in the nectar source are recorded;
Step 3.7, step 3.2~3.6N is repeatedgSecondary, the smallest fitness function value is every bit that heterogeneous network minimizes
Energy value, NgIndicate the maximum number of iterations of artificial bee colony algorithm;
Parameter described in step 3.1 includes:
Honeybee sum Np∈ [10,20], bee numbers N is adoptede∈ [5,10], maximum search number Limit ∈ [100,150] and people
The maximum number of iterations N of work ant colony algorithmg∈[500,600];
The parameter of collection further include: total base station power consumptionThe accessible data of user equipment k in m-th of access points
RateWireless access access point quantity M, it heterogeneous network number of subcarriers N, subcarrier bandwidth W, number of user equipment K, makes an uproar
Sound spectrum density σ2, user equipment k time-division factor-alpha on heterogeneous network sub-carriers nnk, user equipment k average transmission on subcarrier n
Power pnk, user equipment k channel gain g on subcarrier nnk, base station static power consumptionBase station power amplifier efficiency
1/ξBS, determine to can reach data rate c, access points output power based on snr thresholdM-th of access points
Middle user equipment k channel incomeWLAN channel noise varianceWherein m ∈ M, n ∈ N, k ∈ K;
The parameter of collection further include: minimum-rate needed for user equipment k in heterogeneous networkUser equipment k on subcarrier n
Accessible maximum data rate rnk;
Bee colony is initialized, N is randomly generated using formula (4)pThe initial solution of a artificial bee colony algorithm Indicate i-th honeybee
The time scale that user equipment k is assigned in m-th of access points, wherein i ∈ [1, Np],It is that user is assigned to time ratio
The lower limit of example,It is the upper limit that user is assigned to time scale, the random number between s ∈ [0,1],Initial solution needs to meet
Formula (5), (6) and (7),
Initialize the number of iterations serial number gen=1;
Step 3.2 detailed process are as follows:
The size that i-th honeybee fitness function value is calculated using formula (8), functional value is arranged from small to large, takes functional value
N before rankingeSolution regard the green molasses source of the gen times circulation, wherein N aseValue be NpHalf, each green molasses source is one corresponding
Gathering honey bee, remaining solution, which then corresponds to, follows bee position, whereinIndicate i-th honeybee in gen circulation
Fitness function value
Wherein,For access points transmitting state power consumption,For access points Idle state power consumption;
The detailed process of step 3.3 are as follows:
Step 3.3.1 is set searching times v (h, gen)=0, is generated the h gathering honey bee using formula (9) and is recycled at the gen times
New nectar sourceWhereinIndicate the green molasses source that the h gathering honey bee recycles at the gen times,
The wherein random number of r ∈ [- 1,1], h ∈ { 1,2 ..., Ne},j∈{1,2,...,Ne, j ≠ h, wherein j is generated at random;
Step 3.3.2 calculates the fitness letter in the new nectar source of the h gathering honey bee in the gen times circulation using the method for step 3.2
Numerical valueCompareWithSize;If Then replace green molasses source, enables searching times v (h, gen)=0;Otherwise, give up new nectar source, enable v (h, gen) ← v (h,
gen)+1;
The detailed process of step 3.4 are as follows:
Step 3.4.1 calculates h-th of probability P for following bee to select nectar source in the gen times circulation using formula (10)(h,gen), and
By P(h,gen)Compared with rand, if rand < P(h,gen), then bee is followed to be converted to gathering honey bee by h-th, and in h-th of gathering honey bee
Corresponding nectar source is nearby searched for, the random number between rand ∈ (0,1),
Step 3.4.2 determines the new honey in the gen times circulation by the h gathering honey bee for only following bee to convert using formula (11)
Source,
The wherein random number of r ∈ [- 1,1], h ∈ { 1,2 ..., Ne},j∈{1,2,...,Ne, j ≠ h, wherein j is generated at random;
Step 3.4.3 is calculated in the gen times circulation using the method for step 3.3Corresponding fitness function valueCompare fitness function valueWith step 3.3 generate nectar source fitness function value it is big
It is small;IfLess than the nectar source fitness function value that step 3.3 generates, then the nectar source that step of replacing 3.3 generates enables
Searching times v (h, gen)=0;Otherwise, the new nectar source for giving up the gathering honey bee for following bee to convert, enables searching times v (h, gen) ← v
(h,gen)+1。
2. the heterogeneous network energy per bit according to claim 1 based on rate limit minimizes resource allocation methods,
It is characterized in that, the detailed process of step 3.6 are as follows: all fitness functions into step 3.5 of recording step 3.2 in step 3.6
Nectar source corresponding to minimum value, is denoted as in valueAnd the corresponding fitness function value in the nectar source
3. the heterogeneous network energy per bit according to claim 2 based on rate limit minimizes resource allocation methods,
It is characterized in that, step 3.7, enables gen ← gen+1, step 3.2~3.6N is repeatedgIt is secondary, from recordMiddle selection
The corresponding nectar source of minimum value, is denoted as Corresponding fitness function valueWhat as heterogeneous network minimized is every
Bit energy value.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410536581.0A CN104284433B (en) | 2014-10-11 | 2014-10-11 | Heterogeneous network energy per bit based on rate limit minimizes resource allocation methods |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410536581.0A CN104284433B (en) | 2014-10-11 | 2014-10-11 | Heterogeneous network energy per bit based on rate limit minimizes resource allocation methods |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104284433A CN104284433A (en) | 2015-01-14 |
CN104284433B true CN104284433B (en) | 2019-01-04 |
Family
ID=52258782
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410536581.0A Expired - Fee Related CN104284433B (en) | 2014-10-11 | 2014-10-11 | Heterogeneous network energy per bit based on rate limit minimizes resource allocation methods |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104284433B (en) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104640218B (en) * | 2015-01-29 | 2018-12-14 | 南京理工大学 | The heterogeneous network wireless resource allocation methods of proportional rate constraint |
CN104618912B (en) * | 2015-01-29 | 2018-12-14 | 南京理工大学 | Isomery cognition wireless network resource allocation methods based on frequency spectrum perception |
CN105072687B (en) * | 2015-07-28 | 2018-07-06 | 合肥工业大学 | WLAN method for channel allocation based on artificial bee colony algorithm |
CN105611592A (en) * | 2016-01-07 | 2016-05-25 | 东华大学 | Method for intelligently selecting multi-mode terminal in heterogeneous network environment |
CN106685720B (en) * | 2016-12-30 | 2020-08-25 | 南京理工大学 | Network security resource allocation method based on hierarchical bidding mechanism |
CN109102811B (en) * | 2018-07-27 | 2021-03-30 | 广州酷狗计算机科技有限公司 | Audio fingerprint generation method and device and storage medium |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102281637A (en) * | 2011-08-02 | 2011-12-14 | 北京邮电大学 | Dynamic resource allocation method and device under heterogeneous wireless network |
EP2434824A2 (en) * | 2009-05-18 | 2012-03-28 | Samsung Electronics Co., Ltd. | Methods for allocating resource in lte system |
CN103648168A (en) * | 2013-12-26 | 2014-03-19 | 东南大学 | Combined type dynamic spectrum distribution method in heterogeneous network convergence scene |
-
2014
- 2014-10-11 CN CN201410536581.0A patent/CN104284433B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2434824A2 (en) * | 2009-05-18 | 2012-03-28 | Samsung Electronics Co., Ltd. | Methods for allocating resource in lte system |
CN102281637A (en) * | 2011-08-02 | 2011-12-14 | 北京邮电大学 | Dynamic resource allocation method and device under heterogeneous wireless network |
CN103648168A (en) * | 2013-12-26 | 2014-03-19 | 东南大学 | Combined type dynamic spectrum distribution method in heterogeneous network convergence scene |
Non-Patent Citations (1)
Title |
---|
改进人工蜂群算法在信道分配上的应用;刘俊霞等;《计算机工程与应用》;20131231;正文第1-3页 |
Also Published As
Publication number | Publication date |
---|---|
CN104284433A (en) | 2015-01-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104284433B (en) | Heterogeneous network energy per bit based on rate limit minimizes resource allocation methods | |
CN104640220B (en) | A kind of frequency and power distribution method based on NOMA systems | |
US9294960B2 (en) | Method, apparatus and system for cooperative resource scheduling and cooperative communication | |
CN104980389B (en) | It is applicable in new user's otherness selection cut-in method of non-orthogonal multiple system | |
Nikjoo et al. | A novel approach to efficient resource allocation in NOMA heterogeneous networks: Multi-criteria green resource management | |
CN108076432A (en) | Broadcasting Control bandwidth allocation and data receiving-transmitting method and device | |
CN104955077A (en) | Heterogeneous network cell clustering method and device based on user experience speed | |
CN104038945B (en) | A kind of isomery cellular network efficiency optimization method based on independent sets | |
CN104159313B (en) | Femtocell user cluster-dividing method based on reliable communication in cognitive heterogeneous network | |
CN106162846A (en) | A kind of two users NOMA descending efficiency optimization method considering SIC energy consumption | |
CN106231666A (en) | Federated resource distribution method based on efficiency in distributing antenna system | |
CN109699083A (en) | A kind of power distribution method of the non-orthogonal multiple access technology based on multi-user | |
CN102647727B (en) | Selection method of mixed cooperation cluster | |
CN108271172A (en) | A kind of honeycomb D2D communication joint clusters and content disposition method | |
CN109526042A (en) | A kind of network access point selection method of the LWA system based on OWMAD | |
CN104902574B (en) | A kind of day line options and power distribution method based on efficiency | |
CN106792995A (en) | The user access method of content low time delay transmission is ensured in a kind of following 5G networks | |
CN114423028A (en) | CoMP-NOMA (coordinated multi-point-non-orthogonal multiple Access) cooperative clustering and power distribution method based on multi-agent deep reinforcement learning | |
CN110139282A (en) | A kind of energy acquisition D2D communication resource allocation method neural network based | |
CN107071881A (en) | A kind of small cell network distributed energy distribution method based on game theory | |
CN104602279B (en) | Cooperative base station cluster-dividing method and device based on threshold value in a kind of heterogeneous network | |
Huang et al. | Hierarchical cooperation in heterogeneous cloud radio access networks | |
CN104619028A (en) | MIMO (Multiple Input Multiple Output) heterogeneous network resource allocation method capable of guaranteeing users' fairness | |
CN105611640B (en) | A kind of adjustable CoMP downlink user dispatching method of equitable degree | |
CN104410976B (en) | A kind of distributed end-to-end user associates and time allocation method used therein with cellular network subscriber |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190104 Termination date: 20201011 |