 Research
 Open Access
 Published:
Resource allocation in shared spectrum access communications for operators with diverse service requirements
EURASIP Journal on Advances in Signal Processing volume 2016, Article number: 83 (2016)
Abstract
In this paper, we study interoperator spectrum sharing and intraoperator resource allocation in shared spectrum access communication systems and propose efficient dynamic solutions to address both interoperator and intraoperator resource allocation optimization problems. For interoperator spectrum sharing, we present two competent approaches, namely the subcarrier gainbased sharing and fragmentationbased sharing, which carry out fair and flexible allocation of the available shareable spectrum among the operators subject to certain welldefined sharing rules, traffic demands, and channel propagation characteristics. The subcarrier gainbased spectrum sharing scheme has been found to be more efficient in terms of achieved throughput. However, the fragmentationbased sharing is more attractive in terms of computational complexity. For intraoperator resource allocation, we consider resource allocation problem with users’ dissimilar service requirements, where the operator supports users with delay constraint and nondelay constraint service requirements, simultaneously. This optimization problem is a mixedinteger nonlinear programming problem and nonconvex, which is computationally very expensive, and the complexity grows exponentially with the number of integer variables. We propose lesscomplex and efficient suboptimal solution based on formulating exact linearization, linear approximation, and convexification techniques for the nonlinear and/or nonconvex objective functions and constraints. Extensive simulation performance analysis has been carried out that validates the efficiency of the proposed solution.
Introduction
Frequency spectrum is an extremely valuable and important natural resource. The exponential increase in demand for the technologies like WiFi or smart electricity grids means we must utilize this finite radio resource very efficiently. But matching this exponentially growing demand for wireless connectivity is harder in the absence of unused or vacant spectrum. In traditional exclusive licensing systems, many frequency bands are spatially and temporally underutilized. Due to the deficiency of the spectrum resources and to support the predicted enormous wireless traffic explosion in future, it is important to make full use of the existing radio resources. Spectrum sharing presents a supplementary approach to conventional licenseexempt and exclusive licensing schemes and can be realized to cope with the existing network infrastructure with the support of new technologies. Even though many applications still depend on exclusive access to spectrum, spectrum sharing [1–3] is increasingly recognized as the breeding framework for wireless innovation that triggers the development and deployment of more resilient and flexible wireless technologies.
Spectrum sharing among operators can appear in many different scenarios. One example is coprimary sharing, where the spectrum regulator licenses a frequency band to multiple operators without specifying the boundaries between the bands of spectrum sharing operators and all the operators have equal right to access the shareable spectrum. Another example is licensed shared access scenario, where an incumbent user licenses its frequency band to multiple operators for shared usage in a certain geographical location and for a certain time period. Spectrum sharing is coordinated in accordance with sharing rules under a welldefined set of conditions and mutual agreement. Shared spectrum access [4–9] facilitates efficient utilization of the available spectrum in the 5thgeneration (5G) and beyond networks and will become unquestionably mandatory in order to accommodate the predicted enormous wireless traffic explosion. It acts as an intermediary solution between conventional unlicensed and licensed strategies in which the spectrum sharing operators share the licensed spectrum under a decided set of coverage restrictions and time period. Furthermore, spectrum sharing represents a supplementary approach to conventional licenseexempt and exclusive licensing schemes,and can be realized to cope with the existing network infrastructure with reasonable and feasible modifications [10].
Related works and issues on interoperator spectrum sharing
Dynamic and flexible interoperator spectrum sharing among the participating operators is very important in shared spectrum access scenarios. A large number of issues have to be considered, such as the spectrum sharing policy, operators’ individual traffic demands, structure of the shared spectrum, i.e., contiguous/noncontiguous, the operating environment, channel propagation characteristics, and interoperator interference. Unlike resource allocation in other systems, interoperator resource allocation in shared spectrum communication depends on various factors such as license agreement policy and traffic demands along with other conventional constraints [11, 12].
The work in [12] considered a shared spectrum access model, where each operator is allocated with a fragment of the shareable spectrum. However, [12] does not consider dynamic fragment sharing among the operators, which can have a significant impact on the system performance. This is because the achievable throughput for a spectrum sharing operator over different fragments of the shared spectrum can vary quite significantly depending on the types of applications and channel characteristics. In [13], a centralized approach for spectrum sharing across multiple operators has been proposed based on a coordinated scheduling algorithm. The authors of [14, 15] considered orthogonal frequency division multiple access (OFDMA)based scheme and proposed spectrum sharing approaches from a game theoretic perspective under cognitive radio context, where the spectrum sharing operators are classified as primary and secondary. Unfortunately, each of the abovementioned shared spectrum allocation works considered either subcarrier gainbased or fragmentationbased schemes, not both.
Furthermore, during the interoperator spectrum sharing process, if an operator needs to ensure that all the users have approximately same data rates or each user should be able to transmit at a minimum rate, some notion of fairness has to be incorporated in the optimization process that gives the users the way of being treated in accordance with the fairness notion. In this study, we aim at treating all the users equally in terms of allocating resources to them. Along with achieving overall higher system throughput, maximizing fairly shared spectrum efficiency is very important, especially from the spectrum sharing operators’ perspectives.
Related works and issues on intraoperator resource allocation
From the allocated spectrum in the interoperator spectrum sharing stage, each operator then allocates the radio resources to its own users depending on system objective, users’ applications types, and other constraints. In general, the operators can perform such resource allocation independently from each other. For the intraoperator resource allocation, we consider nonoverlapping subcarrier allocation and the operators support users with heterogenous service requirements. There are many works in literature dealing with the problem of resource allocation in OFDMA system under various system constraints [16–20]. For instance, the authors of [16, 17] have shown that the overall system capacity of an OFDMA system is optimized when each subcarrier is assigned to the user with the best channel gain. The maxmin optimization problem is addressed in [16], where all the users are assured to achieve a similar data rate through the maximization of the worst users’ capacity.
The algorithm proposed in [17] is aimed at the maximization of data rate under total transmitting power and target bit error rate requirements. In [18, 19], the authors claim that nonconvexity is not an issue for the resource allocation problem in an OFDMA system if the number of subcarriers is very large. In [20], the authors proposed an iterative resource allocation algorithm to minimize the total transmitting power under fixed user data rates and bit error rate constraints. In [21], the authors proposed a besteffort fairness scheme that ensures minimum number of subchannels for all the users. In [24, 25], adaptive resource allocation in OFDMA system is considered under partial channel state information. In [26–29], the authors formulate an optimization problem, which balances the tradeoff between capacity and fairness among the users. Proportional fairness is assured, i.e., ensures that the rates of different users are proportional, by imposing a set of nonlinear constraints.
We consider intraoperator resource allocation for a system with users with delay constraint service requirements. The users are categorized under two difference sets, i.e., delay constraint (DC) users and nondelay constraint (NDC) users. Unlike [17, 20, 23], which consider homogenous traffic for DC users and NDC users, respectively, in our considered system model, both DC and NDC traffics can be supported simultaneously. Due to the presence of nonlinear structure in the objective function and constraints, and nonsharing nature of the subcarrier allocation among the users, the optimization problem becomes a mixedinteger nonlinear programming (MINLP) problem, which is computationally very expensive. In [22], the authors studied the resource allocation problem in a system with users requiring delay differentiated services and consider fairness in terms of delay sensitive users. They proposed a suboptimal solution by introducing timesharing variables, and therefore, the system model employed differs from the original OFDMA system.
Contributions
For interoperator spectrum sharing in shared spectrum access communications, we propose two solutions that are computationally inexpensive. For both of the solutions, optimizing total system throughput has been the objective metric while allocating spectrum resources to the operators. The first solution (a.k.a. subcarrier gainbased spectrum sharing) is iterative in nature. In this proposed scheme, unlike [13–15], we emphasize on fairness issues not only for the spectrum sharing operators but also for the users served by the operators, by taking care of the sharing policy measures based on welldefined sharing conditions, traffic demands, and propagation environments. The second proposed solution (a.k.a. fragmentationbased spectrum sharing) is based on allocating spectrum fragments to the operators instead of subcarriers as in the case of the first solution, where each fragment is a set of larger number of contiguous subcarriers. Note that each operator can dynamically obtain multiple noncontiguous fragments from the shared spectrum if the available spectrum for sharing is noncontiguous. Contrary to the shared spectrum scheme proposed in [13], the proposed solution in this work allows dynamic sharing of frequency spectrum among the operators depending on the types of applications, e.g., shortrange communications, the technologies it operates on, and channel propagation characteristics.
For the intraoperator resource (spectrum and power) allocation problem, we propose a computationally efficient (if not, at least solvable) solution based on some linearization techniques (exact linearization or linear approximations) considering the structures of the optimization problem and the constraints. The performance of the proposed solution is impressive when compared to the original MINLP and other existing solutions. In particular, we transform the computationally expensive nonconvex MINLP into a convex problem by introducing a series of efficient linearization, linear approximation, and convexification techniques, therefore, significantly reducing the computational time.
The remainder of this paper is structured as follows. The system model and the problem statement are discussed in Section 2. In Section 3, we discuss two competent solutions for interoperator spectrum sharing. In Section 4, the proposed scheme for intraoperator resource allocation for users with dissimilar services is discussed. In Section 5, we describe the simulation parameters and evaluate the performances of the proposed solutions. Finally, we conclude the paper in Section 6.
System model
We consider a coprimary or horizontal spectrum sharing communication model with N _{op} operators, where all the operators have equal right to access the spectrum. The National Spectrum Regulatory Authority (NRA) licenses a shareable spectrum band to N _{op} operators participating in shared spectrum access, without fixed boundaries between spectrum bands of different operators. The operators coordinate their spectrum usage according to certain sharing rules and mutual agreement. All the N _{op} participating operators employ orthogonal frequency division multiple access or multicarrier waveforms [12], e.g., OFDMA, filter bank multicarrier waveforms, and spectrum sharing is achieved in a coordinated way. Different operators have the flexibility to use different air interfaces that support scalable bandwidth and flexible size of discrete Fourier transform (DFT). An entity called the global spectrum controller (GSC) carries out the coordinated spectrum sharing related tasks. The GSC can be either a virtual entity implemented in a distributed way in the base stations or an separate/independent entity in the network infrastructure. A typical shared spectrum network architecture with three operators is depicted in Fig. 1.
An operator or a shared spectrum licensee is an entity operating a mobile/fixed communication networks (MFCN), which holds individual rights of use to the shared spectrum resource. An operator can serve its users by one or more base stations. The GSC supports the entry and storage of shared spectrum resources availability informations and is able to convey the related availability informations to authorized licensed shared spectrum controllers (LSC) and is also able to receive and store acknowledgement informations sent from the LSCs. The GSC also provides means for the NRA to monitor the operation of the shared spectrum system and to provide the shared spectrum system with information on the Sharing Framework (set of sharing rules or sharing conditions for the band, information on spectrum that can be made available for shared use, and the corresponding technical and operational conditions for its use) and the shared spectrum licensees. The GSC ensures that the shared spectrum system operates in conformance with the Sharing Framework and the licensing regime.
LSC is located within the shared spectrum licensee’s domain and enables the shared spectrum licensee to obtain shared spectrum resource availability informations from the GSC and to provide acknowledgment information to the GSC. The LSC interacts with the licensee’s MFCN in order to support the mapping of available informations into appropriate radio transmitter configurations and receive the respective confirmations from the MFCN. Each base station is associated with one LSC. Multiple LSCs of the same or different shared spectrum licensee(s) are connected to one GSC.
In our considered system model, a common subcarrier grid, \(\mathcal {S}_{\text {grid}}\), is firstly formed. The number of subcarriers N _{sub} and subcarrier spacing Δ _{sub} depend on various parameters such as coherence bandwidth B _{coh}, coherence time T _{coh}, carrier frequency offset (CFO) tolerance CFO_{tol}, Doppler frequency f _{D}, the size of the smaller band of noncontiguous spectrum B _{low}, if the shareable spectrum is noncontiguous, etc. The parameter Δ _{sub} is carefully designed such that all the subcarriers in \(\mathcal {S}_{\text {grid}}\) experience flat fading. In general, B _{coh} and T _{coh} decide the maximum/minimum value of Δ _{sub}. Therefore,
A uniform common subcarrier grid is assumed, i.e., even if the shared spectrum is noncontiguous, the subcarrier grid covers the whole shared spectrum under operation. The formation of common subcarrier grid for both contiguous and noncontiguous shared spectrums is depicted in Fig. 2.
Each operator first calculates the minimum required spectrum size in terms of Hz or the number of subcarriers, calculated based on its users’ data rate requirements and transmitting power budget. Thereupon, it sends this information along with the subcarriers’ signaltonoise ratios (SNRs) of its users to the GSC. The GSC associates the operators with the parameters \(\left \{\rho _{1}, \rho _{2}, \cdots, \rho _{N_{\text {op}}}\right \}\) that reflect the sharing agreement policy and quantify the operators’ priority when the spectrum is shared. We consider that operators utilize this priority scheme in which higher priority incurs in upfront payment to the other operators. Any operator that desires higher priority, for instance, to guarantee more spectrum to its customers, shall compensate the other operators by a predefined fee also proportional to the degree of prioritization. The GSC, thereafter, determines the amount of spectrum for each operator depending on the sharing agreement policy, traffic demands, and subcarrier SNRs. The common rule is that the operator who pays more should have access to a larger amount of shareable spectrum. Let \(\phantom {\dot {i}\!}\{\Delta _{\text {min}}^{\mathrm {req,1}},\cdots,\Delta _{\text {min}}^{{\text {req}},{N_{\text {op}}}}\}\) denote the minimum amount of spectrums requested by the operators to satisfy their users’ service requirements, calculated based on average subcarrier SNR and transmitting power constraint, where \(\phantom {\dot {i}\!}\{\boldsymbol {q}_{1},\cdots,\boldsymbol {q}_{N_{\text {op}}}\}\) represent the sets of channel quality informations, i.e., subcarrier SNRs, calculated by different operators. The shared spectrum allocation to different operators is obtained as
where \(\{{\boldsymbol {\mathcal {S}}}_{1},\cdots, {\boldsymbol {\mathcal {S}}}_{N_{\text {op}}}\}\) are the sets of subcarriers assigned to spectrum sharing operators and \({\boldsymbol {\mathcal {S}}}_{1}\cup {\boldsymbol {\mathcal {S}}}_{2}\cup \cdots \cup {\boldsymbol {\mathcal {S}}}_{N_{\text {op}}}=\mathcal {S}_{\text {grid}}\). Note that the subcarriers in \({\boldsymbol {\mathcal {S}}}_{n}\) can be from a small fragment (a contiguous band) of shared spectrum or can be scattered over the whole shared spectrum.
Let us consider that spectrum sharing operator n supports K _{ n } noncooperative users with a single receiving antenna each. The data transmissions of different users are assumed to be subject to slowly varying, independent frequencyselective Rayleigh fading. Perfect channel state information is assumed to be available and a nonsharing subcarrier allocation scheme is considered, i.e., a subcarrier can be allocated to a single user only. The data transmission is subject to regulated maximum transmitting power constraint, \(P^{(n)}_{\text {Max}}\). Let us consider that \(\mathcal {S}_{n}=L_{n}\) and B _{ n }=Δ _{sub} L _{ n } is the total frequency bandwidth allocated to operator n. Then, the capacity achieved by user k of operator n when transmitting data over subcarrier l is given by
with \(h^{(n)}_{k,l}= z^{(n)}_{k,l}^{2} /{\sigma }^{2}_{n}\), where \(z^{(n)}_{k,l}\) defines the frequency gain on subcarrier l of user k and x denotes the cardinality of x. \({\sigma }^{2}_{n}=N_{0} B_{n}/L_{n}\) is the variance of additive white Gaussian noise (AWGN) over subcarrier l, where N _{0} is the noise power spectral density. The quantity \(h^{(n)}_{k,l}=z^{(n)}_{k,l}^{2}/\left (N_{0} \frac {B_{n}}{L_{n}}\right)\) is defined as the effective SNR on subcarrier l allocated to user k of operator n. \(p^{(n)}_{k,l}\) is the amount of power allocated to user k corresponding to subcarrier l. The total rate achieved by user k of operator n is given by \(R^{(n)}_{k}=\sum \limits _{l=1}^{L_{n}}{{{{c}}^{(n)}_{k,l}}{{r}^{(n)}_{k,l}}}\), where \({{{c}}^{(n)}_{k,l}}\) is the subcarrier assignment function. \({{{c}}^{(n)}_{k,l}}=1\) refers to the subcarrier allocation in which user k of operator n is assigned with subcarrier l. If subcarrier l is not assigned to user k, \({{{c}}^{(n)}_{k,l}}\) is equal to 0.
Solutions for interoperator spectrum sharing
In our proposed interoperator spectrum sharing approaches, spectrum sharing among the operators is transformed into an optimization program which maintains a fair priority requirements based on the sharing policy and traffic demands of the operators while maximizing the total system throughput. The spectrum allocation among the operators is performed in such a way that coarsely fulfills the relationship as follows
where \(\mathcal {N}\triangleq \left \{1,2,\cdots,N_{\text {op}}\right \}\) and \(\sum _{n=1}^{N_{\text {op}}} \rho _{n}^{\text {act}}=1\). The relationship defined in (4) states that the amount of spectrum resources allocated to the operators are proportional to each other, and \(\rho _{n}^{\text {act}}\) defines the active priority measure of operator n. Note that \(\rho _{i}, \forall i, i\in \mathcal {N}\) are the original priority measures of the operators depending solely on sharing rules and mutual agreement. While \(\rho _{i}^{\text {act}}, \forall i, i\in \mathcal {N}\) are the active priority measures calculated considering additionally the current traffic demands, \(\rho _{i}^{\text {act}}, \forall i, i\in \mathcal {N}\) decide the final spectrum allocation. The values of \(\rho _{i}^{\text {act}}, \forall i, i\in \mathcal {N}\) may or may not be equal to the values of \(\rho _{i}, \forall i, i\in \mathcal {N}\).
Subcarrier gainbased spectrum sharing
The proposed subcarrierbased interoperator spectrum sharing approach is iterative in nature, and opts to fairly and flexibly allocate the available shareable spectrum among the operators. The subcarriers allocated to any operator scatter over the whole subcarrier grid. We can express the spectrum allocation problem as
The GSC calculates an active set of \(\left \{\rho _{1}, \rho _{2}, \cdots, \rho _{N_{\text {op}}}\right \}\), defined as \(\left \{\rho _{1}^{\text {act}},\rho _{2}^{\text {act}},\cdots,\rho _{N_{\text {op}}}^{\text {act}}\right \}\) before entering into the actual iterative process. The determination of this active set and the iterative spectrum allocation process is provided in Fig. 3. The GSC calculates the active set of sharing parameters by following the process described in phase 1 and finally the spectrum allocation among the operators is carried out by following the process illustrated in phase 2.
The spectrum allocation problem with the operators’ desired amount of spectrum and preferred sets of subcarriers is transformed into an optimization program which maintains a proportional spectrum fairness requirements among the operators. The amount of spectrum and subcarriers are assigned to the operators in such a way that coarsely/closely fulfills the relationship given in (5). The advantage of introducing these normalized priority spectrum measures \(\left \{\rho _{1}^{\text {act}},\rho _{2}^{\text {act}},\cdots,\rho _{N_{\text {op}}}^{\text {act}}\right \}\) is that we can explicitly control the spectrum allocation ratio among the operators during an iterative allocation process. At any particular iteration, the operator i has the opportunity to get assigned with a subcarrier that has the highest SNR over all of its users if it complies with the condition:
Hence, this proposed spectrum allocation scheme assigns subcarriers to the operators depending on their desired amount of spectrum and the sharing policy.
A set of predefined rules is followed by the GSC for dynamic and fair allocation of shared spectrum. The amount of shared spectrum allocated to any operator n, δ _{ n } (calculated based on \(P^{(n)}_{\text {Max}}\) and average subcarrier SNR \(\bar {h}^{(n)}\)) scales with its traffic demand under some fairness measures. If the desired amounts of shared spectrum in terms of number of subcarriers, \(\delta _{n}, \forall n, \hspace {1mm}n\in \mathcal {N}\) are ≥ or ≤ their actual priority amounts \(\eta _{n}, \forall n, \hspace {1mm}n\in \mathcal {N}\) corresponding to the sharing agreement (\(\left \{\rho _{1}, \rho _{2}, \cdots, \rho _{N_{\text {op}}}\right \}\)), the GSC just allocates the subcarriers proportionally according to the actual sharing agreement policy, i.e., \(\rho _{n}^{\text {act}}=\rho _{n}, \forall n\).
When for some operators, \(\delta _{i}<\eta _{i}, i\in \mathcal {N}\), and for the rest of the operators \(\delta _{j}\ge \eta _{j}, j\in \mathcal {N}\) with i≠j, then if \(\sum _{n=1}^{{N_{\text {op}}}}\delta _{n}\eta _{n}\le 0\), the GSC allocates the spectrum according to the desired amount of spectrum irrespective of the sharing agreement as it will not violate the agreement. However, if \(\sum _{n=1}^{{N_{\text {op}}}}\delta _{n}\eta _{n}>0\), the GSC allocates the additional spectrum due to the operators who have δ _{ n }<η _{ n } among the operators with δ _{ n }>η _{ n } proportionally depending on the values of δ _{ n }−η _{ n }. Furthermore, for each operator, the subcarrier assignment is performed in such a way that maintains fairness among its users, i.e., each user gets equal opportunity in a roundrobin manner to get assigned with its best subcarriers. Finally, after the GSC finds the subcarrier sets \(\left \{\mathcal {S}_{1},\mathcal {S}_{2},\cdots, \mathcal {S}_{N_{\text {op}}}\right \}\), it notifies all the spectrum sharing operators. Since all the network operators have access to the whole spectrum band and the users’ device has the capability to tune to the whole band, each operator can give access to any user subscribed to one of the sharing network operators. However, in order to enable such spectrum sharing, infrastructure sharing and high coordination is required among the operators. Software defined networking and network function virtualization may be the viable solutions for such sharing in order to enable the system obtaining the benefit from multiuser diversity across the operators’ domain.
Note that this subcarrierbased spectrum allocation process is iterative and thus requires significantly more time to find the allocation. If the operating environment is such that the channel is highly frequencyselective, then N _{sub} tends to become larger since the subcarrier spacing will become shorter, which in turn will increase the computation time. Note that in the current study, we have considered that the finest resource granularity for transmission is one subcarrier. However, the finest resource granularity can also be one resource block as in the case of Long Term EvolutionAdvanced (LTEA), which contains a group of successive subcarriers.
Fragmentationbased spectrum sharing
In order to reduce the computation time, the GSC can perform fragmentationbased shared spectrum allocation. For fragmentationbased spectrum sharing, we follow the same procedures for obtaining the active priority measures, i.e., phase 1 remains the same.
In fragmentationbased spectrum sharing, the operators have the option to inform the GSC about the favorable fragments they like to operate on by sending an extra variable α. The range of values in α depends on the number of operators participating in the spectrum sharing process. For example, if there are only two operators, α can be binary. If any operator wants to transmit on the lower end of the spectrum, it sends 0, or 1, otherwise. The same goes for the second operator. If there are three operators, α is of 2b size while 00 points to the lower end and 11 points to the upper end of the spectrum. Any operator favors one fragment over other fragments in the shared frequency band depending on the types of applications, e.g., shortrange communications, the technologies it operates on and channel propagation characteristics, and its achievable capacity on the fragment. The GSC also takes these features under consideration when it allocates the fragments to different operators.
When two or more operators request for the same fragment, the GSC prioritizes one over the other by judicious evaluation of the abovementioned features. If all the operators offer the same type of applications and have equal priority, then the contention is solved by random selection of one of the operators. When similar contention occurs again in future, the GSC performs the same random selection by ignoring the operator that was selected in the previous contention period. When fragmentationbased spectrum sharing is employed, each operator can have independent network deployment. Each operator can independently adjust its own transmission frame structure in accordance with the use case, traffic type, etc. The operators have also the flexibility to change the number of subcarriers thus the subcarrier spacing, Δ _{sub} within their fragments.
As an example, let us consider that there are only two operators participating in the shared spectrum access communications, and the available spectrum for sharing in contiguous. If both the operators have same applications types, e.g., cellular communications and ρ _{1}=ρ _{2}=0.5 with α _{1}=0, α _{2}=1, respectively. The GSC calculates the active priority measures \(\rho _{1}^{\text {act}}\) and \(\rho _{1}^{\text {act}}\) in accordance with the traffic demands from the operators and sharing rules. The GSC then partitions the shareable spectrum into two fragments with respect to \(\rho _{1}^{\text {act}}\) and \(\rho _{1}^{\text {act}}\) and allocates the lower end fragment of size \(\delta _{1}^{\text {act}}\Delta _{\text {sub}}\) Hz to operator 1 and the upper end fragment of size \(\delta _{2}^{\text {act}}\Delta _{\text {sub}}\) Hz to operator 2. However, if α _{1} and α _{2} are equal, then the GSC randomly assigns the ends of the spectrum to the operators. If the communications scenario is such that the type of applications and technologies one of the operators operates on, e.g., shorterrange communications, prefers higher end fragment to upper end fragment, the GSC will probably allocate the higher end fragment to that particular operator, even if the other operator seeks the same end. Therefore, fragmentationbased spectrum sharing is a situationspecific mechanism.
As we have already mentioned in the previous sections, the GSC can allocate the shared spectrum among the operators based on fragmentation depending on the operators’ desired minimum fragment size and channel quality information. A fragment is defined as a contiguous band, and its bandwidth must be an integer multiple of the subcarrier bandwidth Δ _{sub} and complies with B _{low} and other system parameters. It is worth mentioning that if the fragmentationbased spectrum sharing is employed, then each operator has the flexibility to employ independent radio interface, flexible DFT size, etc. The work in [30] considers a spectrum sharing scenario where different operators employ different radio interfaces, i.e, waveforms. It is also possible to allocate different fragments from noncontiguous bands if the radio interface supports it [31]. If the operators are not synchronized in a way that operators of adjacent spectrum do not transmit at the same time, guard bands are created around each fragment to protect other operators from its outofband emission. The minimum size of the fragments depends on the desired guard band overhead, which in turn, depends on the pulse shape being used for data modulation.
Each operator can claim a minimum fragment size to limit the overall guardband overhead given as \(\frac {B_{\text {guard}}}{B_{\text {frag}}}\), where B _{guard} is the total amount of spectrum belonging to all the guardbands and B _{frag} is the total amount of frequency spectrum belonging to all usable fragments. If the fragment size is too small, the guardband overhead would be too large. This is calculated based on its waveform especially the outofband emission level. From that, the operator calculates the required guardband, and considering the guardband size, the operator then claims a minimum fragment size. The GSC performs the fragmentation according to the traffic loads of each operator and may also depend on the preferred fragments of each operator.
Each operator transmits a signal in the allocated spectrum fragments by activating and deactivating subcarriers of the signal, i.e., only the subcarriers within the allocated spectrum fragments are activated, while the others are not. Since different operators do not necessarily have accurate mutual synchronization, the outoffragment radiation power of the signals of each operator has to be taken into account, which causes interference to the other operators. We also consider accurate interoperator synchronization that can be realized in downlink if the spectrum sharing operators share the radio access network or through GPS modules used in the base stations. In this proposed system model, each operator can transmit data to its own serving users independently without creating interference (assuming perfect synchronization among the operators or adequate guardbands between the fragments if fragmentation based spectrum sharing is employed) to the users served by other operators.
Both of the proposed interoperator spectrum sharing solutions are suboptimal. In subcarrier or resource block based resource sharing optimization, the solution aims at optimizing the total system throughput and resource allocation is obtained through an iterative process instead of optimal exhaustive search in order to reduce the computational burden and ensures fairness among the operators as well as the users. In fragmentationbased spectrum sharing optimization, GSC judiciously evaluates the sharing rules and the informations received from the operators and allocates the favorable spectrum fragments accordingly. Note that GSC does not follow any strict mathematical process; instead, it takes dynamic and situationspecific measures to decide the fragment allocation.
Solution for intraoperator resource allocation
Soon after receiving the information about spectrum allocations from the GSC, each operator performs intraoperator resource allocation for the users with dissimilar service requirements. In practice, the regulatory scenario enforces a total transmitting or radiated power constraint. Therefore, the base stations of each operator work under maximum transmitting power constraint while satisfying its own users’ service requirements. Note that there can be several base stations under one operator. In this study, we consider that each operator has only one base station to make the analysis simple and straightforward. Note that it is enough to consider resource allocation optimization for any particular operator since base station can transmit data to its own serving users independently without creating interference (with perfect synchronization or adequate guardbands between the fragments) to the users served by other operators.
The main objective of resource allocation optimization in this section is to perform efficient resource allocation for users with DC and NDC service requirements under total transmitting power constraint. Let us consider the resource allocation for operator n, for which \(\mathcal {S}_{n}=L_{n}\), and K _{1} users out of K _{ n } users belong to NDC service requirements while K _{ n }−K _{1} users require DC services under the maximum transmitting power constraint \(P^{(n)}_{\text {Max}}\). For notational brevity, we ignore the operator index n in the following presentation of the paper. Let us define \(\mathcal {K}\) and \(\mathcal {L}\) as the sets of {1,2,⋯,K} and {1,2,⋯,L}, respectively. Now, the resource allocation optimization problem can be cast as 0–1 optimization problem, which is given by
where \(R_{k}^{\text {target}}\) is the desired throughput of DC user k. A solution to this problem looks for a partition of groundset {1,2,⋯,L} into K subsets such that the measure associated with the subsets, P _{Max} fulfills some bounds. Note that the problem in (7) is nonlinear since we have multiplication of variables in constraints and in the objective function. Also, we need to deal with the integer variables because of nondivisibility of resources (subcarriers); thus, it is an nonconvex MINLP. Nonlinear constraints are more difficult to handle. Therefore, it is very advantageous to incorporate linear constraints. In our proposed solution, we restrict our optimization model to contain only linear constraints. In the following, we formulate several linearization approaches to transform (7) into a convex program, which is easier to solve than solving an MINLP since combining both nonlinearity and integrality can lead the MINLP to be undecidable [32].
For notational brevity and simplified analysis, we define a set \(\mathcal {M}\) that contains all the tuples of the indices, i.e., {k,l} as {{1,1},⋯,{1,L},⋯,{k,1},⋯,{k,L},⋯,{K,1},⋯,{K,L}}, where \(\mathcal {M}_{t}\) denotes the tth tuple in \(\mathcal {M}\). The corresponding indices in the tth subset are defined as {k,l}={⌈t/L⌉,t−((⌈t/L⌉−1)L)}, where ⌈·⌉ is the ceiling operator. Similarly, we vectorize the elements h _{ k,l }, c _{ k,l } and p _{ k,l }, ∀k,l, in h, c and p, respectively, in accordance with the sequences of the indices in \(\mathcal {M}\). Now, we can rewrite the objective function as
Now, due to the monotonicity of logarithmic function, i.e., if x>y, log_{2}(x)>log_{2}(y), the log function in the subsequent optimization problems can be eliminated. We can rewrite the objective function in (8) as \(\underset {\{{{c}_{\mathcal {M}_{t}}},{{p}_{\mathcal {M}_{t}}}\}}{\mathop {\max }}\,\hspace {3mm} \prod \limits _{t=1}^{K_{1}L}{(1+{p}_{\mathcal {M}_{t}}{h}_{\mathcal {M}_{t}})}^{{c}_{\mathcal {M}_{t}}}\), and consequently, the optimization problem in (7) can be expressed as
The objective function is still nonlinear in its current form. However, note that since \({c}_{\mathcal {M}_{t}}\in \{0,1\}\), we have the flexibility to transform each multiplicative term in the objective function, \((1+{p}_{\mathcal {M}_{t}}{h}_{\mathcal {M}_{t}})^{{c}_{\mathcal {M}_{t}}}\) as
Obviously, this is not true for all \({c}_{\mathcal {M}_{t}}\), it is true only for binary \({c}_{\mathcal {M}_{t}}\), which is the case here. We take advantage of this transformational relationship in the linearization process. For each t, we create a new variable \({\xi }_{\mathcal {M}_{t}}\), and then add the constraints as given below
Consider the first case \({c}_{\mathcal {M}_{t}}=0\), which means the value of \((1+{p}_{\mathcal {M}_{t}}{h}_{\mathcal {M}_{t}})^{{c}_{\mathcal {M}_{t}}}\) should be 1. The linear constraint \({\xi }_{\mathcal {M}_{t}}\le 1+{\text {min}}\{{p}_{\mathcal {M}_{t}},P_{\text {Max}}{c}_{\mathcal {M}_{t}}\}{h}_{\mathcal {M}_{t}}\) in (11) forces \({\xi }_{\mathcal {M}_{t}}\) to be ≤ 1. Now, let us consider the case \({c}_{\mathcal {M}_{t}}=1\), now the quantity should be equal to \(1+{p}_{\mathcal {M}_{t}}{h}_{\mathcal {M}_{t}}\). Similarly, the constraint in (11) enforces the quantity \({\xi }_{\mathcal {M}_{t}}\) to be \(\le 1+{p}_{\mathcal {M}_{t}}{h}_{\mathcal {M}_{t}}\). The reason for putting a “ ≤” sign in (11) instead of the “ =” sign is to obtain a convex feasible region since a constraint in the form of “linear/affine ≥ concave” generates a nonconvex feasible region, which is a major problem. However, at the optimum, the inequality turns out to be an equality. The geometry of the linearization process of constraint C3 is depicted in Fig. 4 a. The blue circles represent the exact or expected values of the variable \({\xi }_{\mathcal {M}_{t}}\) for two different cases (\({c}_{\mathcal {M}_{t}}=0\) and \({c}_{\mathcal {M}_{t}}=1\)). The red lines show the range of values the variable can take when linearization is employed.
Furthermore, maximization of the new objective function, \(\prod \limits _{t=1}^{K_{1}{L}}{{\xi }_{\mathcal {M}_{t}}}\) and maximization of \( \left (\prod \limits _{t=1}^{K_{1}{L}}{{\xi }_{\mathcal {M}_{t}}}\right)^{1/K_{1}{L}}\) will give the same values for the optimization variables. So, we can recast the optimization problem in (9) as the following
along with the constraints C1–C5 in (9). Now, the objective of the optimization problem in (12) becomes a concave function.
Now, let us turn our focus to the linearization of the constraint C4 in (9). Here, \({c}_{\mathcal {M}_{t}}\) (binary integer) and \({p}_{\mathcal {M}_{t}}\) (continuous) are variables in this mathematical program, and we have to deal with their product \({c}_{\mathcal {M}_{t}}{p}_{\mathcal {M}_{t}}\). If both the variables were continuous, we would have ended up having a quadratic problem, which may create issues with convexity if the quadratic terms appear in constraints. However, constraint C4 is special in the sense that at least one of \({c}_{\mathcal {M}_{t}}\) and \({p}_{\mathcal {M}_{t}}\) is binary, and the other variable is bounded. Under these assumptions, the product \({c}_{\mathcal {M}_{t}}{p}_{\mathcal {M}_{t}}\) can be linearized by introducing new slack variables \({\lambda }_{\mathcal {M}_{t}}\) and incorporating the following additional linear constraints
Therefore, we linearize each term in the sum separately. This way we end up with K N of the λ variables, for example \({\lambda }_{\mathcal {M}_{t}}\). The steps followed in the linearization of constraint C4 are:

