光无线混合宽带接入网QoS感知DBA算法

针对光无线混合宽带接入网的特点,提出一种考虑公平性的Qo S感知DBA算法(QDBA)。仿真结果表明:与已有算法相比,QDBA具有较高的吞吐量和较低的平均时延,同时具有更好的公平性和Qo S保障。     

Bandwidth allocation and admission control scheme based on Nash bargaining solution for WiMAX systems

Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access (TDMA) mode. In this article, the problem of bandwidth allocation and admission control is formulated as a Nash bargaining model. The nash bargaining solution (NBS) derived from the cooperative game is adopted to maximize the spectrum utilization. Analysis and simulation results show that there is a unique Pareto optimal bandwidth allocation solution by using NBS among various flows. Furthermore, maximum utility of the system can also be maintained by using the admission control policy with different number of connections and variable channel qualities. The total throughput of the proposed scheme is close to the maximal one, while significantly improving fairness compared to the existing solutions.     

Opportunistic delay‐margin‐based resource allocation for next‐generation wireless networks

This paper studies and develops efficient traffic management techniques for downlink transmission at the base station (BS) of multi‐service IP‐based networks by combining quality‐of‐service (QoS) provision and opportunistic wireless resource allocation. A delay‐margin‐based scheduling (DMS) for downlink traffic flows based on the delays that each packet has experienced up to the BS is proposed. The instantaneous delay margin, represented by the difference between the required and instantaneous delays, quantifies how urgent the packet is, and thus it can determine the queuing priority that should be given to the packet. The proposed DMS is further integrated with the opportunistic scheduling (OPS) to develop various queueing architectures to increase the wireless channel bandwidth efficiency. Different proposed integration approaches are investigated and compared in terms of delay outage probability and wireless channel bandwidth efficiency by simulation. Copyright © 2010 John Wiley & Sons, Ltd.     

Cross‐layer bandwidth and power allocation for a two‐hop link in wireless mesh network

In this paper, a cross‐layer analytical framework is proposed to analyze the throughput and packet delay of a two‐hop wireless link in wireless mesh network (WMN). It considers the adaptive modulation and coding (AMC) process in physical layer and the traffic queuing process in upper layers, taking into account the traffic distribution changes at the output node of each link due to the AMC process therein. Firstly, we model the wireless fading channel and the corresponding AMC process as a finite state Markov chain (FSMC) serving system. Then, a method is proposed to calculate the steady‐state output traffic of each node. Based on this, we derive a modified queuing FSMC model for the relay to gateway link, which consists of a relayed non‐Poisson traffic and an originated Poisson traffic, thus to evaluate the throughput at the mesh gateway. This analytical framework is verified by numerical simulations, and is easy to extend to multi‐hop links. Furthermore, based on the above proposed cross‐layer framework, we consider the problem of optimal power and bandwidth allocation for QoS‐guaranteed services in a two‐hop wireless link, where the total power and bandwidth resources are both sum‐constrained. Secondly, the practical optimal power allocation algorithm and optimal bandwidth allocation algorithm are presented separately. Then, the problem of joint power and bandwidth allocation is analyzed and an iterative algorithm is proposed to solve the problem in a simple way. Finally, numerical simulations are given to evaluate their performances. Copyright © 2008 John Wiley & Sons, Ltd.     

An optimal bandwidth allocation and data droppage scheme for differentiated services in a wireless network

This paper presents an optimal proportional bandwidth allocation and data droppage scheme to provide differentiated services (DiffServ) for downlink pre‐orchestrated multimedia data in a single‐hop wireless network. The proposed resource allocation scheme finds the optimal bandwidth allocation and data drop rates under minimum quality‐of‐service (QoS) constraints. It combines the desirable attributes of relative DiffServ and absolute DiffServ approaches. In contrast to relative DiffServ approach, the proposed scheme guarantees the minimum amount of bandwidth provided to each user without dropping any data at the base‐station, when the network has sufficient resources. If the network does not have sufficient resources to provide minimum bandwidth guarantees to all users without dropping data, the proportional data dropper finds the optimal data drop rates within acceptable levels of QoS and thus avoids the inflexibility of absolute DiffServ approach. The optimal bandwidth allocation and data droppage problems are formulated as constrained nonlinear optimization problems and solved using efficient techniques. Simulations are performed to show that the proposed scheme exhibits the desirable features of absolute and relative DiffServ. Copyright © 2009 John Wiley & Sons, Ltd.     

Dynamic bandwidth recycle algorithm for OVSF–CDMA systems

