Coverage analysis of cell‐edge users in heterogeneous wireless networks using Stienen's model and RFA scheme

In heterogeneous wireless networks, signal‐to‐interference‐plus‐noise ratio (SINR) suffers degradation due to strong interference received by users from offloaded macro base station (mBS). Similarly, cell‐edge users experience low SINR due to their distant locations. Moreover, small base stations (sBSs) located in the vicinity of mBS experience reduced coverage due to the high transmit power of mBS. To overcome these limitations, we use Stienen's model as a base station deployment strategy to improve network performance gain. More specifically, we use reverse frequency allocation (RFA) as an interference management scheme together with Stienen's model to significantly improve SINR, enhance edge user coverage, and avoid sBS deployment near the mBS. In the proposed set‐up, the available coverage region is divided into two noncontiguous regions, ie, center region and outer region. Furthermore, mBSs are uniformly distributed throughout the coverage region using independent Poisson point processes, while sBSs are deployed only in outer region using Poisson hole process (PHP). Closed‐form expressions for coverage probabilities are characterized for the proposed model. Numerical results show that the proposed scheme yields improved SINR with enhanced edge user coverage and requires fewer number of sBSs.     

A Distributed Packet Scheduling Scheme with Interference Avoidance for Non Real-Time Applications in CDMA Networks

In this paper, a packet scheduling scheme based on real-time channel conditions and dominant intercell interferer avoidance is proposed, studied and evaluated for reverse links in a time-slotted code division multiple access (CDMA) system. This scheme is implemented by distribution of tags by receivers among transmitters. Each base station issues M(1) tags to M mobile users based on the ranked reverse link gains in every slot. M=1 corresponds to spread-spectrum time division multiplexing mode operation and M1 corresponds to scheduling multiple simultaneous transmissions as in the traditional CDMA systems. The number of issued tags is a system parameter which depends on the expected traffic, the number of cells and the propagation conditions in the network. In the proposed scheme, users who not only have stronger channel gains to their respective home base stations but also cause relatively lower intercell interference are scheduled for transmissions. Different classes of tags can be issued and various scheduling decision rules can be implemented giving flexibility in interference management. Simulation results in shadow and multipath fading environment are presented to show the performance advantage of the proposed scheme.     

Performance analysis of switch‐based multiuser scheduling schemes with adaptive modulation in spectrum sharing systems

This paper focuses on the development of multiuser access schemes for spectrum sharing systems whereby secondary users are allowed to share the spectrum with primary users under the condition that the interference observed at the primary receiver is below a predetermined threshold. In particular, two scheduling schemes are proposed for selecting a user among those that satisfy the interference constraint and achieve an acceptable signal‐to‐noise ratio level. The first scheme focuses on optimizing the average spectral efficiency by selecting the user that reports the best channel quality. In order to alleviate the relatively high feedback required by the first scheme, a second scheme based on the concept of switched diversity is proposed, where the base station (BS) scans the secondary users in a sequential manner until a user whose channel quality is above an acceptable predetermined threshold is found. We develop expressions for the statistics of the signal‐to‐interference and noise ratio as well as the average spectral efficiency, average feedback load, and the delay at the secondary BS. We then present numerical results for the effect of the number of users and the interference constraint on the optimal switching threshold and the system performance and show that our analysis results are in perfect agreement with the numerical results. Copyright © 2014 John Wiley & Sons, Ltd.     

Call admission control with opportunistic scheduling scheme

In this paper, a rate‐based admission control scheme for a single shared wireless base station with opportunistic scheduling and adaptive modulation and coding (AMC) is proposed. The proposed admission scheme maintains minimum average rates of the admitted users, i.e., new users will be admitted if the base station has enough resources to support the required minimum average transmission rates of all users. The proposed scheme relies on an analytical model for the average per‐user rates of an opportunistic scheduling in an unsaturated scenario, where some queues may be empty for certain periods of time. We provide extensive simulation results to demonstrate the accuracy of the base analytical model on which our admission scheme relies. Copyright © 2009 John Wiley & Sons, Ltd.     

On feasibility examination of DS‐CDMA systems with imperfect successive interference cancellation

