An adaptive bandwidth reservation scheme for high-speed multimediawireless networks

In the next generation high-speed wireless networks, it is important to provide quality-of-service (QoS) guarantees as they are expected to support multimedia applications. This paper proposes an admission control scheme based on adaptive bandwidth reservation to provide QoS guarantees for multimedia traffic carried in high-speed wireless cellular networks. The proposed scheme allocates bandwidth to a connection in the cell where the connection request originates and reserves bandwidth in all neighboring cells. When a user moves to a new cell and a handoff occurs, bandwidth is allocated in the new cell, bandwidth is reserved in the new cell's neighboring cells, and reserved bandwidth in more distant cells is released. The amount of bandwidth to reserve is dynamically adjusted, reflecting the current network conditions. The performance of the proposed scheme is evaluated through simulations of realistic cellular environments. The simulated network consists of a large number of cells, mobile users with various movement patterns are assumed, and a variety of multimedia applications (e.g., audio phone, video conference, video on demand, file transfer, etc.) is considered. It is shown that the proposed scheme provides small handoff dropping probability (i.e., the probability that handoff connections are dropped due to a lack of bandwidth) and achieves high bandwidth utilization     

A Novel Probability-Based Handoff Strategy for Multimedia LEO Satellite Communications

A novel bandwidth allocation strategy and a connection admission control technique arc proposed to improve the utilization of network resource and provide the network with better quality of service （QoS） guarantees in multimedia low earth orbit （LEO） satellite networks. Our connection admission control scheme, we call the probability based dynamic channel reservation strategy （PDR）, dynamically reserves bandwidth for real-time services based on their handoff probability. And the reserved bandwidth for real-time handoff connection can also be used by new connections under a certain probability determined by the mobility characteristics and bandwidth usage of the system. Simulation results show that our scheme not only lowers the call dropping probability （CDP） for Class I real-time service but also maintains the call blocking probability （CBP） to certain degree. Consequently, the scheme can offer very low CDP for rcal-time connections while keeping resource utilization high.     

基于无线ATM的快速切换管理新方案

未来的移动通信网应发展成以异步传模式（ＡＴＭ） 为基础,支持多媒体业务的网络。为了在这种环境下实现无缝隙、快速切换,提出了在相邻基站间备用永久虚连接（ＰＶＣ） 的一种快速切换管理方案,并计算了给定ＰＶＣ 带宽时的切换阻塞概率。本方案与Ａｃａｍ ｐｏｒａ 的虚连接树（ＶＣＴ） 相比,有效地节省了有线链路资源,并在切换过程中保持本地小区序列的完整性     

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     

Joint connection-level and packet-level quality-of-service support for VBR traffic in wireless multimedia networks

In this paper, we investigate call admission control (CAC) schemes that can jointly provide connection-level quality-of-service (QoS) (in terms of the new call blocking probability and the handoff dropping probability) and packet-level QoS (in terms of the packet loss probability) for wireless multimedia networks. Stationary CAC schemes are proposed as the results of the solution to constrained optimization problems. A dynamic CAC scheme that can be adapted to varied and varying traffic conditions dynamically is also proposed. The proposed CAC schemes are computationally efficient and easy to implement, thus being suitable for real-time system deployment. Simulation results have demonstrated that the proposed dynamic CAC scheme achieves better performance when applied to realistic traffic conditions found in wireless multimedia networks.     

Q-Win – A New Admission and Handoff Management Scheme for Multimedia LEO Satellite Networks

