An unsaturated model for request mechanisms in WiMAX

Worldwide interoperability for microwave access (WiMAX) based wireless metropolitan area networks have recently received wide attention as they support high data rates with great quality of service (QoS) capabilities. In order to support QoS, bandwidth request (BW-REQ) mechanisms are suggested in the WiMAX standard for resource reservation. In this letter we propose a simple and accurate analytical model for the performance analysis of contention-based bandwidth request mechanisms. The accuracy of this model is verified with simulation results.     

A new CDMA-based bandwidth request method for IEEE 802.16 OFDMA/TDD systems

This paper proposes an efficient bandwidth request method for a non-real-time polling service and best effort service in the IEEE 802.16 system. The proposed method produces a bandwidth request code to indicate the channel quality and the necessary number of slots. The base station allocates uplink bandwidth depending on the bandwidth request code. Thus, the proposed method can omit the transmission procedure of the bandwidth request message. The performance analysis results show that the proposed method can reduce the delay for the uplink data transmission.     

Cross-layer Based Delay-constraint Adaptive Polling for High Density Subscribers in IEEE 802.16 WiMAX Networks

The IEEE 802.16 standard (namely WiMAX) is proposed to support QoS-aware transmission of real-time service in Wireless Metropolitan Area Networks (WMANs). WiMAX also can operate as a wireless backbone, and then cooperates with WiFi to form a heterogeneous wireless network. Thus, hot spots of WiFi belonging to different WiMAX networks can communicate with each other. For achieving that a Base Station (BS) serves a large number of Subscriber Stations (SSs), WiMAX uses a centralized polling access mechanism instead of a random access mechanism. WiMAX thus avoids occurring access collisions but causes long polling delay under a high-density SSs situation. Consequently, IEEE 802.16 does not schedule real-time service (rtPS) while the BS is in multicast polling mode. This problem of long polling delay becomes worse when the BS serves high-density SSs, because the BS only polls some SSs or groups in every frame time. This paper thus proposes an adaptive polling approach with a cross-layer mechanism, which dynamically polls SSs among different polling modes while continuously supporting the rtPS service. The approach consists of two phases. The first phase adopts two hysteresises of number of SSs and residual bandwidth to determine the optimal polling mode for each connection. The second phase presents a novel QoS-aware rtPS service (QrtPS) that provides an Average Delay requirement instead of the Maximum Delay requirement to take over the rtPS service when a SS is polled by the multicast mode. Additionally, a cross-layer mechanism is proposed to achieve that the real-time applications can be sent with a high-quality or low-quality video codec when the SS is in unicast or multicast mode, respectively. Numerical results demonstrate that the proposed approach significantly outperforms IEEE 802.16 in average delay and network utilization. Furthermore, the collision probabilities of using different numbers of contention slots of an uplink subframe and different numbers of groups within a BS are evaluated for the multicast mode. The results meet the experiments.

Investigations on heuristic bandwidth request mechanism with signaling analysis for BWA networks

Best effort services in next generation broadband wireless access (BWA) networks would be more interactive and bandwidth demanding. This attracted a substantial amount of researches to focus on contention bandwidth request mechanisms for best effort services. The contention resolution with code division multiple access (CDMA) based mobile assisted truncated binary exponential backoff (C-MAB) suffers low contention efficiency and high access delay due to the nature of accessing mechanism in worldwide interoperability for microwave access (WiMAX) network that confines the mobile station in estimating the optimum contention window. Further, these performances decrease when transmission failure is modeled with unavailability of bandwidth, collision due to contention, transmission code failure, and channel error. To improve the performances, in this paper, we suggest a contention resolution with CDMA based base station assisted backoff (C-BAB) for orthogonal frequency division multiple access (OFDMA) based WiMAX networks. With C-BAB, the base station computes an optimum contention window by accounting average contention window and probability of failure. With a 2.69% additional overhead at the BS, the proposed C-BAB shows a 32.82% increase in contention efficiency and 24.21% decrease in access delay (25% error rate, q = 0.60 and ranging slot = 64) compared to C-MAB.     