In DS‐CDMA systems with the successive interference cancellation (SIC) technique, there are K! possible decoding orders for K active users and the decoding order has considerable impact on system performance. Once the constraints on the received powers of mobile stations and the bit‐energy‐to‐interference‐power‐spectral‐density ratio requirements are satisfied under some decoding order of SIC, the system is feasible. Otherwise, if the constraints are violated under all possible decoding orders, the system is infeasible. It is highly time‐consuming to examine the system feasibility directly by using the usual exhaustive search method (ESM) for a system with even moderate number of users. In this paper, we propose an efficient approach for examining the feasibility of DS‐CDMA systems with imperfect SIC. The proposed approach has significantly lower computational complexity than that of ESM and thus benefits the quick decisions of admission control and/or scheduling, which are essential for Quality of Service provisioning in DS‐CDMA systems. Furthermore, we theoretically prove that the system under the resultant decoding order obtained by the proposed approach is able to achieve the lowest outage probability among all possible decoding orders. We conduct extensive simulation experiments, and the numerical results validate our analysis and demonstrate the effectiveness of our approach. Copyright © 2010 John Wiley & Sons, Ltd.     

Dynamic Channel Assignment with Flexible Reuse Partitioning in Cellular Systems

In cellular communications, one of the main research issues is how to achieve optimum system capacity with limited frequency spectrum. For many years, researchers have proposed and studied many dynamic channel assignment (DCA) schemes to increase the capacity of cellular systems. Another proposed technique, Reuse Partitioning (RP), is used to achieve higher capacity by reducing the overall reuse distance. In convention, when RP is exploited in network-based DCA, a portion of channels will be assigned permanently to each partitioned region. However, the number of channels assigned to each region may not be~optimum due to factors like the uneven and time-varying traffics. In this paper, a new network-based DCA scheme is proposed with the flexible use of RP technique, named as flexible dynamic reuse partitioning with interference information (FDRP-WI). In this scheme, channels are open to all incoming calls and no channel pre-allocation for each region is required. As long as the channel assignment satisfies the co-channel interference constraints, any user from any region can use any channel. The scheme aims to minimize the effect of assigned channels on the availability of channels for use in the interfering cells and to reduce overall reuse distance. Both FDRP-WI with stationary users and mobile users are investigated. Simulation results have confirmed the effectiveness of FDRP-WI scheme. In the case with stationary users, FDRP-WI exhibits outstanding performance in improving the system capacity under both uniform and non-uniform traffic distributions. Under the uniform traffic case, the scheme can provide over 100% capacity improvement as compared to conventional fixed channel assignment scheme with 70 system channels at 1% blocking probability. In the case with mobile users, the impact of mobility on the new call probability, P _b, and the call dropping probability, P _d, is evaluated. The effect on system capacity of reserving some channels for handoff calls is first studied. Then, we propose a new handoff scheme, called “Reverse Overflow” (RO), to improve the utilization of channels with smaller reuse distances under mobile environment. Simulation results show that, with RO handoff, the system capacity of FDRP-WI is effectively improved at the expense of higher handoff rates in the cellular system.     

A self‐organized resource allocation scheme for heterogeneous macro‐femto networks

This paper investigates the radio resource management (RRM) issues in a heterogeneous macro‐femto network. The objective of femto deployment is to improve coverage, capacity, and experienced quality of service of indoor users. The location and density of user‐deployed femtos is not known a‐priori. This makes interference management crucial. In particular, with co‐channel allocation (to improve resource utilization efficiency), RRM becomes involved because of both cross‐layer and co‐layer interference. In this paper, we review the resource allocation strategies available in the literature for heterogeneous macro‐femto network. Then, we propose a self‐organized resource allocation (SO‐RA) scheme for an orthogonal frequency division multiple access based macro‐femto network to mitigate co‐layer interference in the downlink transmission. We compare its performance with the existing schemes like Reuse‐1, adaptive frequency reuse (AFR), and AFR with power control (one of our proposed modification to AFR approach) in terms of 10 percentile user throughput and fairness to femto users. The performance of AFR with power control scheme matches closely with Reuse‐1, while the SO‐RA scheme achieves improved throughput and fairness performance. SO‐RA scheme ensures minimum throughput guarantee to all femto users and exhibits better performance than the existing state‐of‐the‐art resource allocation schemes.Copyright © 2014 John Wiley & Sons, Ltd.     