Low Earth Orbit (LEO) satellite networks are deployed as an enhancement to terrestrial wireless networks in order to provide broadband services to users regardless of their location. In addition to global coverage, these satellite systems support communications with hand-held devices and offer low cost-per-minute access cost, making them promising platform for Personal Communication Services (PCS). LEO satellites are expected to support multimedia traffic and to provide their users with the negotiated Quality of Service (QoS). However, the limited bandwidth of the satellite channel, satellite rotation around the Earth and mobility of end-users makes QoS provisioning and mobility management a challenging task. One important mobility problem is the intra-satellite handoff management. The main contribution of this work is to propose Q-Win, a novel call admission and handoff management scheme for LEO satellite networks. A key ingredient in our scheme is a companion predictive bandwidth allocation strategy that exploits the topology of the network and contributes to maintaining high bandwidth utilization. Our bandwidth allocation scheme is specifically tailored to meet the QoS needs of multimedia connections. The performance of Q-Win is compared to that of two recent schemes proposed in the literature. Simulation results show that our scheme offers low call dropping probability, providing for reliable handoff of on-going calls, good call blocking probability for new call requests, while maintaining bandwidth utilization high.     

Development and Comparison Between Resource Allocation Strategies Based on Intelligent Scheme and Traditional Distributed Dynamic Resource Allocation Strategies in Mobile Communication Networks

The third generation of mobile communication aims to transmit not only voice and text but also videos and multimedia data. Furthermore, in the future it is expected to involve web browsing, file transfer, and database access. This requires wireless cellular networks to efficiently support packet data traffic. Therefore, challenge in the design of wireless networks is to support both voice and packet data service of traffic with different QoS-parameters. On the other hand one aspect of this challenge is to develop an efficient scheme for assigning resources to new arriving calls or handoff of different traffic types. Since the blocking probability is one of the most important QoS- parameters, the QoS of wireless cellular networks are often measured in terms of two probabilities, the first is the new call blocking probability that a new call cannot be satisfied because of the unavailability of a proper free channel, and the second is the handoff blocking probability that a proper free channel is not available when a mobile station (MS) wants to move into a neighboring cell. To meet this aspect of the challenge, this proposal proposes a new assignment scheme based on intelligent methodologies to utilize frequency spectrum efficiently and to reduce call blocking probabilities. Jamal Raiyn received the first MS degree (Diplom) in applied mathematics from Siegen University in Germany, in 1998, and the second MS degree in mathematics and computer science from Hannover University in Germany, in 2000. From January 2001 to April 2002, he worked in institute for Data Communications System at the University of Siegen in Germany. Since September 2002 till now, he is a lecturer in computer science department at the Al-Kasemi Academy in Israel, and he is working toward PhD degree at BIU in Tel-Aviv/Israel. In addition a fellow researcher in school for electrical engineering Tel-Aviv University in Israel.     

Priority-determined multiclass handoff scheme with guaranteed mobile QoS in wireless multimedia networks

The provision of multiclass services is gaining wide acceptance and will be more ubiquitous in future wireless and mobile systems. The crucial issue is to provide the guaranteed mobile quality of service (QoS) for arriving multiclass calls. In multimedia cellular networks, we should not only minimize the dropping rate of handoff calls, but also control the blocking rate of new calls at an acceptable level. This paper proposes a novel multiclass call-admission-control mechanism that is based on a dynamic reservation pool for handoff requests. In this paper, we propose the concept of servicing multiclass connections based on priority determination through the combined analysis of mobile movement information and the desired QoS requirements of multimedia traffic. A practical framework is provided to determine the occurrence time of handoff-request reservations. In our simulation experiments, three kinds of timers are introduced for controlling the progress of discrete events. Our simulation results show that the individual QoS criteria of multiclass traffic such as the handoff call-dropping probability can be achieved within a targeted objective and the new-call-blocking probability is constrained to be below a given level. The proposed scheme is applicable to channel allocation of multiclass calls over high-speed wireless multimedia networks.     

GEO卫星移动通信系统信道分配策略研究

根据移动终端越区切换的物理过程,结合GEO系统的特点,建立移动终端运动的数学模型,将地面移动通信系统的无优先权、预留信道和排队方案3种信道分配方案应用于GEO系统,进行仿真分析。仿真结果表明,预留信道方案虽然能够降低切换呼损率,但却增加了初始呼叫呼损率;排队混合方案在取得与预留信道方案同样的切换呼损率时,可以获得更低的初始呼叫呼损率,排队混合方案优于预留信道方案。     