This paper presents a dynamic bandwidth recycle algorithm in the downlink of a WCDMA system using orthogonal variable spreading factor codes (OVSF). It consists of a bandwidth recycle algorithm and a bandwidth reservation algorithm. The bandwidth recycle algorithm is used to recycle bandwidth from current serviced connections when the system does not have enough available bandwidth to support a bandwidth request. The bandwidth reservation algorithm is used to reduce transmission delay caused by suddenly increasing bandwidth requests. Four traffic classes, conversational, streaming, interactive, and background classes, defined by universal mobile telecommunication system (UMTS) are considered. Simulation results show that the bandwidth utilization and block rate are improved, the bandwidth guaranteed to conversational and streaming classes are protected, and the delay time of interactive and background classes are kept under an acceptable value even when the traffic load is heavy. Copyright © 2005 John Wiley & Sons, Ltd.     

FPS‐MAC: Fuzzy priority scheduling‐based MAC protocol for intelligent monitoring systems

Recent advances in microelectronics have encouraged the implementation of a wireless sensor network (WSN) in intelligent monitoring systems (IMSs). The IMS for time‐critical applications requires timely and reliable data delivery without sacrificing the energy efficiency of the network. This paper proposes FPS‐MAC, a fuzzy priority scheduling‐based medium access control protocol, designed for event critical traffic in hierarchical WSN. The FPS‐MAC allows time‐critical event traffic to opportunistically steal the data slots allocated for periodic data traffic in event‐based situations. Additionally, a fuzzy logic‐based slot scheduling mechanism is introduced to provide guaranteed and timely medium access to emergency traffic load and ensures the quality‐of‐service (QoS) requirements of IMSs. Both analytical and simulation results for data throughput, energy consumption, and transmission delay of FPS‐MAC, TLHA, E‐BMA, and BMA‐RR have been analyzed to demonstrate the superiority of the proposed FPS‐MAC protocol.     

Dynamic bandwidth allocation and buffer dimensioning under equal segment scheme to support video‐on‐demand services

This paper focuses on the optimization of network bandwidth allocation and buffer dimensioning to transport pre‐stored MPEG video data from source to playback destination across ATM networks. This is one of the most important issues in the support of video‐on‐demand (VoD) service. This paper provides a novel scheme in the dynamic allocation of bandwidth to segments of video using ABR mode. The dynamic bandwidth allocation is based on a new concept, called playback tunnel which is obtained from the traffic characteristics of the pre‐stored MPEG video trace to determine the optimum of transmission bandwidth as well as the buffer capacity to ensure that the playback buffer neither underflows nor overflows. The proposed scheme is tested with real‐life MPEG video traces. The obtained results have shown its significant performance improvement in terms of the capacity of playback buffer, the start‐up playback delay, the size of video segment and the network multiplexing gain. Copyright © 2001 John Wiley & Sons, Ltd.     

Efficient medium arbitration of FSAN‐compliant GPONs

The steadily rising demand for multimedia and data services, the falling cost and omnipresence of Ethernet and the maturity of passive optical networks (PON) technology, promise to radically change the landscape in the local loop. The heart of a gigabit PON system (recently standardized by FSAN/ITU) is the medium access controller (MAC), which arbitrates access to the upstream link among users with fluctuating traffic demands and effects the multiplexing and concentration policy. At the same time, it has to safeguard the service quality and enforce the parameters agreed in the service level agreements (SLAs) between the users and the service provider. In this paper, a MAC protocol designed to serve any mix of services according to their quality of service (QoS) needs, employing four priority levels along with a high number of logically separate data queues is presented. The architecture and implementation in hardware of a MAC algorithm capable of allocating bandwidth down to a resolution of a byte with QoS differentiation is the focus of this paper. It employs the bandwidth arbitration tools of the FSAN/ITU G.984.3 standard and maps SLA parameters to GPON service parameters to create an efficient, fair and flexible residential access system. Copyright © 2005 John Wiley & Sons, Ltd.     

An OFDM-TDMA/SA MAC Protocol with QoS Constraints for Broadband Wireless LANs

Orthogonal frequency division multiplexing (OFDM) is an important technique to support high speed transmission of broadband traffic in wireless networks, especially broadband wireless local area networks (LANs). Based on OFDM, a new multiple access scheme, called OFDM-TDMA with subcarrier allocation (OFDM-TDMA/SA), is proposed in this paper. It provides more flexibility in resource allocation than other multiple access schemes such as OFDM-TDMA, OFDM-frequency division multiple access (OFDM-FDMA), and orthogonal frequency division multiple access (OFDMA). With OFDM-TDMA/SA, a medium access control (MAC) is designed for broadband wireless LANs. It optimizes bit allocation in subcarriers so that maximum bits are transmitted in each OFDM symbol under a frequency selective fading environment. The OFDM-TDMA/SA MAC protocol also supports three classes of traffic such as guaranteed, controlled-load, and best effort services. Based on the optimum subcarrier bit-allocation algorithm and considering heterogeneous QoS constraints of multimedia traffic, a hierarchical scheduling scheme is proposed to determine the subcarriers and time slots in which a mobile terminal can transmit packets. In such a way, the OFDM-TDMA/SA MAC protocol significantly increases system throughput in a frequency selective fading environment and guarantees QoS of multimedia traffic. Computer simulation is carried out to evaluate the performance of the OFDM-TDMA/SA MAC protocol. Results show that the new MAC protocol outperforms other MAC protocols for OFDM-based wireless LANs. This work was supported by the State of Georgia Yamacraw Project (E21-105).     