Introducing a variable \({\lambda }_{\mathcal {M}_{t}}={c}_{\mathcal {M}_{t}}{p}_{\mathcal {M}_{t}}\) for each product.

Finding upper and lower bounds for each \({p}_{\mathcal {M}_{t}}\).

Introducing the constraints for each \({\lambda }_{\mathcal {M}_{t}}\) as in (13).

Substituting the \({\lambda }_{\mathcal {M}_{t}}\) variables into the constraint \(\sum \limits _{t=1}^{{K}{L}}{c}_{\mathcal {M}_{t}}{p}_{\mathcal {M}_{t}}=P_{\text {Max}}\).
Therefore, due to the linearization of C4, we have these following linear constraints to be incorporated in the optimization problem.
Consider the first case \({c}_{\mathcal {M}_{t}}=0\), which means the product \({\lambda }_{\mathcal {M}_{t}}={c}_{\mathcal {M}_{t}}{p}_{\mathcal {M}_{t}}\) should be 0. The first pair of inequalities (N1, N2) says \(0\le {\lambda }_{\mathcal {M}_{t}}\le 0\), forcing \({\lambda }_{\mathcal {M}_{t}}=0\). The second pair of inequalities (N3, N4) says \({p}_{\mathcal {M}_{t}}P_{\text {Max}}\le {\lambda }_{\mathcal {M}_{t}} \le {p}_{\mathcal {M}_{t}}\), and \({\lambda }_{\mathcal {M}_{t}}=0\) satisfies those inequalities. Now, consider the case \({c}_{\mathcal {M}_{t}}=1\), so that the product should be \({\lambda }_{\mathcal {M}_{t}}={p}_{\mathcal {M}_{t}}\). The first pair of inequalities becomes \(0 \le {\lambda }_{\mathcal {M}_{t}} \le P_{\text {Max}}\), which is satisfied by \({\lambda }_{\mathcal {M}_{t}}={p}_{\mathcal {M}_{t}}\). The second pair says \({p}_{\mathcal {M}_{t}} \le {\lambda }_{\mathcal {M}_{t}} \le {p}_{\mathcal {M}_{t}}\), forcing \({\lambda }_{\mathcal {M}_{t}}={p}_{\mathcal {M}_{t}}\) as desired. This linearization approach, in particular, equates to splitting the feasible regions into two subregions, one where \({c}_{\mathcal {M}_{t}}=0\) and \(f({c}_{\mathcal {M}_{t}},{p}_{\mathcal {M}_{t}})={c}_{\mathcal {M}_{t}}{p}_{\mathcal {M}_{t}}=0\) (trivially linear) and the other where \({c}_{\mathcal {M}_{t}}=1\) and \(f({c}_{\mathcal {M}_{t}},{p}_{\mathcal {M}_{t}})={p}_{\mathcal {M}_{t}}\) (also linear).
The geometry of the linearization process of constraint C4 is depicted in Fig. 4 b. The blue circles represent the expected values of the optimization variable \({\lambda }_{\mathcal {M}_{t}}\). The gray shaded areas represent the range of values that the variable can take due to linearization process. The red circles stands for the obtained values of the optimization variable. Note that the expected and obtained values of \({\lambda }_{\mathcal {M}_{t}}\) are perfectly matched, i.e., exact linearization is obtained.
Now, we are left with the constraint C5 of (9), which is also nonlinear. Following the relationship in (10), constraint C5 can be stated as
which further can be equivalently stated as the following
where the left side of (16) is the geometricmean of the optimization variables \({\xi }_{\mathcal {M}_{t}}\) and it is concave. After performing linearization and/or convexification of the nonlinear constraints (outer approximating the feasible region) and the objective function, the MINLP optimization problem in (7) now becomes a convex, which is comparatively much easier to solve.
Performance analysis
In all simulation results presented in this section, the wireless channel is modeled as a frequencyselective channel consisting of six independent Rayleigh multipaths. The multipath components are modeled by Jakes’ flat fading model [33]. The power delay profile is exponentially decaying with e ^{−αl} with α=1(decay factor), where l defines the multipath index. A maximum delay spread of 5 μs and maximum doppler of 30 Hz are assumed. The relative power of the six multipath components are [0, −4.35, −8.69, −13.08, −17.43, −21.78] dB. The power spectral density of AWGN is −170 dBm/Hz. We also assume that the width of the shared spectrum is 10 MHz and it is contiguous. A common subcarrier grid is generated with 512 subcarriers and the operators employ OFDMA for carrying users’ data. In the performance analysis for fragmentbased spectrum allocation, all the operators employ same subcarrier spacing and radio interfaces with OFDM waveforms, however, the DFT sizes vary depending on the sizes of frequency fragments (i.e., depending on the number of subcarriers as fragments are integer multiples of subcarrier bandwidth) the operators are assigned with. For example, let us say, during one scheduling, the cardinalities of the sets of subcarriers (contiguous) assigned to three spectrum sharing operators are given by \(\mathcal {S}_{1}=112\), \(\mathcal {S}_{2}=213,\) and \(\mathcal {S}_{3}=187\). Then, the DFT sizes employed by operator 1, operator 2, and operator 3 are 128, 256, and 256, respectively. Note that the DFT size is chosen as a power of 2 greater than or equal to the number of subcarriers one operator is assigned with. On the other hand, in subcarrier gainbased allocation, all the operators employ a DFT size of 512 irrespective of the number of subcarriers each operator is assigned with since all the operators operate over the whole shared spectrum. Each BS may perform subchannelization of the subcarriers it is assigned with for intraoperator resource allocation if data transmission occurs in terms of resource block. Note that we compare the performance of subcarrier and fragmentationbased spectrum sharing in terms of achieved throughput. Standard waterfilling algorithm is followed to distribute the power optimally among the subcarriers per user per operator. The nonlinear optimization solver KNITRO [34] along with mathematical programming modeling language AMPL [35] have been employed to solve the intraoperator resource allocation optimization problem.
In Fig. 5, we have investigated the impact of varying the number of spectrum sharing operators on achieved system throughput and compared the performances of subcarrier gainbased and fragmentationbased spectrum sharing. It can be clearly seen that subcarrierbased spectrum distribution achieves higher throughput, and the performance gap increases as the number of operators is increased under a given set of subcarriers. This is due to there fact that when a large number of operators participate in the shared spectrum access communication, the multiuser diversity improves. Compared to the fragmentationbased spectrum sharing, subcarrierbased spectrum sharing has higher flexibility in allocating the subcarriers to the operators, i.e., to the users who have the highest gains for the subcarriers. The only disadvantageous fact about the subcarrierbased distribution is that the GSC needs to send each operator the indices of the subcarriers, which, in turn, increases the backhaul load. It is worthy to mention that for the performance evaluation in Fig. 5, we have considered a spectrum sharing scenario where all the operators are overloaded and \(\phantom {\dot {i}\!}\rho _{1}=\rho _{2}=\cdots =\rho _{N_{\text {op}}}\). Therefore, when there are two operators sharing the spectrum, all the available subcarriers are assigned to two operators equally. When there are more (>2) operators, the available spectrum is assigned to the operators in accordance with the sharing rules and active priority measures. We have already mentioned that the operators have the flexibility in employing independent radio interface, e.g., multicarrier waveform, DFT size. Under this circumstance, the operators employ varying DFT sizes depending on the numbers of subcarriers they are assigned with.
In Fig. 6, we study the impact of multiuser diversity on shared spectrum access system in terms of difference in achieved throughputs between the subcarrier gainbased and fragmentationbased spectrum sharing solutions by varying the number of operators and also the number of users per operator. We can clearly distinguish three distinct regions on this figure: (i) region 1 is determined by the steepest ascent in the performance gap curves and it corresponds to scenarios in which there are few users per operator; (ii) region 3 is determined by the steepest descent in the performance gap curves and corresponds to scenarios in which the number of users per operator is (almost) maximum; (iii) region 2 lies within region 1 and region 3 and corresponds to the scenarios most likely found in real systems. Region 1 and region 3 can be treated as boundary regions where both of the proposed spectrum sharing approaches perform almost equally or where the gap is small. That is to say, region 1 represents the, unlikely yet possible, scenario in which a single user gets assigned with all the subcarriers belonging to its operator, for both the subcarrierbased and fragmentbased approaches. On the other hand, region 3 should be thought as the scenario in which there are as many users as the number of available subcarriers and each user is assigned with a single subcarrier.
Note the the higher gap between the subcarrierbased and fragmentbased allocation methods is achieved when the system has more spectrum sharing operators. This is due to the fact that the set size of available subcarriers inherent to each allocation method decreases with different rates as the number of spectrum sharing operators grows. For instance, although there is throughput improvement due to multiuser diversity under the fragmentbased solution, such improvement is significantly affected as each operator gets assigned with a smaller fragment due to the existence of more operators. Therefore, from the whole spectrum sharing communication system perspective, the maximum gap depends on the size of the subcarrier grid, sharing parameters \(\phantom {\dot {i}\!}\{\rho _{1},\rho _{2},\cdots,\rho _{N_{\text {op}}}\},\) and the number of spectrum sharing operators. For any particular operator, the gap will solely depend on the set size of the subcarriers it is assigned with and the number of users the operator serves. We can still observe that the analysis shown in Fig. 6 could be useful for an entity managing the shared spectrum in order to make a judicious selection of allocation method. For instance, suppose that the aforementioned GSC decides that a performance gap within 1 bps/Hz is acceptable. In a region where three operators having up to 20 users each share the licensed spectrum, the fragmentation based allocation method should be utilized since the performance requirement is satisfied with reduced computational time.
We evaluate the achieved spectrum efficiency by employing the proposed linearizationbased intraoperator resource allocation approach for users with DC and NDC service requirements in Fig. 7 and compare it with the original MINLPbased solution and other existing methods. Here, two out of the total four users have DC service requirements of 1.4 and 1.6 bps/Hz, respectively. Note that the spectrum efficiencies achieved by solving the original MINLP problem and proposed approach are very close. The upper bound curve is obtained by solving the proposed method in [22]. The solution gives an upper bound on the achievable maximum sum rate of all NDC users under the individual rate requirement for each DC user and the total transmit power constraint. But, the proposed convex relaxation technique in [22] permits timesharing of each subchannel; therefore, the system model differs from the original OFDMA system since it does not perform mutually exclusive subchannel assignment. If we strictly follow nonoverlapping subcarrier allocation, the correct bound is MINLP solution. That is to say that the optimal solution of the MINLP is also the optimal solution of the linearized problem, i.e., the upper bound is given by the MINLP solution. In other words, for integer programming problems (i.e., \(c_{\mathcal {M}_{t}}\in \{0,1\}\)), MINLP solution evolves as the upper bound.
Exact solution of the linearized and convex optimization problem depends on factors like tolerance of the feasibility error and relative optimality tolerance of the solver. Smaller values of absolute feasibility tolerance and relative optimality tolerance result in a higher degree of accuracy in the solution with respect to the feasibility and optimality, respectively, but the solution will be more expensive. We have kept the default values for tolerance of the feasibility error and optimality error, which is 1.0e −6 for both the cases. As this value is quite small, even if we cannot guarantee the optimality, we can at least claim that the solution provided by the solver is very close to the optimal solution.
It can be noticed that there exists a difference in performance between the original MINLP and linearized program solutions. One possible reason for this performance gap is that although in Fig. 4 b we certainly obtain perfect matching of the expected and obtained values of the slack variables, we may not obtain such perfect matching in Fig. 4 a. Furthermore, it should be noted that the obtained values of the slack variables in Fig. 4 a are always lower than the expected/maximum values. Therefore, when the MINLP is solved, it is very likely that the expected values will be obtained. However, when the linearized problem is solved, the obtained values may not always match the expected values. Since, the obtained values are always ≤ the expected values, there may exist a difference in performance of the linearized/convexified and MINLP solutions. In order to find the probable cause responsible for this gap, we followed the following concept: after optimization, if the slack variable ξ is strictly smaller than the right side of (11), it would be easy to increase ξ until the inequality in (11) becomes an equality. This would eventually benefit the objective function, and it would not violate any constraint. The constraint C5 in (16) will even benefit from an increase of ξ. However, we found that the constraint in Eq. (11): \({\xi }_{\mathcal {M}_{t}}\le 1+{\text {min}}\{{p}_{\mathcal {M}_{t}},P_{\text {Max}}{c}_{\mathcal {M}_{t}}\}{h}_{\mathcal {M}_{t}}\) is not that main cause of the performance loss. Interestingly, we noticed that the values of \({\xi }_{\mathcal {M}_{t}} {\text {min}}\{{p}_{\mathcal {M}_{t}},P_{\text {Max}}{c}_{\mathcal {M}_{t}}\}{h}_{\mathcal {M}_{t}}\) are very close to 1 and, even after increasing ξ until the inequality in (11) becomes an equality, does not really help much in improving the gap. Thus, this gap may be the consequence of numerical inaccuracies of the solver we employed.
From the point of view of computational complexity of the intraoperator resource allocation problem, as far as the worstcase complexity goes, MINLP problems are provably unsolvable [32], but linearized problems are solvable (sometimes, perhaps not very quickly). Furthermore, nonlinear programming is more difficult than linear programming, especially when the feasible region is nonconvex since it can be hard to determine which points are actually optimal. Therefore, if we have a choice, a linearized formulation is probably a better choice because the constraints are easier to deal with, and the LP relaxation gives an LP optimum. However, it is not straightforward to prefer one formulation over the other just based on computational complexity. One should however make such decisions based on a judicious analysis of existing tools and algorithms and perform experiments to find out the most efficient approach. In general, in the current stateoftheart, the linearized formulation tends to win.
Conclusions
In this paper, we considered a shared spectrum access communication system and proposed suboptimal solutions both for interoperator and intraoperator resource allocation problems. For interoperator spectrum allocation, two efficient algorithms (subcarrier and fragmentation based) are proposed that take care of the mutual sharing policy and fairness issues. Subcarrierbased spectrum allocation scheme has been found to be more efficient in terms of achieved throughput. However, fragmentationbased allocation scheme is more suitable in terms of computational complexity. For the intraoperator resource (spectrum and power) allocation problem, we considered resource allocation for a system with users with delay constraint service requirements and formulated computationally efficient (if not, at least solvable) solutions based on some linearization techniques (exact linearization or linear approximations) considering the structures of the optimization problems and the constraints. The performances of the proposed solutions are impressive when compared to the original MINLP and other existing solutions.
In the current status of the proposed spectrum sharing algorithms, we have not considered the loss of spectral efficiency due to additional guardband being used by the operators that employ inefficient waveforms. Using spectrally inefficient waveforms by some of the operators would decrease the overall shared spectrum access spectral efficiency and at the same time, the GSC could be unfair to the operators who employ spectrally efficient waveforms. Therefore, some mechanisms need to be developed to identify the operators and quantify the loss and thus, penalize the operators employing inefficient waveforms accordingly, which will be investigated in our future works.
In order to simplify the user terminal complexity, the availability of large and contiguous spectrum is preferable. User terminal might require to perform aggregation of multiple frequency bands with different characteristics if large contiguous spectrum for sharing is unavailable. Furthermore, the radio frequency front end of the user terminal needs to be tuneable and configurable to operate at a particular frequency band depending on shareable spectrum availability for its operator to support different spectrum of operation. Therefore, designs of frequency agile front end for user terminal and flexible air interface for supporting dynamic usage of spectrum need to be investigated.
References
 1
