Investigation on group based contention bandwidth request in LTE-A networks under high delay spread environment

In this paper, contention bandwidth request has been investigated for long term evolution-advanced (LTE-A) networks under extended typical urban based multipath fading channel that displays high delay spread environment. As the choice of preambles has to provide high detection probability under such environments, at the outset, this paper examines various group based preamble selection mechanisms, namely, Type I, Type II and Type III preamble sets. With suitable type of group based preamble, the challenge during contention bandwidth request is the appropriate choice of contention window during contention resolution. The contention window in this paper is chosen based on the indicators of various failure events, namely, probability of collision due to contention, probability of unavailability of bandwidth, probability of channel error and probability of improper detection of Zadoff–Chu sequences. After suggesting a scheme to account the possible failure events, an analytical model for contention-based bandwidth request has been developed for LTE-A networks. In addition, two backoff mechanisms are proposed to resolve contention among user equipment’s effectively and these mechanisms are compared to the existing techniques, namely, binary exponential backoff and uniform backoff. Further, the contention mechanism has been substantiated for varying depth of channel errors. With Type I grouping, the backoff with optimized contention window improves the efficiency by 13.95 %, reduces the access delay by 18.71 % and decreases the dropping probability by 59.33 % than the existing uniform backoff mechanism.     

WiMAX系统的带宽请求与分配问题的研究

详述了WiMAX系统的各种带宽请求与分配策略，并重点分析了基于竞争的请求与分配机制。通过对竞争请求的冲突概率进行分析，推出了回退窗口和竞争窗口的最佳分配尺寸。并计算了不同业务流数量下系统可达到的最大传输效率。计算机仿真表明以此尺寸进行分配。可有效减小请求冲突，提高系统的传输效率和带宽使用效率。     

Performance comparison of OFDM bandwidth request schemes in fixed IEEE 802.16 networks

IEEE 802.16 standard specifies two contention based bandwidth request schemes working with OFDM physical layer specification in point-to-multipoint (PMP) architecture, the mandatory one used in region-full and the optional one used in region-focused. This letter presents a unified analytical model to study the bandwidth efficiency and channel access delay performance of the two schemes. The impacts of access parameters, available bandwidth and subchannelization have been taken into account. The model is validated by simulations. The mandatory scheme is observed to perform closely to the optional one when subchannelization is active for both schemes.     

Contention resolution with EIED backoff for bandwidth request in IEEE 802.16 networks

In this letter, we suggest contention resolution with exponential increase and exponential decrease (EIED) backoff for bandwidth request in worldwide interoperability for microwave access (WiMAX) networks. In EIED, setting of backoff factor to overcome collision due to contention is very challenging and hence we suggest a method to compute backoff factor with average contention window. Further, to reduce access delay, we estimate the response time based on probability of failure and average contention window. Simulations validate the proposed EIED backoff in terms of contention efficiency, capacity and access delay. The contention efficiency and capacity is improved by 47.50% (for q value of 0.25) and 28.57% (for 25 numbers of transmission opportunity), respectively, when bandwidth request is made with the proposed EIED backoff mechanism.     

A nonpreemptive priority-based access control scheme for broadbandad hoc wireless ATM local area networks

The DQRUMA (distributed-queueing request update multiple access) protocol has been considered as an access protocol for the BAHAMA (broadband ad hoc wireless ATM local area network). However, it cannot support the service discipline of integrated multimedia traffic since it does not include any priority and access control policy. In this paper, we propose a nonpreemptive priority-based access control scheme for the DQRUMA protocol. Under such a scheme, modifying the CSMA/CA protocol in the contention period supports many levels of priorities such that user mobility (handoff) can be supported in BAHAMA. Besides, the proposed transmit-permission policy and adaptive bandwidth allocation scheme provide various QoS (quality-of-service) guarantees while maintaining high bandwidth utilization. Simulations show that it provides a good performance in ad hoc wireless ATM LAN environments     

