521 research outputs found

    WIMAX Basics from PHY Layer to Scheduling and Multicasting Approaches

    Get PDF
    WiMAX (Worldwide Interoperability for Microwave Access) is an emerging broadband wireless technology for providing Last mile solutions for supporting higher bandwidth and multiple service classes with various quality of service requirement. The unique architecture of the WiMAX MAC and PHY layers that uses OFDMA to allocate multiple channels with different modulation schema and multiple time slots for each channel allows better adaptation of heterogeneous user’s requirements. The main architecture in WiMAX uses PMP (Point to Multipoint), Mesh mode or the new MMR (Mobile Multi hop Mode) deployments where scheduling and multicasting have different approaches. In PMP SS (Subscriber Station) connects directly to BS (Base Station) in a single hop route so channel conditions adaptations and supporting QoS for classes of services is the key points in scheduling, admission control or multicasting, while in Mesh networks SS connects to other SS Stations or to the BS in a multi hop routes, the MMR mode extends the PMP mode in which the SS connects to either a relay station (RS) or to Bs. Both MMR and Mesh uses centralized or distributed scheduling with multicasting schemas based on scheduling trees for routing. In this paper a broad study is conducted About WiMAX technology PMP and Mesh deployments from main physical layers features with differentiation of MAC layer features to scheduling and multicasting approaches in both modes of operations

    Coordinated Multicasting with Opportunistic User Selection in Multicell Wireless Systems

    Full text link
    Physical layer multicasting with opportunistic user selection (OUS) is examined for multicell multi-antenna wireless systems. By adopting a two-layer encoding scheme, a rate-adaptive channel code is applied in each fading block to enable successful decoding by a chosen subset of users (which varies over different blocks) and an application layer erasure code is employed across multiple blocks to ensure that every user is able to recover the message after decoding successfully in a sufficient number of blocks. The transmit signal and code-rate in each block determine opportunistically the subset of users that are able to successfully decode and can be chosen to maximize the long-term multicast efficiency. The employment of OUS not only helps avoid rate-limitations caused by the user with the worst channel, but also helps coordinate interference among different cells and multicast groups. In this work, efficient algorithms are proposed for the design of the transmit covariance matrices, the physical layer code-rates, and the target user subsets in each block. In the single group scenario, the system parameters are determined by maximizing the group-rate, defined as the physical layer code-rate times the fraction of users that can successfully decode in each block. In the multi-group scenario, the system parameters are determined by considering a group-rate balancing optimization problem, which is solved by a successive convex approximation (SCA) approach. To further reduce the feedback overhead, we also consider the case where only part of the users feed back their channel vectors in each block and propose a design based on the balancing of the expected group-rates. In addition to SCA, a sample average approximation technique is also introduced to handle the probabilistic terms arising in this problem. The effectiveness of the proposed schemes is demonstrated by computer simulations.Comment: Accepted by IEEE Transactions on Signal Processin

    QoS Scheduling in IEEE 802.16 Broadband Wireless Access Networks

    Get PDF
    With the exploding increase of mobile users and the release of new wireless applications, the high bandwidth requirement has been taking as a main concern for the design and development of the wireless techniques. There is no doubt that broadband wireless access with the support of heterogeneous kinds of applications is the trend in the next generation wireless networks. As a promising broadband wireless access standard, IEEE 802.16 has attracted extensive attentions from both industry and academia due to its high data rate and the inherent media access control (MAC) mechanism, which takes the service differentiation and quality of service (QoS) provisioning into account. To achieve service differentiation and QoS satisfaction for heterogenous applications is a very complicated issue. It refers to many fields, such as connection admission control (CAC), congestion control, routing algorithm, MAC protocol, and scheduling scheme. Among these fields, packet scheduling plays one of the most important roles in fulfilling service differentiation and QoS provisioning. It decides the order of packet transmissions, and provides mechanisms for the resource allocation and multiplexing at the packet level to ensure that different types of applications meet their service requirements and the network maintains a high resource utilization. In this thesis, we focus on the packet scheduling for difficult types of services in IEEE 802.16 networks, where unicast and mulitcast scheduling are investigated. For unicast scheduling, two types of services are considered: non-real-time polling service (nrtPS) and best effort (BE) service. We propose a flexible and efficient resource allocation and scheduling framework for nrtPS applications to achieve a tradeoff between the delivery delay and resource utilization, where automatic repeat request (ARQ) mechanisms and the adaptive modulation and coding (AMC) technique are jointly considered. For BE service, considering the heterogeneity of subscriber stations (SSs) in IEEE 802.16 networks, we propose the weighted proportional fairness scheduling scheme to achieve the flexible scheduling and resource allocation among SSs based on their traffic demands/patterns. For multicast scheduling, a cooperative multicast scheduling is proposed to achieve high throughput and reliable transmission. By using the two-phase transmission model to exploit the spatial diversity gain in the multicast scenario, the proposed scheduling scheme can significantly improve the throughput not only for all multicast groups, but also for each group member. Analytical models are developed to investigate the performance of the proposed schemes in terms of some important performance measurements, such as throughput, resource utilization, and service probability. Extensive simulations are conducted to illustrate the efficient of the proposed schemes and the accuracy of the analytical models. The research work should provide meaningful guidelines for the system design and the selection of operational parameters, such as the number of TV channels supported by the network, the achieved video quality of each SS in the network, and the setting of weights for SSs under different BE traffic demands

    HYBRID ROUTING AND MULTICAST SCHEDULING ALGORITHMS FOR OFDMA RELAY NETWORKS

    Get PDF
    In era of technology, Wireless communication domain growing rapidly due to user mobility & different business operator to deploy Multicast & Broadcast based applications combining video, voice & text. To compute with it; two hop Orthogonal Frequency Division Multiple Access (OFDMA) relay network are being efficiently used in combination with Multicasting which forms a promising communication model for many multiparty applications. We can achieve multiplexing gains in OFDMA network by certain multicast strategy. Grouping of relay network and cooperation between them is one way of multicast strategy. For effective use of relay network, grouping and scheduling for the same must be carried out in intelligent manner. Different scheduling algorithms have been used for different relay network to maximize the multicast flow. While using the scheduling algorithm for OFDMA relay network we have notice the problem of multicast transmission between networks when failure occurs. To solve the problem of multicast transmission when failure occurs one must use dynamic method to choose different path i.e. routing dynamically over the network. Relay network group themselves and cooperate between, also reporting for the failure
    corecore