T Irnich, J Kronander, Y Selen, G Li, in IEEE International Symposium Personal Indoor Mobile Radio Communications. Spectrum sharing scenarios and resulting technical requirements for 5G systems, (2013), pp. 127–132.
 2
M Matinmikko, H Okkonen, M Palola, S Yrjola, P Ahokangas, M Mustonen, Spectrum sharing using licensed shared access: the concept and its workflow for LTEadvanced networks. IEEE Trans. Wireless Commun. 21(2), 72–79 (2014).
 3
S Yrjola, E Heikkinen, in IEEE International Conference on Cognitive Radio Oriented Wireless Networking and Communications. Active antenna system enhancement for supporting Licensed Shared Access (LSA) concept, (2014), pp. 291–298.
 4
M Mustonen, T Chen, H Saarnisaari, Matinmikko M, S Yrjola, M Palola, Cellular architecture enhancement for supporting the european licensed shared access concept. IEEE Trans.Wireless Commun. 21(3), 37–43 (2014).
 5
J KhunJush, P Bender, B Deschamps, M Gundlach, in ETSI Workshop on Reconfigurable Radio Systems. Licensed shared access as complementary approach to meet spectrum demands: benefits for next generation cellular systems, (2012), pp. 1–5.
 6
M Gundlach, J Hofmann, C Markwart, E Mohyeldin, in IEEE International Workshop on Cognitive Cellular Systems. Recent advances on LSA in standardization, regulation, research and architecture design, (2014), pp. 1–5.
 7
