Multiple preemptive EDCA for emergency medium access control in distributed WLANs

The increasingly use of wireless local area networks (WLANs) in public safety and emergency network services demands for a strict quality of service (QoS) guarantee especially a large number of users report an emergency for immediate channel access. Unfortunately, the traditional IEEE 802.11e-based enhanced distributed channel access (EDCA) does not support a strict QoS guarantee for life saving emergency traffic under high loads. Previous studies have attempted to enhance the performance of EDCA called the Channel Preemtive EDCA (CP-EDCA) which is a promising idea to support emergency traffic in WLANs. However, CP-EDCA supports a single emergency traffic only (i.e. no emergency service differentiation) with high delays for increased traffic loads. To overcome this problem, we propose a class of EDCA protocol called Multiple Preemption EDCA (MPEDCA) as a candidate to support multiple emergency traffics under high loads. Each MP-EDCA node can support up to four emergency traffics (life, health, property and environment) with different priorities in addition to support background (non-emergency) traffic. The proposed protocol privileged the high priority life-saving emergency traffic to preempt the services of low priority ones without much starvation in the network to maintain a strict QoS guarantee. The paper evaluates the performance of MPEDCA through an extensive analysis of simulation outcome. The results obtained show that MP-EDCA outperforms CP-EDCA in achieving lower medium access control and emergency node delays

Resource allocation in cellular CDMA systems with cross- layer Optimization

Ph.DDOCTOR OF PHILOSOPH

이동통신 네트워크에서의 QoS 패킷 스케줄러 설계 및 고정 릴레이 관련 주파수 재사용 관리 기법 연구

학위논문 (박사)-- 서울대학교 대학원 공과대학 전기·컴퓨터공학부, 2017. 8. 박세웅.The main interest of this paper is to understand a basic approach to provide more efficient method to allocate radio resources in the mobile communication systems, especially in which radio resources could be allocated by both frequency and time division multiple access. So, we consider OFDMA system and the ideas described in this paper could be easily applied to the current and next generation mobile communication systems. This paper studies two basic research themesa QoS packet scheduler design and fixed relay resource management policies based on frequency reuse in mobile networks. This paper considers novel scheduler structures that are executable in the environments of multiple traffic classes and multiple frequency channels. To design a scheduler structure for multiple traffic classes, we first propose a scheduler selection rule that uses the priority of traffic class and the urgency level of each packet. Then we relax the barrier of traffic class priority when a high priority packet has some room in waiting time. This gives us a chance to exploit multiuser diversity, thereby giving more flexibility in scheduling. Our considered scheduler can achieve higher throughput compared to the simple extension of conventional modified largest weighted delay first (MLWDF) scheduler while maintaining the delay performance for QoS class traffic. We also design a scheduler structure for multiple frequency channels that chooses a good channel for each user whenever possible to exploit frequency diversity. The simulation results show that our proposed scheduler increases the total system throughput by up to 50% without degrading the delay performance. This paper also introduces radio resource management schemes based on frequency reuse for fixed relay stations in mobile cellular networks. Mobile stations in the cell boundary experience poor spectral efficiency due to the path loss and interference from adjacent cells. Therefore, satisfying QoS requirements of each MS at the cell boundary has been an important issue. To resolve this spectral efficiency problem at the cell boundary, deploying fixed relay stations has been actively considered. In this paper, we consider radio resource management policies based on frequency reuse for fixed relays that include path selection rules, frequency reuse pattern matching, and frame transmission pattern matching among cells. We evaluate performance of each policy by varying parameter values such as relay stations position and frequency reuse factor. Through Monte Carlo simulations and mathematical analysis, we suggest some optimal parameter values for each policy and discuss some implementation issues that need to be considered in practical deployment of relay stations. We also surveyed further works that many researchers have been studied to tackle the similar problems of QoS scheduling and resource management for relay with our proposed work. We expect that there would be more future works by priority-based approach and energy-aware approach for QoS scheduling. Also current trends such as the rising interest in IoT system, discussion of densification of cells and D2D communications in 5G systems make us expect that the researches in these topics related with relays would be popular in the future. We also think that there are many interesting problems regarding QoS support and resource management still waiting to be tackled, especially combined with recent key topics in mobile communication systems such as 5G standardization, AI and NFV/SDN.Chapter 1 Introduction 1 1.1 QoS Packet Scheduler 4 1.2 Fixed Relay Frequency Reuse Policies 6 Chapter 2 Scheduler Design for Multiple Traffic Classes in OFDMA Networks 10 2.1 Proposed Schedulers 10 2.1.1 Scheduler Structures 12 2.1.2 MLWDF scheduler for Multiple Traffic Classes 13 2.1.3 Joint Scheduler 13 2.2 System Model 18 2.3 Performance Evaluation 19 2.3.1 Schedulers for Multiple Traffic Classes 20 2.3.2 Impact of Scheduler Selection Rule 25 2.3.3 Frame Based Schedulers 27 2.3.4 Impact of Partial Feedback 30 2.3.5 Adaptive Threshold Version Schedulers 33 2.4 Conclusion 36 Chapter 3 Frequency Reuse Policies for Fixed Relays in Cellular Networks 40 3.1 System Model 40 3.1.1 Frame Transmission and Frequency Reuse Patterns among RSs 42 3.1.2 Positioning of RSs and Channel Capacity 44 3.1.3 Area Spectral Efficiency 45 3.2 Radio Resource Management Policies Based on Frequency Reuse 46 3.2.1 Path Selection Rule 46 3.2.2 Frequency Reuse and Frame Transmission Pattern Matchings among Cells 52 3.3 Monte Carlo Simulation and Results 53 3.4 Consideration of Practical Issues 80 3.5 Conclusion 81 Chapter 4 Surveys of Further Works 83 4.1 Further Works on QoS Schedulers 83 4.1.1 WiMAX Schedulers 85 4.1.2 LTE Schedulers 92 4.2 Further Works on Radio Resource Management in Relay Systems 98 4.3 Future Challenges 100 Chapter 5 Conclusion 104 Bibliography 107 초록 127Docto

