Call admission control scheme for real-time services in packet-switched OFDM wireless networks

A call admission control scheme is proposed for real-time services in packet-switched orthogonal frequency division multiplexing （OFDM） wireless cellular networks. The main idea of the proposed scheme is to use maximum acceptance ratio to maintain maximum channel utilization for real-time services according to the desired packet-level and call- level quality-of-service （QoS） requirements. The acceptance ratio is periodically adjusted by using a time discrete Markov chain and Wiener prediction theory according to the varying traffic load. Extensive simulation results show that this algorithm maintains high channel utilization, even as it guarantees packet-level and call-level QoS requirements for real-time services.     

OBS网络中支持实时业务的管道机制

在分析光突发交换网络时延的基础上,提出了一种有效支持实时业务的管道机制.在边缘节点与核心节点之间建立通信管道.实时业务的突发控制包通过管道的核心节点时,不需要被处理,其处理时间为零,因而减少了偏置时间和网络时延.同时也降低了核心节点处理突发控制包的次数,降低了核心节点的实现复杂度.仿真结果表明,管道机制能有效降低实时业务的端对端时延.     

Resource allocation for real-time traffic in unreliable wireless cellular networks

Providing reliable transmission for real-time traffic in wireless cellular networks is a great challenge due to the unreliable wireless links. This paper concentrates on the resource allocation problem aiming to improve the real-time throughput. First, the resource allocation problem is formulated as a Markov Decision Process and thus the optimal resource allocation policy could be obtained by adopting the value iteration algorithm. Considering the high time complexity of the optimal algorithm, we further propose an approximate algorithm which decomposes the resource allocation problem into two subproblems, namely link scheduling problem and packet scheduling problem. By this method, the unreliable wireless links are only constrained in the link scheduling problem, and we can focus on the real-time requirement of traffic in packet scheduling problem. For the link scheduling problem, we propose the maxRel algorithm to maximize the long-term network reliability, and we theoretically prove that the maxRel algorithm is optimal in scenarios with dynamic link reliabilities. The Least Laxity First algorithm is adopted for the packet scheduling problem. Extensive simulation results show that the proposed approximate resource allocation algorithm makes remarkable improvement in terms of time complexity, packet loss rate and delay.     

Connection-based scheduling for supporting real-time traffic in wireless mesh networks

Packet transmission scheduling for supporting real-time traffic in a WMN is difficult, and one of the main challenges is to coordinate temporal operations of the mesh access points (APs) in order to provide strict latency guarantee while efficiently utilizing the radio resources. In this paper a connection-based scheduling (CBS) scheme is proposed. Connections with more hops are given a higher priority, and connections with a lower priority can only use resources remaining from serving all higher priority ones. For each multihop connection, the scheduling minimizes latency between successive hops. A connection-based optimization problem is formulated with an objective to minimize the amount of required AP resources, subject to the latency requirement of the connections. Numerical results show that the proposed scheduling scheme achieves close-to-optimum performance at both the connection and packet levels.     

Long-term rate control for concurrent multipath real-time video transmission in heterogeneous wireless networks

Concurrent multipath transmission provides an effective solution for streaming high-quality mobile videos in heterogeneous wireless networks. Rate control is commonly adopted in multimedia communication systems to fully utilize the available network bandwidth. This paper proposes a novel rate control for concurrent multipath video transmission. The existing rate control algorithms mainly adapt bit rate in the short-term pattern, i.e., without considering the long-term video transmission quality. We propose a long-term rate control scheme that takes into account the status of both the transmission buffer and video frames. First, a mathematical model is developed to formulate the non-convex problem of long-term quality maximization. Second, we develop a dynamic programming solution for online encoding bit rate control based on buffer status. The performance evaluation is conducted in a real test bed over LTE and Wi-Fi networks. Experimental results demonstrate that the proposed long-term rate control scheme achieves appreciable improvements over the short-term rate control schemes in terms of video quality and delay performance.     

End-to-end optimized TCP-friendly rate control for real-time video streaming over wireless multi-hop networks