M Abitbol, PJ Muller, in IEEE International Symposium on Dynamic Spectrum Access Networks. Licensed Shared Access: an innovation in European radio spectrum policy, (2014), pp. 259–262.
 8
M. D Mueck, V Frascolla, B Badic, in IEEE International Workshop on Cognitive Cellular Systems. Licensed Shared Access—stateoftheart and current challenges, (2014), pp. 1–5.
 9
M Palolo, T Rautio, M Matinmikko, J Prokkola, M Mustonen, M Heikkila, T Kippola, S Yrjola, V Hartikainen, L Tudose, A Kivinen, J Paavola, J Okkonen, M Makelainen, T Hanninen, H Kokkinen, in IEEE International Conference on Cognitive Radio Oriented Wireless Networking and Communications. Licensed Shared Access (LSA) trial demonstration using real LTE network, (2014), pp. 498–502.
 10
P Ahokangas, M Matinmikko, S Yrjola, M Mustonen, H Posti, E Luttinen, A Kivimaki, in IEEE International Symposium on Dynamic Spectrum Access Networks. Business models for mobile network operators in Licensed Shared Access (LSA), (2014), pp. 263–270.
 11
E Perez, K. J Friederichs, I Viering, D. J Naranjo, in IEEE International Conference on Cognitive Radio Oriented Wireless Networking and Communications. Optimization of authorised/licensed shared access resources, (2014), pp. 241–246.
 12