Improvement in the Priority Handoff Scheme for Multi-Service Wireless Mobile Networks

Abstract: In this study, a new handoff strategy to improve the performance of wireless mobile networks is presented. It has been found form this study that the dropping probability of handoff calls is drastically reduced compared to the existing method of channel reservation strategy of handoff calls and the performance of new calls can be improved. The strategy is that the new call should be delayed then it can use the last idle channel. The time that all the channels are holding has been shortened. Opportunities of the new call and handoff call occupancy channel are increased; the scheme also takes into account the priority of different data types and only when the highpriority data packets queue is empty, the data packets in low-priority data queue can be transmitted. Simulation results show that, to let the new voice call delay in the allowable range, can effectively reduce the dropping probability of handoff call and the blocking probability of high-priority data while improving the probability of new call to enter into the systems

Queueing models for capacity changes in cellular networks

With the rapid development of cellular communication techniques, many recent studies have focused on improving the quality of service (QoS) in cellular networks. One characteristic of the systems in cellular networks, which can have direct impact on the system QoS, is the fluctuation of the system capacity. In this thesis, the QoS of systems with capacity fluctuations is studied from two perspectives: (1) priority queueing systems with preemption, and (2) the M/M/~C/~C system. In the first part, we propose two models with controlled preemption and analyze their performance in the context of a single reference cell that supports two kinds of traffic (new calls and handoff calls). The formulae for calculating the performance measures of interest (i.e., handoff call blocking probability, new call blocking and dropping probabilities) are developed, and the procedures for solving optimization problems for the optimal number of channels required for each proposed model are established. The proposed controlled preemption models are then compared to existing non-preemption and full preemption models from the following three perspectives: (i) channel utilization, (ii) low priority call (i.e., new calls) performance, and (iii) flexibility to meet various constraints. The results showed that the proposed controlled preemption models are the best models overall. In the second part, the loss system with stochastic capacity, denoted by M/M/~C/~C, is analyzed using the Markov regenerative process (MRGP) method. Three different distributions of capacity interchange times (exponential, gamma, and Pareto) and three different capacity variation patterns (skip-free, distance-based, and uniform-based) are considered. Analytic expressions are derived to calculate call blocking and dropping probabilities and are verified by call level simulations. Finally, numerical examples are provided to determine the impact of different distributions of capacity interchange times and different capacity variation patterns on system performance

Improving Routing Efficiency, Fairness, Differentiated Servises And Throughput In Optical Networks

Wavelength division multiplexed (WDM) optical networks are rapidly becoming the technology of choice in next-generation Internet architectures. This dissertation addresses the important issues of improving four aspects of optical networks, namely, routing efficiency, fairness, differentiated quality of service (QoS) and throughput. A new approach for implementing efficient routing and wavelength assignment in WDM networks is proposed and evaluated. In this approach, the state of a multiple-fiber link is represented by a compact bitmap computed as the logical union of the bitmaps of the free wavelengths in the fibers of this link. A modified Dijkstra\u27s shortest path algorithm and a wavelength assignment algorithm are developed using fast logical operations on the bitmap representation. In optical burst switched (OBS) networks, the burst dropping probability increases as the number of hops in the lightpath of the burst increases. Two schemes are proposed and evaluated to alleviate this unfairness. The two schemes have simple logic, and alleviate the beat-down unfairness problem without negatively impacting the overall throughput of the system. Two similar schemes to provide differentiated services in OBS networks are introduced. A new scheme to improve the fairness of OBS networks based on burst preemption is presented. The scheme uses carefully designed constraints to avoid excessive wasted channel reservations, reduce cascaded useless preemptions, and maintain healthy throughput levels. A new scheme to improve the throughput of OBS networks based on burst preemption is presented. An analytical model is developed to compute the throughput of the network for the special case when the network has a ring topology and the preemption weight is based solely on burst size. The analytical model is quite accurate and gives results close to those obtained by simulation. Finally, a preemption-based scheme for the concurrent improvement of throughput and burst fairness in OBS networks is proposed and evaluated. The scheme uses a preemption weight consisting of two terms: the first term is a function of the size of the burst and the second term is the product of the hop count times the length of the lightpath of the burst