Rate control is an important issue in video streaming applications. The most popular rate control scheme over wired networks is TCP-Friendly Rate Control (TFRC), which is designed to provide optimal transport service for unicast multimedia delivery based on the TCP Reno’s throughput equation. It assumes perfect link quality, treating network congestion as the only reason for packet losses. Therefore, when used in wireless environment, it suffers significant performance degradation because of packet losses arising from time-varying link quality. Most current research focuses on enhancing the TFRC protocol itself, ignoring the tightly coupled relation between the transport layer and other network layers. In this paper, we propose a new approach to address this problem, integrating TFRC with the application layer and the physical layer to form a holistic design for real-time video streaming over wireless multi-hop networks. The proposed approach can achieve the best user-perceived video quality by jointly optimizing system parameters residing in different network layers, including real-time video coding parameters at the application layer, packet sending rate at the transport layer, and modulation and coding scheme at the physical layer. The problem is formulated and solved as to find the optimal combination of parameters to minimize the end-to-end expected video distortion constrained by a given video playback delay, or to minimize the video playback delay constrained by a given end-to-end video distortion. Experimental results have validated 2–4 dB PSNR performance gain of the proposed approach in wireless multi-hop networks by using H.264/AVC and NS-2.     

An adaptive FEC scheme for data traffic in wireless ATM networks

A new adaptive forward-error-correction scheme (AFEC) is introduced at the link layer for TCP/IP data traffic in wireless ATM networks. The fading and interference in wireless links cause high and variable error rates, as well as bursty errors. The purpose of the AFEC scheme is to provide a dynamic error-control mechanism by using Reed-Solomon coding to protect the ATM cell payload, as well as the payload type indicator/cell loss priority fields in the ATM cell header. In order to enhance the error tolerance in cell framing and correct delivery, the AFEC scheme functions within a new concept called LANET framing and addressing protection mechanisms. The AFEC scheme has been validated using a simulation testbed of a low-speed wireless ATM network     

joint target delay determination and rate control for real-time videos in heterogeneous wireless networks

In heterogeneous wireless networks with time-varying channels, the video rate is usually adjusted based on the network bandwidth to guarantee ultra-low latency video transmission under an end-to-end target delay constraint. However, the target delay with a fixed value according to historical experience cannot guarantee the quality of video continuously since wireless network bandwidth changes rapidly, especially when the network deteriorates. An alternative scheme is to dynamically set the target delay according to the network status within an acceptable delay range. However, this scheme cannot be ensured in heterogeneous wireless networks with time-varying channels. Thus, to address this issue, a multi-objective optimization algorithm for joint optimization of rate control and target delay is proposed, where the target delay and video rate are jointly adjusted dynamically. Second, to reduce the optimization complexity due to the multi-objective and multi-parameter characteristics, multi-objective optimization algorithm be decomposed and solved by optimizing each independent sub-problem. Finally, the proposed algorithm is verified on a semi-physical simulation platform. Experiments show that the frame loss rate is reduced from 6.65% to 2.06%, and a peak signal-to-noise ratio (PSNR) gain of 18.32% is obtained when the network performance is low.     

CDMA网络中多媒体业务的接入控制

从码分多址(CDMA)系统的特点出发，采用多维马尔可夫过程来分析多媒体业务共存时基于干扰水平的接入控制策略，得到在小区容量可变情况下的系统性能。文中考虑到切换用户的优先级以及不同类型用户的不同QoS要求，还在系统中设置了多级接入门限，从而实现在扩大系统容量的同时，又力求保证系统已有的链路质量，实现接入控制的目的。     

ARC: an integrated admission and rate control framework for competitive wireless CDMA data networks using noncooperative games

The competition among wireless data service providers brings in an option for the unsatisfied customers to switch their providers, which is called churning. The implementation of Wireless Local Number Portability (WLNP) is expected to further increase the churn rate (the probability of users switching the provider). However, the existing resource management algorithms for wireless networks fail to fully capture the far-reaching impact of this unforeseen competitiveness. From this perspective, we first formulate noncooperative games between the service providers and the users. A user's decision to leave or join a provider is based on a finite set of strategies. A service provider can also construct its game strategy set so as to maximize their utility (revenue) considering the churn rate. Based on the game theoretic framework, we propose an integrated admission and rate control (ARC) framework for CDMA-based wireless data networks. The admission control is at the session (macro) level while the rate control is at the link layer packet (micro) level. Two admission control modes are considered - one-by-one mode and batch processing mode, in which multiple users are admitted at a time. We show that: 1) for the one-by-one mode, the Nash equilibrium using pure strategy can be established for both under-loaded and fully-loaded systems and 2) for batch processing mode, there is either an equilibrium in pure strategy or a dominant strategy exists for the service provider. Therefore, the providers have clearly defined admission criteria as outcome of the game. Users are categorized into multiple classes and offered differentiated services based on the price they pay and the service degradation they can tolerate. We show that the proposed ARC framework significantly increases the provider's revenue and also successfully offers differentiated QoS to the users.     

