- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Journal of Computer Networks and Communications
Volume 2012 (2012), Article ID 510942, 9 pages
Cognitive Code-Division Channelization with Admission Control
1Department of Electrical Engineering, The State University of New York at Buffalo, Buffalo, NY 14260, USA
2ANDRO Computational Solutions, 7902 Turin Road Bldg. 2, Rome, NY 13440, USA
Received 14 February 2012; Revised 9 May 2012; Accepted 9 May 2012
Academic Editor: Enrico Del Re
Copyright © 2012 Kanke Gao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We consider the problem of joint resource allocation and admission control in a secondary code-division network coexisting with a narrowband primary system. Our objective is to find the maximum number of admitted secondary links and then find the optimal transmitting powers and code sequences of those secondary links such that the total energy consumption of the secondary network is minimized subject to the conditions that primary interference temperature constraints, secondary signal-to-interference-plus-noise ratio (SINR) constraints and secondary peak power constraints are all satisfied. This is an NP-hard optimization problem which motivates the development of suboptimal algorithms. We propose a novel iterative algorithm to solve this problem in a computationally efficient manner. Numerical results demonstrate that the proposed algorithm provides excellent solutions that result in high energy efficiency and large admitted percentage of secondary links.
With the explosive demand in wireless service in recent years, radio spectrum has become the scarcest resource for the modern wireless communication industry. Therefore, both spectrum regulation makers and wireless technology specialists endeavor to seek solutions that would increase the amount of available frequency spectrum. With the FCC's report that much of the licensed radio spectrum is highly underutilized , the concept of cognitive radio was proposed as a solution to the spectrum scarcity problem, where secondary (unlicensed) users can opportunistically access the licensed spectrum provided that they do not cause any “harmful” interference to the primary (licensed) network. From the realization point of view, cognitive radio networking can be realized using two approaches: underlay and overlay . Conventional cognitive radio proposals utilize the overlay approach where secondary users (SUs) detect spectrum holes (frequency bands not used by primary users) by sensing the whole spectrum and then transmit over them. In contrast, under the underlay approach, SUs can coexist with the primary users (PUs) as long as interference from SUs does not exceed the tolerable interference temperature at the primary receivers. Spread spectrum technology has been proposed as the most promising technology to maximize frequency reuse by exploiting the underlay approach . Spread spectrum technology allows cognitive code-division users to coexist in parallel in frequency and time with primary users. The major challenge is to admit the maximum number of secondary users to access the spectrum and efficiently allocate power and signature to each secondary user.
Admission control and resource allocation problem can be traced back to the 90’s. In [4, 5], Foschini and Miljanic proposed a distributed asynchronous power control algorithm under predefined signal-to-interference-plus-noise constraints in conventional cellular systems, which converges to the optimal power allocation solution that minimizes the total transmission power. Furthermore, a distributed power control problem under user-specific signal-to-interference-plus-noise ratio (SINR) and power budget constraints was considered in , where distributed constrained power control (DCPC) and asynchronous distributed constrained power control (ADCPC) schemes were developed to maximize the minimum SINR of all users under synchronous and asynchronous power updates, respectively. In [7, 8], admission control problem was studied, and a number of single or multiple transmitter removal algorithms were reported. Among them, stepwise maximum interference removal algorithm (SMIRA) is the most effective one resulting in the smallest outage probability. Recently, interesting research works on admission and power control under the framework of cognitive code-division networks were reported in [9–11]. A centralized algorithm combining geometric programming and tree-pruning method  was presented to allow secondary users to share the spectrum under secondary quality of service (QoS) constraints and a primary interference temperature constraint. In , a gradient descent algorithm was proposed to solve admission control and power allocation jointly. More recently, in , a spectrum underlay cognitive radio network (CRN) was considered, and a low-complexity suboptimal algorithm named interference constraint-aware SMIRA (I-SMIRA) was proposed to maximize the number of admitted SUs. In all the above literature of cognitive code-division networks, no optimization was carried out with respect to code channels (signatures) of secondary users. In contrast, code design for secondary code-division links was considered in [12–14], where SUs coexist with a wideband primary code-division multiple access (CDMA) system. In , a single secondary code-divison link is designed such that it achieves the maximum SINR subject to primary SINR requirements . The extension to the design of multiple secondary code-division links is studied in [13, 14]. In practice, there exist many scenarios where the primary (legacy) users communicate with modulated narrowband signals. Under these scenarios, the design of secondary underlay code-division links still remains an open problem.
To the best of our knowledge, this paper presents the first research work on the problem of establishing secondary code-division links coexisting with a primary narrowband system. Since the wideband transmissions of secondary users generally experience multipath fading, the RAKE matched filter is utilized at the secondary receivers (SRs). Our objective is to maximize the number of admitted secondary links and minimize the total power consumption of active secondary links under the following constraints: (1) SINR constraints at secondary RAKE receivers, (2) interference constraints at the primary receivers (PRs), and (3) peak transmission power constraints at secondary transmitters (STs). This optimization problem is an NP-hard problem, which motivates the development of efficient suboptimal algorithms that provide good solutions. We propose an iterative algorithm to solve this problem which produces a suboptimal solution with excellent cognitive networking performance characteristics in terms of the number of admitted SUs and network energy consumption. We provide numerical results to demonstrate that our proposed algorithm outperforms existing signature design and admission control algorithms previously proposed in the literature.
Within this context, our main contributions in this paper can be outlined as the following. (i)Uncoordinated Code-Division Spectrum Management. Unlike traditional frequency division operations, we consider multiple secondary wideband code-division links coexisting with a primary narrowband system, a scenario which has not been previously addressed. (ii)Joint Power and Code-Channel Allocation. Our optimization framework incorporates code sequence design as an additional optimization dimension/resource. This additional dimension is expected to improve spectrum utilization compared to conventional power optimization approaches considered in [6, 9–11]. (iii)New Removal Criterion. For the admission control problem, we define a new metric that aggregates only the effective violation (both primary interference and secondary SINR violation) from STs, which is different from and more effective than the one proposed in .
The rest of the paper is organized as follows. We present the cognitive code-division network model and formulate the admission control and resource allocation problem in Section 2. The proposed iterative algorithm is described in detail in Section 3. We provide computational complexity analysis in Section 4. In Section 5, simulation results are presented to demonstrate the performance of our proposed algorithm. Concluding remarks are presented in Section 6.
2. System Model and Problem Statement
We consider a primary narrowband system where each primary user holds the license for one of subbands of the spectrum. We assume that of primary users, , are active to transmit from primary transmitters to primary receivers , in each time slot. A secondary network with requesting links between secondary transmitters and secondary receivers , , shares the spectrum with the primary system in a spectrum underlay manner. For notational convenience, we number each secondary and primary transmitter-receiver pair by the indices and , respectively, and refer to them as users. All secondary users are equipped with spread spectrum devices and are expected to simultaneously communicate over the whole spectrum without causing any harmful interference to primary users. Due to the dispersion characteristics of the wireless channel, secondary wideband spread spectrum signals with processing gain are assumed to propagate over multipath (frequency-selective) fading channels with resolvable paths.
After carrier demodulation, chip-matched filtering and sampling at the chip rate over the duration of a multipath extended symbol (bit) period of chips, the received signal at can be represented as where is the bit energy, is the information bit, and () is the normalized signature vector of secondary link , ; represents interference induced by all active PUs; is additive white Gaussian noise (AWGN) at with mean and covariance . In (1), is the multipath channel matrix from to given in the form of where represents th resolvable path coefficient modeled as a Rayleigh-distributed random variable. In order to exploit the multipath diversity, we assume that each SR uses a normalized RAKE-matched filter that collects the signal energy from all the received signal paths for the user of interest, that is, The receiver in this manner achieves the performance of an th order diversity communications system. The output of the RAKE filter is given by where is the “despread” signal of the narrowband primary interference plus noise, which can be seen as zero-mean AWGN with variance . The assumption of AWGN is due to the fact that after despread processing, the power of narrowband primary interference is evenly spread across the broad band of secondary spread spectrum system. The output SINR of the filter can be calculated as where denotes the received bit energy at after its receiver filter and
At the primary narrowband receivers, secondary spread spectrum signals are seen as white noise at each licensed narrowband with constant spectral densities . They are also assumed to experience flat fading on each licensed narrow band. In the spirit of cognitive radio, causing no harmful interference can be evaluated by a metric called interference temperature, which is defined to be the interference from all SUs measured at PRs.
Here, we consider joint maximization of the number of admitted SUs and minimization of total energy consumption in the secondary cognitive radio network (CRN). The objective is to find a joint admission control and resource (i.e., power and signature) allocation scheme that maximizes the number of SUs accessing the spectrum and minimizes the total energy consumption. Minimizing total network energy is an important problem especially when the network has a constraint on the interference it can cause to other neighboring networks. Since our goal is to admit as many users as possible and minimize the energy consumption of the network, we initially formulate the problem as a multiobjective optimization problem with three sets of constraints: (1) SINR constraints at the SRs, (2) interference temperature constraints at PRs, and (3) power budget constraints at the STs. We can now formulate problem, referred to as P, as follows: In , , , is the zero norm of which denotes the number of admitted users, is the indicator function for positive real numbers , and is the path coefficient from to . Inequality (8) represents a set of interference temperature constraints for the PUs. Inequality (9) represents a set of SINR constraints for the SUs. The SU will transmit, if and only if the SINR of that link is greater than or equal to the threshold SINR. If the link is not active, that is, if the user is not admitted, the SINR constraint is automatically satisfied.
The problem is a multiobjective optimization problem (MOP) for which the solution space is represented by a set of Pareto optimal (trade-off) solutions (non-dominated by any other solution) between the two objectives . One technique for solving MOPs is to maximize a (normalized) weighted sum of the objectives where a larger weight represents the objective with higher importance (or priority). However, in our problem, the two objective functions are of different nature, that is, the number of users can only take integer values whereas the total energy can take real values, hence a weighted objective will not be well defined. There are other techniques in the literature to solve MOPs such as evolutionary algorithms , but they may be computationally expensive and are not the focus of this work. Our goal in this work is not to find a set of Pareto optimal solutions. Instead, similar to the weighted objective approach, we prioritize our objectives. Let us consider a scenario where the priority is to minimize the energy consumption of the network. Let denote the set of objective value pairs corresponding to Pareto optimal solutions obtained by solving P. It is easy to see that is a trivial Pareto optimal objective pair, that is, , since it corresponds to zero (minimum) energy consumption in the network. However, our main goal here is to find a solution that corresponds to a large number of admitted SUs that consume the minimum energy possible. In other words, we assign the first objective in (7) higher importance over the other. Therefore, we divide the problem P into two separate single objective optimization problems and solve them in an iterative manner until convergence is obtained. In the next section and subsections therein, we provide the details of our proposed admission control and resource allocation algorithm.
3. Proposed Admission Control and Resource Allocation Algorithm
Since the objective corresponding to the number of admitted users has higher priority, we start the problem by assuming that all requesting secondary links are supported. (A set of secondary links is supported if and only if there exists at least one nontrivial (i.e., power greater than zero) resource allocation solution such that all corresponding constraints in (9)-(10) are satisfied.) In this case, the problem is a single-objective joint power and signature allocation problem. Note that this first problem may or may not admit any feasible solutions. After the first problem is attempted to be solved, we define a new single-objective optimization problem for admission control. This second problem is solved only if the previously obtained power and signature allocation solution viloates the constraints of P or if there is no feasible solution to the first problem. We explain the details of our approach in the next subsections.
3.1. Joint Power and Code-Channel Allocation
Under the assumption that there are SUs that are supported, let P1 denote the new single-objective optimization problem formulated as We note that P1 is a nonconvex optimization problem. Our approach in solving P1 starts with optimizing the secondary signature set assuming that the energy associated with each SU, that is, is fixed and unknown. The signature set optimization does not require the knowledge of . We notice that the secondary SINR constraints in (9) can be equivalently written in the form of where , , and is the matrix of entries defined in (6), . By the Perron-Frobenius theorem , it is well known that there exists a positive vector such that (12) is satisfied with equality if and only if , where is the Perron root of . Note that is an implicit function of secondary signature set . For a given , when (12) is satisfied with equality, it means that the system is using the lowest energy possible to satisfy its SINR constraint. Moreover, smaller means that the system can support a higher SINR requirement. Therefore, intuitively, if we minimize , we provide more room to further reduce to satisfy the given SINR requirement in (12) with equality. Therefore, the signature set can be optimized to minimize to maximize the energy efficiency of the secondary network. Now, we explain our optimization approach as follows. We note that it is difficult to minimize directly. However, from matrix theory on induced norm, we can write the following: Based on the fact that is lower and upper bounded by multiples of , we define a new cost function and we optimize the secondary signature by minimizing using a block coordinate descent algorithm, that is, by iteratively updating one secondary signature at a time. Although is not a tight bound for in general, it is utilized here for two reasons: (1) minimization of can be carried out in a tractable manner, (2) the solutions obtained by minimizing provide good solutions (in fact better solutions than the ones proposed in the literature) as shown by numerical results in Section 5. The signature for secondary link that minimizes is given by where and Let where and denote eigenvector matrix and diagonal eigenvalue matrix of , respectively. If we treat other secondary signatures as fixed parameters, then the optimization (14) takes the equivalent form It is well known that the optimal solution is the eigenvector of with minimum eigenvalue. Therefore, the signature that minimizes (14) is given by It is straightforward to see that the updated objective at is no larger than its value evaluated at . In general, repeating the update iteratively for all the signature sets, the secondary signature set converges because the objective function reduces monotonically after each update and it is lower bounded. In order to deal with ill-conditioned cases where there are multiple stationary (local minimum) points of with the same value, we stop the iterations if there is no significant improvement in the cost function after a certain number of iterations.
After computing the secondary signature set, we consider the constraints in (10) and (12) together and follow the ADCPC algorithm proposed in  to update the transmission bit energy for each secondary link in an iterative manner. The energy update at each iteration is given by Following , it can be shown that the iterative update in (18) converges to a unique vector determined by the fixed-point solution where , is the set of active secondary links and is the solution of (19), referred to as stationary bit-energy vector. In , it was also shown that if the stationary bit-energy vector by (18) meets all secondary SINR constraints in (9), then the secondary SINR constraints are satisfied with equality. The solution of (19) is optimal in terms of energy efficiency provided that all the constraints in (9), (10) of the problem P1 are satisfied.
We should note here that there is a possibility of not having a feasible solution for P1, since it may not be feasible for all secondary links to transmit at the same while satisfying their SINR constraints. In this case, the fixed energy point in (19) will have at least one SU that uses its maximum energy . Whether there is a feasible solution for P1 or not, the admission control procedure which is explained in the next section needs to be followed, since P1 does not incorporate primary interference temperature constraints.
3.2. Admission Control
When the network is dense and the number of requesting secondary links is high, it becomes difficult to support all requesting secondary links simultaneously, that is, the constraints in (8), (9), and (10) may not be simultaneously satisfied for all requesting secondary links. In this case, the problem becomes an admission control problem where the objective is to find the subset of requesting secondary links with the maximum size while satisfying all the constraints in (8), (9), and (10). We now attempt to solve the admission control problem denoted by P2 formulated as The problem of admission control, that is, maximizing the number of admitted SUs was shown to be NP-hard in . The NP-hardness of this problem motivates the development of effective and computationally efficient heuristic algorithms that provide good suboptimal solutions. In fact, not surprisingly, all the admission control algorithms developed in the literature so far are based on such heuristics [7–11]. For P2, rather than using the conventional admission control procedure proposed in , we propose a new removal criterion that effectively incorporates primary interference temperature constraints. We start with following the notations originally proposed in . For every bit-energy vector and subset , let us define We note that indicates the excess interference power caused by ; indicates the excess interference power measured at ; indicates the total excess interference power which all the s in the subset experience. From the results in , we note that We also see that if and only if all secondary links are supported.
The basic idea behind our admission control algorithm is that we iteratively remove the link which violates the constraints in (8), (9), and (10) the most until all the constraints are satisfied. We now explain the algorithm more formally. Due to the fact that the stationary bit-energy vector already satisfies power budget constraints in (10), we consider admission control in three different scenarios.
In Scenario 1, the admission control problem can be equivalently converted into the problem considered in . In this case, SMIRA in  can be used to remove the most violated secondary link one after one until all the constraints in (8), (9), and (10) are satisfied. According to the definition of violation measure in (21), (22), and (23), the removal criterion of SMIRA is to reduce the most by removing the secondary link indexed by given as Intuitively, secondary link is the one that causes the most interference to other secondary links or receives the most interference from other links.
For Scenarios 2 and 3, we define a new metric that quantifies the excess interference power caused by and measured at s as where We note that represents aggregate effective violation caused by at the s for which the primary interference constraints are violated. Note that this metric different than the one proposed in  which incorporates all the effects (even including negative (non)violation effects) from primary transmitters. In Scenario 2, some of the primary interference temperature constraints are violated. Therefore, we remove the secondary link in Scenario 2 as follows: In the last scenario (Scenario 3), we have to aggregate the violation effects of both secondary SINR constraints and primary interference constraints. We propose the following removal criterion for Scenario 3: In fact, denotes the comprehensive excess interference power of secondary link weighted by its transmitting power. By using this criterion, intuitively, the network would potentially reserve the maximum number of secondary links that consume the minimum total energy.
After removing one link at a time, we return to P1 again and attempt to solve P1 and repeat the procedure in an alternating manner. We note that removing one link at a time does not necessarily solve P2, but the whole iterative algorithm solves P1 and P2 jointly as explained in the next section.
3.3. Joint Admission Control and Resource Allocation
The steps of our iterative joint admission control and resource allocation algorithm are summarized as follows. (1)At iteration , set ( is a small constant). (2)Solve P1 using the proposed method in Section 3.1 and go to step 3. If there is no feasible solution for P1, go to step 3 (Note that the number of admitted SUs is updated at each iteration (see Section 3.1).). (3)If the constraints of P (or P2) are violated, remove one link using the proposed method in Section 3.2, set , set and go to step 2. Else stop. Note that the convergence of this iterative algorithm is guaranteed, because, at step 3, the SUs that were previously removed are not reconsidered. In this case, the solution will be suboptimal, however the iterations will eventually converge in the worst case to the point corresponding to the objective pair , that is, the solution that has zero admitted users. Therefore, the maximum number of iterations required for convergence is . The details regarding the steps of our proposed joint admission control and resource allocation algorithm are explained in Algorithm 1.
4. Computational Complexity
The computational cost is evaluated in terms of “FLOP”, which is defined by an additive or a multiplicative operation. The computational complexity of the signature set optimization is dominated by the complexity of the eigen-decomposition for , , which is . Given the optimized signature set, the power allocation is carried out by the iterative procedure in (18) using DCPC and ADCPC algorithms. The complexity of this procedure is of order . Then, we test whether the constraints (9) and (8) (equivalently, (12) and (8)) are satisfied. If the constrains are all met, this pair is output as the optimal solution. Otherwise, the admission control procedure is followed, whose complexity is of order . We repeat the procedure of joint power and code-channel allocation and the procedure of admission control in an alternating manner until all the aforementioned constraints are satisfied (see Algorithm 1). As noted, the maximum number of iterations required for convergence of Algorithm 1 is at . This is due to the greedy nature of the algorithm. At each iteration, one secondary user is removed from the network and that user is not admitted again in the following iterations. Therefore, the total complexity of Algorithm 1 is of order . For comparison purposes, consider the alternative algorithms that use our optimized signature set along with SMIRA and I-SMIRA. The former and the latter have computational complexities of order and , respectively. This suggests that if is equal or close to , then both three algorithms have the same order of computational complexity.
5. Simulation Results
In this section, we provide some simulation results to evaluate the performance of the proposed algorithm. We consider a primary narrowband system with active transmission links and a secondary code-division network with requesting links and processing gain . We assume that each secondary transmission between secondary transmitters and receivers propagates over a multipath channel with resolvable paths where the corresponding channel coefficients are taken to be the magnitude of independent complex Gaussian random variables with mean and variance . The channels between secondary transmitters and primary receivers follow a path loss model with the path-loss exponent of 4, that is, , where denotes the distance between and drawn i.i.d. from a uniform distribution over , and is a constant set to . The SINR threshold and maximum allowable bit energy for secondary links are set to dB and dB, respectively. The maximum tolerable interference temperatures at the primary receivers are all set to , . The variance of AWGN in (1) is set to . We assume that each primary transmitter creates dB () interference on their corresponding (narrow)bands at the secondary receivers. Furthermore, each primary user is assumed to occupy of the whole available bandwidth. Under these assumptions, the total primary interference power at a given secondary receiver equals . As a result, the total primary interference plus noise after RAKE filtering (“despreading”) becomes zero-mean AWGN with variance . Our simulations are based on Monte Carlo random channel realizations.
We compare the performance of the proposed joint resource allocation and admission control algorithm (Section 4) with the following benchmarks. (i) Proposed optimized secondary signature set by (17) with SMIRA; (ii) Proposed optimized secondary signature set by (17) with I-SMIRA; (iii) Karystinos-Pados (KP) bound equality binary signature set [19–21] with I-SMIRA (The binary signature set that achieves KP bound is minimum total-squared correlation optimal. For , when the KP-optimal sequences coincide with the familiar Walsh-Hadamard signature codes.).
In Figure 1, we plot the admitted percentage of secondary links as a function of the SINR threshold of secondary links. We assume that there are requesting secondary links in the network. It is clear from the figure that the proposed optimized secondary signature set results in significant performance improvement with respect to the KP bound equality signature set. Furthermore, the proposed joint resource allocation and admission control algorithm outperforms other three algorithms including the ones using our optimized signature sets with SMIRA and I-SMIRA admission control strategies. The improvement achieved by the proposed algorithm becomes more significant as secondary SINR threshold increases, that is, as secondary QoS requirement becomes more stringent. In Figure 2, we investigate the energy efficiency of the secondary network. Here, we do not include the KP bound equality signature set with I-SMIRA in the comparison due to its relatively low admission rate of secondary links. The proposed algorithm again achieves the highest energy efficiency compared to its counterparts.
Figures 3 and 4 demonstrate the impact of the number of requesting secondary links on the secondary network performance. We fix the secondary SINR threshold to 10 dB and vary the number of requesting secondary links from 10 to 18. Figures 3 and 4 show the average number of admitted secondary links and the average bit energy per secondary link, respectively, versus the number of requesting secondary links. Similarly, the proposed joint resource allocation and admission control algorithm achieves visible improvement against the other two algorithms. We should mention that, when the number of requesting secondary links is small, the performance of the optimized signature set with I-SMIRA is slightly better than the proposed algorithm in terms of average bit energy consumption as seen in Figure 4. This is due to the fact that the proposed algorithm supports more secondary links than I-SMIRA which in turn increases the relative average energy cost when the number of requesting secondary links is small. As the number of secondary requests increases, it is clear that the proposed joint algorithm results in better energy efficiency outperforming other algorithms.
We studied the problem of cognitive code-division networking where secondary users coexist with a narrowband primary system. We formulated the problem as the search for the powers and signatures of secondary links to maximize the number of admitted secondary links and minimize the total power consumption of secondary links under primary interference temperature constraints, secondary SINR constraints, and maximum peak power constraints. We proposed an iterative joint admission control and resource allocation algorithm for this NP-hard optimization problem which provides excellent results by allowing a large number of active secondary links while improving the energy efficiency of the network as shown in the simulation results.
Depending on the operation mode of the primary system (narrowband or wideband), the proposed solution in this paper can be combined with a primary system identification technique followed by an adaptive selection of secondary operation mode between the proposed solution herein and the solution proposed in . Such an adaptive operation mode will ensure that the secondary links can efficiently and effectively share the licensed band in a dynamically changing environment.
This material is based on research sponsored by the Air Force Research Laboratory, under Agreement no. FA8750-11-C-0124. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the Air Force Research Laboratory or the USA Government.
- Federal Communications Commission, “Spectrum policy task force,” Report ET Docket 02-135, 2002.
- Q. Zhao and B. M. Sadler, “A survey of dynamic spectrum access,” IEEE Signal Processing Magazine, vol. 24, no. 3, pp. 79–89, 2007.
- K. Gao, S. N. Batalama, and D. A. Pados, “Bounds on the maximum SINR of binary and quaternary code-division,” IEEE Transactions on Communications, vol. 60, pp. 14–18, 2012.
- G. J. Foschini and Z. Miljanic, “Simple distributed autonomous power control algorithm and its convergence,” IEEE Transactions on Vehicular Technology, vol. 42, no. 4, pp. 641–646, 1993.
- G. J. Foschini and Z. Miljanic, “Distributed autonomous wireless channel assignment algorithm with power control,” IEEE Transactions on Vehicular Technology, vol. 44, no. 3, pp. 420–429, 1995.
- S. A. Grandhi, J. Zander, and R. Yates, “Constrained power control,” Wireless Personal Communications, vol. 1, no. 4, pp. 257–270, 1994.
- J. C. Lin, T. H. Lee, and Y. T. Su, “Power control algorithm for cellular radio systems,” Electronics Letters, vol. 30, no. 3, pp. 195–197, 1994.
- M. Andersin, “Gradual removals in cellular PCS with constrained power control and noise,” Wireless Networks, vol. 2, no. 1, pp. 27–43, 1996.
- Y. Xing, C. N. Mathur, M. A. Haleem, R. Chandramouli, and K. P. Subbalakshmi, “Dynamic spectrum access with QoS and interference temperature constraints,” IEEE Transactions on Mobile Computing, vol. 6, no. 4, pp. 423–433, 2007.
- L. Zhang, Y. C. Liang, and Y. Xin, “Joint admission control and power allocation for cognitive radio networks,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '07), pp. 673–676, Honolulu, Hawaii, USA, April 2007.
- L. Le and E. Hossain, “Resource allocation for spectrum underlay in cognitive radio networks,” IEEE Transactions on Wireless Communications, vol. 7, no. 12, pp. 5306–5315, 2008.
- K. Gao, S. N. Batalama, D. A. Pados, and J. D. Matyjas, “Cognitive code-division channelization,” IEEE Transactions on Wireless Communications, vol. 10, no. 4, pp. 1090–1097, 2011.
- A. Elezabi, M. Kashef, M. Abdallah, and M. Khairy, “CDMA underlay network with cognitive interference-minimizing code assignment and semi-blind interference suppression,” Wireless Communications and Mobile Computing, vol. 9, no. 11, pp. 1460–1471, 2009.
- M. Li, S. N. Batalama, D. A. Pados, T. Melodia, M. J. Medley, and J. D. Matyjas, “Cognitive code-division links with blind primary-users identification,” IEEE Transaction on Wireless Communications, vol. 10, pp. 3743–3753, 2011.
- J. G. Proakis, Digital Communications, McGraw-Hill, New York, NY, USA, 4th edition, 2001.
- S. Boyd and L. Vandenberghe, Convex Optimization, Cambrige University Press, Cambridge, UK, 2004.
- K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms, Wiley, New York, NY, USA, 2001.
- E. Seneta, Non-Negative Matrices, G. Allen, London, UK, 1973.
- G. N. Karystinos and D. A. Pados, “New bounds on the total squared correlation and optimum design of DS-CDMA binary signature sets,” IEEE Transactions on Communications, vol. 51, no. 1, pp. 48–51, 2003.
- C. Ding, M. Golin, and T. Kløve, “Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets,” Designs, Codes, and Cryptography, vol. 30, no. 1, pp. 73–84, 2003.
- V. P. Ipatov, “On the Karystinos-Pados bounds and optimal binary DS-CDMA signature ensembles,” IEEE Communications Letters, vol. 8, no. 2, pp. 81–83, 2004.