Adaptive multichannel data dissemination: support of dynamic traffic awareness and push-pull time balance

Data dissemination by the use of periodic broadcast is a viable scalable mechanism due to the explosion of information services in wireless networks. Many research works have exploited the data broadcast methodologies, however, upon the premise that the broadcast traffic is static on a single broadcast channel. In practice, the broadcast traffic changes dynamically and multiple broadcast channels can be utilized for efficient data dissemination. Accordingly, in this paper we devise an adaptive multichannel data-dissemination mechanism, including two components: the multichannel traffic-awareness and the deterministic balance search techniques. The multichannel traffic-awareness technique performs a cyclic estimation of dynamic access frequency distribution in response to traffic dynamics. With the measured estimation, the deterministic balance search technique adjusts channel allocation and item classification to further minimize and balance the push access and the pull response time. The experimental results show that the proposed mechanism is able to attain the result of channel partition and item classification very close to the optimum and, thus, minimize the mean access time in both push and pull channels simultaneously. Therefore, the reliability of broadcast contents is guaranteed.     

无线虚拟网络中基于自回归滑动平均预测的在线自适应虚拟资源分配算法

该文针对无线虚拟化网络中业务的不确定和信息反馈的时延而引起虚拟资源分配不合理,提出一种基于自回归滑动平均(ARMA)预测的在线自适应虚拟资源分配算法。首先,该算法以保障虚拟网络队列上溢概率为目标对时频资源和缓存资源进行联合分配,并建立虚拟网络总成本最小化的理论分析模型。其次,考虑到虚拟网络对不同资源差异化的应用需求,设计了一种多时间尺度的资源动态调度机制,在长周期上基于ARMA模型的预测信息实现缓存资源的预留策略,在短周期上基于利用大偏差原理推导的队列上溢概率对虚拟网络优先级排序,并根据确定的优先级动态调度时频资源,从而满足各虚拟网络的业务需求。仿真结果表明,该算法可有效降低比特丢失率,同时提升物理资源的利用率。     

DiffServ resource allocation for fast handoff in wireless mobileInternet

The next-generation wireless networks are evolving toward a versatile IP-based network that can provide various real-time multimedia services to mobile users. Two major challenges in establishing such a wireless mobile Internet are support of fast handoff and provision of quality of service (QoS) over IP-based wireless access networks. In this article, a DiffServ resource allocation architecture is proposed for the evolving wireless mobile Internet. The registration-domain-based scheme supports fast handoff by significantly reducing mobility management signaling. The registration domain is integrated with the DiffServ mechanism and provisions QoS guarantee for each service class by domain-based admission control. Furthermore, an adaptive assured service is presented for the stream class of traffic, where resource allocation is adjusted according to the network condition in order to minimize handoff call dropping and new call blocking probabilities     

End-to-End Adaptive QoS Provisioning over GPRS Wireless Mobile Network

The General Packet Radio Service (GPRS) offers performance guaranteed packet data services to mobile users over wireless frequency-division duplex links with time division multiple access, and core packet data networks. This paper presents a dynamic adaptive guaranteed Quality-of-Service (QoS) provisioning scheme over GPRS wireless mobile links by proposing a guaranteed QoS media access control (GQ-MAC) protocol and an accompanying adaptive prioritized-handoff call admission control (AP-CAC) protocol to maintain GPRS QoS guarantees under the effect of mobile handoffs. The GQ-MAC protocol supports bounded channel access delay for delay-sensitive traffic, bounded packet loss probability for loss-sensitive traffic, and dynamic adaptive resource allocation for bursty traffic with peak bandwidth allocation adapted to the current queue length. The AP-CAC protocol provides dynamic adaptive prioritized admission by differentiating handoff requests with higher admission priorities over new calls via a dynamic multiple guard channels scheme, which dynamically adapts the capacity reserved for dealing with handoff requests based on the current traffic conditions in the neighboring radio cells. Integrated services (IntServ) QoS provisioning over the IP/ATM-based GPRS core network is realized over a multi-protocol label switching (MPLS) architecture, and mobility is supported over the core network via a novel mobile label-switching tree (MLST) architecture. End-to-end QoS provisioning over the GPRS wireless mobile network is realized by mapping between the IntServ and GPRS QoS requirements, and by extending the AP-CAC protocol from the wireless medium to the core network to provide a unified end-to-end admission control with dynamic adaptive admission priorities.     

Data Broadcast with Adaptive Network Coding in Heterogeneous Wireless Networks