An adaptive reservation scheme for VBR voice traffic in wireless ATM networks

A reservation scheme, named dynamic hybrid partitioning, is proposed for the Medium Access Control (MAC) protocol of wireless ATM (WATM) networks operating in Time Division Duplex (TDD) mode. The goal is to improve the performance of the real-time Variable Bit Rate (VBR) voice traffic in networks with mixed voice/data traffic. In most proposed MAC protocols for WATM networks, the reservation phase treats all traffic equally, whether delay-sensitive or not. Hence, delay-sensitive VBR traffic sources have to compete for reservation each time they wake up from idle mode. This causes large and variable channel access delays, and increases the delay and delay variation (jitter) experienced by ATM cells of VBR traffic. In the proposed scheme, the reservation phase of the MAC protocol is dynamically divided into a contention-free partition for delay-sensitive idle VBR traffic, and a contention partition for other traffic. Adaptive algorithms dynamically adjust the partition sizes to minimize the channel bandwidth overhead. Simulation results show that the delay performance of delay-sensitive VBR traffic is improved while minimizing the overhead.     

Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks

Next generation wireless code division multiple access (CDMA) networks are required to support packet multimedia traffic. This paper addresses the connection admission control problem for multiservice packet traffic modeled as Markov modulated Poisson process (MMPP) with the quality of service (QoS) requirements on both physical layer signal-to-interference ratio (SIR) and network layer blocking probability. Optimal linear-programming-based algorithms are presented that take into account of SIR outage probability constraints. By exploiting the MMPP traffic models and introducing a small SIR outage probability, the proposed algorithms can dramatically improve the network utilization. In addition, we propose two reduced complexity algorithms that require less computation and can have satisfactory approximation to the optimal solutions. Numerical examples illustrating the performance of the proposed schemes are presented.     

Mobility modeling and analytical solution for spatial traffic distribution in wireless multimedia networks

In this paper, we propose a general mobility model suitable for wireless multimedia networks. Our model is based on splitting a region into subregions. Furthermore, we make an analogy between subregions as well as their inter-connections with a multi-class Jackson queueing network comprising of infinite-server nodes. The main attribute of such a network is due to its product-form stationary distribution. Using this model, we are able to obtain a closed analytical form for the spatial traffic distribution corresponding to a specific number of network-connected users with different classes of service and mobility in a typical region. Also, we show the flexibility obtained by the proposed mobility model in representing some general distributions such as sum-of-hyper-exponentials (SOHYP), hyper-Erlang and Cox which were previously suggested to model mobility-related statistical parameters, e.g., cell dwell time and channel holding time. Finally, we apply the proposed model to a few mobility scenarios and obtain the resultant active user's location density.     

基于信息覆盖的无线传感器网络访问控制机制

通过周期性地信息扩散,设计THC(two-hop cover)算法,使传感器节点能够在用户移动过程中及时得到用户的认证信息.基于THC算法,引入Merkle散列树和单向链等安全机制,采用分布式的访问控制模式,提出了适用于随机移动用户的传感器网络访问控制机制.分析和实验表明,本机制既适用移动用户,也适用静止用户,计算、通信、存储开销低,能够抵制节点捕获、重放、DoS等攻击.     

Fixed collision rate back-off scheme for collision resolution in wireless networks

This investigation proposes a fixed collision rate (FCR) back-off algorithm for wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) algorithms. It is shown that, when maximum throughput is achieved, collision rate is almost a constant for any traffic load. In the operation of the FCR, the CU dynamically adjusts the back-off window size to keep the collision rate at a constant level for maximum throughput. Simulation results demonstrate that the unfairness of bandwidth utilization in the BEB is significantly lessened and the throughput can be maintained at e^-1≈0.368 when the number of users approaches infinity. The capture effect even further improves system performance.     

无线传感器网络的簇头功率控制技术