移动自组织网络中基于QoE的跨层多波束信道接入机制

引入数字多波束技术可以使移动自组织网络的信道容量得到有效提升，然而，时间、频率、空间、用户、功率等多维度资源域的统一调度与跨层联合优化使得信道接入机制的分析与设计变得更加复杂。为此，结合多波束的特性，将波束宽度限制、收发限制、通道限制、功率限制等多种约束条件抽象图论问题，并建立分析模型。基于分析模型，进一步提出了MB-MAC（Multi-beam Medium Access Control）信道接入机制，结合物理层的预编码技术，建立定向链路的队列模型，度量用户的满意度(Quality of Experience,QoE)，设计了适用于自组织网络中多用户并发并收的信道接入机制，兼顾了网络容量和用户满意度。仿真结果表明，MB-MAC机制能在保证各个用户满意度的情况下，有效提升网络吞吐率。     

Distributed upload bandwidth assigning algorithm in P2P VoD system

In a peer-to-peer(P2P) live streaming system,each peer uses greedy strategy to download chunks as many as possible so as to assure smooth playback and promote the chunk propagation.However,diversity of video playback rate,heterogeneity of peer downlink bandwidth and no prefetching limitation determine that greedy strategy is not the best strategy for P2P video-on-demand(VoD) system though this strategy performs well in P2P live system.To reasonably assign upload bandwidth among peers,we first present a stochastic model to relate expected downloading speed(EDS) with buffered data amount(BDA,the amount of data has been fetched in buffer,however has not been played yet by the peer),video playback rate and fluency(the probability of no interruption in a viewing process).On the base of this model,we design an equal fluency bandwidth assigning algorithm(EFBAA).In this algorithm,requesting peers compute EDS according to several local parameters(such as BDA,video playback rate and fluency) dynamically and independently and send the EDS to neighbor peers together with buffer map.Then the neighbor peer proportionally partitions and assigns its upload bandwidth to requesting peers according to their EDS.Extensive simulations demonstrate that EFBAA outperforms greedy strategy in terms of server load and startup latency.     

Performance analysis of a channel allocation scheme for multi‐service mobile cellular networks

This paper presents a new channel allocation scheme, namely the dynamic partition with pre‐emptive priority (DPPP) scheme, for multi‐service mobile cellular networks. The system is modelled by a two‐dimensional Markov process and analysed by the matrix‐analytic method. A pre‐emptive priority (PP) mechanism is employed to guarantee the quality of service (QoS) requirement of the real‐time (RT) traffic at the expense of some degradation of non‐real‐time (NRT) traffic, while the victim buffer compensates the degradation and has no negative impact on the RT traffic. The complete service differentiation between new calls and handoff calls from different traffic classes is achieved by using the dynamic partition (DP) concept with the help of related design parameters. The performance analysis and numerical results show that the DPPP scheme, compared with the existing schemes, is effective and practical in multi‐service environments. Copyright © 2006 John Wiley & Sons, Ltd.     

Graph‐based resource allocation algorithms for multiuser downlink MIMO‐OFDMA networks

Multiuser multiple‐input multiple‐output orthogonal frequency division multiple access (MIMO‐OFDMA) is considered as the practical method to attain the capacity promised by multiple antennas in the downlink direction. However, the joint calculation of precoding/beamforming and resource allocation required by the optimal algorithms is computationally prohibitive. This paper proposes computationally efficient resource allocation algorithms that can be invoked after the precoding and beamforming operations. To support stringent and diverse quality of service requirements, previous works have shown that the resource allocation algorithm must be able to guarantee a specific data rate to each user. The constraint matrix defined by the resource allocation problem with these data rate constraints provides a special structure that lends to efficient solution of the problem. On the basis of the standard graph theory and the Lagrangian relaxation, we develop an optimal resource allocation algorithm that exploits this structure to reduce the required execution time. Moreover, a lower‐complexity suboptimal algorithm is introduced. Extensive simulations are conducted to evaluate the computational and system‐level performance. It is shown that the proposed resource allocation algorithms attain the optimal solution at a much lower computational overhead compared with general‐purpose optimization algorithms used by previous MIMO‐OFDMA resource allocation approaches. Copyright © 2012 John Wiley & Sons, Ltd.     