A Fast Handoff Management Scheme in ATM-Based Personal Communication Networks

Future wireless personal communication networks will likely have infrastructures based on asynchronous transfer mode (ATM) networks. It is a challenge to support seamless, fast handoffs in such an environment. We propose a fast handoff management scheme using permanent virtual connections (PVCs) reserved between neighboring base stations (BSs). In the proposed scheme, the handoff can be quickly performed by rerouting the communication path via the PVCs. Handoff calls are distributively controlled only by the corresponding BSs without the involvement of any ATM switches. ATM cell sequence integrity during handoff can be maintained by the BSs. In order to dimension the PVC, we analytically derive the probability of handoff blocking due to the lack of PVCs. We give some numerical examples of PVC dimensioning. The proposed scheme can be utilized in the future IMT-2000 networks accommodating various narrowband services in the range of several kbps to several hundreds kbps.     

Dynamic resource allocation schemes during handoff for mobilemultimedia wireless networks

User mobility management is one of the important components of mobile multimedia systems. In a cell-based network, a mobile should be able to seamlessly obtain transmission resources after handoff to a new base station. This is essential for both service continuity and quality of service assurance. In this paper, we present strategies for accommodating continuous service to mobile users through estimating resource requirements of potential handoff connections. A diverse mix of heterogeneous traffic with diverse resource requirements is considered. The investigate static and dynamic resource allocation schemes. The dynamic scheme probabilistically estimates the potential number of connections that will be handed off from neighboring cells, for each class of traffic. The performance of these strategies in terms of connection blocking probabilities for handoff and local new connection requests are evaluated. The performance is also compared to a scheme previously proposed by Yu and Leung (see IEEE J. Select. Areas Commun., vol.15, p.1208-25, 1997). The results indicate that using dynamic estimation and allocation, we can significantly reduce the dropping probability for handoff connections     

多媒体业务在越区切换中服务质量保证方法的研究

为了降低多媒体业务在移动环境中的呼叫中断率,提高无线信道的利用率,该文提出了一种动态预留带宽分配机制(DRBA),该机制对到达的越区切换呼叫按业务类型区别处理,对于高优先级的实时业务,通过在邻近小区内预留带宽的方法降低呼叫中断率;对于非实时业务,当小区内的信道带宽不足以支持新到达的越区切换呼叫时,通过动态地借用实时业务过度预留的带宽,改善非实时业务的呼叫中断率,进一步达到提高无线信道利用率,为不同的业务类型提供公平的服务质量(QoS)的目标。     

Analysis of a hybrid cutoff priority scheme for multiple classes of traffic in multimedia wireless networks

In this paper, we propose and analyze the performance of a new handoff scheme called hybrid cutoff priority scheme for wireless networks carrying multimedia traffic. The unique characteristics of this scheme include support for N classes of traffic, each may have different QoS requirements in terms of number of channels needed, holding time of the connection and cutoff priority. The proposed scheme can handle finite buffering for both new calls and handoffs. Futhermore, we take into consideration the departure of new calls due to caller impatience and the dropping of queued handoff calls due to unavailability of channels during the handoff period. The performance indices adopted in the evaluation using the Stochastic Petri Net (SPN) model include new call and handoff blocking probabilities, call forced termination probability, and channel utilization for each type of traffic. Impact on the performance measures by various system parameters such as queue length, traffic input and QoS of different traffic has also been studied. This revised version was published online in June 2006 with corrections to the Cover Date.     

Dynamic channel reservation based on mobility in wireless ATMnetworks

We present a dynamic channel reservation scheme to improve the utilization of wireless network resources while guaranteeing the required QoS of handoff calls. The wireless channels are dynamically reserved by using the request probability determined by the mobility characteristics and channel occupancy to guarantee acceptable quality of handoff calls and keep the new call blocking probability as low as possible     

Design and Analysis of a Channel Assignment Scheme for CDMA/TDMA Mobile Networks