In this paper, we propose a new data broadcast mechanism with network coding in heterogeneous wireless networks. Our mechanism adaptively clusters the mobile hosts in fewer cells to minimize the bandwidth consumption. In addition, we adaptively code the data according to the data temporarily stored in each mobile host with a distributed manner. Our mechanism allows each delivered message to be coded from only a subset of data to further reduce the number of required messages. We formulate the cell selection and broadcast coding problem with integer programming and prove that the problem is NP-hard. We design a distributed algorithm based on Lagrangean relaxation. Our algorithm needs no server to record the location, queried, and stored information of receivers. Moreover, our algorithm is adaptive to the dynamic group membership, mobility, queried, and stored data of receivers.     

Real-Time Data Delivery Using Prediction Mechanism in Mobile Environments

Mobile data delivery is a critical issue in the mobile computing area. One of the most important problems is the efficient access to data. A proposed solution to this problem is the prefetching technique which consists in putting in reserving the information before the users need it. Low bandwidth, unreliable wireless links, and frequent disconnections of mobile environments make it difficult to satisfy the timing requirements of traditional strategies. This paper investigates broadcast scheduling strategies for push-based broadcast with timing constraints in the form of deadlines ,and proposes a prediction algorithm based on Kalman filter theory for this study. The proposed dissemination policy and adaptive bandwidth allocation scheme obtain sufficient conditions such that all the time-bounded traffic sources satisfy their timing constraints to provide various quality of service guarantees in the broadcast period. Our goal is to identify scheduling algorithms for broadcast systems that ensure requests meeting their deadlines. Our approach examines the performance of traditional real-time strategies and mobile broadcasting strategies, and demonstrates that traditional real-time algorithms do not always perform the best in mobile environments. The proposed design indeed achieves good performance in mobile environments.     

Voice/Data Integrated Wireless Channel Access in Third Generation Digital Cellular Networks: The Performance of Bursty Data Generated by Interactive Applications

Mobile wireless communications, which includecellular telephones, land mobile radio, and personalcommunications systems, have experienced enormous growthover the last decade. Data services represent a critical component of future wirelesscommunications, but have received little attention sofar. While some attention has been given to specializedmobile data networks, less has been directed at the ongoing design of data services in evolvingthird generation digital cellular wireless networks. Inthis work we present the results of a simulation studythat explores the performance of a Reservation Random Access (RRA) scheme for transmittingdata packets over a common radio broadcast channel in acellular radio environment. In addition to voicetraffic, we consider data packet traffic generated by interactive applications. It is expected thatsuch applications will be very important in thirdgeneration wireless access mobile communication systems.Through an extensive simulation study of the data message delay distribution, we show that theproposed RRA scheme, originally designed under thePoisson data message arrival process assumption, canalso efficiently operate and be optimized under theextremely bursty data message arrival processcharacterized by independent, identically distributed,Pareto message interarrival times.     

VANET: A novel service for predicting and disseminating vehicle traffic information

The arrival of cloud computing technology promises innovative solutions to the problems inherent in existing vehicular ad hoc network (VANET) networks. Because of the highly dynamic nature of these networks in crowded conditions, some network performance improvements are needed to anticipate and disseminate reliable traffic information. Although several approaches have been proposed for the dissemination of data in the vehicular clouds, these approaches rely on the dissemination of data from conventional clouds to vehicles, or vice versa. However, anticipating and delivering data, in a proactive way, based on query message or an event driven has not been defined so far by these approaches. Therefore, in this paper, a VANET‐Cloud layer is proposed for traffic management and network performance improvements during congested conditions. For the traffic management, the proposed layer integrates the benefits of the connected sensor network (CSN) to collect traffic data and the cloud infrastructure to provide on‐demand and automatic cloud services. In this work, traffic services use a data exchange mechanism to propagate the predicted data using a fuzzy aggregation technique. In the evaluation phase, simulation results demonstrate the effectiveness of the proposed VANET‐Cloud layer to dramatically improve traffic safety and network performance as compared with recent works.     

Network condition and application‐based data adaptive intelligent message routing in vehicular network

Recent advances in intelligent transportation systems enable a broad range of potential applications that significantly improve the vehicle and road safety and facilitate the efficient dissemination of information among the vehicles. To assist the vehicle traffic, message broadcasting is a widely adopted technique for road safety. But efficient message broadcasting is a significant issue, especially in a high network density due to the broadcast storm problem. To solve this issue, several methods are proposed to eliminate the redundant transmission of safety packets. However, they lack in restricting the broadcasting region of safety messages, and the transmissions of safety packets outside the dangerous region, and force the vehicles to unnecessary detours. This paper proposes an adaptive multimode routing protocol, network condition, and application‐based data adaptive intelligent message routing in vehicular network (NetCLEVER) that supports 2 modes of operation such as message broadcasting and intelligent routing. In message broadcasting mode, the NetCLEVER decides the dangerous region of the network by considering the changes of neighbor vehicles velocity, instead of current vehicle velocity, because a vehicle decision in velocity is interdependent with the preceding vehicles. In intelligent routing mode, the NetCLEVER exploits the cuckoo search optimization in routing by taking into account multiple routing factors such as the road topology of intersections and traffic signals and their impact on link stability, which improves the reliability of routing packets significantly. The performance evaluation illustrates that the proposed NetCLEVER improves reliable wireless communication as well as road safety in vehicular ad hoc networks.     

