Performance of mobile prepaid and priority call services

We conduct simulation experiments to study a mobile phone system that provides priority and prepaid call services using service nodes. An analytical model for the nonprepaid and prepaid services has been developed to verify the computer simulations. We observe that there exists a threshold point such that beyond this point, increasing the number of mobile switching center ports (service node ports or the radio channels) does not improve the system performance. Furthermore, our results show that priority assignment schemes may significantly affect the operator's revenue     

A call admission control scheme for packet data in CDMA cellular communications

In wireless cellular communication systems, call admission control (CAC) is to ensure satisfactory services for mobile users and maximize the utilization of the limited radio spectrum. In this paper, we propose a new CAC scheme for a code division multiple access (CDMA) wireless cellular network supporting heterogeneous self-similar data traffic. In addition to ensuring transmission accuracy at the bit level, the CAC scheme guarantees service requirements at both the call level and the packet level. The grade of service (GoS) at the call level and the quality of service (QoS) at the packet level are evaluated using the handoff call dropping probability and the packet transmission delay, respectively. The effective bandwidth approach for data traffic is applied to guarantee QoS requirements. Handoff probability and cell overload probability are derived via the traffic aggregation method. The two probabilities are used to determine the handoff call dropping probability, and the GoS requirement can be guaranteed on a per call basis. Numerical analysis and computer simulation results demonstrate that the proposed CAC scheme can meet both QoS and GoS requirements and achieve efficient resource utilization.     

A teletraffic performance study of mobile LEO-Satellite cellular networks with gamma distributed call duration

In this paper, the authors develop an analytical model to study the performance of a mobile low earth orbiting (LEO) satellite cellular network. The model assumes that the call duration has a gamma distribution and considers the effect of system parameters such as the number of channels per cell, the number of channels reserved for the handoff, and the cell residence time, on the teletraffic performance of the system. The quality of service (QoS) measures studied in this paper include new call blocking probability, handoff failure probability, premature call-termination probability (CTP), and call dropping probability (CDP). Based on the causal central limit theorem, the authors use a two-parameter gamma distribution to approximate the distribution of the sum of the residence times in the cells. The analytical model presented in this paper may be used with any call-holding-time distribution. The analytical results are validated by a computer simulation.     

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     

Distributed call admission control in mobile/wireless networks

The major focus of this paper is distributed call admission control in mobile/wireless networks, the purpose of which is to limit the call handoff dropping probability in loss systems or the cell overload probability in lossless systems. Handoff dropping or cell overload are consequences of congestion in wireless networks. Our call admission control algorithm takes into consideration the number of calls in adjacent cells, in addition to the number of calls in the cell where a new call request is made, in order to make a call admission decision. This is done by every base station in a distributed manner without the involvement of the network call processor. The admission condition is simple enough that the admission decision can be made in real time. Furthermore, we show that our distributed call admission control scheme limits the handoff dropping or the cell overload probability to a predefined level almost independent of load conditions. This is an important requirement of future wireless/mobile networks with quality-of-service (QoS) provisioning     

A resource estimation and call admission algorithm for wirelessmultimedia networks using the shadow cluster concept

The shadow cluster concept can be used to estimate future resource requirements and to perform call admission decisions in wireless networks. Shadow clusters can be used to decide if a new call can be admitted to a wireless network based on its quality-of-service (QoS) requirements and local traffic conditions. The shadow cluster concept can especially be useful in future wireless networks with microcellular architectures where service will be provided to users with diverse QoS requirements. The framework of a shadow cluster system is completely distributed, and can be viewed as a message system where mobile terminals inform the base stations in their neighborhood about their requirements, position, and movement parameters. With this information, base stations predict future demands, reserve resources accordingly, and admit only those mobile terminals which can be supported adequately. The shadow cluster concept involves some processing and communication overheads. These overheads have no effect on wireless resources, but only on the base stations and the underlying wireline network. It is shown how base stations determine the probabilities that a mobile terminal will be active in other cells at future times, define and maintain shadow clusters by using probabilistic information on the future position of their mobile terminals with active calls, and predict resource demands based on shadow cluster information. In addition, a call admission algorithm is introduced, which uses current traffic and bandwidth utilization conditions, as well as the amount of resources and maximum allowable “dropping probability” being requested. Performance results showing the advantages of the shadow cluster concept are also included     

Optimal call admission control under packet and call level QoS constraints and effect of buffering

For a single network switch allocating link bandwidth to connections of a single class, an optimal call admission control (CAC) policy is found by the solution of a linear programming (LP) problem. Our optimization differs from previous work in that we include the effect of an output buffer in the switch for the temporary storage of packets bound for transmittal across the link. We find a policy that is optimal in the sense of minimizing call blocking subject to a packet level quality of service (QoS) requirement that limits the packet loss ratio. Such a policy's call blocking probability, if it is small enough to satisfy a call level QoS requirement, then establishes the feasibility of satisfying both the packet and call level QoS requirements for a given call request rate. We show with a previously described example that the addition of even a small output buffer can significantly increase the range of call request rates for which there exists a feasible policy, i.e. one that satisfies both QoS requirements. Also presented is an upper bound, valid for any fixed buffer size, on the range of call request rates for which there exists a feasible CAC policy. Copyright © 2003 John Wiley & Sons, Ltd.     