User Selection Algorithms for MU‐MIMO Systems with Coordinated Beamforming

In this paper, we propose two novel user selection algorithms for multiuser multiple‐input and multiple‐output downlink wireless systems, in which both a base station (BS) and mobile stations (MSs) are equipped with multiple antennas. Linear transmit beamforming at the BS and receive combining at the MSs are used to avoid interference between users and find a better sum‐rate capacity performance. An optimal technique for selecting users would entail an exhaustive search, which in practice becomes computationally complex for a realistic number of users. Suboptimal algorithms with low complexity are proposed for a coordinated beamforming scheme. Simulation results show that the performance of the proposed algorithms is better than that provided by previous algorithms and is very close to an optimal approach with reduced complexity.     

Linear Interference Cancellation of Asynchronous CDMA Systems by Preconditioned CG Method

It is well known that the iterative method is used for solving a set of linear equations corresponding to linear interference cancellation structures. An ideal computation of the decorrelating or the linear minimum mean-squared-error (LMMSE) detector requires order K ³ flops, where K is the number of users. To alleviate the computational complexity, iterative decorrelating and the LMMSE detectors are proposed. In this paper, the symmetric successive over relaxation (SSOR) preconditioning scheme is applied to the conjugate gradient (CG) method. The performance of the detectors is investigated and it is found that the SSOR preconditioned CG (PCG) method can provide significantly faster convergence than CG method.     

Price‐based interference management in dense femtocell systems

Femtocell technology has been drawing considerable attention as a cost‐effective means of improving cellular coverage and capacity. However, under co‐channel deployment, femtocell system in dense environment may incur high uplink interference to existing macrocells and experiences strong inter‐cell interference at the same time. To manage the uplink interference to macrocell, as well as the inter‐cell interference, this paper proposes a price‐based uplink interference management scheme for dense femtocell systems. Specifically, on the one hand, to guarantee the macrocell users' quality of service, the macrocell base station prices the interference from femtocell users (FUEs) subject to a maximum tolerable interference power constraint. On the other hand, the inter‐cell interference is also taken into consideration. Moreover, a Stackelberg game model is adopted to jointly study the utility maximization of the macrocell base station and FUEs. Then, in order to reduce the amount of information exchange, we design a distributed power allocation algorithm for FUEs. In addition, admission control is adopted to protect the active FUEs' performance. Numerical results show that the price‐based interference management scheme is effective. Meanwhile, it is shown that the distributed power allocation combined with admission control is capable of robustly protecting the performance of all the active FUEs. Copyright © 2013 John Wiley & Sons, Ltd.     

Multi‐group linear turbo equalization with intercell interference cancellation for MC‐CDMA cellular systems

In this paper, we investigate multi‐group linear turbo equalization using single antenna interference cancellation (SAIC) techniques to mitigate the intercell interference for multi‐carrier code division multiple access (MC‐CDMA) cellular systems. It is important for the mobile station to mitigate the intercell interference as the performance of the users close to cell edge is mainly degraded by the intercell interference. The complexity of the proposed iterative detector and receiver is low as the one‐tap minimum mean square error (MMSE) equalizer is employed for mitigating the intracell interference, while a simple group interference canceller is used for suppressing the intercell interference. Simulation results show that the proposed iterative detector and receiver can mitigate the intercell interference effectively through iterations for both uncoded and coded signals. Copyright © 2009 John Wiley & Sons, Ltd.     

Co‐tier downlink interference management in dense femtocell networks

With the adoption of long‐term evolution standard for 4G mobile communications, the deployment of femtocell base stations (FBSs) to cope with the surging traffic in mobile wireless communication is becoming increasingly popular. However, with the random installation of FBSs, the problem of interference among FBSs is still a challenge. In this paper, assuming the presence of a femtocell management system that can control and coordinate the densely deployed FBSs, a novel power backoff scheme is proposed that determines the appropriate transmit power of each FBS so that the interference is reduced. Simulation results for randomly deployed FBSs in an environment with shadowing using MATLAB are provided, showing that our proposed methods can effectively mitigate the co‐tier downlink interference while improving the system capacity in a densely deployed femtocell network with shared spectrum use. Quantitatively, the average interference is reduced by roughly 90% to 100% of dBm, and the average capacity is increased by more than 80%. These results attest to the effectiveness of the proposed scheme.     