J Luo, J Eichinger, Z Zhao, E Schulz, in IEEE International Symposium on Dynamic Spectrum Access Networks. Multicarrier waveform based flexible interoperator spectrum sharing for 5G systems, (2014), pp. 449–457.
 13
L Anchora, L Badia, E Karipidis, M Zorzi, in International Symposium on Wireless Communications Systems. Capacity gains due to orthogonal spectrum sharing in multioperator lte cellular networks, (2012), pp. 286–290.
 14
H Kamal, M Coupechoux, P Godlewski, in IEEE International Symposium on Personal Indoor Mobile Radio Communications. Interoperator spectrum sharing for cellular networks using game theory, (2009), pp. 425–429.
 15
M Bennis, S Lasaulce, M Debbah, Interoperator spectrum sharing from a game theoretical perspective. EURASIP J. Adv. Signal Process. 2009:, 295739 (2009).
 16
W Rhee, JM Cioffi, in IEEE Vehicular Technology Conference. Increase in capacity of multiuser OFDM system using dynamic subchannel allocation, (2000), pp. 1085–1089.
 17
J Jang, KB Lee, Transmit power adaptation for multiuser OFDM systems. IEEE J. Selected Areas Commun. 21(2), 171–178 (2003).
 18
W Yu, R Lui, Dual methods for nonconvex spectrum optimization of multicarrier systems. IEEE Trans. Wireless Commun. 54(7), 1310–1322 (2006).
 19