Performance Optimization with Efficient Polling Mechanism in IEEE 802.16 Networks with Cross-Layer Consideration

IEEE 802.16 standard suite defines a reservation-based bandwidth allocation mechanism. A SS (Subscriber Station) has to be polled to request bandwidth reservation before transmits uplink data to a BS (Base Station). In this mechanism exist two main polling modes: the unicast polling mode and the contention-based polling mode. The different polling operations in MAC (Medium Access Control) result in different PHY (PHYsical layer) frame structure that deeply affect the performance. Therefore, there should be an optimal scheme to adopt these two polling modes in order to optimize the performance. Although the standard defines five service classes to adaptively use the polling modes to fit the QoS (Quality of Service) requirements of different applications, it does not specify exactly a scheme to adopt these two polling modes efficiently and fairly during the polling process. In~this paper, we investigate the polling mechanisms in IEEE 802.16 networks, and focus the attention on the performance caused by different adoption schemes. We also propose a simple but efficient polling mechanism to optimize the performance. The simulation results verify that the performance is conditioned to the fulfillment of the polling mechanisms and our proposed optimal polling scheme can allocate bandwidth more efficient and achieve better performance.     

Queue-aware uplink bandwidth allocation and rate control for polling service in IEEE 802.16 broadband wireless networks

IEEE 802.16 standard defines the air interface specifications for broadband access in wireless metropolitan area networks. Although the medium access control signaling has been well-defined in the IEEE 802.16 specifications, resource management and scheduling, which are crucial components to guarantee quality of service performances, still remain as open issues. In this paper, we propose adaptive queue-aware uplink bandwidth allocation and rate control mechanisms in a subscriber station for polling service in IEEE 802.16 broadband wireless networks. While the bandwidth allocation mechanism adaptively allocates bandwidth for polling service in the presence of higher priority unsolicited grant service, the rate control mechanism dynamically limits the transmission rate for the connections under polling service. Both of these schemes exploit the queue status information to guarantee the desired quality of service (QoS) performance for polling service. We present a queuing analytical framework to analyze the proposed resource management model from which various performance measures for polling service in both steady and transient states can be obtained. We also analyze the performance of best-effort service in the presence of unsolicited grant service and polling service. The proposed analytical model would be useful for performance evaluation and engineering of radio resource management alternatives in a subscriber station so that the desired quality of service performances for polling service can be achieved. Analytical results are validated by simulations and typical numerical results are presented.     

Performance of packet voice transmission using IEEE 802.16 protocol

The IEEE 802.16 standard defines three types of scheduling services for supporting real-time traffic, unsolicited grant service (UGS), real-time polling service (rtPS), and extended real-time polling service (ertPS). In the UGS service, the base station (BS) offers a fixed amount of bandwidth to a subscriber station (SS) periodically, and the SS does not have to make any explicit bandwidth requests. The bandwidth allocation in the rtPS service is updated periodically in the way that the BS periodically polls the SS, which makes a bandwidth request at the specified uplink time slots and receives a bandwidth grant in the following downlink subframe. In the ertPS service, the BS keeps offering the same amount of bandwidth to the SS unless explicitly requested by the SS. The SS makes a bandwidth request only if its required transmission rate changes. In this article we study the performance of voice packet transmissions and BS resource utilization using the three types of scheduling services in IEEE 802.16-based backhaul networks, where each SS forwards packets for a number of voice connections. Our results demonstrate that while the UGS service achieves the best latency performance, the rtPS service can more efficiently utilize the BS resource and flexibly trade-off between packet transmission performance and BS resource allocation efficiency; and appropriately choosing the MAC frame size is important in both the rtPS and ertPS services to reduce packet transmission delay and loss rate     

Modeling Contention Based Bandwidth Request Scheme for IEEE 802.16 Networks