Dynamic bandwidth partition schemes for integrated voice,video, and data traffic in the IEEE 802.11e distributed wireless LANs

In mobile cellular networks, bandwidth is deterministic in terms of the number of channels by frequency division, time division, or code division. On the other hand, bandwidth partition schemes in the contention‐based medium access control (MAC) in distributed wireless LANs are extremely challenging due to the contention‐based nature, packet‐based network, and the most important aspect: only one channel available, competed by an unknown number of stations. In this paper, we study this challenging issue. We propose and study four different bandwidth partition schemes for integrated voice/video/data traffic in the IEEE 802.11e wireless LANs: a Static bandwidth Partition (SP) scheme, a Dynamic budget Partition (DP) scheme, a Dynamic bandwidth Partition with Finer‐Tune (DP‐FT) scheme, and a Dynamic bandwidth Partition with Reserved Region (DP‐RR). The proposed schemes are compared and evaluated via extensive simulations. Results show that the DP‐FT scheme is the best scheme. Copyright © 2009 John Wiley & Sons, Ltd.     

Integrating Voice, Video, and E-mail Data Packet Traffic over Wireless TDMA Channels with Errors

In this paper, we explore, via an extensive simulation study, the performance of a new medium access-control (MAC) protocol when integrating voice, video, and e-mail data packet traffic over a wireless channel of high capacity, with errors. Depending on the number of video users admitted into the system, our protocol varies (a) the request bandwidth dedicated to resolving the voice users contention and (b) the probability with which the base station grants information slots to voice users, in order to preserve full priority for video traffic. We evaluate the voice and video packet-dropping probabilities for various voice and video load conditions and the average e-mail data message delays. Our scheme achieves high aggregate channel throughput in all cases of traffic load despite the introduction of errors in the system.     

On the optimization of the contention resolution mechanism for IEEE 802.16 networks

The IEEE 802.16 standard defines a contention bandwidth request mechanism offering QoS-aware broadband access through a wireless medium. According to the standard, the Base Station (BS) is responsible for granting the requests issued by the Subscriber Stations (SSs). The SSs communicate their requests to the BS by placing their requests into the uplink subframe, using the contention period defined within the subframe for this purpose. The size of contention period, defined in minislots, is fixed by the BS on a frame by frame basis. The remaining part of the uplink subframe is used to carry the data frames. A tradeoff between these two periods of the uplink subframe is required for an effective operation of the system. On the contrary, if the size of the contention is shorten below a certain threshold, the SSs may be unable to place their requests within the time required by the end-user applications. In this paper, we introduce an adaptive mechanism of the contention period size. The proposed mechanism takes into account the varying operation conditions of the system by estimating the number of stations that may be placing a request. Simulation results confirm that our proposal outperforms other mechanisms having recently been reported in the literature.     

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.     

Performance Analysis of a Bandwidth Guaranteed Medium Access Control Protocol for WDM Local Networks

In this paper, we propose and analyze a bandwidth guaranteed medium access control protocol for broadcast-and-select WDM local networks with a star topology. The proposed protocol is based on a combination of contention and dedicated reservation mechanisms for time slotted WDM networks. Every node accesses the data channel by transmitting request packets in minislots on a separate control channel. There are two types of minislots; dedicated minislots and contention minislots. Nodes requiring bandwidth guarantees, called guaranteed nodes, use dedicated minislots that are assigned by the centralized control node. The remaining nodes, called random-access nodes, share contention minislots using a distributed random access mechanism. The dedicated minislots can guarantee a minimum bandwidth for the guaranteed nodes. The contention minislots enable on-demand services at the optical layer and achieve good fairness for the remaining bandwidth. Here, the data channels are dynamically assigned to the minislots successfully returned on a first-come-first-served (FCFS) basis. This protocol can combine the best of centralized and distributed access protocols such as simplicity, efficiency, and flexibility. We analyze the maximum throughput and verify the results by simulation.     