Spectrum sensing and power/rate control in CDMA cognitive radio networks

In this paper, a two‐phase algorithm for the spectrum sensing and power/rate control of a secondary user (S‐user) or cognitive radio is proposed. In the first phase, the primary base station (P‐BS), which is conscious of both the number and the data rate of primary active users (P‐user), broadcasts theitusage capacity percentage (UCP) of its cell. Since knowing only the UCP is not enough to guarantee that the total load (of P‐users and S‐users) is less than a maximum permissible load, the S‐user must measure the total interference received from both the P‐users and other S‐users. In this direction, using both the UCP and measurement of the interference received from the P‐users and the S‐users by the S‐user or secondary base station (S‐BS), we mathematically derive an equation for issuing data transmission permission, which if it is held then the second phase of the algorithm: the transmit power/rate control starts. In this phase, the S‐user and the S‐BS look for feasible values for the transmit power level and transmission rate. If there are feasible values, it starts its transmission at these feasible transmit power and rate. Since both the location of the S‐user and the channel condition vary in time, the whole algorithm is iterated periodically with a period faster than the coherence time of the channel. Furthermore, we consider the down link of the above system with cooperation among neighboring S‐users to overcome fading channels and we investigate the amount of improvement in the reliability of the issuing data transmission permission. As well, we consider the uplink of the system with multiple antennas in the S‐BS to investigate the improvement in the same parameter over spatially correlated and independent fading channels. Theoretical analysis is validated using computer simulations. Both theoretical analysis and computer simulations show that the proposed cooperative spectrum sensing algorithm performs properly at SNR = ?5dB in flat Nakagami‐m fading channels with m = 1 even in correlated fading channels. We also address the improvement of the reliability of the issuing data transmission permission in the uplink in case of using multiple antennas only in the S‐BS. Copyright © 2011 John Wiley & Sons, Ltd.     

A Stackelberg game for relay selection and power allocation in an active cooperative model involving primary users and secondary users

In recent years, cooperative communications have been widely used to improve the spectrum efficiency in cognitive radio networks. In this paper, we propose a new cooperative model involving primary and secondary users, where a primary transmitter may select a number of the secondary users to act as relays in order to maximize its data rate and to transmit at lower energy level, thereby saving energy and reducing interference at the secondary base station. The cooperative transmission is a multiple two‐hop relaying scheme, which guarantees an achievable data rate exceeding that in the direct transmission. In the proposed approach, the problem of joint relay selection and power allocation is formulated as a Stackelberg game, which converges to a unique optimal Nash equilibrium. Performance evaluation shows that this model offers benefit to both sides, where the primary users achieve higher data rate at lower energy consumption and the signal to interference plus noise ratio at the secondary base station is increased significantly. In addition, the results show that the proposed solution outperforms the investigated models in terms of achievable data rate.     

Semi‐distributed dynamic inter‐cell interference coordination scheme for interference avoidance in heterogeneous networks

Inter‐cell interference (ICI) is a major problem in heterogeneous networks, such as two‐tier femtocell (FC) networks, because it leads to poor cell‐edge throughput and system capacity. Dynamic ICI coordination (ICIC) schemes, which do not require prior frequency planning, must be employed for interference avoidance in such networks. In contrast to existing dynamic ICIC schemes that focus on homogeneous network scenarios, we propose a novel semi‐distributed dynamic ICIC scheme to mitigate interference in heterogeneous network scenarios. With the goal of maximizing the utility of individual users, two separate algorithms, namely the FC base station (FBS)‐level algorithm and FC management system (FMS)‐level algorithm, are employed to restrict resource usage by dominant interference‐creating cells. The distributed functionality of the FBS‐level algorithm and low computational complexity of the FMS‐level algorithm are the main advantages of the proposed scheme. Simulation results demonstrate improvement in cell‐edge performance with no impact on system capacity or user fairness, which confirms the effectiveness of the proposed scheme compared to static and semi‐static ICIC schemes.     

Energy‐efficient power control for uplink spectrum‐sharing heterogeneous networks