IEEE 802.16 standard specifies a contention based bandwidth request scheme for best-effort and non-real time polling services in point-to-multipoint (PMP) architecture. In this letter we propose an analytical model for the scheme and study how the performances of bandwidth efficiency and channel access delay change with the contention window size, the number of contending subscriber stations, the number of slots allocated for bandwidth request and data transmission. Simulations validate its high accuracy.     

Estimation of the efficiency of bandwidth request piggybacking to data packets in the wireless network controlled by the IEEE 802.16 protocol

A data transmission process of the centralized wireless network controlled by IEEE 802.16 protocol, in which a set of subscriber stations utilizes the common channel to transmit data to the base station, is discussed. The developed analytical model makes it possible to investigate the efficiency of upstream traffic transmission, including channel reservation using the random multiple access algorithm and packet sending with allowance for bandwidth request piggybacking onto data. The analytical estimates of packet registration and service durations are presented.     

Forward-link capacity in smart antenna base stations with dynamicslot allocation

We consider a base station, which communicates to a set of portable stations using a smart antenna operating in multibeam, packet-switched, space division multiple access (SDMA) mode. We assume that the system operates using time division duplexing (TDD) and focus on the problem of access to the stations by the base station in the forward-link direction. A polling protocol is used which permits efficient access in this type of system. The operation of the protocol is unique in that it permits dynamic slot allocation and accommodates variations in channel time coherence. In the protocol, dynamic slot assignment is integrated into the forward-link beam scheduling. This allows us to explore the value of dynamic station slot assignment when constructing the SDMA/TDMA frames. The results show the improvements in capacity, which are possible in such systems and give insight into the degradation in protocol performance that occurs when channel coherence times decrease. We find that very large improvements in capacity are possible using dynamic slot allocation, especially under harsh channel conditions. We also investigate various base station queueing issues in this type of system. It is shown that care must be taken in how buffering is performed so that blocking effects do not unnecessarily degrade the forward-link capacity     

Performance analysis of bandwidth requests under unicast, multicast and broadcast pollings in IEEE 802.16d/e

In the polling mode in IEEE 802.16d/e, one of three modes: unicast, multicast and broadcast pollings, is used to reserve bandwidth for data transmission. In the unicast polling, the BS polls each individual MS to allow to transmit a bandwidth request packet, while in the multicast and broadcast pollings, the truncated binary exponential backoff (TBEB) mechanism is adopted as a contention resolution among mobile stations (MSs) in a multicast or broadcast group. This paper investigates the delay of bandwidth requests in the unicast, multicast and broadcast pollings, by deriving the delay distribution of the unicast polling and the TBEB by means of analytical methods. We consider an error-free channel as well as an error-prone channel with i.i.d. constant packet error rate per frame. Furthermore, we find the utilization of transmission opportunity to see efficiency of the bandwidth in the TBEB. Performance evaluations are provided to show that analytical results are well-matched with simulations. By the numerical results, we can find the optimal parameters such as the initial backoff window size of the TBEB and the number of transmission opportunities (or slots) satisfying quality of service (QoS) requirement on delay and loss, and thus we can determine which scheme is better than others depending on the probability of a request arrival during one frame. Numerical examples address that the TBEB performs better than the unicast polling for light traffic loads and vice versa for heavy traffic loads. Also, it is shown that the multicast polling has better performance than the broadcast polling in the sense of shorter delay, lower loss probability and higher utilization of transmission opportunity.     

Adaptive power allocation and call admission control in multiservice WiMAX access networks [Radio Resource Management and Protocol Engineering for IEEE 802.16]

