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 Hopfield neural-network-based dynamic channel allocation withhandoff channel reservation control

As channel allocation schemes become more complex and computationally demanding in cellular radio networks, alternative computational models that provide the means for faster processing time are becoming the topic of research interest. These computational models include knowledge-based algorithms, neural networks, and stochastic search techniques. This paper is concerned with the application of a Hopfield (1982) neural network (HNN) to dynamic channel allocation (DCA) and extends previous work that reports the performance of HNN in terms of new call blocking probability. We further model and examine the effect on performance of traffic mobility and the consequent intercell call handoff, which, under increasing load, can force call terminations with an adverse impact on the quality of service (QoS). To maintain the overall QoS, it is important that forced call terminations be kept to a minimum. For an HNN-based DCA, we have therefore modified the underlying model by formulating a new energy function to account for the overall channel allocation optimization, not only for new calls but also for handoff channel allocation resulting from traffic mobility. That is, both new call blocking and handoff call blocking probabilities are applied as a joint performance estimator. We refer to the enhanced model as HNN-DCA++. We have also considered a variation of the original technique based on a simple handoff priority scheme, here referred to as HNN-DCA+. The two neural DCA schemes together with the original model are evaluated under traffic mobility and their performance compared in terms of new-call blocking and handoff-call dropping probabilities. Results show that the HNN-DCA++ model performs favorably due to its embedded control for assisting handoff channel allocation     

A Channel Sharing Scheme for Cellular Mobile Communications

This paper presents a channel sharing scheme, Neighbor Cell Channel Sharing (NCCS) , based on region partitioning of cell coverage for wireless cellular networks. Each cell is divided into an inner-cell region and an outer-cell region. Cochannel interference is suppressed by limiting the usage of sharing channels in the inner-cell region. The channel sharing scheme achieves a traffic-adaptive channel assignment and does not require any channel locking. Performance analysis shows that using the NCCS scheme leads to a lower call blocking probability and a better channel utilization as compared with other previously proposed channel assignment schemes.     

NACR: A New Adaptive Channel Reservation in Cellular Communication Systems

Future Personal Communication Networks (PCN) will employ microcells and picocells to support a higher capacity, thus increasing the frequency of handoff calls. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. The proposed guard channel schemes for radio channel allocation in cellular networks reduce handoff call blocking probability at the expense of increases in new call blocking probability by giving resource access priority to handoff calls over new calls in call admission control. Under uniform traffic assumptions, it has been shown that a fixed number of guard channels leads to good performance results. In a more realistic system, non-uniform traffic conditions should be considered. In this case, the achieved call blocking probability may deviate significantly from the desired objective. In this paper, we propose a new adaptive guard channel scheme: New Adaptive Channel Reservation (NACR). In NACR, for a given period of time, a given number of channels are guarded in each cell for handoff traffic. An approximate analytical model of NACR is presented. Tabu search method has been implemented in order to optimize the grade of service. Discrete event simulations of NACR were run. The effectiveness of the proposed method is emphasized on a complex configuration.     

Adaptive antenna array assisted dynamic channel allocationtechniques

The performance of base station adaptive antenna arrays (AAAs) is investigated in conjunction with fixed channel allocation (FCA) and dynamic channel allocation (DCA) schemes. Locally distributed DCA arrangements are studied and benchmarked against standard FCA, in the context of both line-of-sight (LOS) and multipath propagation environments. One-, two-, four-, and eight-element AAAs are employed using the sample matrix inversion (SMI) beamforming algorithm, in both the up- and the downlink. In most investigated scenarios, the locally optimized least interference algorithm (LOLIA) exhibited the best overall compromise in terms of a set of combined metrics, such as the forced termination probability, new call blocking probability, and the probability of a low quality access     

切换保留信道与新呼叫排队相结合的LEO星座通信系统信道分配方案研究

提出一种适用于LEO(低轨道)星座通信系统的信道分配方案。该方案为切换呼叫提供了保留信道,降低了切换呼叫的阻塞概率。同时,采取新呼叫排队策略抑制保留信道引起的新呼叫阻塞概率的恶化,如果正在进行的呼叫离开,队列中的新呼叫可以按照次序获得分配信道。结果表明,该方案可以显著降低切换呼叫阻塞概率,并使新呼叫阻塞概率得到改善。     

Multibeam cellular communication systems with dynamic channel assignment across multiple sectors

In cellular communication systems, directional multibeam antennas at cell sites can be used to reduce cochannel interference, increase frequency reuse and improve system capacity. When combined with dynamic channel assignment (DCA), additional improvement is possible. We propose a multibeam scheme using dynamic channel assignment across multiple sectors. A cell is divided into several sectors, each of which is covered by several directional beams. Specific channels are allocated to each sector as in fixed channel assignment (FCA). A channel of a sector is dynamically assigned to a wireless user who communicates through one of the several beams of the sector. The assignment is made so that constraints on the allowable cochannel interference are satisfied. Limitations due to cochannel interference are analyzed. A tractable analytical model for the proposed scheme is developed using multidimensional birth–death processes. Theoretical traffic performance characteristics such as call blocking probability, forced termination probability, handoff activity, carried traffic and channel rearrangement rate are determined. With the proposed scheme, call blocking probability can be reduced significantly for a fixed offered traffic. Alternatively, system capacity can be increased while blocking probability is maintained below the required level. Smaller forced termination probability is obtainable in comparison with corresponding FCA schemes.     

基于延迟输出反馈的上行多小区MIMO蜂窝干扰网络自由度分析

针对具有反馈时延的上行多小区MIMO（Multiple-Input Multiple-Output）蜂窝干扰网络,提出一种基于延迟输出反馈（OF,Output Feedback）的回溯干扰重构（RIR,Retrospective Interference Reconstruction）方案.该方案首先通过在基站构造接收波束成形矩阵,将重构的OF下传至用户.然后用户对延迟的OF预编码并传输至基站,基站利用预编码信息消除小区间干扰.分析了上行任意多小区MIMO蜂窝干扰网络的RIR方案适用条件、系统和速率和可达自由度（DoF,Degrees of Freedom）,并将RIR方案与回溯干扰对齐方案和TDMA方案进行对比仿真分析,结果表明,RIR方案能获得更多自由度.     

Performance analysis of dynamic channel assignment algorithms in cellular mobile systems with hand‐off

In this paper, the traffic performance of dynamic channel assignment (DCA) in cellular mobile system with hand‐off is investigated. A traffic model for cellular system incorporating hand‐off is established first. Under the framework of the model, a hand‐off priority scheme is developed to reduce the forced termination of calls in progress. This paper analyses and derives the traffic performance bound for DCA strategies with hand‐off by extending the maximum packing (MP) scheme to include the hand‐off procedure. For practical implementation, a distributed DCA algorithm (DDCA) is also proposed. A non‐priority scheme and the proposed priority scheme can be combined with either MP or DDCA. It is shown that the simulation results of DDCA scheme are comparable with the analytical bounds given by MP for both the non‐prioritized case and prioritized case. A reasonable trade‐off between the new call blocking probability and forced termination probability can be achieved by using the proposed prioritized scheme in DCA. Copyright © 2002 John Wiley & Sons, Ltd.     

An innovative channel management strategy for highly reliable handoff in cellular networks

In this paper, we have resolved the problem of forced call termination that occurs when mobile traffic is concentrated on a hot‐spot cell in cellular networks. Enhanced Channel Management Scheme (ECMS) is an innovative way to increase the flexibility of channel usage over non‐uniform traffic distribution. ECMS exploits mobile hosts initiated or active in overlapping areas between cells. The scheme consists of three phases to monitor the status of channels on each base station and to make a channel reservation using the availability list maintained for the candidate‐MH selection. When the traffic load in a cell is intolerably high, ECMS invokes the load‐balancing procedure to distribute its traffic to adjacent cells. The reserved channels are used to support the safe and fast handoff. From the simulation, we observed that ECMS outperformed other compatible channel assignment schemes such as directed handoff schemes in blocking probability and channel utilization. Copyright © 2002 John Wiley & Sons, Ltd.     

Analytical methods to calculate the performance of a cellularmobile radio communication system with hybrid channel assignment

Two approximate techniques are presented to evaluate the performance of large-scale mobile radio systems using a hybrid channel assignment scheme and a cellular structure, The two approximate analyses give the steady-state probability distributions of the system which are used to obtain expressions for the blocking probabilities. In the first method, the blocking probability is obtained by finding the interarrival time probability distribution function of one composite interrupted Poisson process (IPP) stream consisting of several IPP streams overflowing from the cell of interest and its cochannel interference cells. The second method is proposed to solve the blocking probability of the system by regarding each call as a GI/M/m (m) model. Analytical results are compared with simulation results, and good agreement is observed for both channel assignments (hybrid and fixed). The methods presented are applicable to the design of hybrid channel assignment schemes and dynamic channel assignment schemes     

Dynamic Channel Allocation for Real-Time Connections in Highway Macrocellular Networks

The wide deployment of multimedia services in third generation wireless networks will require handoff designs that can simultaneously reduce the blocking probability of handoff requests and decrease the handoff delay. Reducing the handoff blocking probability is needed to prevent frequent call dropping of real-time VBR/VCR connections and decreasing the delay associated with handoff is needed to prevent QoS degradation for multimedia traffic. In this paper, we present a channel assignment/reassignment scheme for highway cellular networks that achieves both requirements. The scheme can be used to deliver real-time data to a large segment of global highways, namely, highways in which the radio channels used in a given cell cannot be simultaneously used in the two neighboring cells to its left and to its right. The scheme possesses the desirable features of real-time algorithms: the execution time per handoff request has a constant time complexity, the number of transmitted messages per request is small, and the space overhead is also O(1). The scheme uses a non-compact initial assignment of nominal channels to neighboring cells and utilizes a set of pointers in each base station to implement an efficient channel assignment and reassignment strategy. The resulting approach greatly simplifies the selection process and avoids the expensive computation and message exchanges typically needed by dynamic channel allocation schemes. The low communication overhead of the scheme can be further reduced via control thresholds. Performance simulation results show that the scheme achieves low blocking probability and is therefore suitable for handling handoffs of real-time connections in highway cellular networks.     

A New Connection Admission Control for Spotbeam Handover in LEO Satellite Networks

Frequent spotbeam handovers in low earth orbit (LEO) satellite networks require a technique to decrease the handover blocking probabilities. A large variety of schemes have been proposed to achieve this goal in terrestrial mobile cellular networks. Most of them focus on the notion of prioritized channel allocation algorithms. However, these schemes cannot provide the connection-level quality of service (QoS) guarantees. Due to the scarcity of resources in LEO satellite networks, a connection admission control (CAC) technique becomes important to achieve this connection-level QoS for the spotbeam handovers. In this paper, a geographical connection admission control (GCAC) algorithm is introduced, which estimates the future handover blocking performance of a new call attempt based on the user location database, in order to decrease the handover blocking. Also, for its channel allocation scheme, an adaptive dynamic channel allocation (ADCA) scheme is introduced. By simulation, it is shown that the proposed GCAC with ADCA scheme guarantees the handover blocking probability to a predefined target level of QoS. Since GCAC algorithm utilizes the user location information, performance evaluation indicates that the quality of service (QoS) is also guaranteed in the non-uniform traffic pattern.     

SIR-based call admission control by intercell interferenceprediction for DS-CDMA systems

A new signal-to-interference ratio (SIR)-based call admission control (CAC) scheme is proposed in DS-CDMA systems. In this scheme, a new call is accepted by a base station (BS) if the SIRs at that specific base station (BS) and its nearby, not necessarily adjacent, BSs can be guaranteed to be higher than some threshold value after accepting the new call. The SIRs of the nearby BSs can be guaranteed by predicting the additional intercell interference the new call will produce if it is accepted by the specific BS. Numerical results show that this scheme outperforms previous SIR-based CAC schemes     

Improving quality of service in WiMAX communication at vehicular speeds: a new call admission control solution

Call admission control (CAC) scheme serves as a useful tool for the WiMAX technology, which ensures that resources are not overcommitted and thereby, all existing connections enjoy guaranteed quality of service (QoS). CAC schemes largely rely on readily available information like currently available resources and bandwidth demand of the new call while making an acceptance or rejection decision once a new request arrives. Since wireless channels are not as reliable as wired communication, CAC scheme in WiMAX communication faces a serious challenge of making a right estimate of the usable channel capacity (i.e., effective throughput capacity) while computing the available resources in various communication scenarios. Existing CAC schemes do not consider the impact of mobility at vehicular speeds when computing the usable link capacity and available resources. The main limitation of such CAC scheme is that when a mobile node moves at a slower speed and makes a connection request to the base station (BS), the BS evaluates the situation based on the currently available information. The BS in such cases, is short‐sighted and often overestimates the available resources as it completely ignores the scenario when the SS reaches its top speed within a very short time after a CAC decision is made, causing a significant drop in usable throughput. In this paper, we address this limitation of existing WiMAX CAC schemes and propose a new CAC scheme that estimates the usable link capacity for WiMAX communication at vehicular speeds and uses this information while making a CAC decision. We also present a CAC scheme that takes the speed distribution model of a mobile node into account during the CAC decision making process. Simulation results confirm that the proposed scheme achieves lower dropping rate and improved QoS compared to existing schemes. Copyright © 2011 John Wiley & Sons, Ltd.     