Analytical modeling of HSUPA-enabled UMTS networks for capacity planning

In recent years, mobile communication networks have experienced significant evolution. The 3G mobile communication system, UMTS, employs WCDMA as the air interface standard, which leads to quite different mobile network planning and dimensioning processes compared with 2G systems. The UMTS system capacity is limited by the received interference at NodeBs due to the unique features of WCDMA, which is denoted as `soft capacity'. Consequently, the key challenge in UMTS radio network planning has been shifted from channel allocation in the channelized 2G systems to blocking and outage probabilities computation under the `cell breathing' effects which are due to the relationship between network coverage and capacity. The interference characterization, especially for the other-cell interference, is one of the most important components in 3G mobile networks planning. This monograph firstly investigates the system behavior in the operation of UMTS uplink, and develops the analytic techniques to model interference and system load as fully-characterized random variables, which can be directly applicable to the performance modeling of such networks. When the analysis progresses from single-cell scenario to multi-cell scenario, as the target SIR oriented power control mechanism is employed for maximum capacity, more sophisticated system operation, `feedback behavior', has emerged, as the interference levels at different cells depend on each other. Such behaviors are also captured into the constructed interference model by iterative and approximation approaches. The models are then extended to cater for the features of the newly introduced HSUPA, which provides enhanced dedicated channels for the packet switched data services such that much higher bandwidth can be achieved for best-effort elastic traffic, which allows network operators to cope with the coexistence of both circuit-switched and packet-switched traffic and guarantee the QoS requirements. During the derivation, we consider various propagation models, traffic models, resource allocation schemes for many possible scenarios, each of which may lead to different analytical models. All the suggested models are validated with either Monte-Carlo simulations or discrete event simulations, where excellent matches between results are always achieved. Furthermore, this monograph studies the optimization-based resource allocation strategies in the UMTS uplink with integrated QoS/best-effort traffic. Optimization techniques, both linear-programming based and non-linear-programming based, are used to determine how much resource should be assigned to each enhanced uplink user in the multi-cell environment where each NodeB possesses full knowledge of the whole network. The system performance under such resource allocation schemes are analyzed and compared via Monte-Carlo simulations, which verifies that the proposed framework may serve as a good estimation and optimal reference to study how systems perform for network operators

Analytical modeling of HSUPA-enabled UMTS networks for capacity planning

In recent years, mobile communication networks have experienced significant evolution. The 3G mobile communication system, UMTS, employs WCDMA as the air interface standard, which leads to quite different mobile network planning and dimensioning processes compared with 2G systems. The UMTS system capacity is limited by the received interference at NodeBs due to the unique features of WCDMA, which is denoted as `soft capacity'. Consequently, the key challenge in UMTS radio network planning has been shifted from channel allocation in the channelized 2G systems to blocking and outage probabilities computation under the `cell breathing' effects which are due to the relationship between network coverage and capacity. The interference characterization, especially for the other-cell interference, is one of the most important components in 3G mobile networks planning. This monograph firstly investigates the system behavior in the operation of UMTS uplink, and develops the analytic techniques to model interference and system load as fully-characterized random variables, which can be directly applicable to the performance modeling of such networks. When the analysis progresses from single-cell scenario to multi-cell scenario, as the target SIR oriented power control mechanism is employed for maximum capacity, more sophisticated system operation, `feedback behavior', has emerged, as the interference levels at different cells depend on each other. Such behaviors are also captured into the constructed interference model by iterative and approximation approaches. The models are then extended to cater for the features of the newly introduced HSUPA, which provides enhanced dedicated channels for the packet switched data services such that much higher bandwidth can be achieved for best-effort elastic traffic, which allows network operators to cope with the coexistence of both circuit-switched and packet-switched traffic and guarantee the QoS requirements. During the derivation, we consider various propagation models, traffic models, resource allocation schemes for many possible scenarios, each of which may lead to different analytical models. All the suggested models are validated with either Monte-Carlo simulations or discrete event simulations, where excellent matches between results are always achieved. Furthermore, this monograph studies the optimization-based resource allocation strategies in the UMTS uplink with integrated QoS/best-effort traffic. Optimization techniques, both linear-programming based and non-linear-programming based, are used to determine how much resource should be assigned to each enhanced uplink user in the multi-cell environment where each NodeB possesses full knowledge of the whole network. The system performance under such resource allocation schemes are analyzed and compared via Monte-Carlo simulations, which verifies that the proposed framework may serve as a good estimation and optimal reference to study how systems perform for network operators