This article considers energy‐efficient power control schemes for interference management in uplink spectrum‐sharing heterogeneous networks that maximize the energy efficiency of users, protect the macro base station, and support users with QoS consideration. In the first scenario, we define the objective function as the weighted sum of the energy efficiencies and develop an efficient global optimization algorithm with global linear and local quadratic rate of convergence to solve the considered problem. To ensure fairness among individual user equipments (UEs) in terms of energy efficiency, we consider the max‐min problem, where the objective is defined as the weighted minimum of the energy efficiencies, and a fractional programming theory and the dual decomposition method are jointly used to solve the problem and investigate an iterative algorithm. As by‐products, we further discuss the global energy efficiency problem and consider near‐optimal schemes. Numerical examples are provided to demonstrate significant improvements of the proposed algorithms over existing interference management schemes.     

Channel estimation and interference suppression for uplink CDMA mobile communication systems

Wireless communications for mobile telephone and data transmission is currently undergoing very rapid development. Code division multiple‐access (CDMA) implemented with direct sequence spread spectrum signaling is among the most promising multiplexing technologies for cellular telecommunications services. In this paper, jointly period inserted pilot symbols assisted recursive (PIPSAR) channel estimation and interference suppression techniques are proposed for uplink CDMA mobile communication systems. The uplink CDMA mobile communication system model is described in the form of space‐time domain through antenna array and multipath expression. Interference suppression is achieved by using adaptive minimum mean squared error (MMSE) digital filters that span several successive received chip oversampling vectors of a symbol interval. PIPSAR techniques are used to estimate channel parameters. The correlation between the successive periods is considered to further improve the performance of the proposed scheme. Analysis and simulations are used to evaluate the performance of the proposed scheme. Copyright © 2004 John Wiley & Sons, Ltd.     

Software‐only TDOA/RTT positioning for 3G WCDMA wireless network

A hybrid location finding technique based on time difference of arrival (TDOA) with round‐trip time (RTT) measurements is proposed for a wideband code division multiple access (WCDMA) network. In this technique, a mobile station measures timing from at least three base stations using user equipment receive—transmit (UE Rx—Tx) time difference and at least three base stations measure timing from the mobile station using RTT. The timing measurements of mobile and base stations are then combined to solve for both the location of the mobile and the synchronization offset between base stations. A software‐only geolocation system based on the above mobile/base stations timing measurements is implemented in Matlab platform and the performance of the system is investigated using large‐scale propagation models. Copyright © 2007 John Wiley & Sons, Ltd.     

Beam interference suppression in multi-cell millimeter wave communications

Due to the increase in the number of users, beam switching is used for suppressing interference, which leads to higher computational complexity in multi-cell millimeter wave communications. In order to resolve this problem, a beam interference model is introduced, and a lower complexity beam interference suppression algorithm based on user grouping is proposed. The proposed algorithm operates beam switching and multi-cell cooperative transmission for a part of the users when there exists beam interference due to high user density. In particular, considering the distinct interference suffered by each user, the proposed dual-threshold user grouping method can effectively solve the frequent switching problem at the base station caused by multi-cell cooperative transmission in multi-cell environments. Simulation results show that the proposed algorithm can reduce the computational complexity of beam switching and approach ideal system capacity, compared with conventional interference suppression algorithms that do not involve grouping of users.     

Second‐order statistics of multiuser relay cooperation systems over Nakagami‐m fading channels

To attain overall recognition of the effect of Nakagami‐m channel parameters on the second‐order statistics and to present a guide to the design and configuration of systems, we investigate the average level crossing rate (LCR) and average fading duration (AFD) of multiuser single relay cooperation wireless communications, in which the multiple mobile users communicate with base station under the help of single relay. On the basis of the statistical channel state information (CSI) between mobile users and relay, a single user is selected to communicate with base station. For the multiuser relay cooperation communications, we first present the integral expressions to the LCR and AFD of equivalent end‐to‐end envelope by using strict mathematical proof. Then with appropriate approximation, we obtain the closed‐form solutions to the upper and lower bounds of average LCR and AFD as well as the ones of Laplace approximation. Finally, on the basis of the derivations, we validate the approximations to LCR and AFD, and investigate the effect of the system parameters on LCR and AFD. The comparison results show that the derivations match well the simulations, and the exact values can be bounded by the obtained upper and lower bounds. Copyright © 2013 John Wiley & Sons, Ltd.