CN116506874B - Spectrum access method for delay perception - Google Patents
Spectrum access method for delay perception Download PDFInfo
- Publication number
- CN116506874B CN116506874B CN202310618005.XA CN202310618005A CN116506874B CN 116506874 B CN116506874 B CN 116506874B CN 202310618005 A CN202310618005 A CN 202310618005A CN 116506874 B CN116506874 B CN 116506874B
- Authority
- CN
- China
- Prior art keywords
- frequency
- ith
- time slot
- slot
- switching
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/14—Spectrum sharing arrangements between different networks
-
- 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/0446—Resources in time domain, e.g. slots or frames
-
- 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
-
- 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 invention belongs to the field of wireless communication, and particularly relates to a frequency spectrum access method for delay perception, which comprises the steps of constructing a centralized radio system and initializing, wherein the system comprises PU, SU and a base station; the method comprises the steps of constructing an SU spectrum allocation optimization problem with the aim of minimizing system throughput loss and energy consumption caused by SU switching frequency; solving the problem of optimization of SU frequency spectrum allocation by a polynomial heuristic algorithm, and obtaining a combination scheme of time slots and frequencies of SU; the invention aims to minimize throughput and energy consumption and improve system performance by considering frequency separation distance.
Description
Technical Field
The invention belongs to the field of wireless communication, and particularly relates to a frequency spectrum access method for delay perception.
Background
With the rapid development of wireless communication technology, the number of mobile intelligent devices and internet of things devices has proliferated. However, the spectrum on which wireless communication technology relies is not renewable. In the current wireless access network, the spectrum utilization rate is low, because a fixed spectrum allocation strategy is adopted, that is, spectrum resources are allocated to fixed wireless devices for use, so that great waste of the spectrum resources is caused. To solve this problem, researchers have proposed a concept of dynamic spectrum access (Dynamic Spectrum Access, DSA), in which devices called Cognitive Radio (CR) or Secondary Users (SUs) can opportunistically use a portion of spectrum that is not currently being used by Primary Users (PUs), improving spectrum utilization.
The DSA technique of CR provides a promising paradigm for solving the contradiction between device diversity and spectrum resource scarcity. One of the key technologies of cognitive radio is spectrum sensing, which can allow a PU to open the licensed spectrum owned by the PU to an unlicensed SU when the PU is inactive on the licensed spectrum. Under the holding of the technology, as the frequency spectrum holes which appear when some PU is idle can be effectively utilized by SU, the performance of a radio system and the utilization rate of radio frequency spectrum resources are improved, and ubiquitous connection is provided for intelligent households, intelligent automobiles, intelligent agriculture and the like which appear continuously in the future.
Spectrum sharing in common cognitive radio networks (Cognitive Radio Network, CRN) is generally divided into centralized and decentralized. In a decentralized CRN, the SU accesses the spectrum opportunistically by running its own internal DSA policy. In a centralized CRN, the CBS allocates frequency channels to SU by dynamically searching for unused licensed spectrum (also called spectrum holes). This type of spectrum sharing method in centralized CR is called CBS scheduling.
In CRN, SU needs to detect the idle spectrum for access, while ensuring that it does not interfere with PU. When a PU is detected to be active in a particular frequency band, a SU operating in that frequency band needs to immediately cease operating and switch to other idle frequency bands. Switching the SU from a certain frequency band to a different frequency band, i.e. changing the operating frequency of the SU, results in frequent tuning of the power amplifier, which results in energy consumption and throughput loss due to the frequency band switching, since the tuning of the device to a new operating frequency requires time to start and stabilize.
When a cognitive radio alters its operating frequency, it experiences a hardware switching delay to tune to the new frequency because of the hardware limitations of the frequency synthesizer before it can be fully utilized. The band switching delay generally depends on the distance between the two bands, e.g. switching from a center frequency of 600MHz to 10GHz results in a larger delay than switching from 600MHz to 650MHz, while the energy consumption during the frequency conversion also depends on the distance between the two bands, which is also a result of the band switching delay. Although the switching delay and energy loss caused by the frequency band switching are negligible for the wireless technology operating in the narrow band, since the future CRN may operate in a wider frequency spectrum range, the frequency band switching of SU introduces non-negligible delay and energy consumption, resulting in the performance degradation of the CRN, so the frequency band switching power and the frequency band switching delay are important parameters, and the frequency spectrum allocation and scheduling algorithm designed for the CRN must consider the energy consumption caused by different time delays and time delays when switching to different frequency bands.
Disclosure of Invention
In order to solve the above problems, the present invention provides a method for accessing a spectrum by delay sensing, which is used for reducing the loss caused by delay switching. In the cognitive radio scenario of the present invention, the entire system operates on discrete time units while dividing the spectrum resources in the target CRN into non-overlapping orthogonal channels that are licensed for PU use, but which are spectrum shared with the unlicensed SU by CBS scheduler in order to increase the utilization of spectrum resources. Modeling this problem as a problem of channel allocation, taking into account the loss of throughput and energy consumption that occurs when a user switches to a new operating frequency, by allocating frequency and time slots to SU, aims to minimize throughput and energy consumption taking into account the frequency separation distance.
In order to achieve the above purpose, the present invention provides the following technical solutions:
s1, constructing and initializing a centralized radio system, wherein the system comprises a PU, an SU and a base station;
s2, constructing an SU frequency spectrum allocation optimization problem with the aim of minimizing the system throughput loss and the energy consumption caused by the SU switching frequency;
s3, solving the problem of optimization of SU frequency spectrum allocation through a polynomial heuristic algorithm, and obtaining a combination scheme of time slots and frequencies of the SU.
Further, the centralized radio system constructed in step S1 operates in discrete time units, and the number of time slots in operation is T and the number of available frequencies is F.
Further, the optimization problem model constructed in step S2 is expressed as:
C5:b i,t ＝(j,0) + ,j<t and X i,f,j ＝1
Wherein,represents a set of N SUs, < >>Represents the set of F frequencies available, +.>Representing a set of T time slots; lambda is a balance factor, when lambda=1, the problemMore focused on minimizing energy over the entire scheduling period, however, when λ=1, the problem is more focused on throughput loss due to frequency switching over the entire scheduling period; η represents a constant, e represents the energy consumed by SU to transmit a unit of data packet, C i,f,t Indicating throughput loss of ith SU when switching to the f-th frequency in the t-th time slot, E i,f,t Representing the energy consumption of the ith SU when switching to the f-th frequency in the t-th time slot, B i,f,t Representing the maximum number of data packets transmitted by the ith SU when the ith time slot is switched to the f frequency; x is X i,f,t As a binary variable, if the f-th frequency is assigned to the i-th SU at the t-th time slot, then X i,f,t =1, otherwise X i,f,t =0; constraint C1 indicates that each SU is at least allocated with a combination of time slots and frequencies, so that time fairness is guaranteed, and starvation caused by the fact that some SUs cannot allocate channels for a long time is avoided; constraint C2 indicates that at the t-th time slot, the f-th frequency can only be allocated to one SU; constraint C3 indicates that at time slot t, one SU can only be allocated one frequency; constraint f in C4 i,t Indicating the frequency to which the ith SU is assigned on the t-th time slot; constraint b in C5 i,t An index representing the closest busy slot of the ith SU before the t slot; constraint k in C6 i,f,t Indicating the number of frequencies the ith SU is to undergo a handover in the middle of switching to the f-th frequency in the t-th time slot, a +>Indicating that the ith SU is at b i,t The allocated frequency on the time slot, α represents the switching delay of the unit frequency, T s The length of each slot is represented and is in milliseconds.
Further, throughput loss C of ith SU when switching to the f-th frequency at the t-th time slot i,f,t The calculation formula of (2) is as follows:
wherein U is i,f Representing the whole tone consisting of T time slotsDuring this period, the ith SU uses the maximum number of packets that can be transmitted at frequency f in any slot.
Further, energy consumption E of ith SU when switching from the t time slot to the f frequency i,f,t The calculation formula of (2) is as follows:
E i,f,t ＝βk i,f,t
where β represents the switching energy consumption per unit frequency.
Further, the maximum data packet number B transmitted by the ith SU when the ith time slot is switched to the f frequency i,f,t The calculation formula of (2) is as follows:
wherein ( + Representation (x) + ＝max(0,x)，U i,f Representing the maximum number of packets that an ith SU can transmit in any slot using frequency f during the entire schedule of T slots.
Further, step S3 solves the SU spectrum allocation optimization problem by a polynomial heuristic algorithm, including:
s31, initializing parameters, and enablingΦ represents the SU set that has not been assigned a slot during the algorithm execution;
s32, entering the t time slot, and calculating a weighted sum Z of throughput loss and energy consumption generated when the SU of the i unassigned time slot is switched to the f frequency i,f Expressed as:
where λ represents the balance factor, η represents a constant, e represents the energy consumed by SU to transmit a unit of data packet, C i,f,t Indicating throughput loss of ith SU when switching to the f-th frequency in the t-th time slot, E i,f,t Represent the firstEnergy consumption of i SU when switching from the t time slot to the f frequency, B i,f,t Representing the maximum number of data packets transmitted by the ith SU when the ith time slot is switched to the f frequency;
s33, calculating a weighted sum of the total throughput loss and the energy consumption of each SU which is not allocated with the time slot, wherein the weighted sum is expressed as:
wherein Z is i,f A weighted sum of throughput loss and energy representing the ith SU using the F-th frequency in a particular time slot, F representing the total number of frequencies;
s34, arranging weighted sum ascending of total throughput loss and energy consumption of all the SUs which are not allocated with time slots, and selecting the SUs of the first N/T time slots which are not allocated with time slots to add into a set ψ; wherein N is the total number of SUs, and T is the total number of time slots in one scheduling period;
s35, constructing an integer programming problem for the N/T SUs without assigned time slots selected in the step S34, and solving a frequency assignment scheme of the N/T SUs without assigned time slots by adopting an ILP method; the integer programming problem is expressed as:
where N' represents the number of SUs in the set ψ, X i ′ ,f As a binary decision variable, if the ith SU uses the f-th frequency, X i ′ ,f =1, otherwise X i ′ ,f =0; s36, according to the solving result of the step S35, at least one of the following is allocatedSU of frequency kick out the aggregate Φ;
s37, setting X in the time slot t according to the solving result of the step S35 i,f,t ＝X i ′ ,f ,Initializing a set ψ as an empty set;
s38, judging whether T > T is met, if yes, ending the algorithm to obtain a frequency allocation scheme of N SUs; if not, let t=t+1 and return to step S32.
The invention has the beneficial effects that:
the invention focuses on the delay problem caused by frequency switching. To ensure proper transmission of the PU, the SU may waste a portion of time switching from one frequency to a new frequency, which may not be negligible. Considering the problem of frequency spectrum allocation of SU in centralized CRN, minimizing throughput and energy loss by allocating frequency and time slots to SU, and improving system performance by minimizing throughput and energy consumption by allocating frequency and time slots to SU with the aim of considering frequency spacing distance. And an algorithm of a polynomial is designed to solve the proposed problem. Providing a good solution for SU devices to operate in a wider frequency range in the future.
Drawings
Fig. 1 is a diagram of a centralized cognitive radio architecture of the present invention;
FIG. 2 is a flow chart of a method for spectrum access by delay sensing according to the present invention;
fig. 3 is a flowchart of solving SU spectrum allocation optimization problem by polynomial heuristic algorithm in the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The invention provides a delay-aware spectrum access method, which allocates residual spectrum holes for SU under the condition that the occupation frequency of PU is known, as shown in figure 1, and comprises the following steps:
s1, constructing and initializing a centralized radio system, wherein the system comprises a PU, a SU and a base station.
In particular, the network architecture of the centralized radio system constructed by the present invention is shown in fig. 2. In this embodiment the centralized radio system operates in discrete time units and the number of time slots in operation is T and the number of available frequencies is F.
S2, constructing an SU spectrum allocation optimization problem with the aim of minimizing system throughput loss and energy consumption caused by SU switching frequency.
Specifically, the invention minimizes throughput and energy loss by allocating frequency and time slots to SU; further, frequency and time slots are allocated to SU in consideration of the frequency separation distance, so as to minimize throughput and energy loss and improve system performance. For the purpose of the present invention, the following analysis was performed.
A. Busy slot analysis:
because the SU does not have to be allocated certain frequencies in every time slot, it is also possible that one SU is not allocated any frequencies in certain time slots. The time slots are defined in the present invention as follows: assuming that the ith SU is not assigned any frequency in the t-th time slot, the t-th time slot is an idle time slot for the ith SU, otherwise the t-th time slot is a busy time slot for the ith SU. The same time slot may belong to different time slot types for different SUs.
Considering a special case, when the ith SU is to perform frequency switching in the t time slot, if the t time slot belongs to an idle time slot of the ith SU, the ith SU does not have any throughput loss when performing frequency switching in the t time slot; in contrast, if the t-th time slot belongs to a busy time slot of the i-th SU, the i-th SU occupies a part of time when performing frequency switching in the t-th time slot, which causes a certain throughput loss, so it is important to analyze whether each time slot belongs to an idle time slot or a busy time slot for each SU.
Specifically, f i,t Defined as the frequency at which the ith SU is allocated on the t-th slot, and satisfies:
wherein X is i,f,t As a binary variable, if the f-th frequency is assigned to the i-th SU at the t-th time slot, then X i,f,t =1, otherwise X i,f,t ＝0。
Specifically, the index values are attached to T slots in order from 1 to T according to the time relationship. Let enter the t-th slot, where the index relationship of the t-th slot to the nearest previous busy slot belonging to the i-th SU is:
b i,t ＝(j,0) + j < t and X i,f,j ＝1
Wherein b i,t An index representing the closest busy slot of the ith SU before the t slot; b if the t-th slot is the first busy slot of the i-th SU in the scheduler i,t =0; if the ith SU has another busy slot before the nth slot, j is the index value of the immediately preceding busy slot immediately adjacent to the nth slot, and b i,t =j. It follows that the number of free slots of the ith SU between the current slot t and the previous busy slot j is equal to t-b i,t -1。
B. Channel switching delay analysis:
the number of frequencies that the ith SU needs to switch when using the f-th frequency in the t-th time slot is calculated to determine the time required to complete the switch. The channel switching delay problem refers to the hardware switching delay of the frequency synthesizer in case the SU has determined to switch to an idle channel, which delay depends on the relative position of the two frequencies on the frequency spectrum, which switching delay has a great influence on the throughput of the CRN and therefore has to be taken into account.
In particular, the invention employs k i,f,t Indicating that the ith SU is used in the t-th slotThe number of frequencies to be switched at the f-th frequency, consider the following two cases in total.
B1. When b i,t When=0, it indicates that the t-th slot is the first busy slot of the i-th SU in the schedule period, i.e., the i-th SU is not allocated any frequency before the t-th slot. In this case, k i,f,t =0, indicating that the ith SU is preconditioned to the first frequency used at the t-th slot.
B2. When 0 < b i,t When < t-1, i.e. the f-th frequency is not the first frequency used by the i-th SU, the i-th SU has a busy slot b before the t-th slot i,t In this case, the ith SU uses busy slot b i,t And the idle time slot between the first time slot and the t time slot is switched to the f frequency. At this time, the ith SU shifts the frequency from busy slot b at the t-th slot i,t The frequency used is switched to a new frequency, i.e. the number of frequencies to be spanned on the f-th frequency is expressed asI.e.Wherein (1)>Busy slot b before the t-th slot i,t The allocated frequency.
After analyzing the number of frequencies that the ith SU needs to switch to using the f-th frequency in the t-th time slot, busy time slot b i,t The number of the part of the free time slots with the t-th time slot can be calculated as (t-b i,t -1) each time slot has a length T s Millisecond. The switching delay per frequency is denoted by α, then in this free slot the number of frequencies that the ith SU is allowed to switch is [ (t-b) i,t -1)T s ]To switch to the target frequency f, the number of frequencies that need to be spanned isFor this part of the frequencies, onlyBusy time slots can be occupied to complete the frequency switch.
Based on the above analysis, the expression of the number of frequencies that the ith SU needs to switch to use the f-th frequency in the t-th slot is:
C. loss analysis:
definition C i,f,t The throughput loss of the ith SU when the ith time slot is switched to the f frequency is represented, and the calculation formula is as follows:
wherein α represents a switching delay of a unit frequency, U i,f During the entire schedule consisting of T slots, the i-th SU uses the maximum number of packets that can be transmitted using frequency f in any slot;
assuming that β is the switching energy consumption of the unit frequency, since the switching energy consumption is related to the number of switching frequencies, the energy consumption E generated when the ith SU switches to the f-th frequency in the t-th time slot i,f,t ＝βk i,f,t . Meanwhile, define e as the energy consumed by the SU to send a unit of data packet, without loss of generality, assume e is the same for all SUs. Therefore, the energy consumption over the entire scheduling period can be expressed as:
wherein B is i,f,t Indicating the maximum number of packets that the ith SU transmits when switching to the f-th frequency in the t-th time slot.
Based on the foregoing A, B, C three-point analysis, constructing an optimization problem model that takes into account frequency switching is expressed as:
C5:b i,t ＝(j,0) + ,j<t and X i,f,j ＝1
Wherein,for a set of N SU's in the entire CRN, and (2)>Representing the set of F frequencies available in the whole cell,/or->Representing a set of T time slots throughout the scheduling period. λ represents a balance factor, this problem being more focused on minimizing the energy during the whole scheduling period when λ=0; when λ=1, the problem is more focused on the whole scheduleThroughput loss due to frequency switching during the period. η represents a larger constant that prevents the energy consumption from being too small to be ignored. e represents the energy consumed by SU to transmit a unit of data packet, C i,f,t Indicating throughput loss of ith SU when switching to the f-th frequency in the t-th time slot, E i,f,t Representing the energy consumption of the ith SU when switching to the f-th frequency in the t-th time slot, B i,f,t Representing the maximum number of data packets transmitted by the ith SU when the ith time slot is switched to the f frequency; x is X i,f,t As a binary variable, if the f-th frequency is assigned to the i-th SU at the t-th time slot, then X i,f,t =1, otherwise X i,f,t ＝0。
Constraint C1 indicates that each SU is assigned at least one time slot and frequency combination; constraint C2 indicates that at the t-th time slot, the f-th frequency can only be allocated to one SU; constraint C3 indicates that at time slot t, one SU can only be allocated one frequency; constraint C4 represents a combination of one time slot and one frequency to which one SU is allocated, so as to ensure time fairness and avoid starvation caused by that some SU cannot allocate channels for a long time; constraint C5, which means that in one time slot, one frequency can only be allocated to one SU, avoids collisions between SU; at the same time, more than one cognitive user transmits in the same frequency and time slot, which may cause the total interference experienced by the PU to exceed the maximum tolerable interference limit. Constraint C6 indicates that a SU can only transmit using no more than the number of its transceivers in a time slot, since a transceiver can only be tuned to one frequency.
S3, solving the problem of optimization of SU frequency spectrum allocation through a polynomial heuristic algorithm, and obtaining a combination scheme of time slots and frequencies of the SU.
Specifically, a scheduling period including T time slots is taken as a unit period, an algorithm is adopted to obtain a scheduling decision of the scheduling period before entering one scheduling period each time, and then frequency switching is performed for SU. As shown in fig. 3, the specific process of performing frequency switching for SU in one scheduling period by using a heuristic algorithm includes the following steps:
s31, initializing parameters, and enablingΦ represents the SU set that has not been assigned a slot during the algorithm execution;
s32, entering the t time slot, and calculating a weighted sum Z of throughput loss and energy consumption generated when the SU of the i unassigned time slot is switched to the f frequency i,f Expressed as:
where Φ represents the SU set of unassigned slots;
s33, calculating a weighted sum of the total throughput loss and the energy consumption of each SU which is not allocated with the time slot, wherein the weighted sum is expressed as:
wherein Z is i,f A weighted sum of throughput loss and energy representing the ith SU using the F-th frequency in a particular time slot, F representing the total number of frequencies;
s34, arranging weighted sum ascending of total throughput loss and energy consumption of all the SUs which are not allocated with time slots, and selecting the SUs of the first N/T time slots which are not allocated with time slots to add into a set ψ; wherein N is the total number of SUs, and T is the total number of time slots in one scheduling period;
s35, constructing an integer programming problem for the N/T SUs without assigned time slots selected in the step S34, and solving a frequency assignment scheme of the N/T SUs without assigned time slots by adopting an ILP method; the integer programming problem is expressed as:
wherein N 'represents the number of SUs in the set ψ, X' i,f Is a binary decision variable, 1 if SUi uses frequency f, or 0 otherwise.
S36. it is checked whether the integer programming problem assigns at least one frequency to each SU. According to the result of the solution of step S35, the SU assigned at least one frequency is kicked out of the set Φ, i.e. ifΦ++Φ - { i };
s37, executing X 'of integer programming problem according to S35' i,f Setting X for the particular time slot t i,f,t I.e. X i,f,t ＝X′ i,f ,According to the result of the solution of step S35, SU assigned at least one frequency is kicked out of the set Φ.
S38, judging whether T > T is met, if yes, ending the algorithm to obtain a frequency allocation scheme of N SUs; if not, let t=t+1 and return to step S32.
In the present invention, unless explicitly specified and limited otherwise, the terms "mounted," "configured," "connected," "secured," "rotated," and the like are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally formed; can be mechanically or electrically connected; either directly or indirectly through intermediaries, or in communication with each other or in interaction with each other, unless explicitly defined otherwise, the meaning of the terms described above in this application will be understood by those of ordinary skill in the art in view of the specific circumstances.
Although embodiments of the present invention have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made therein without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (2)
1. A method of delay-aware spectrum access, comprising the steps of:
s1, constructing and initializing a centralized radio system, wherein the system comprises a PU, an SU and a base station;
s2, constructing an SU frequency spectrum allocation optimization problem with the aim of minimizing the system throughput loss and the energy consumption caused by the SU switching frequency;
the optimization problem model constructed in the step S2 is expressed as follows:
s.t.C1:
C2:
C3:
C4:
C5:b i,t ＝(j,0) + ,j<t and X i,f,j ＝1
Wherein,represents a set of N SUs, < >>Represents the set of F frequencies available, +.>Representing a set of T time slots; λ is a balance factor, and when λ=0, this problem is more focused on the minimization of energy in the entire scheduling period, whereas when λ=1, this problem is more focused on the throughput loss due to frequency switching in the entire scheduling period; η represents a constant, e represents the energy consumed by SU to transmit a unit of data packet, C i,f,t Indicating throughput loss of ith SU when switching to the f-th frequency in the t-th time slot, E i,f,t Representing the energy consumption of the ith SU when switching to the f-th frequency in the t-th time slot, B i,f,t Representing the maximum number of data packets transmitted by the ith SU when the ith time slot is switched to the f frequency; x is X i,f,t As a binary variable, if the f-th frequency is assigned to the i-th SU at the t-th time slot, then X i,f,t =1, otherwise X i,f,t =0; constraint C1 indicates that each SU is at least allocated with a combination of time slots and frequencies, so that time fairness is guaranteed, and starvation caused by the fact that some SUs cannot allocate channels for a long time is avoided; constraint C2 indicates that at the t-th time slot, the f-th frequency can only be allocated to one SU; constraint C3 indicates that at time slot t, one SU can only be allocated one frequency; constraint f in C4 i,t Indicating the frequency to which the ith SU is assigned on the t-th time slot; constraint b in C5 i,t An index representing the closest busy slot of the ith SU before the t-th slot; constraint k in C6 i,f,t Indicating the number of frequencies the ith SU is to undergo a handover in the middle of switching to the f-th frequency in the t-th time slot, a +>Indicating that the ith SU is at b i,t The allocated frequency on the time slot, alpha representing the unit frequencyDelay of switching of rate, T s Representing the length of each slot and in milliseconds;
throughput loss C of ith SU at t-th slot to f-th frequency i,f,t The calculation formula of (2) is as follows:
wherein U is i,f Representing the maximum number of packets that an ith SU can transmit in any time slot using frequency f during the entire schedule consisting of T time slots;
energy consumption E of ith SU in t time slot to f frequency i,f,t The calculation formula of (2) is as follows:
E i,f,t ＝βk i,f,t
wherein, beta represents switching energy consumption of unit frequency;
maximum number of data packets B transmitted by the ith SU when switching from the nth time slot to the f-th frequency i,f,t The calculation formula of (2) is as follows:
wherein () + Representation (x) + ＝max(0,x)，U i,f Representing the maximum number of packets that an ith SU can transmit in any time slot using frequency f during the entire schedule consisting of T time slots;
s3, solving an SU frequency spectrum allocation optimization problem through a polynomial heuristic algorithm, and obtaining a combination scheme of a time slot and a frequency of the SU;
step S3, solving the optimization problem of SU spectrum allocation through a polynomial heuristic algorithm, wherein the method comprises the following steps:
s31, initializing parameters, and enablingΦ represents the SU set that has not been assigned a slot during the algorithm execution;
s32, calculating the weighted sum Z of the throughput loss and the energy consumption generated when the SU of the ith unassigned time slot is switched to the f frequency when the t time slot starts i,f Expressed as:
where λ represents the balance factor, η represents a constant, e represents the energy consumed by SU to transmit a unit of data packet, C i,f,t Indicating throughput loss of ith SU when switching to the f-th frequency in the t-th time slot, E i,f,t Representing the energy consumption of the ith SU when switching to the f-th frequency in the t-th time slot, B i,f,t Representing the maximum number of data packets transmitted by the ith SU when the ith time slot is switched to the f frequency;
s33, calculating a weighted sum of the total throughput loss and the energy consumption of each SU which is not allocated with the time slot, wherein the weighted sum is expressed as:
wherein Z is i,f A weighted sum of throughput loss and energy representing the ith SU using the F-th frequency in a particular time slot, F representing the total number of frequencies;
s34, arranging weighted sum ascending of total throughput loss and energy consumption of all the SUs which are not allocated with time slots, and selecting the SUs of the first N/T time slots which are not allocated with time slots to add into a set ψ; wherein N is the total number of SUs, and T is the total number of time slots in one scheduling period;
s35, constructing an integer programming problem for the N/T SUs without assigned time slots selected in the step S34, and solving a frequency assignment scheme of the N/T SUs without assigned time slots by adopting an ILP method; the integer programming problem is expressed as:
s.t.C1:
C2:
where N' represents the number of SUs in the set ψ, X i ′ ,f As a binary decision variable, if the ith SU uses the f-th frequency, X i ′ ,f =1, otherwise X i ′ ,f ＝0；
S36, kicking out a set phi from the SU allocated with at least one frequency according to the solving result of the step S35;
s37, setting in the specific time slot t according to the solving result of the step S35Initializing a set ψ as an empty set;
s38, judging whether T > T is met, if yes, ending the algorithm to obtain a frequency allocation scheme of N SUs; if not, let t=t+1 and return to step S32.
2. The method of claim 1, wherein the centralized radio system constructed in step S1 operates in discrete time units, and the number of time slots in operation is T and the number of available frequencies is F.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310618005.XA CN116506874B (en) | 2023-05-29 | 2023-05-29 | Spectrum access method for delay perception |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310618005.XA CN116506874B (en) | 2023-05-29 | 2023-05-29 | Spectrum access method for delay perception |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116506874A CN116506874A (en) | 2023-07-28 |
| CN116506874B true CN116506874B (en) | 2024-01-23 |
Family
ID=87321613
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310618005.XA Active CN116506874B (en) | 2023-05-29 | 2023-05-29 | Spectrum access method for delay perception |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116506874B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105979526A (en) * | 2016-06-29 | 2016-09-28 | 桂林电子科技大学 | Biding method for spectrum auction of cognitive distributed antenna system |
| WO2022037676A1 (en) * | 2020-08-20 | 2022-02-24 | 国防科技大学 | Dynamic spectrum sharing method based on user online learning and low-overhead cooperation |
| KR102438747B1 (en) * | 2021-03-31 | 2022-08-31 | 인하대학교 산학협력단 | Method and apparatus for allocating transcoding task considering video quality in live streaming environment |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7248841B2 (en) * | 2000-06-13 | 2007-07-24 | Agee Brian G | Method and apparatus for optimization of wireless multipoint electromagnetic communication networks |
| US9538388B2 (en) * | 2006-05-12 | 2017-01-03 | Shared Spectrum Company | Method and system for dynamic spectrum access |
-
2023
- 2023-05-29 CN CN202310618005.XA patent/CN116506874B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105979526A (en) * | 2016-06-29 | 2016-09-28 | 桂林电子科技大学 | Biding method for spectrum auction of cognitive distributed antenna system |
| WO2022037676A1 (en) * | 2020-08-20 | 2022-02-24 | 国防科技大学 | Dynamic spectrum sharing method based on user online learning and low-overhead cooperation |
| KR102438747B1 (en) * | 2021-03-31 | 2022-08-31 | 인하대학교 산학협력단 | Method and apparatus for allocating transcoding task considering video quality in live streaming environment |
Non-Patent Citations (2)
| Title |
|---|
| 利用多目标PSO优化的累积时延和信道容量联合优化的频谱切换算法;张煜培;赵知劲;郑仕链;;电信科学(第07期);全文 * |
| 基于移动主用户的认知无线网络动态频谱接入;刘觉夫;胡静;王建旭;陈婧琳;;计算机工程与设计(第11期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116506874A (en) | 2023-07-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zheng et al. | Device-centric spectrum management | |
| Zheng et al. | Collaboration and fairness in opportunistic spectrum access | |
| Ngo et al. | Distributed resource allocation for cognitive radio networks with spectrum-sharing constraints | |
| CN102065544B (en) | Resource management method and system | |
| JP5155366B2 (en) | Dynamic limited reuse scheduler | |
| WO2008005649A2 (en) | An orthogonal frequency domain multiplexing (ofdm) communication system | |
| Hawa et al. | Distributed opportunistic spectrum sharing in cognitive radio networks | |
| El Azaly et al. | Performance analysis of centralized dynamic spectrum access via channel reservation mechanism in cognitive radio networks | |
| Huang et al. | Prediction-based spectrum aggregation with hardware limitation in cognitive radio networks | |
| Mir et al. | An adaptive handoff strategy for cognitive radio networks | |
| CN104093209A (en) | A Dynamic Cognitive Network Resource Allocation Method | |
| Gbadamosi et al. | Adaptive interference avoidance and mode selection scheme for D2D-enabled small cells in 5G-IIoT networks | |
| CN116506874B (en) | Spectrum access method for delay perception | |
| Wang et al. | A virtual control layer resource allocation framework for heterogeneous cognitive radio network | |
| Aboulfotouh et al. | Time-efficient sub-optimal solutions for dynamic spectrum allocation in CRN with user fairness | |
| Li et al. | Channel allocation scheme based on greedy algorithm in cognitive vehicular networks | |
| Gardellin et al. | A fully distributed game theoretic approach to guarantee self-coexistence among WRANs | |
| Miuccio et al. | Channel-aware and QoS-aware downlink resource allocation for multi-numerology based 5G NR systems | |
| Wang et al. | Multi-homing in unlicensed LTE networks | |
| Aslam et al. | Fair, efficient, and power-optimized spectrum sharing scheme for cognitive radio networks | |
| Bigdeli et al. | Offline and real-time deadline-aware scheduling and resource allocation algorithms favoring big data transmission over cognitive CRANs | |
| Shawkat et al. | Spectrum handoff analysis for multiple secondary users in cognitive radio networks | |
| Tayel et al. | Spectrum access management of multi-class secondary users in hybrid cognitive radio networks | |
| Xu et al. | Resource Allocation for OFDMA-Based Cognitive Networks: An Interference-Efficient Perspective | |
| Kaniezhil et al. | Improvement of Spectrum Sharing using Traffic pattern prediction |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |