Dynamic channel assignment with queuing in highway microcells

The effect of queuing on an ordered dynamic channel assignment with reassignment (QODCAR) scheme in a highway microcellular environment are studied. Results show that queuing improves channel use by approximately 9-43%, and significantly lowers the probability of call failure.<>     

State-dependent control of call arrivals in layered cellular mobile networks

Layered cellular mobile networks have been widely proposed as a way of accommodating traffic growth in mobile communications. There is a need, however, to give some form of priority to handover attempts over fresh call attempts to ensure that handovers are fast and reliable. A class of call control policies with state-dependent control of fresh call arrivals is considered for this purpose. A modified version of the Value Iteration Algorithm is used to solve a Markov decision model for the optimal call control policy. The network blocking performance under optimal state-dependent control is compared with the performance under a much simpler channel reservation policy for a model of a cellular sub-network. The channel reservation policy is shown to perform nearly as well as the optimal policy at lower loads, where fresh call blocking is less than 5%, indicating that it is both an effective and an efficient method for ensuring good handover performance.     

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     

Packet reservation multiple access in a metropolitan microcellularradio environment

The author examines the performance of a packet reservation multiple access (PRMA) protocol in a metropolitan microcellular radio environment using computer simulations. Call characteristics, mobility, and channel conditions have an impact on PRMA performance which is measured in terms of the average packet dropping rate per call. In order to maintain a reasonable level of service quality for calls in progress, teletraffic loading can be controlled by introducing a call setup queue and limiting the number of active subscribers. Call mobility is found to have a minor impact on PRMA performance. PRMA is also fairly robust against adverse channel conditions with a drop in performance of about 15% when the channel packet loss rate is less than 0.01. Performance comparisons to other protocols are also carried out     

Performance Analysis of Fair Channel Sharing Policies in an Integrated Cellular Voice/Data Network

We study channel sharing in an integrated cellular voice/data network with a finite queue for data call requests that cannot be served immediately upon arrival. Using analytical techniques, a comparison of different fair channel sharing policies is made. As a main result, a closed-form expression is derived for the expected sojourn time (waiting time plus transfer time) of a data call, conditional on its size, indicating that the sojourn time is proportional to the call size. This attractive proportionality result establishes an additional fairness property for the channel sharing policies proposed in the paper. Additionally, as a valuable intermediate result, the conditional expected sojourn time of an admitted data call is obtained, given the system state at arrival, which may serve as an appreciated feedback information service to the data source. An extensive numerical study is included to compare the proposed policies and to obtain insight in the performance effects of the various system and policy parameters.     

Delay analysis of a cellular mobile priority queueing system

A nonpreemptive priority queueing system incorporating a channel reservation policy and a hysteresis mechanism is considered for use in cellular mobile networks. The aim is to provide for priority for handover attempts over new call. Attempts in such a way as to avoid the forced termination of calls in progress without unduly affecting the performance seen by new call attempts. The system model is found to have a matrix-geometric solution with a phase-type distribution for the handover delay and a matrix-exponential distribution for the delay seen by new call attempts. It is also shown that the system can be represented by an M/G/1 queue with multiple vacations. A new result is derived for the M/G/1 queue with multiple vacations and impatient customers and this allows for the analysis to be extended so that new call arrivals are subject to a fixed timeout in queue. Results are provided which show how nonpreemptive priority in conjunction with channel reservation and hysteresis an provide for fast and efficient handover performance for cellular mobile networks     

Channel reservation for handoff calls in a PCS network

Some new performance measures and channel reservation for handoff calls for maximizing the service provider's revenue in a personal communications service (PCS) network, with general cell residence time and general requested call holding time, are investigated. Here, each cell within the PCS network consists M channels, but only when at least m+1 (0⩽m<μ) channels are available will a new originating call be accepted. A handoff attempt is unsuccessful if no channel in the target cell is available. Some new performance measures of the system such as the modified offered load (MOL) approximations of the blocking probability of new and handoff calls, the distribution and the mean actual call holding time of a new call and related conditional distributions and the expectations, as well as the boundary of the mean of the actual call holding time of an incomplete call and a complete call are obtained. A necessary and sufficient condition for maximizing the provider's revenue is achieved for any general cost structure if it is an increasing function of the actual call holding time. In order to be fair to the customers with incomplete call and complete call, two different kinds of holding costs are considered for the different customers. In both situations, the optimal controlling value m of handoff priority is obtained by maximizing the service provider's revenue     

Performance analysis of channel de-allocation schemes for dynamic resource allocation in GSM/GPRS networks

Channel de-allocation for GSM voice call (DASV) has been considered for dynamic resource allocation in GSM/GPRS networks. Two new de-allocation schemes are proposed: de-allocation for GPRS packet (DASP) and de-allocation for both GSM voice call and GPRS packet (DASVP). An analytic model with general GPRS data channel requirement is derived to evaluate the performance of the schemes in terms of GSM voice call incompletion probability, GPRS packet dropping probability, average GPRS packet transmission time and channel utilisation.     

Distributed autonomous wireless channel assignment algorithm withpower control

Local autonomous dynamic channel allocation (LADCA) including power control is essential to accommodating the anticipated explosion of demand for wireless. The authors simulate call performance for users accessing channels in a regular cellular array with a base located at the center of each hexagon. The computer model includes stochastic channel demand and a propagation environment characterized by attenuation with distance as well as shadow fading. The study of LADCA shows that distributed power control and channel access can be combined in an access management policy that achieves satisfactory system capacity and provides desired call performance. The authors report: LADCA/power control is observed to be stable alleviating a major concern about users unaware of the signal to interference problems their presence on a channel might cause to others. There can be substantial inadvertent dropping of calls in progress caused by originating calls. Modeling user time dynamics is essential. LADCA contrasts very favorably with fixed channel allocation (FCA) in a comparative example     

Probabilistic channel reservation scheme for mobilepico/microcellular networks

Channel reservation based on the handoff probability of a call arriving in an adjacent cell is proposed as a more flexible and dynamic means of providing handoff priority in mobile pico/microcellular networks in which frequent handoff events are to be expected. A basic probabilistic channel reservation scheme is described and shown to yield improvements in performance, especially in terms of channel utilization by successfully completed call, over the well-known static trunk reservation policy     

GSM移动通信网络掉话解析

本文将全面分析GSM移动通信系统中导致各类掉话的原因。在移动通信中,掉话可分为两种形式：一类是在SDCCH信道上的掉话,一类是在TCH信道上的掉话。掉话率作为反映网络性能的一项重要指标,一直是网络优化工作关注的重点。     

无线双通道网络话音业务信道接入性能分析

无线双通道网络能够有效解决战术环境下码分组网数目过小造成的码分资源浪费问题。混合业务传输环境下,实时话音业务信道接入性能是衡量无线双通道网络性能的关键指标之一。通过使用一种理想的固定时分信道带宽分配方案,在保障话音业务传输实时性的条件下,分别从单跳网络拓扑和多跳网络拓扑结构给出了双通道网络可用信道数目。使用基于优先权的混合业务多服务台离散时间排队模型分析了双通道网络的话音业务平均数目、呼叫阻塞概率、平均网络吞吐量和信道利用率等性能。数值计算结果证明：相比传统网络,双通道网络在混合业务高负载条件下能够容纳更多的话音业务并具有更低的呼叫阻塞概率。     

Modeling and analysis of hierarchical cellular networks with bidirectional overflow and take-back strategies under generally distributed cell residence times

The rapid growth of wireless services and mobile users drives a great interest in cellular networks with a hierarchical structure. Hierarchical cellular networks (HCNs) can provide high system capacity, efficient channel utilization and inherent load-balancing capability. In this paper, we develop an analytical model and a performance analysis method for a two-layer HCN with bidirectional overflow and take-back strategies. Mobile users are divided into two classes. The call requests (including new and handoff calls) of fast and slow users are preferably assigned to the macrolayer and microlayer, respectively. A call from a fast user or slow user can overflow to its non-preferable layer if there is no channel available. The successful overflow call can be taken back to its preferable layer if a channel becomes available. Since the commonly used exponentially distributed assumption for cell residence time and then the channel occupancy time does not hold for emerging mobile networks, we model various cell residence times by general distributions to adapt to more flexible mobility environments. The channel occupancy times are derived in terms of the Laplace transforms of various cell residence times. The handoff rates, overflow rates and take-back rates of each layer are also derived in terms of the new call arrival rates and related probabilities. The stationary probabilities (and then the performance measures) are determined on the basis of the theory of multi-dimensional loss systems.     

Modeling and analysis of hierarchical cellular networks with general distributions of call and cell residence times

We present an analytic model for the performance evaluation of hierarchical cellular systems, which can provide multiple routes for calls through overflow from one cell layer to another. Our model allows the case where both the call time and the cell residence time are generally distributed. Based on the characterization of the call time by a hyper-Erlang distribution, the Laplace transform of channel occupancy time distribution for each call type (new call, handoff call, and overflow call) is derived as a function of the Laplace transform of cell residence time. In particular, overflow calls are modeled by using a renewal process. Performance measures are derived based on the product form solution of a loss system with capacity limitation. Numerical results show that the distribution type of call time and/or cell residence time has influence on the performance measure and that the exponential case may underestimate the system performance.     

基于模糊逻辑的呼叫允许控制研究

无线频谱资源的缺乏以及用户的移动性使无线网络的服务质量的供给成为一个日益严峻的问题。为了满足服务质量的需要,该文提出蜂窝移动通信系统的一种模糊呼叫允许控制方案。它自动搜寻基站中保护信道数量的最优值,使资源得到合理的利用并保证服务质量的供给。对提出的模糊方案和一种动态信道预留方案进行了仿真比较,仿真结果表明模糊方案具有较强的鲁棒性,方案的呼叫阻止率、切换掉线率和信道利用率等性能参数都优于自适应方案。     

