Service Adaptability in Multimedia Wireless Networks

Next-generation wireless communication systems aim at supporting wireless multimedia services with different quality-of-service (QoS) and bandwidth requirements. Therefore, effective management of the limited radio resources is important to enhance the network performance. In this paper, we propose a QoS adaptive multimedia service framework for controlling the traffic in multimedia wireless networks (MWN) that enhances the current methods used in cellular environments. The proposed framework is designed to take advantage of the adaptive bandwidth allocation (ABA) algorithm with new calls in order to enhance the system utilization and blocking probability of new calls. The performance of our framework is compared to existing framework in the literature. Simulation results show that our QoS adaptive multimedia service framework outperforms the existing framework in terms of new call blocking probability, handoff call dropping probability, and bandwidth utilization.      

A fair resource allocation protocol for multimedia wireless networks

Wireless networks are expected to support real-time interactive multimedia traffic and must be able, therefore, to provide their users with quality-of-service (QoS) guarantees. Although the QoS provisioning problem arises in wireline networks as well, mobility of hosts and scarcity of bandwidth makes QoS provisioning a challenging task in wireless networks. It has been noticed that multimedia applications can tolerate and gracefully adapt to transient fluctuations in the QoS that they receive from the network. The additional flexibility afforded by the ability of multimedia applications to tolerate and adapt to transient changes in QoS can be exploited by protocol designers to significantly improve the overall performance of wireless systems. This paper presents a fair resource allocation protocol for multimedia wireless networks that uses a combination of bandwidth reservation and bandwidth borrowing to provide network users with QoS in terms of guaranteed bandwidth, call blocking, and call dropping probabilities. Our view of fairness was inspired by the well-known max-min fairness allocation protocol for wireline networks. Simulation results are presented that compare our protocol to similar schemes.     

Implementation of call admission control scheme in next generation mobile communication networks using particle swarm optimization and fuzzy logic systems

In the present and next generation wireless networks, cellular system remains the major method of telecommunication infrastructure. Since the characteristic of the resource constraint, call admission control is required to address the limited resource problem in wireless network. The call dropping probability and call blocking probability are the major performance metrics for quality of service (QoS) in wireless network. Many call admission control mechanisms have been proposed in the literature to decrease connection dropping probability for handoffs and new call blocking probability in cellular communications. In this paper, we proposed an adaptive call admission control and bandwidth reservation scheme using fuzzy logic control concept to reduce the forced termination probability of multimedia handoffs. Meanwhile, we adopt particle swarm optimization (PSO) technique to adjust the parameters of the membership functions in the proposed fuzzy logic systems. The simulation results show that the proposed scheme can achieve satisfactory performance when performance metrics are measured in terms of the forced termination probability for the handoffs, the call blocking probability for the new connections and bandwidth utilization.     

无线多媒体网络中一种基于测量网络状态的动态呼叫接纳控制算法

提出了一种无线多媒体网络中基于测量网络状态的动态呼叫接纳控制算法.它区分了实时和非实时业务,在网络带宽资源不足时可通过降低非实时业务带宽确保实时业务呼叫连接的可靠性;还可根据当前网络状况调整预留带宽大小,使小区实时业务切换呼叫掉线率低于设定的门限值.大量仿真结果显示该算法具有低实时业务切换呼叫掉线率和与固定预留方案相当的带宽利用率,而只以略高的新呼叫阻塞率为代价,适合各种不同概率发生时实际应用的情况.     

Application of support vector machines to bandwidth reservation in sectored cellular communications

Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping probability for handoffs in cellular communications. The handoff events occur at a much higher rate in sectored cellular networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced termination and waste of limited bandwidth in the sectored cellular communications, particularly when the handoff traffic is heavy. In this paper, a self-adaptive bandwidth reservation scheme, which adopts support vector machines technique, is proposed to reduce the forced termination probability. Meanwhile, a channel-borrowing technique is used to decrease the new call-blocking probability of real-time traffic. The simulation results show that the proposed scheme can achieve superior performance than the representative bandwidth-reserving schemes in sectored cellular networks in the literature when performance metrics are measured in terms of the forced termination probability and the new call- blocking probability.     

An efficient approach for distributed dynamic channel allocation with queues for real-time and non-real-time traffic in cellular networks