Optimal call admission control with QoS guarantee in a voice/data integrated cellular network

This paper addresses the issue of call admission control with the necessary quality-of-service (QoS) guarantee for an integrated service mobile cellular network. Specifically, we extend the limited fractional guarded channel (LFGC) scheme to incorporate the multiple traffic types, and derive the set of parameters that leads to the optimal call admission control. The key challenges are the state-dependent nature of the admission control, and the increasing complexity of the state space in a multi-services environment. We propose a novel control mechanism that only uses a few parameters (2-5) to characterize the optimal control planes, and use the simulated annealing technique to obtain the optimal control parameters.     

Approximate urban area call drop‐out probability estimation in mobile multi‐satellite systems

Land mobile satellite (LMS) systems require constellations of multiple satellites to compensate for the large blockage probabilities suffered in urban areas. An approximate methodology based on the street masking function (MKF) or mask concept is presented for the evaluation of system availability. MKFs are graphical representations of the angles (azimuths and elevations) for which a satellite is visible from the terminal's location in the street. MKFs can also be used in the evaluation of second order statistics such as durations of fades or connections. In this paper, the applicability of the mask concept is demonstrated by performing a study of the probability of successful call completion in a LEO‐based satellite telephony service. Copyright © 2003 John Wiley & Sons, Ltd.     

Adaptive resource allocation for prioritized call admission over anATM-based wireless PCN

In future personal communications networks (PCNs) supporting network-wide handoffs, new and handoff requests will compete for connection resources in both the mobile and backbone networks. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. The previously proposed guard channel scheme for radio channel allocation in cellular networks reduces handoff call blocking probability substantially at the expense of slight increases in new call blocking probability by giving resource access priority to handoff calls over new calls in call admission control. While the effectiveness of a fixed number of guard channels has been demonstrated under stationary traffic conditions, with nonstationary call arrival rates in a practical system, the achieved handoff call blocking probability may deviate significantly from the desired objective. We propose a novel dynamic guard channel scheme which adapts the number of guard channels in each cell according to the current estimate of the handoff call arrival rate derived from the current number of ongoing calls in neighboring cells and the mobility pattern, so as to keep the handoff call blocking probability close to the targeted objective while constraining the new call blocking probability to be below a given level. The proposed scheme is applicable to channel allocation over cellular mobile networks, and is extended to bandwidth allocation over the backbone network to enable a unified approach to prioritized call admission control over the ATM-based PCN     

CM-IMS紧急呼叫业务实现技术研究

介绍了CM-IMS紧急呼叫业务技术实现原理,描述其在现网中的部署及应用情况,分析了CM-IMS紧急呼叫在实际应用中存在的问题及解决方案。     

Modeling call control for distributed applications in telephony

The advanced intelligent network (AIN) architecture, an environment in which distribution applications are designed, developed, and deployed independent of the network implementation by different service developers, on possibly different platforms, at different times, is considered. The focus is primarily on support for call-processing applications through call-modeling techniques. However, the entities of NECs application service processor (ASP) architecture as a whole are briefly described to provide a basic understanding of the scope of the call model. The call-modeling concepts discussed at the Bellcore-sponsored Multi-Vendor Interaction forum are compared with NEC's call-modeling concepts. A simple approach (i.e. the logical path) for controlling the execution of FCs (function components) when multiple AIN services are active on a call is suggested. An object-oriented implementation based on the NEC call model is described     

Effective VoIP call routing in WLAN and cellular integration

In cellular-WLAN integration, a dual-mode mobile station (MS) typically disables the WLAN module for power saving. A major problem is that for an incoming VoIP call (or data session), the MS will not be able to receive this call from the WLAN. It turns out that the call is directed to the cellular network. This letter proposes a simple push solution where an MS can accurately detect a VoIP call from paging signaling of the cellular network. Then the WLAN module of the MS is turned on and the VoIP call is connected to the MS through the relatively inexpensive WLAN.     

3G动态预留呼叫接纳控制算法研究

第三代移动通信技术支持不同服务质量(QoS)的多媒体业务,而呼叫接纳控制(CAC)技术是移动通信中的关键技术之一.本文提出一种动态预留呼叫接纳控制算法,该算法根据小区中各业务的话务量预测各业务所需信道教,从而为切换业务和新业务预留一定的信道.通过比较动态预留算法与新呼叫受限算法和中断优先级算法的性能,得出动态预留算法在降低语音和数据业务的呼叫阻塞率、中断率方面有明显的改善,是一种比较理想的呼叫接纳控制算法.     

Improving quality of experience in wireless VoIP through novel call scheduling