DWK Ng, ES Lo, R Schober, Energyefficient resource allocation in multicell OFDMA systems with limited backhaul capacity. IEEE Trans. Wireless Commun. 11(10), 3618–3631 (2012).
 20
CY Wong, RS Cheng, KB Lataief, RD Murch, Multiuser OFDM system with adaptive subcarrier, bit, and power allocation. IEEE J. Selected Areas Commun. 17:, 1747–1758 (1999).
 21
C Bae, DH Cho, Fairnessaware adaptive resource allocation scheme in multihop OFDMA systems. IEEE Commun. Lett. 11:, 134–136 (2007).
 22
M Tao, YC Liang, F Zhang, Resource allocation for delay differentiated traffic in multiuser OFDM systems. IEEE Trans. Wireless Commun. 7(6), 2190–2201 (2008).
 23
YM Tsang, RS Cheng, in IEEE Wireless Communications and Networking Conference. Optimal resource allocation in SDMA/MIMO/OFDM systems under QoS and power constraints, (2004).
 24
Z Hu, G Zhu, Y Xia, G Liu, in IEEE Wireless Communications and Networking Conference. Multiuser subcarrier and bit allocation for MIMOOFDM systems with perfect and partial channel information, (2004), pp. 1188–1193.
 25
P Xia, S Zhou, G Giannakis, Adaptive MIMOOFMA based on partial channel state information. IEEE Trans. Signal Process. 52:, 202–213 (2004).
 26