To achieve a successful broadband wireless access solution, the IEEE 802.16 subcommittee has released a series of standards for WiMAX (worldwide interoperability for microwave access). From a technical viewpoint, WiMAX is a feasible alternative to the wired Internet access solutions such as cable modem and DSL. Nevertheless, from the commercial viewpoint, whether the promise of WiMAX will be materialized still depends on its revenue rate to telecom operators and its service quality to the subscribers. In such a context, this article addresses two resource management mechanisms in WiMAX access networks, that is, adaptive power allocation (APA) and call admission control (CAC), from the perspectives of both service providers and WiMAX subscribers. APA emphasizes how to share the limited power resource of base station among different WiMAX subscribers and further influences the access bandwidth of each subscriber; CAC highlights how to assign a subscriber's access bandwidth to different types of applications. Moreover, to build a WiMAX access network, APA and CAC have to work cooperatively to provide cross-layer resource management. In this article we focus on the OFDMA-TDD system, which allows high spectrum-utility efficiency on uplink and downlink channels in the asymmetric scenario of "lastmile" Internet access. We conclude the article with an optimization strategy to balance service provider's revenue and subscriber's satisfaction     

Analysis of a polling system for telephony traffic with application to wireless LANs

Recently, polling has been included as a resource sharing mechanism in the medium access control (MAC) protocol of several communication systems, such as the IEEE 802.11 wireless local area network, primarily to support real-time traffic. Furthermore, to allow these communication systems to support multimedia traffic, the polling scheme often coexists with other MAC schemes such as random access. Motivated by these systems, we develop a model for a polling system with vacations, where the vacations represent the time periods in which the resource sharing mechanism used is a non-polling mode. The real-time traffic served by the polling mode in our study is telephony. We use an on-off Markov modulated fluid (MMF) model to characterize telephony sources. Our analytical study and a counterpart validating simulation study show the following. Since voice codec rates are much smaller than link transmission rates, the queueing delay that arises from waiting for a poll dominates the total delay experienced by a voice packet. To keep delays low, the number of telephone calls that can be admitted must be chosen carefully according to delay tolerance, loss tolerance, codec rates, protocol overheads and the amount of bandwidth allocated to the polling mode. The effect of statistical multiplexing gain obtained by exploiting the on-off characteristics of telephony traffic is more noticeable when the impact of polling overhead is small.     

Adaptive control for random access traffic in mobile radio systems

An adaptive random access control method is developed for the idle-signal-casting multiple-access (ICMA) or other random-access protocols. Its purpose is to prevent channel breakdown by controlling permission probabilities of user terminal's transmission according to the load of a random-access channel. In ICMA, a base station broadcasts an `idle' or `busy' signal to prevent collisions of random access signals from terminals. Two kinds of control parameters related to permission probabilities are used. Probability q is referred to by all user terminals attempting transmission, and probability p is referred to if a user terminal must wait for the end of another's transmission. The values of these parameters are determined according to the channel occupancy factor measured at a base station, and the base station broadcasts them to user terminals with `idle' or `busy' signals. This method can prevent channel breakdown and greatly improve channel performance under heavy-traffic conditions. Results of evaluating the method by computer simulation are discussed     

从WiMAX到LTE:不同宽带无线接入技术殊途同归

游牧和移动宽带无线接入将成为未来通信市场的重要需求.WiMAX正是针对这一需求而专门发展的,其性能强、效率高、成本低,具有灵活的体制,可通过配置满足各种应用场景的要求.同样,为了进入宽带无线接入市场,3GPP首先发展了被称为3.5G的HSDPA技术(可以大幅度提高分组数据的传输速率),2004年底又决定发展长期演进(LTE)计划,其指标和技术都与WiMAX相近,可以说是殊途同归.面对LTE的竞争,WiMAX要想在宽带无线接入市场中占有一席之地必须拥有好的频率,使用地面电视广播频率可提供大面积覆盖,降低成本.     

Adaptive downlink and uplink channel split ratio determination for TCP-based best effort traffic in TDD-based WiMAX networks