Distributed traffic adaptive channel allocation

Dynamic channel allocation (DCA) schemes adapt to the time variant demand for channels in cellular mobile telephony systems. In this paper we propose a DCA scheme that smoothly changes the channel allocation by solving the following problem. Given a cell structure, a collection of channels, the frequency reuse distance, an allocation of channels to cells, and the number of active connections per cell, accommodate a new call or a new handover by minimally reconfiguring the established allocation of channels to cells. First, this problem is formulated as 0–1 quadratic programming problem. Next, we present a distributed, heuristic solution to the problem, which is based on the observed behaviour of the optimal algorithm. Finally, we present some simulation results on the performance and the feasibility of the distributed algorithm. © 1997 John Wiley & Sons, Ltd.     

PERFORMANCE STUDY OF AN INTEGRATED SATELLITE/TERRESTRIAL MOBILE COMMUNICATION SYSTEM

Terrestrial cellular networks and mobile satellite systems are expected to converge towards a future integrated satellite/terrestrial mobile communication network. Besides a system globalization, the integration of terrestrial and satellite mobile systems will lead to the unloading of the fixed part of the mobile network. This paper proposes an integrated satellite/terrestrial mobile communication system and evaluates its performance in terms of the blocking probability for new call attempts, the call dropping probability and the probability of unsuccessful call. This communication system was simulated and its performence compared with that of a stand-alone terrestrial mobile system. In the terrestrial part of the system we have considered fixed channel allocation (FCA) and dynamic channel allocation (DCA) techniques. Satellite channels can have equal or lower priority compared to terrestrial channels. The improvement of the system performance by means of satellite-to-terrestrial handovers was also estimated.     

A new frequency channel assignment algorithm in high capacity mobile communication systems

A new algorithm for frequency channel assignment in mobile radio communication is proposed. The algorithm uses flexible fixed channel assignment which enables the calls having all their nominal channels busy to borrow channels from the neighboring cells provided that co-channel interference will not result. The borrowed channel cannot be used in three interfering cells; therefore reassignment strategy is used when a call is terminated on a nominal channel to switch a call in progress in a borrowed channel to that nominal one and set free the borrowed channel in the three interfering cells. Thus the traffic carried on borrowed channels is minimized. Also different call switching strategies are proposed to give priority to some channels to be used by the nominal cells and other channels to be borrowed by neighboring cells. These strategies considerably reduce the blocking probability. A simulation study of the algorithm was carried out on 49 hexagonal zones having uniform traffic density. Also a combined telephone and dispatch traffic was included in the simulation study. The results showed that the new algorithm is better than the other channel assignment schemes. This can be applied in high capacity mobile communications systems to utilize the spectrum efficiently.     

一种新的优化动态信道分配策略及建模分析

本文提出一种新的动态信道分配策略,称之为分级紧致的动态信道分配(CCDCA),所谓分级就是基于引入的"冷态"和"热态"的概念,将小区所处的状态分为冷态与热态;所谓紧致就是对处于不同状态的小区给出不同的紧致模型.该策略在对"热态"的处理过程中利用了"冷态"的先验信息,有机地结合了局部信息与整体信息,同时能保证小区间有较小的服务偏差,提高了整个系统的服务质量.文中还从理论上给出了冷、热态阈值的分析模型,计算出了模型的主要参数,该模型也可以用来分析系统性能.仿真结果证明该方案有较小的呼阻率和较高的频谱利用率,所提出的模型比较接近实际系统.     

Repacking on demand for two-tier wireless local loop

This paper proposes a radio channel assignment scheme called repacking on demand (RoD) for two-tier wireless local loop (WLL) networks. A two-tier WLL overlays a macrocell with several microcells. When a new call arrives at a two-tier WLL with RoD, if no idle channel is available in both the microcell and the macrocell, repacking is performed (i.e., a call in the macrocell is moved to its corresponding microcell), and then the reclaimed macrocell channel is used to serve the new call. An analytic model is proposed to compute the call blocking probability of the two-tier WLL with repacking. This analytic model is validated against simulation experiments. We prove that the blocking probability is not affected by the call holding time distributions, but is only dependent on the mean of the call holding times. Compared with some previous proposed schemes, RoD has low blocking probability and significantly reduces repacking rate.