Z Shen, JG Andrews, BL Evans, Adaptive resource allocation in multiuser OFDM systems with proportional data rate fairness. IEEE Trans. Wireless Commun. 4(6), 2726–2737 (2005).
 27
IC Wong, Z Shen, J. G Andrews, B. L Evans, in IEEE International Workshop on Signal Processing Systems. A low complexity algorithm for proportional resource allocation in OFDMA systems, (2004).
 28
S Sadr, A Anpalagan, K Raahemifar, in IEEE Vehicular Technology Conference. A novel subcarrier allocation algorithm for multiuser OFDM system with fairness: User’s perspective, (2007), pp. 1772–1776.
 29
C Mohanram, S Bhashyam, A suboptimal joint subcarrier and power allocation algorithm for multiuser OFDM. IEEE Commun.Letts. 9(8), 685–687 (2005).
 30
MG Kibria, GP Villardi, K Ishizu, F Kojima, in IEEE Wireless Personal Multimedia Communications. Coexistence of systems with different multicarrier waveforms in LSA communications, (2015), pp. 1–5.
 31
J McMenamy, I Macaluso, N Marchetti, L Doyle, in IEEE International Symposium on Dynamic Spectrum Access Networks. A methodology to help operators share the spectrum through an enhanced form of carrier aggregation, (2014), pp. 334–345.
 32
RC Jeroslow, There cannot be any algorithm for integer programming with quadratic constraints. Oper Res. 21(1), 221–224 (1973).
 33
TS Rappaport, Wireless Communications: Principles and Practice (NJ: PrenticeHall, Upper Saddle River, 2002).
 34
RH Byrd, J Nocedal, RA Waltz, KNITRO: an integrated package for nonlinear optimization, largescale nonlinear optimization, vol. 83 (SpringerVerlag, 2006).
 35
R Fourer, DM Gay, BW Kernighan, AMPL: a modeling language for mathematical programming. Manag. Sci.36:, 519–554 (1990).
Acknowledgements
This research was conducted under a contract of R&D for radio resource enhancement, organized by the Ministry of Internal Affairs and Communications, Japan.
Competing interests
The authors declare that they have no competing interests.
Author information
Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Kibria, M.G., Villardi, G.P., Ishizu, K. et al. Resource allocation in shared spectrum access communications for operators with diverse service requirements. EURASIP J. Adv. Signal Process. 2016, 83 (2016). https://doi.org/10.1186/s1363401603818
Received:
Accepted:
Published:
Keywords
 Shared spectrum access
 Resource allocation
 Delay constraint service
 NLP relaxation
 Linear approximation