基于多门限预留机制的自适应带宽分配算法

针对异构无线网络融合环境提出了一种基于多门限预留机制的自适应带宽分配算法,从而为多业务提供QoS保证。该算法采用多宿主传输机制,通过预设各个网络中不同业务的带宽分配门限,并基于各个网络中不同业务和用户的带宽分配矩阵,根据业务k支持的传输速率等级需求和网络状态的变化,将自适应带宽分配问题转化为一个动态优化问题并采用迭代方法来求解,在得到各个网络中不同业务和用户优化的带宽分配矩阵的同时,在带宽预留门限和网络容量的约束条件下实现网络实时吞吐量的最大化,以提高整个异构网络带宽的利用效率。数值仿真结果显示,所提算法能够支持满足QoS需求的传输速率等级,减小了新用户接入异构网络的阻塞概率,提高了平均用户接入率并将网络吞吐量最大提高40%。     

Channel Management for Multi-Service Traffic in Cellular Wireless Networks

Channel management aims to provide quality of service guarantees for mobile users while efficiently utilize limited radio spectrum. With the increasing demand for diverse services in wireless networks, channel management for multi-service traffic in wireless networks is important. To provide diverse broadband services in limited radio spectrum, previous literature has presented adaptive services which provide mobile users with good quality of services. This study considers channel management for multi-service traffic in wireless networks with adaptive services. A channel management scheme, namely, restricted sharing, is devised to provide multi-class traffic with quality of service guarantees while increase channel utilization as much as possible. An analysis is used to study the performance of the restricted sharing scheme. Three classes are considered in numerical results. Numerical results show that the restricted sharing scheme guarantees quality of service and achieves high channel utilization.     

A prioritized resource allocation algorithm for multiple wireless body area networks

This paper presents a prioritized resource allocation algorithm to share the limited communication channel resource among multiple wireless body area networks. The proposed algorithm is designed based on an active superframe interleaving scheme, one of the coexistence mechanisms in the IEEE 802.15.6 standard. It is the first study to consider the resource allocation method among wireless body area networks within a communication range. The traffic source of each wireless body area network is parameterized using the traffic specification, and required service rate for each wireless body area networks can be derived. The prioritized resource allocation algorithm employs this information to allocate the channel resource based on the wireless body area networks’ service priority. The simulation results verified that the traffic specification and the wireless body area network service priority based resource allocation are able to increase quality of service satisfaction, particularly for health and medical services.     

Efficient Uplink Bandwidth Request with Delay Regulation for Real-Time Service in Mobile WiMAX Networks

The emerging broadband wireless access technology based on IEEE 802.16 is one of the most promising solutions to provide ubiquitous wireless access to the broadband service at low cost. This paper proposes an efficient uplink bandwidth request-allocation algorithm for real-time services in Mobile WiMAX networks based on IEEE 802.16e. In order to minimize bandwidth wastage without degrading quality of service (QoS), we introduce a notion of target delay and propose dual feedback architecture. The proposed algorithm calculates the amount of bandwidth request such that the delay is regulated around the desired level to minimize delay violation and delay jitter for real-time services. Also, it can increase utilization of wireless channel by making use of dual feedback, where the bandwidth request is adjusted based on the information about the backlogged amount of traffic in the queue and the rate mismatch between packet arrival and service rates. Due to the target delay and dual feedback, the proposed scheme can control delay and allocate bandwidth efficiently while satisfying QoS requirement. The stability of the proposed algorithm is analyzed from a control-theoretic viewpoint, and a simple design guideline is derived based on this analysis. By implementing the algorithm in OPNET simulator, its performance is evaluated in terms of queue regulation, optimal bandwidth allocation, delay controllability, and robustness to traffic characteristics.     

An adaptive dual-threshold power saving mechanism in WiMAX

In the energy saving mechanism with random delay in broadband wireless network, an adaptive algorithm based on the dual-threshold and dynamic scheduling model is presented. First, to solve the demand assignment problem of bandwidth allocation and improve the system overall performance in broadband wireless network, using dynamic scheduling method and best-effort and non-real-time polling service traffic are analyzed. Then, an adaptive dual-threshold PSM for WiMAX is proposed, which not only tunes the tradeoff to satisfy various QoS requirements, but also makes adaptive adjustment based on traffic. Finally, Simulation results show that the mechanism has superior performance in comparison with the ideal assumption of Poisson arriving.     

Radio Resource Allocation for Scalable Video Services Over Wireless Cellular Networks