We are witnessing these days a rapid growth of mobile users. Therefore, frequency spectrum must be efficiently utilized, as available frequency spectrum is limited. This paper proposes a channel allocation scheme with efficient bandwidth reservation, which initially reserves some channels for handoff calls, and later reserves the channels dynamically, based on the user mobility. The direction of user mobility may not be straight always, but the user may also go left, right or backwards. Thus, QoS can be improved, if the channel reservation is made based upon the user mobility and the location of the user. We devise here a new algorithm that deals with multiple traffic systems by modifying the existing DDCA algorithm [Krishna, P.V., Iyengar, N.Ch.S.N., 2008. Optimal channel allocation algorithm with efficient channel reservation for cellular networks. International Journal of Communication Networks and Distributed Systems 1 (1), 33-51]. This algorithm reserves more channels for hot cells, less number of channels for cold cells and an average number of channels for the medium cells. Furthermore, we maintain queues for all types of calls. We model the system by a three-dimensional Markov Chain and compute the QoS parameters in terms of the blocking probability of originating calls and the dropping probability of handoff calls. The results indicate that the proposed channel allocation scheme exhibits better performance by considering the above mentioned user mobility, type of cells, and maintaining of the queues for various traffic sources. In addition, it can be observed that our approach reduces the dropping probability by using reservation factor.     

Dynamically adaptive channel reservation scheme for cellular networks

In personal communications networks (PCN) supporting network-wide handoffs, new and handoff requests compete for connection resources in both mobile and backbone networks. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. In general, most of the previously proposed schemes for radio channel allocation in cellular networks reduce handoff call blocking probability substantially at the expense of increasing the new call blocking probability by giving higher priority to handoff calls over new calls in admission control. This reduces the total admitted traffic and results in inefficient utilization of wireless channels. The tradeoff between the new and handoff calls blocking probabilities should be defined on importance basis. In this paper, we propose a performance metric equation that makes a trade off between the two probabilities depending on the network preferences. Using this equation, we study the performance of various proposed channel reservation schemes. Also in this paper, a new dynamically adaptive channel reservation scheme (DACRS) is developed and compared with other schemes proposed in the literature. The DACRS assigns handoff-reserved channels to new calls depending on the locality principle in which the base station with the help of location estimation algorithms in the mobile location center predicts the position of the mobile terminal. Eventually, the DACRS is designed to improve channel utilization while satisfying the QoS of the calls. As will be shown analytically and through simulation, the DACRS outperforms current reservation schemes and results in more statistical gain, and powerful channel utilization.     

Preemption-Aware Instantaneous Request Call Routing for Networks With Book-Ahead Reservation

This paper presents a new preemption-aware quality of service (QoS) routing algorithm for instantaneous request (IR) call connections in a QoS-enabled network where resources are shared between IR and book-ahead (BA) call connections. BA reservation, which confirms the availability of resources in advance, is a highly attractive technique for time sensitive applications that require high amount of bandwidth with guaranteed QoS. One of the major concerns for the implementation of BA reservation is the need for preemption of on-going IR calls to accommodate BA calls when resource scarcity arises. Preemption disrupts service continuity of on-going calls which is considered as severely detrimental from users' perceived QoS definition found in recent studies. Existing QoS routing algorithms focus on resource conservation or load balancing as the key objective to attain in addition to guaranteed QoS. No works have yet focused on the preemption problem of on-going IR calls at routing stage in the presence of BA calls. We present a mathematical formulation to compute the preemption probability of an incoming IR call at routing stage based on the current IR and future BA load information. We propose a routing strategy by formulating a link cost function comprising of the calculated preemption probability of the incoming IR call and hop count. Simulation results confirm that QoS routing based on the proposed link cost function significantly outperforms widely recommended shortest path and widest path routing algorithms in terms of IR call preemption and blocking rate. The proposed approach also yields higher network utilization and IR effective throughput.     

OFDMA系统中的多业务接入控制算法

提出一种针对分析正交频分多址接入(OFDMA)系统的改进多业务接入控制算法。OFDMA系统为用户提供一定数量的子载波进行传输,通过压缩原信道带宽或传输速率,降低原信道上的业务服务质量,从而提高小区内可使用的信道数量。仿真结果表明,与传统信道预留算法相比,该算法可提高信道资源利用率,降低目标小区的切换呼叫阻塞率和新呼叫阻塞率。     

On utility-fair bandwidth adaptation for multi-class traffic QoS provisioning in wireless networks

The ability to adjust the allocated bandwidth of ongoing calls to cope with wireless network resource fluctuations is becoming increasingly important. In this paper, we describe a utility-based bandwidth adaptation scheme for multi-class traffic quality-of-service (QoS) provisioning in wireless networks. With the proposed scheme, each call is assigned a utility function according to its adaptive characteristics. Depending on the network load the allocated bandwidth of ongoing calls are upgraded or degraded dynamically such that each call receives fair utility. The quantization of utility function by dividing the utility range into a fixed number of equal intervals is a key feature of our proposed utility-fair algorithm. Appropriate call admission control and bandwidth reservation policies are also integrated into the proposed scheme to provide QoS guarantees to the new and handoff calls. Extensive simulation experiments have been conducted to evaluate the performance of the proposed scheme compared with two other existing ones. Results show that our bandwidth adaptation scheme is effective in achieving utility fairness while keeping the call blocking and handoff dropping probabilities substantially low.     