In this paper, we study the determination of downlink (DL) and uplink (UL) channel split ratio for Time Division Duplex (TDD)-based IEEE 802.16 (WiMAX) wireless networks. In a TDD system, uplink and downlink transmissions share the same frequency at different time intervals. The TDD framing in WiMAX is adaptive in the sense that the downlink to uplink bandwidth ratio may vary with time. In this work, we focus on TCP based traffic and explore the impact of improper bandwidth allocation to DL and UL channels on the performance of TCP. We then propose an Adaptive Split Ratio (ASR) scheme which adjusts the bandwidth ratio of DL to UL adaptively according to the current traffic profile, wireless interference, and transport layer parameters, so as to maximize the aggregate throughput of TCP based traffic. Our scheme can also cooperate with the Base Station (BS) scheduler to throttle the TCP source when acknowledgements (ACKs) are transmitted infrequently. The performance of the proposed ASR scheme is validated via ns^-2 simulations. The results show that our scheme outperforms static allocation (such as the default value specified in the WiMAX standard and other possible settings in existing access networks) in terms of higher aggregate throughput and better adaptivity to network dynamics.     

Performance of Double-Tier Access-Control Schemes Using a Polling Backbone for Metropolitan and Interconnected Communication Networks

We consider a double-tier communication network architecture for metropolitan area and packet radio networks for controlling the access of network terminals into a single shared broadcast channel. Terminals are organized into local groups in accordance with their geographical proximity or other criteria. Each local group can be associated with a primary station. The latter can serve as an unbuffered repeater for terminal transmissions unto the multiple-access channel. A polling policy is used by the primary stations to gain access into the shared communications backbone. Once a primary station is provided access into the channel, it initiates a local access control procedure. Message delay performance results and bounds are obtained for general reservation local-access procedures. In particular, we analyze and present performance results for a polling/tree-random-access procedure which can be effectively used for many packet radio and cellular digital radio networks, as well as for a polling/positionalpriority scheme for CATV and fiber-optic based networks.     

EPON和WiMAX融合架构下带宽分配和调度机制的研究

以太网无源光网络(EPON)和IEEE 802.16(WiMAX)的融合网络在固定移动混合接入网中被认为是很有前景的接入方式.文中提出了3种WiMAX无线网络与EPON网络系统融合架构,融合系统同时具有光网络的高带宽和无线网络的灵活性.为了在接入网中支持QoS,本文为融合结构提出了一种动态带宽分配算法(DBA)和调度机...     

Packet Switching in Radio Channels: New Conflict-Free Multiple Access Schemes

We study new access schemes for a population of geographically distributed data users who communicate with each other and/or with a central station over a multiple-access broadcast ground radio packet-switching channel. We introduce and analyze alternating priorities (AP), round robin (RR), and random order (RO) as new conflict-free methods for multiplexing buffered users without control from a central station. These methods are effective when the number of users is not too large; as the number grows, a large overhead leads to a performance degradation. To reduce this degradation, we consider a natural extension of AP, called minislotted alternating priorities (MSAP) which reduces the overhead and is superior to fixed assignment, polling, and known random access schemes under heavy traffic conditions. At light input loads, only random access schemes outperform MSAP when we have a large population of users. In addition, and of major importance, is the fact that MSAP does not require control from a central station.     

Sampling Jitter Effect on a Reconfigurable Digital IF Transceiver to WiMAX and HSDPA

This paper outlines the time jitter effect of a sampling clock on a software‐defined radio technology‐based digital intermediate frequency (IF) transceiver for a mobile communication base station. The implemented digital IF transceiver is reconfigurable to high‐speed data packet access (HSDPA) and three bandwidth profiles: 1.75 MHz, 3.5 MHz, and 7 MHz, each incorporating the IEEE 802.16d worldwide interoperability for microwave access (WiMAX) standard. This paper examines the relationship between the signal‐to‐noise ratio (SNR) characteristics of a digital IF transceiver with an under‐sampling scheme and the sampling jitter effect on a multichannel orthogonal frequency‐division multiplexing (OFDM) signal. The simulation and experimental results show that the SNR of the OFDM system with narrower band profiles is more susceptible to sampling clock jitter than systems with relatively wider band profiles. Further, for systems with a comparable bandwidth, HSDPA outperforms WiMAX, for example, a 5 dB error vector magnitude improvement at 15 picoseconds time jitter for a bandwidth of WiMAX 3.5 MHz profile.