An optimal solution to resource allocation among soft QoS traffic in wireless network

Optimization theory and nonlinear programming method have successfully been applied into wire‐lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control schemes. The resource (e.g., bandwidth) allocation in a communication network has been modeled into an optimization problem: the objective is to maximize the source aggregate utility subject to the network resource constraint. However, for wireless networks, how to allocate the resource among the soft quality of service (QoS) traffic remains an important design challenge. Mathematically, the most difficult comes from the non‐concave utility function of soft QoS traffic in the network utility maximization (NUM) problem. Previous result on this problem has only been able to find its sub‐optimal solution. Facing this challenge, this paper establishes some key theorems to find the optimal solution and then present a complete algorithm called utility‐based allocation for soft QoS to obtain the desired optimal solution. The proposed theorems and algorithm act as designing guidelines for resource allocation of soft QoS traffic in a wireless network, which take into account the total available resource of network, the users’ traffic characteristics, and the users’ channel qualities. By numerical examples, we illustrate the explicit solution procedures.Copyright © 2013 John Wiley & Sons, Ltd.     

一种用于流控和资源管理的区分业务Fast-TCP机制

该文提出了一种传统TCP技术的改进方案基于区分业务的 Fast-TCP 机制,简称区分业务F-TCP。通过探讨和借鉴相关的流控、调度及队列管理策略,进一步提出了区分业务F-TCP的实现算法。大量的仿真结果证实了这种机制及其实现算法的可行性和有效性,以及相关的缓冲区占用量突发的估计公式。该机制可在现有的Internet网络中有效地提供业务区分。     

Ad Hoc网络中具有QoS保障的同步MAC协议

介绍了Ad Hoc网络中保障实时业务QoS要求的时间同步多址接入协议。该类协议以时分多址为基础,通过资源预留为实时业务预约固定的时隙,赋予实时业务接入信道的优先权,保证了实时业务的接入延时,延时抖动以及吞吐量等QoS指标,为Ad Hoc网络支持多媒体业务的接入奠定了基础。     

A distributed adaptive guard channel reservation scheme for cellular networks

In this paper, a distributed adaptive guard channel reservation (DAGCR) scheme is proposed to give priority to handoff calls. This scheme is built upon the concept of guard channels and it uses an adaptive algorithm to search automatically the optimal number of guard channels to be reserved at each base station. The quality‐of‐service (QoS) parameters used are the new and handoff call blockings. Simulation studies are performed to compare the present algorithm with the static guard channel policy. Simulation results show that this proposed algorithm guarantees the handoff call blocking probability to remain below the targeted threshold up to a substantially high offered load with a minimal blocking to new calls up to a moderate offered load and also shows significantly high channel utilization in all offered load conditions. This scheme is examined over a wide range of offered load. Thus, it seems the proposed scheme is very useful in controlling the blocking performances in wireless cellular networks. Copyright © 2006 John Wiley & Sons, Ltd.     

Space‐time diversity‐enhanced QoS provisioning for real‐time service over MC‐DS‐CDMA based wireless networks

In order to support the quality‐of‐service (QoS) requirements for real‐time traffic over broadband wireless networks, advanced techniques such as space‐time diversity (STD) and multicarrier direct‐sequence code division multiple access (MC‐DS‐CDMA) are implemented at the physical layer. However, the employment of such techniques evidently affects the QoS provisioning algorithms at the medium access control (MAC) layer. In this paper, we propose a space‐time infrastructure and develop a set of cross‐layer real‐time QoS‐provisioning algorithms for admission control, scheduling, and subchannel‐allocations. We analytically map the parameters characterizing the STD onto the admission‐control region guaranteeing the real‐time QoS. Our analytical analyses show that the proposed algorithms can effectively support real‐time QoS provisioning. Also presented are numerical solutions and simulation results showing that the STD can significantly improve the QoS provisioning for real‐time services over wireless networks. Copyright © 2007 John Wiley & Sons, Ltd.     

Novel congestion control approach in wireless multimedia sensor networks

Data generated in wireless multimedia sensor networks (WMSNs) may have different importance and it has been claimed that the network exert more efforts in servicing applications carrying more important information. Nevertheless, importance of packets cannot generally be accurately represented by a static priority value. This article presents a dynamic priority based congestion control (DPCC) approach that makes two major innovations in WMSNs. First, DPCC employs dynamic priority to represent packet importance. Second, it prioritizes the local traffic of motes near the base station when WMSN is highly congested. Simulation results confirm the superior performance of the proposed approach with respect to energy efficiency, loss probability and latency as well.