In this paper, a channel assignment scheme is proposed for use in CDMA/TDMA mobile networks carrying voice and data traffic. In each cell, three types of calls are assumed to compete for access to the limited number of available channels by the cell: new voice calls, handoff voice calls, and data calls. The scheme uses the movable boundary concept in both the code and time domains in order to guarantee the quality of service (QoS) requirements of each type. A traditional Markov analysis method is employed to evaluate the performance of the proposed scheme. Measures, namely, the new call blocking probability, the handoff call forced termination probability, the data call loss probability, the expected number of handoff and the handoff link maintenance probability are obtained from the analysis. The numerical results, which are validated by simulation, indicate that the scheme helps meet the QoS requirements of the different call types.     

Modeling and efficient handling of handoffs in integrated wireless mobile networks

We propose and analyze two handoff schemes without and with preemptive priority procedures for integrated wireless mobile networks. We categorize the service calls into four different types, namely, originating voice calls, originating data calls, voice handoff request calls, and data handoff request calls and we assume two separate queues for two handoff services. A number of channels in each cell are reserved exclusively for handoff request calls. Out of these channels, few are reserved exclusively for voice handoff request calls. The remaining channels are shared by both originating and handoff request calls. In the preemptive priority scheme, higher priority is given to voice handoff request calls over data handoff request calls and can preempt data service to the queue if, upon arrival, a voice handoff request finds no free channels. We model the system by a three-dimensional Markov chain and compute the system performance in terms of blocking probability of originating calls, forced termination probability of voice handoff request calls, and average transmission delay of data calls. It is observed that forced termination probability of voice handoff request calls can be decreased by increasing the number of reserved channels. On the other hand, as a data handoff request can be transferred from a queue of one base station to another, there is no packet loss of data handoff except for a negligibly small blocking probability.     

Performance analysis of a preemptive and priority reservation handoff scheme for integrated service-based wireless mobile networks

We propose an analytical model for integrated real-time and non-real-time services in a wireless mobile network with priority reservation and preemptive priority handoff schemes. We categorize the service calls into four different types, namely, real-time and non-real-time service originating calls, and real-time and non real-time handoff service request calls. Accordingly, the channels in each cell are divided into three parts: one is for real-time service calls only, the second is for non-real-time service calls only, and the last one is for overflow of handoff requests that cannot be served in the first two parts. In the third group, several channels are reserved exclusively for real-time service handoffs so that higher priority can be given to them. In addition, a realtime service handoff request has the right to preempt non-real-time service in the preemptive priority handoff scheme if no free channels are available, while the interrupted non-real-time service call returns to its handoff request queue. The system is modeled using a multidimensional Markov chain and a numerical analysis is presented to estimate blocking probabilities of originating calls, forced termination probability, and average transmission delay. This scheme is also simulated under different call holding time and cell dwell time distributions. It is observed that the simulation results closely match the analytical model. Our scheme significantly reduces the forced termination probability of real-time service calls. The probability of packet loss of non-real-time transmission is shown to be negligibly small, as a non-real-time service handoff request in waiting can be transferred from the queue of the current base station to another one.     

基于高频段卫星动态信道预约的自适应QoS切换算法

未来高频段卫星网络将为固定和移动用户提供多媒体通信业务,而为移动用户提供无线多媒体业务的一个最关键的问题是保证端到端连接的业务质量。该文提出了一种基于高频段卫星动态信道预约的自适应QoS切换算法,并与其它切换方式进行了性能比较。     

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.<>     

基于动态信道预约的自适应QoS切换算法

未来无线网络将为固定和移动用户提供多媒体通信和计算业务．为移动用户提供无线多媒体业务的一个最关键的挑战是保证端到端连接的业务质量．通过重复使用无线频谱的微蜂窝或微微蜂窝结构是一个有前途的改善移动多媒体网络容量的方式．但切换次数随着蜂窝大小的降低而增加．移动多媒体网络的一个至关重要的问题是需要可以满足各种QoS需要且有更高资源利用率的有效切换方式．该文提出了一种称为基于动态信道预约的自适应QoS切换算法,并与其它切换方式进行了性能比较．