In the last few years we have experienced a dramatic increase in the use of IP networks for voice applications (VoIP) over wireless networks due to increased bandwidth availability and enhanced device capabilities. Since demand often exceeds available capacity, Call Admission Control mechanisms are in place to prevent the uncontrolled usage of bandwidth. Through the use of an intermediary gateway, VoIP calls are in many cases terminated to a normal landline or cellphone; the capacity of such a gateway is also a finite resource since the number of users can vary significantly as many are mobile. In this article we propose an enhanced scheme that aims to manage access to the lines available so that they are used in a fair manner and utilized to the highest degree possible. This management is facilitated by enhancing a proxy implementation with a number of call scheduling policies. The ability to satisfy pending call requests as soon as lines become available, results in increased user service satisfaction. Moreover, it increases line utilization which is crucial from an economic viewpoint. The ultimate goal is to improve Quality of Experience which is deemed as highly important especially considering that wireless network users experience opportunistic and intermittent connectivity.     

无线移动网中呼叫接纳控制模型分析

新一代无线网应该能够同时支持传统的数据业务和实时交互式多媒体业务，并能够为用户提供QoS保证。在无线网中提供QoS保证，呼叫接纳控制扮演着重要的角色。对已有的呼叫接纳控制方面的研究成果进行了归纳、总结和分析，以期得出适合于无线移动多媒体网络的呼叫接纳控制模型。为适应当前的多媒体应用，侧重于对和适应性带宽分配相结合的接纳控制模型的分析。另外，介绍了与价格机制相结合的接纳控制模型，经济学概念的引入，为我们解决问题提供了一种新的视角。     

The effect of call admission policies on the system benefit of CDMA communication networks

Previous studies of call admission control (CAC) in mobile communication networks focused on call blocking and call dropping mechanisms. However, achieving global optimization of the system benefit is a complicated process. In this paper, we propose a benefit optimization model that accommodates as many users as possible, while simultaneously maintaining system-wide quality of service (QoS) in terms of admission control. To clarify the CAC concept, we construct a framework of CAC policies, derive associated interference models based on the framework, and then investigate the effects of the policies on the system benefit. In addition, to solve the complicated integer programming problem, we adopt the Lagrangean relaxation approach, and employ Lagrangean multipliers to perform sensitivity analysis of several parameters. The contribution of this study is twofold: the novel problem formulation and the improvement in the system benefit. The computational results demonstrate that the system accrues more benefit as new traffic is loaded and the number of users increases. Meanwhile, the sensitivity analysis shows that proper assignment of the strength of power-controlled signals is a key factor in the global optimization of the system benefit.     

Effect of mobile terminal heterogeneity on call blocking/dropping probability in cooperative heterogeneous cellular networks

It is envisaged that next generation wireless networks (NGWN) will be heterogeneous, consisting of multiple radio access technologies (RATs) coexisting in the same geographical area. In these heterogeneous wireless networks, mobile terminals of different capabilities (heterogeneous terminals) will be used by subscribers to access network services. We investigate the effect of using heterogeneous mobile terminals (e.g. single-mode, dual-mode, triple-mode, etc.) on call blocking and call dropping probabilities in cooperative heterogeneous wireless networks. We develop analytical models for heterogeneous mobile terminals and joint radio resource management in heterogeneous wireless networks. Using a two-class three-RAT heterogeneous wireless network as an example, the effect of using heterogeneous terminals in the network is evaluated. Results show the overall call blocking/dropping probability experienced by subscribers in heterogeneous wireless networks depends on the capabilities of mobile terminals used by the subscribers. In the worst case scenario, when all subscribers use single-mode mobile terminals, each subscriber is confined to a single RAT and consequently, joint radio resource management in heterogeneous wireless network has no improvement on new call blocking and handoff call dropping probabilities. However, in the best case scenario, when all subscribers use three-mode terminals, new class-1 call blocking probability decreases from 0.37 (for 100% single-mode terminals) to 0.05, at the arrival rate of 6 calls per minute. New class-2 call blocking probability also decreases from 0.8 to 0.52. Similarly, handoff class-1 call dropping probability decreases from 0.14 to 0.003, and handoff class-2 call dropping probability decreases from 0.44 to 0.09.     

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 new call control scheme of Push-To-Talk system

For Push-To-Talk (PTT) system based on Public Mobile Data Network (PMDN), the end-to-end time delay is the key aspect of the user’s experience. The Push-Over-Cellular (POC) scheme defined by Open Mobile Alliance (OMA) is based on the VoIP phone model and use SIP protocol as the call control scheme. The call setup time delay in SIP may reach to several seconds, which is unacceptable for the PTT service. In this paper, we provide a new call control scheme for PTT system based on PLMN network. By combining the apriority knowledge of PTT call model and the priority control scheme, we encapsulate the signaling message and the voice data into a same data packet, when the user push the button, the voice and the call control signaling are sent to the server at the same time. So the long time delay of call setup procedure of POC scheme can be eliminate. The end-to-end call delay can be decreased significantly. The experiment result based on the commercial CDMA2000 1X network of China Unicom shows that the call delay can be decreased to 600 ms, which approach to the traditional trunk communication system’s requirement.