Channel segregation-a self-organized dynamic channel allocationmethod: application to TDMA/FDMA microcellular system

Channel segregation was previously proposed as a self-organized dynamic channel assignment. Its performance was examined by applying it to frequency-division multiple access systems. Its applications to the TDMA/FDMA (time-division multiple access/frequency-division multiple access) or multicarrier TDMA system is discussed. The spectrum efficiency of the TDMA/FDMA cellular system deteriorates due to the problem of unaccessible channel: a call can be blocked in a cell even when there are idle channels because of the restriction on simultaneous use of different carrier frequencies in the cell. It is shown that channel segregation can resolve this problem with a small modification of its algorithm. The performance of the TDMA/FDMA system with channel segregation on the call blocking probability versus traffic density is analyzed with computer simulation experiments. The effect of losing the TDMA frame synchronization between cells on the performance is also discussed     

Call blocking performance of distributed algorithms for dynamicchannel allocation in microcells

We determine the call blocking performance of channel-allocation algorithms where every channel is available for use in every cell and where decisions are made by mobiles/portables based only on local observations. Using a novel Erlang-B approximation method, together with simulation, we demonstrate that even the simplest algorithm, the timid, compares favorably with impractical, centrally administered fixed channel allocation. Our results suggest that an aggressive algorithm, that is, one requiring call reconfigurations, could provide a substantially reduced blocking probability. We also present some algorithms which take major steps toward achieving the excellent blocking performance of the hypothetical aggressive algorithm but having the stability of the timid algorithm     

Integrated call control in a CDMA cellular system

Soft handoff is an essential component of code-division multiple-access (CDMA) digital mobile communication systems. While soft handoff has some advantages of system capacity and communication quality, it also has some disadvantages arising from the excessive use of channel resources. In this study, we propose a new control policy to alleviate effectively this excessive use of channel resources. For CDMA cellular mobile systems consisting of homogeneous cells, a variety of traffic parameters are estimated by the detailed traffic analysis, based on which a Markovian queueing model is developed to analyze the performance of the proposed call control policy. With a well-known performance objective, a mathematical problem of finding optimal call control parameters is proposed, along with its solution method     

Demand assignment multiple access and dynamic channel allocationstrategies for integrating radio dispatch and telephone services overmobile satellite systems

The authors discuss the performance analyses of a novel demand assignment multiple access (DAMA) scheme addressing the special characteristics of the mobile radio service (MRS), and a new method for dynamically allocating a common pool of channels to both MRS and mobile telephone service (MTS) to improve channel utilization. The new DAMA scheme makes use of call queuing, batch processing, and pipelined signaling to minimize call setup overhead for MRS traffic. MRS call setup delays were analyzed by simulation modeling of a mobile satellite system (MSS) with many mobile voice-dispatch networks operating over a multiple spot beam satellite to investigate the effects of traffic volume, batch size, and batch service disciplines. A reserved channel margin algorithm for dynamic channel allocation was shown to be effective in harmonizing the different call setup performance requirements for MTS and MRS. Numerical results show that dynamic channel allocation applied to a common pool of 40 channels enables a 20-25% increase in the number of mobile terminals compared with a fixed allocation of 20 channels to each of the two services     

Call-on-hold for improving the performance of dynamic channel-assignment strategies in cellular networks

Efficient use of the limited radio spectrum is of paramount importance to supporting the ever-increasing number of mobile terminals. There is a need for devising complementing techniques to improve the performance of dynamic channel-assignment (DCA) algorithms to increase the capacity of cellular systems. In this paper, we study the concept of call-on-hold to improve the performance of a class of DCA algorithms called coordinated assignment without measurement (CAWM). DCA algorithms such as the Geometric strategy, the Nanda-Goodman strategy, the borrowing with directional channel locking (BDCL) strategy, and the two-step dynamic priority (TSDP) strategy fall into the CAWM class. To gain insight into the CAWM DCA algorithms, we simulated those algorithms and monitored carrier availability and failure to assign a channel characteristics in a cell. After observing these characteristics, we formulated a hypothesis as follows: If a new or handoff call is put on hold for a short while in a cell in the absence of an available channel, it is highly likely that the local base station will soon find a channel for the call. In the proposed approach, a DCA algorithm is said to have failed to assign a channel to a call only if a waiting call is delayed for longer than a threshold period called maximum delay. Our simulation-based study shows that it is possible to significantly reduce failure rates of the CAWM class of DCA algorithms by putting those calls on hold which would otherwise be blocked or dropped. The impact of small values of maximum delay on the average delay suffered by all calls in a network is negligible, but the reduction in failure rate is significant. We have explained how the call-on-hold idea can be easily integrated with the GSM system.