Good quality video services always require higher bandwidth. Hence, to provide the video services e.g., multicast/broadcast services (MBSs) and unicast services along with the existing voice, internet, and other background traffic services over the wireless cellular networks, it is required to efficiently manage the wireless resources in order to reduce the overall forced call termination probability, to maximize the overall service quality, and to maximize the revenue. Fixed bandwidth allocation for the MBS sessions either reduces the quality of the MBS videos and bandwidth utilization or increases the overall forced call termination probability and of course the handover call dropping probability as well. Scalable video coding (SVC) technique allows the variable bit rate allocation for the video services. In this paper, we propose a bandwidth allocation scheme that efficiently allocates bandwidth among the MBS sessions and the non-MBS traffic calls (e.g., voice, unicast, internet, and other background traffic). The proposed scheme reduces the bandwidth allocation for the MBS sessions during the congested traffic condition only to accommodate more calls in the system. Instead of allocating fixed bandwidths for the MBS sessions and the non-MBS traffic, our scheme allocates variable bandwidths for them. However, the minimum quality of the videos is guaranteed by allocating minimum bandwidth for them. Using the mathematical and numerical analyses, we show that the proposed scheme maximizes the bandwidth utilization and significantly reduces the overall forced call termination probability as well as the handover call dropping probability.     

On the effects of traffic mixtures in direct broadcast satellite networks

In this paper we present a multi‐criterion control simulation in a realistically complex environment of a satellite network, involving non‐symmetric up and downlinks. Direct broadcast satellite (DBS) networks carrying heterogeneous traffic is characterized with challenges, such as high traffic burstiness, wireless channel dynamics, and large, but limited capacity. On the other hand, there are system characteristics that can be leveraged to address these challenges such as in centralized topology, different levels in quality of service (QoS) and priorities, availability of side information about channel conditions, flexibility in delivery of delay insensitive traffic, etc. We have developed an adaptive resource allocation and management (ARAM) system that takes the advantage of such characteristics to maximize the utilization of the available capacity on the forward DBS link, while maintaining QoS in the presence of channel effects and congestion in the network. Since variable‐bit‐rate (VBR) video traffic is given priority over available‐bit‐rate (ABR) data traffic in the ARAM concept, in this paper we investigate the impact of the fraction of VBR load in overall load. Copyright © 2002 John Wiley & Sons, Ltd.     

一种优化无线多媒体业务接入允许控制和资源分配算法

无线网络中的多媒体业务具有很大吸引力。本文将多媒体业务分为实时业务和非实时业务,提出了一种呼叫接入控制优化算法CAC-RA,此算法通过采用马尔科夫方法,排队论和非线性规划模型,同时解决呼叫允许控制和资源优化分配问题。提出的利益函数考虑了最大利用资源,同时满足无线网络各类用户的QoS要求,同时尽量减少用户的资源重新分配的频率和幅度变化,仿真实验数据显示CAC-RA算法能较好地适应业务变化的网络,同时实现了较为理想的利益值,满足无线网络多媒体用户的QoS要求。     

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.     

Dynamic random access code assignment for prioritized packet data transmission in WCDMA networks

We propose a measurement-based dynamic random access (RA) code assignment procedure for prioritized packet data transmission in wideband code-division multiple access (WCDMA) networks. This dynamic adaptation process is based on analytical performance results derived for random packet access under Rayleigh fading in WCDMA networks. The performance of the proposed measurement-based RA code assignment procedure with three different adaptation methods is evaluated by using computer simulations. The performance of the proposed scheme is compared with those of a retransmission control-based and static channel allocation-based prioritized packet access scheme. An integrated (physical layer and link layer) delay-throughput performance model is presented for finite population RA WCDMA systems. The proposed dynamic RA code assignment procedure can be used in an adaptive quality of service (QoS) framework for dynamically adjusting the QoS of prioritized RA data traffic in the evolving WCDMA-based differentiated services wireless Internet protocol networks.     

Cross-layer resource allocation for integrated Voice/Data traffic in wireless cellular networks

A major task in next-generation wireless cellular networks is provisioning of quality of service (QoS) over the bandwidth limited and error-prone wireless link. In this paper, we propose a cross-layer design scheme to provide QoS for voice and data traffic in wireless cellular networks with differentiated services (DiffServ) backbone. The scheme combines the transport layer protocols and link layer resource allocation to both guarantee the QoS requirements in the transport layer and achieve efficient resource utilization in the link layer. Optimal resource allocation problems for voice and data flows are formulated to guarantee pre-specified QoS with minimal required resources. For integrated voice/data traffic in a cell, a hybrid time-division/code-division medium access control (MAC) scheme is presented to achieve efficient multiplexing. Theoretical analysis and simulation results demonstrate the effectiveness of the proposed cross-layer approach.