MQ: an integrated mechanism for multimedia multicasting

This paper studies the integration of multimedia multicasting, with the consideration of multicast with end-to-end QoS guarantees by resource reservation, dynamic join and departure of participants, user heterogeneity, scalability, robustness, and loop-free control. A protocol called MQ, Multicast with QoS, is proposed to support multimedia group communications with QoS guarantees for heterogeneous recipients. With MQ, while resource reservation is de-coupled from QoS multicast routing, they are integrated in a way to avoid the problem of “sender-oriented” path determination, a problem that occurs when RSVP is used in conjunction with QoS routing for heterogeneous reservations. Being a truly receiver-oriented and integrated scheme for multimedia multicasting, MQ supports such integration in a robust, scalable and loop-free way. It also accommodates heterogeneous users with varied QoS, dynamically adjusts QoS trees to improve resource utilization, and guarantees end-to-end QoS requirements. We have conducted simulations to evaluate the performance of the proposed mechanism. MQ demonstrates its advantages over the conventional loosely coupled integration of TP multicasting, resource reservation and QoS routing, in terms of better accommodation of heterogeneous users, higher scalability, lower blocking probability for users to join groups with service guarantees, and more efficient resource utilization to enhance system performance     

无线网络时变带宽业务的准入控制性能分析

无线蜂窝网络的通话准入控制方法与通话的 Qo S以及无线信道的利用率密切相关 .使用 Markov过程得出了业务带宽需求时变状况下系统性能 (通话的切换掉线概率、并发掉线概率、阻塞概率以及信道利用率 )的理论模型 .通过数值结果分析了系统负载、用户的移动、通话的持续时间对系统性能的影响     

支持动态带宽分配的呼叫接入策略

为了适应无线网络对多媒体业务的业务服务质量的需求,论文根据无线网络的多媒体业务特征,提出了一种支持动态带宽分配的无线多媒体业务的呼叫接入策略。通过对该策略进行数学模型分析和数值仿真,结果表明,该策略在小区带宽紧张时,通过降低可变带宽业务的业务带宽,能有效降低用户呼叫阻塞概率和中断概率;在小区带宽有剩余时,可以通过增加可变带宽业务的服务带宽来提高资源利用率。另外,可变带宽业务还能够灵活地借用为越区切换用户预留的带宽资源,充分地利用系统资源。     

A preemptive channel allocation scheme for multimedia traffic in mobile wireless networks

This paper presents a channel allocation model with both partial and full preemptive capabilities for multimedia traffic in mobile wireless networks. The different types of multimedia traffic in transmitting through next-generation networks possess different characteristics and demand an adequate channel allocation scheme to fulfill individual Quality of Service (QoS) requirements. In the proposed model, multimedia traffic is classified into three classes corresponding to different priority levels in a decreasing order. To effectively reduce the dropping probability, a higher-priority handoff call is allowed to fully or partially preempt any lower-priority ongoing calls when the channel capacity becomes insufficient. In addition, to prevent from possible starvation of the lowest-priority traffic, a portion of system channels are purposely reserved. Performance measures, including the dropping probability of handoff calls, the call-interruption probability that an ongoing call is forced to termination due to full preemption, and the bandwidth reduction ratio due to partial preemption, are investigated through an analytical model built with 4-D Markov chains. The numerical results demonstrate the effectiveness of our model.     

Connection-dependent threshold model: a generalization of the Erlang multiple rate loss model

In this paper first, we review two extensions of the Erlang multi-rate loss model (EMLM), whereby we can assess the call-level quality-of-service (QoS) of ATM networks. The call-level QoS assessment in ATM networks remains an open issue, due to the emerged elastic services. We consider the coexistence of ABR service with QoS guarantee services in a VP link and evaluate the call blocking probability (CBP), based on the EMLM extensions. In the first extension, the retry models, blocked calls can retry with reduced resource requirements and increased arbitrary mean residency requirements. In the second extension, the threshold models, for blocking avoidance, calls can attempt to connect with other than the initial resource and residency requirements which are state dependent. Secondly, we propose the connection-dependent threshold model (CDTM), which resembles the threshold models, but the state dependency is individualized among call-connections. The proposed CDTM not only generalizes the existing threshold models but also covers the EMLM and the retry models by selecting properly the threshold parameters. Thirdly, we provide formulas for CBP calculation that incorporate bandwidth/trunk reservation schemes, whereby we can balance the grade-of-service among the service-classes. Finally, we investigate the effectiveness of the models applicability on ABR service at call set-up. The retry models can hardly model the behavior of ABR service, while the threshold models perform better than the retry models. The CDTM performs much better than the threshold models; therefore we propose it for assessing the call-level performance of ABR service. We evaluate the above-mentioned models by comparing each other according to the resultant CBP in ATM networks. For the models validation, results obtained by the analytical models are compared with simulation results.     