Word-specific precoding of contention bursts for broadband wireless networks

A precoding technique for pre-equalising contention bursts in a slotted-ALOHA access request scheme, for use in single-carrier broadband fixed wireless access (FWA) networks is presented. Multipath channel distortion is compensated for at the transmitter, so that the contention burst arrives undistorted at the receiver.     

On Multiple Traffic Type Integration over Wireless TDMA Channels with Adjustable Request Bandwidth

A new medium access control (MAC) protocol for mobile wireless communications is presented and investigated. We explore, via an extensive simulation study, the performance of the protocol when integrating voice, video and data packet traffic over a wireless channel of high capacity (referring to an indoor microcellular environment). Depending on the number of video users admitted into the system, our protocol varies: a) the request bandwidth dedicated to resolving the voice users contention, and b) the probability with which the base station grants information slots to voice users, in order to preserve full priority for video traffic. We evaluate the maximum voice capacity and mean access delay, as well as the aggregate channel throughput, for various voice and video load conditions, and the maximum voice capacity, aggregate channel throughput and average data message delays, for various video, voice and data load conditions. As proven by the comparison with a recently introduced efficient MAC scheme (DPRMA), when integrating voice and video traffic our scheme obtains higher voice capacity and aggregate channel throughput. When integrating all three traffic types, our scheme achieves high aggregate channel throughput in all cases of traffic load.     

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.     

同步无线Mesh网络带宽申请与分配策略的改进

数据通信具有突发性与带宽计算的不确定性,现有同步无线Mesh网络带宽申请与分配策略未对此问题进行充分考虑,在设计上存在带宽申请速度慢、带宽分配没有最大化、将数据时隙区分了上下行等不足,导致了QoS保障能力低与网络性能的下降。提出了带宽申请与分配策略的改进方案,包括结合各类数据业务类型的带宽申请条件的描述、检查数据发送队列的时间间隔描述、带宽分配最大化的描述、数据时隙不再区分上、下行的描述。理论分析表明,改进后的方案能够提供精确的QoS保障并提高网络性能。     

Performance Analysis of WiMAX Networks AC

In WiMAX networks, contention based bandwidth requests are allowed in the uplink channel on the time division duplexing frame. The standard allows some types of traffic classes to use this period while preventing others like Unsolicited Grant Service. In this study, we provide a performance analysis of the three types of connections (ertPS, non-real time Polling Service and Best Effort) that are allowed to contend for bandwidth request opportunities. The choice of these traffic classes covers both real and non-real traffic types. Two quality of service parameters; contention probability and average connection delay are investigated in order to evaluate the network performances. Different levels of priority and blocking probability are assigned to each class of service. This performance analysis has been done using an analytical model for evaluating admission control for the previous mentioned classes in WiMAX network.     

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.     

An adaptive bandwidth reservation scheme for high-speed multimediawireless networks

In the next generation high-speed wireless networks, it is important to provide quality-of-service (QoS) guarantees as they are expected to support multimedia applications. This paper proposes an admission control scheme based on adaptive bandwidth reservation to provide QoS guarantees for multimedia traffic carried in high-speed wireless cellular networks. The proposed scheme allocates bandwidth to a connection in the cell where the connection request originates and reserves bandwidth in all neighboring cells. When a user moves to a new cell and a handoff occurs, bandwidth is allocated in the new cell, bandwidth is reserved in the new cell's neighboring cells, and reserved bandwidth in more distant cells is released. The amount of bandwidth to reserve is dynamically adjusted, reflecting the current network conditions. The performance of the proposed scheme is evaluated through simulations of realistic cellular environments. The simulated network consists of a large number of cells, mobile users with various movement patterns are assumed, and a variety of multimedia applications (e.g., audio phone, video conference, video on demand, file transfer, etc.) is considered. It is shown that the proposed scheme provides small handoff dropping probability (i.e., the probability that handoff connections are dropped due to a lack of bandwidth) and achieves high bandwidth utilization     