在军事侦察与环境监测中,无线传感器网络一般部署在无人区域或危险区域,不能依靠人对系统进行配置与管理.网络节点通过撒播造成分簇后密度不均,影响了网络性能.由于同簇节点通信使用同一信道,簇的大小直接关系到每个节点的通信能力.当簇内节点个数处于一个合适的范围时,网络才能发挥最好的性能.因此需要对簇头进行功率控制来优化网络结构.针对这一缺乏准确数学模型的过程,提出一种基于PID的模糊自适应的变步长簇头功率控制方案,把簇内节点数目控制在一个合理的范围内.其特点是概念简单、易于理解和提高系统的鲁棒性,仿真结果从理论上证明了通过控制分簇大小以后,网络的寿命和通信能力都有所增加.     

Reducing signaling traffic in wireless ATM networks through handoff scheme improvement

We propose a new handoff call management scheme which reduces signaling traffic in wireless ATM networks and improves the efficiency of the virtual channel. Chaining followed by a make‐break algorithm is a suitable handoff scheme for various situations. In the chaining part of the scheme, a chain routing algorithm is studied and compared with the hop‐limiting scheme. When the algorithm is implemented in our scheme, it improves the performance of the existing scheme in call drop rates so as to reduce the signaling traffic in wireless ATM networks. Copyright © 2002 John Wiley & Sons, Ltd.     

Efficient traffic prediction scheme for real-time VBR MPEG videotransmission over high-speed networks

The efficient transportation of real-time variable bit rate (VBR) video traffic in high-speed networks is currently an active area of research. The capability to predict VBR video traffic can significantly improve the effectiveness of numerous management tasks, including dynamic bandwidth allocation and congestion control. This paper proposes an adaptive traffic prediction method for VBR MPEG videos, a major multimedia application. Rapid traffic variations due to scene changes are analyzed, then a prediction scheme using the identification of scene changes related to I and P frames is presented. For predicting multiplexed MPEG traffic, a prediction interval is derived that represents a highly correlated traffic sequence. In addition, to reduce the prediction error, a less fluctuating signal instead of the original multiplexed traffic is used as the input for the predictor. Simulation results show that the proposed method is able to predict the original traffic more accurately than the conventional LMS method     

Predictive QoS-based admission control for multiclass traffic incellular wireless networks

We develop the notion of quality of service (QoS) for multimedia traffic in terms of maximum call dropping probabilities independent of system load and a predefined call blocking probability profile for the different traffic classes for wireless networks of arbitrary shape and dimension. We describe two distributed predictive admission control algorithms, independent multiclass one-step prediction (IMOSP-CS and IMOSP-RES), which provide each traffic class with a given call dropping probability and a desired call blocking probability profile. Both algorithms may be seen as extensions of the multimedia one-step prediction (MMOSPRED) algorithm previously reported, which uses prediction of the overload probability in the home and neighbor cells in deciding whether to admit new users into a multiclass cellular system. The two algorithms differ in their approach to handoff call admission. The first algorithm completely shares the bandwidth among the entering handoff users while the second implements a partition-based reservation scheme. In this paper, we additionally impose a call blocking criterion that ensures a system-imposed call priority independent of the traffic in the system and which adapts to changes in the offered load. In comparing these algorithms to each other, we focus on system throughput and class independence. Both algorithms provide appropriate throughput under both homogeneous and heterogeneous traffic loading conditions while maintaining steady call dropping probabilities for each traffic class     

A rate adaptation transcoding scheme for real-time video transmission over wireless channels

In this work, we investigate the problem of bit-rate adaptation transcoding for transmitting video over burst-error wireless channels, i.e., channels such that errors tend to occur in clusters during fading periods. In particular, we consider a scenario consisting of packet-based transmission with an Automatic Repeat reQuest (ARQ) error control and a feedback channel. With the acknowledgements received through the feedback channel and a statistical channel model, we have an estimate of the current channel state, and effective channel bandwidth. In this paper, we analyze the buffering implications of inserting a video transcoder at the wireless access point with the variable bit-rate channel as the target. We derive the conditions that both the source encoder and transcoder buffers have to meet for preventing the end decoder buffer from underflowing. Furthermore, we propose a bit-rate adaptation algorithm for VBR transcoders used in the wireless access point. Our experimental results demonstrate that the proposed algorithm can accurately control the bit-rate of the transcoded video stream and reduce the number of frames been skipped without violating the end-to-end delay requirement.