A multi-layer experimental study of multimedia and QoS communication in wireless mesh networks

A significant issue in Mesh networks is to support multimedia transmissions while providing Quality of Service (QoS) guarantees to mobile users. For real-time multimedia streaming, unstable throughput or insufficient bandwidth will incur unexpected delay or jitter, and it remains difficult to provide comprehensive service guarantees for a wireless mesh environment. In this paper, we target the problem of providing multimedia QoS in wireless mesh networks. We design and implement a campus test-bed for supporting multimedia traffic in mobile wireless mesh networks, and investigate in detail some possible improvements on a number of layers to enable multimedia transmission over wireless networks with QoS support. We first study a number of improvements of some existing routing protocols to support multimedia transmissions. Some new admission control and rate control mechanisms are studied and their performance gains are verified in our experiments. In our new cross-layer adaptive rate control (CLARC) mechanism, we adaptively change the video encoder’s output bit rate based on the available network bandwidth to improve the quality of the received video. We also design a mobile gateway protocol to connect the MANET to Internet and a wireless LAN management protocol to automatically manage WLAN to provide some QoS.     

基于马尔科夫链的联合呼叫接入控制算法

异构网络的接入策略与网络资源管理效率紧密相关;同时,网络复杂性与网络资源竞争性直接影响到用户服务质量。针对异构网络接入控制存在的切换掉话率和呼叫阻塞率高、资源利用率低等问题,提出了基于马尔科夫链的联合呼叫接入控制算法。接入控制算法为切换呼叫业务、实时业务动态地预留了一定的带宽资源,根据不同业务设置带宽降级因子来决定是否释放带宽;同时,根据用户偏好和不同业务的QoS要求,构建了呼叫接入控制效用函数,利用马尔科夫链进行了建模分析。仿真表明,算法提高了网络资源利用率,降低了系统复杂度,满足了各类业务的QoS要求。     

支持多媒体业务的新型无线多跳网络MAC协议*

提出了一种单信道无线多跳网络同步媒体接入控制协议—M-TDMA。基于信道预约,协议采用分类调度机制以满足多媒体业务中各类业务的服务质量需求。协议采用信道使用列表（CUL）、预约控制时隙、划分竞争期和非竞争期等措施维护预约信道,降低分组冲突率,提高信道使用率。分析结果表明,协议在保证分组传输可靠性的同时,传输时延较低,能够较好地支持多媒体业务的服务质量需求。     

一种自适应的扇型微蜂房式带宽预留通信模式

在目前的跨区域连接方式中,扇型微蜂房式的网络系统比传统的微蜂房式系统有更高的传输速度.文中介绍了一种自适应的带宽预留模式,这种模式使用了一种神经模糊带宽预留估计量的技术,经过证实,这种技术能够减少客户连接时被强行终止的概率.在这种带宽预留模式中,使用一种通道借用技术能够在实时通信时,减少新的呼叫受阻现象的发生.通过分析强行终止的客户连接和呼叫受阻的概率事件,仿真结果表明,采用扇型微蜂房式的网络系统比传统的固定带宽预留模式要有更好的性能.     

Dynamic bandwidth allocation for 3G wireless systems—A fuzzy approach

3G Wireless systems are to support multiple classes of traffic with widely different characteristics and quality of service (QoS) requirements. A major challenge in this system is to guarantee the promised QoS for the admitted users, while maximizing the resource allocation through dynamic resource sharing. In the case of multimedia call, each of the services has its own distinct QoS requirements concerning probability of blocking (P_B), service access delay (SAD), and access delay variation (ADV). The 3G wireless system attempts to deliver the required QoS by allocating appropriate resources (e.g. bandwidth, buffers), and bandwidth allocation is a key in achieving this. Dynamic bandwidth allocation policies reported so far in the literature deal with audio source only. They do not consider QoS requirements. In this work, a fuzzy logic (FL)-based dynamic bandwidth allocation algorithm for multimedia services with multiple QoS (P_B, SAD, ADV, and the arrival rate) requirements are presented and analyzed. Here, each service can declare a range of acceptable QoS levels (e.g. high, medium, and low). As QoS demand varies, the proposed algorithm allocates the best possible bandwidth to each of the services. This maximizes the utilization and fair distribution of resources. The proposed allocation method is validated in a variety of scenarios. The results show that the required QoS can be obtained by appropriately tuning the fuzzy logic controller (FLC).