Adaptive fast data broadcasting scheme for video-on-demand service

As we support video-on-demand (VOD) service with batching schemes, the bandwidth requirement will be very large for a popular movie. For a hot video, fast data broadcasting scheme substantially reduce the bandwidth requirements as compared with batching schemes. However, the fast data broadcasting scheme needs to predict which movie is hot. If the prediction is not accurate, the allocated bandwidth will be wasted. This paper presents a new data broadcasting scheme for VOD service. For a movie, as it is popular, the new scheme will work like the fast data broadcasting scheme to save the communication bandwidth. If there is no request for the movie, the new scheme will not allocate bandwidth for the movie. Therefore, the bandwidth allocation for a movie is always efficient whether or not the movie is popular     

Tunable Reliable Multicast for Periodic Information Dissemination

Existing reliable transport protocols for periodic information dissemination ignore application semantics while attempting to be 100% reliable. Application Level Framing (ALF) suggests that taking application semantics into account when designing transport protocols can result in performance that is highly optimized for the network. We apply this principle in designing a policy-based TUNAble semi-reliable multicast protocol (TUNA) for periodic information dissemination. Specifically, TUNA is not constrained to guarantee full reliability, but allows the receiving application to selectively request retransmissions of lost portions of the data stream, based on user-level policies. TUNA uses statistical properties of the data stream to adaptively guide receivers in dynamically altering their reliability policies. This is particularly well matched for satellite systems, where end node to satellite bandwidth is limited, especially when shared by large community of end nodes. Our simulation results show that TUNA is made highly scalable by reducing the number of NACKs sent back to the information source, while keeping the staleness of received data within application-specified bounds. Under large session sizes, TUNA yields a factor of 1.5 to 6 improvement over a fully reliable scheme; for high loss rates, it results in a factor of 1.5 to 5 improvement. TUNA is also able to reduce contention for retransmission request bandwidth in a multiple access backchannel environment. We have implemented TUNA and a prototype application called InfoCaster in the MASH toolkit.     

A Bandwidth Reservation Multiple Access Protocol for Wireless ATM Local Networks

A bandwidth reservation multiple access scheme(BRMA) is proposed to resolve contention and assignbandwidth among multiple users trying to gain access toa common channel such as in mobile users contending for resources in an ATM-based cellular networkor a wireless local area network (LAN) with shortpropagation delays. The protocol is best suited tosupport variable-bit-rate (VBR) traffic that exhibits high temporal fluctuations. Each mobile user isconnected end-to-end to another user over virtualchannels via the base station that is connected to thewired ATM B-ISDN network. The channel capacity is modeled as a time frame with a fixed duration.Each frame starts with minislots, to resolve contentionand reserve bandwidth, followed by data-transmissionslots. Every contending user places a request for data slots in one of the minislots. If therequest is granted by the base station through adownlink broadcast channel, the user then startstransmission in the assigned slot(s). The number ofassigned slots varies according to the required qualityof service (QoS), such as delay and packet lossprobability. A speech activity detector is utilized inorder to indicate the talkspurts to avoid wastingbandwidth. Due to its asynchronous nature, BRMA is ratherinsensitive to the burstiness of the traffic. Since theassignment of the minislots is deterministic, therequest channels are contention-free and the data channels are collision-free. Hence, in spite ofthe overhead (minislots) in each frame, BRMA provideshigher throughput than Packet Reservation MultipleAccess (PRMA) for the same QoS, especially for high-speed systems. A better delay performance is alsoachieved for data traffic compared to Slotted Alohareservation-type protocol PRMA. In addition, BRMAperforms better in terms of bandwidth efficiency thanthe conventional TDMA or the Dynamic TDMA, wherespeech activity detectors are very difficult toimplement.