IEEE 802.11 기반 Enterprise 무선 LAN을 위한 자원 관리 기법

학위논문 (박사)-- 서울대학교 대학원 : 공과대학 전기·컴퓨터공학부, 2019. 2. 전화숙.IEEE 802.11이 무선 LAN (wireless local area network, WLAN)의 실질적인 표준이 됨에 따라 수 많은 엑세스 포인트(access points, APs)가 배치되었고, 그 결과 WLAN 밀집 환경이 조성되었다. 이러한 환경에서는, 이웃한 AP들에 동일한 채널을 할당하는 문제를 피할 수 없으며, 이는 해당 AP들이 같은 채널을 공유하게 하고 그로 인한 간섭을 야기한다. 간섭으로 인한 성능 저하를 줄이기 위해 채널 할당(channelization) 기법이 중요하다. 또한, 한 조직이 특정 지역에 밀집 배치된 AP들을 관리한다면 특정 사용자를 서비스할 수 있는 AP가 여럿일 수 있다. 이 경우, 사용자 접속(user association, UA) 기법이 준정적(quasi-static) 환경과 차량 환경 모두에서 네트워크 성능에 큰 영향을 미친다. 본 논문에서는 밀집 배치된 WLAN 환경에서 와이파이(WiFi) 성능 향상을 위해 채널 할당 기법을 제안한다. 먼저, 제안한 기법에서는 각각의 AP에 채널을 할당하기 위해 간섭 그래프(interference graph)를 이용하며 채널 결합(channel bonding)을 고려한다. 다음으로, 주어진 채널 결합 결과를 기반으로 해당 AP가 동적 채널 결합을 지원하는지 여부에 따라 주 채널(primary channel)을 결정한다. 한편, 준정적 환경과 차량 환경에서의 UA 문제는 다소 차이가 있다. 따라서 본 논문에서는 각각의 환경에 따라 서로 다른 UA 기법을 설계하였다. 준정적 환경에서의 UA 기법은 멀티캐스트 전송, 다중 사용자 MIMO (multi-user multiple input multiple output), 그리고 AP 수면과 같은 다양한 기술과 함께 AP간의 부하 분산(load balancing)과 에너지 절약을 고려한다. 제안하는 기법에서 UA 문제는 다목적함수 최적화 문제로 정식화하였고 그 해를 구하였다. 차량 환경에서의 UA 기법은 핸드오버(handover, HO) 스케줄 문제로 귀결된다. 본 논문에서는 도로의 지형을 고려하여 사용자가 접속할 AP를 결정하는 HO 스케줄 기법을 제안한다. 사용자는 단지 다음 AP로 연결을 맺을 시기만 결정하면 되기 때문에, 차량 환경에서의 매우 빠르고 효율적인 HO 기법을 구현할 수 있다. 이를 위해, 그래프 모델링 기법(graph modeling technique)을 활용하여 도로를 따라 배치된 AP사이의 관계를 표현한다. 현실적인 시나리오를 위해 직선 구간, 우회 구간, 교차로, 그리고 유턴 구간 등을 포함하는 복잡한 도로 구조를 고려한다. 도로 구조를 고려하여 각 사용자의 이동 경로를 예측하고, 그에 기반하여 각 사용자 별 HO의 목적 AP 집합을 선택한다. 제안하는 HO 스케줄 기법의 설계 목적은 HO 지연 시간의 합을 최소화하고 각 AP에서 해당 채널을 사용하려는 사용자 수를 줄이면서 WiFi 연결 시간을 최대화하는 것이다. 마지막으로, 본 논문에서는 준정적 환경에서 제안한 채널 할당 기법과 UA 기법의 현실성을 증명하기 위한 시험대(testbed)를 구성하였다. 또한, 광범위한 시뮬레이션을 통해 준정적 환경과 차량 환경에서 제안한 기법들과 기존의 기법들의 성능을 비교하였다.As the IEEE 802.11 (WiFi) becomes the defacto global standard for wireless local area network (WLAN), a huge number of WiFi access points (APs) are deployed. This condition leads to a densely deployed WLANs. In such environment, the conflicting channel allocation between the neighboring access points (APs) is unavoidable, which causes the channel sharing and interference between APs. Thus, the channel allocation (channelization) scheme has a critical role to tackle this issue. In addition, when densely-deployed APs covering a certain area are managed by a single organization, there can exist multiple candidate APs for serving a user. In this case, the user association (UA), i.e., the selection of serving AP, holds a key role in the network performance both in quasi-static and vehicular environments. To improve the performance of WiFi in a densely deployed WLANs environment, we propose a channelization scheme. The proposed channelization scheme utilizes the interference graph to assign the channel for each AP and considers channel bonding. Then, given the channel bonding assignment, the primary channel location for each AP is determined by observing whether the AP supports the static or dynamic channel bonding. Meanwhile, the UA problem in the quasi-static and vehicular environments are slightly different. Thus, we devise UA schemes both for quasi-static and vehicular environments. The UA schemes for quasi-static environment takes account the load balancing among APs and energy saving, considering various techniques for performance improvement, such as multicast transmission, multi-user MIMO, and AP sleeping, together. Then, we formulate the problem into a multi-objective optimization and get the solution as the UA scheme. On the other hand, the UA scheme in the vehicular environment is realized through handover (HO) scheduling mechanism. Specifically, we propose a HO scheduling scheme running on a server, which determines the AP to which a user will be handed over, considering the road topology. Since a user only needs to decide when to initiate the connection to the next AP, a very fast and efficient HO in the vehicular environment can be realized. For this purpose, we utilize the graph modeling technique to map the relation between APs within the road. We consider a practical scenario where the structure of the road is complex, which includes straight, curve, intersection, and u-turn area. Then, the set of target APs for HO are selected for each user moving on a particular road based-on its moving path which is predicted considering the road topology. The design objective of the proposed HO scheduling is to maximize the connection time on WiFi while minimizing the total HO latency and reducing the number of users which contend for the channel within an AP. Finally, we develop a WLAN testbed to demonstrate the practicality and feasibility of the proposed channelization and UA scheme in a quasi-static environment. Furthermore, through extensive simulations, we compare the performance of the proposed schemes with the existing schemes both in quasi-static and vehicular environments.1 Introduction 1.1 Background and Motivation 1.2 Related Works 1.3 Research Scope and Proposed Schemes 1.3.1 Centralized Channelization Scheme for Wireless LANs Exploiting Channel Bonding 1.3.2 User Association for Load Balancing and Energy Saving in Enterprise WLAN 1.3.3 A Graph-Based Handover Scheduling for Heterogenous Vehicular Networks 1.4 Organization 2 Centralized Channelization Scheme for Wireless LANs Exploiting Channel Bonding 2.1 System Model 2.2 Channel Sharing and Bonding 2.2.1 Interference between APs 2.2.2 Channel Sharing 2.2.3 Channel Bonding 2.3 Channelization Scheme 2.3.1 Building Interference Graph 2.3.2 Channel Allocation 2.3.3 Primary Channel Selection 2.4 Implementation 3 User Association for Load Balancing and Energy Saving in Enterprise Wireless LANs 3.1 System Model 3.1.1 IEEE 802.11 ESS-based Enterprise WLAN 3.1.2 Downlink Achievable Rate for MU-MIMO Groups 3.1.3 Candidate MU-MIMO Groups 3.2 User Association Problem 3.2.1 Factors of UA Objective 3.2.2 Problem Formulation 3.3 User Association Scheme 3.3.1 Equivalent Linear Problem 3.3.2 Solution Algorithm 3.3.3 Computational Complexity (Execution Time) 3.4 Implementation 4 A Graph-Based Handover Scheduling for Heterogenous Vehicular Networks 4.1 System Model 4.2 Graph-Based Modeling 4.2.1 Division of Road Portion into Road Segments 4.2.2 Relation between PoAs on a Road Segment 4.2.3 Directed Graph Representation 4.3 Handover Scheduling Problem 4.3.1 Problem Formulation 4.3.2 Weight of Edge 4.3.3 HO Scheduling Algorithm 4.4 Handover Scheduling Operation 4.4.1 HO Schedule Delivery 4.4.2 HO Triggering and Execution 4.4.3 Communication Overhead 5 Performance Evaluation 5.1 CentralizedChannelizationSchemeforWirelessLANsExploitingChannel Bonding 5.1.1 Experiment Settings 5.1.2 Comparison Schemes 5.1.3 Preliminary Experiment for Building Interference Graph 5.1.4 Experiment Results 5.2 User Association for Load Balancing and Energy Saving in Enterprise Wireless LANs 5.2.1 Performance Metrics 5.2.2 Experiment Settings 5.2.3 Experiment Results 5.2.4 Simulation Settings 5.2.5 Comparison Schemes 5.2.6 Simulation Results 5.2.7 Simulation for MU-MIMO System 5.3 A Graph-BasedHandover Scheduling for Heterogenous Vehicular Networks 5.3.1 Performance Metrics 5.3.2 Simulation Settings 5.3.3 Simulation Results 6 Conculsion Bibliography AcknowledgementsDocto

WCDMA Mobility Troubleshooting Studies and Enhancements

Mobiliteetti on yksi WCDMA-teknologian menestyksen avaintekijöistä. Saumattoman liikkuvuuden ylläpitämiseksi radioresurssien hallinnan algoritmit ovat tärkeässä roolissa verkon hallinnassa. Yhdessä pääsyvalvonnan, kuormavalvonnan, pakettiskedulerin, resurssimanagerin ja tehovalvonnan kanssa kanavanvaihtoalgoritmit vastaavat laadukkaan, katkeamattoman yhteyden ylläpidosta. Nämä algoritmit on toteutettu radioverkko-ohjaimen (RNC) ohjelmistossa. Ohjelmiston elinkaaren aikana ohjelmiston eri osissa kohdataan erilaisia haasteita. Ohjelmiston lisäksi ongelmia voi löytyä myös radioverkon suunnittelusta, verkkolaitteistosta tai päätelaitteista. Kaikkien näiden ongelmien analysointiin vaaditaan kokeneita R&D-insinöörejä, eikä ongelmien varsinaisen aiheuttajan löytäminen usein ole yksinkertaista. Tämän takia erilaiset vianetsintätyökalut ovat ohjelmistokehityksessä ensisijaisen tärkeitä. Tämä diplomityö analysoi jo käytössä olevia vianetsintämenetelmiä NSN-WCDMA-Control Plane-Handover Algorithm -ryhmässä sekä esittää erilaisia paranneltuja ratkaisuja näihin menetelmiin. Tämän diplomityön tuloksena muutamia paranneltuja ratkaisuja toteutettiin ja muutamia muita ratkaisumalleja analysoitiin. Vianetsintätyökalujen sekä -menetelmien kehitys jatkuu tarkastellussa ohjelmistokehitysryhmässä myös tämän diplomityön valmistumisen jälkeen.Mobility is the key success area in WCDMA technology. To maintain seamless mobility, Radio Resource Management algorithms are essential in network management. Together with Admission Control, Load Control, Packet Scheduler, Resource Manager and Power Control algorithms, Handover Control algorithms are responsible for high quality seamless communication. These algorithms take place in the Radio Network Controller software. In software life-cycle there can be challenges related with different software program blocks. Other than software problems there can also be radio network planning problems, hardware problems and user-equipment related problems. Those issues have to be analyzed by experienced R&D engineers. Usually it is not straightforward to investigate what is the root cause. Because of this reason troubleshooting tools play a vital role in software development. This thesis analyzes the existing troubleshooting solutions in NSN-WCDMA-Control Plane-Handover Algorithm team and proposes enhanced solutions for those needs. As a result of this thesis, some of the enhanced solutions are implemented and analyses for the other solutions are provided. Development of troubleshooting tools and methodology will continue in the software development team after the completion of this thesis

End-to-End Simulation of 5G mmWave Networks

Due to its potential for multi-gigabit and low latency wireless links, millimeter wave (mmWave) technology is expected to play a central role in 5th generation cellular systems. While there has been considerable progress in understanding the mmWave physical layer, innovations will be required at all layers of the protocol stack, in both the access and the core network. Discrete-event network simulation is essential for end-to-end, cross-layer research and development. This paper provides a tutorial on a recently developed full-stack mmWave module integrated into the widely used open-source ns--3 simulator. The module includes a number of detailed statistical channel models as well as the ability to incorporate real measurements or ray-tracing data. The Physical (PHY) and Medium Access Control (MAC) layers are modular and highly customizable, making it easy to integrate algorithms or compare Orthogonal Frequency Division Multiplexing (OFDM) numerologies, for example. The module is interfaced with the core network of the ns--3 Long Term Evolution (LTE) module for full-stack simulations of end-to-end connectivity, and advanced architectural features, such as dual-connectivity, are also available. To facilitate the understanding of the module, and verify its correct functioning, we provide several examples that show the performance of the custom mmWave stack as well as custom congestion control algorithms designed specifically for efficient utilization of the mmWave channel.Comment: 25 pages, 16 figures, submitted to IEEE Communications Surveys and Tutorials (revised Jan. 2018

Location Management in IP-based Future LEO Satellite Networks: A Review

Future integrated terrestrial, aerial, and space networks will involve thousands of Low Earth Orbit (LEO) satellites forming a network of mega-constellations, which will play a significant role in providing communication and Internet services everywhere, at any time, and for everything. Due to its very large scale and highly dynamic nature, future LEO satellite networks (SatNets) management is a very complicated and crucial process, especially the mobility management aspect and its two components location management and handover management. In this article, we present a comprehensive and critical review of the state-of-the-art research in LEO SatNets location management. First, we give an overview of the Internet Engineering Task Force (IETF) mobility management standards (e.g., Mobile IPv6 and Proxy Mobile IPv6) and discuss their location management techniques limitations in the environment of future LEO SatNets. We highlight future LEO SatNets mobility characteristics and their challenging features and describe two unprecedented future location management scenarios. A taxonomy of the available location management solutions for LEO SatNets is presented, where the solutions are classified into three approaches. The "Issues to consider" section draws attention to critical points related to each of the reviewed approaches that should be considered in future LEO SatNets location management. To identify the gaps, the current state of LEO SatNets location management is summarized. Noteworthy future research directions are recommended. This article is providing a road map for researchers and industry to shape the future of LEO SatNets location management.Comment: Submitted to the Proceedings of the IEE

Final report on the evaluation of RRM/CRRM algorithms

Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

Distributed scheduling algorithms for LoRa-based wide area cyber-physical systems

Low Power Wide Area Networks (LPWAN) are a class of wireless communication protocols that work over long distances, consume low power and support low datarates. LPWANs have been designed for monitoring applications, with sparse communication from nodes to servers and sparser from servers to nodes. Inspite of their initial design, LPWANs have the potential to target applications with higher and stricter requirements like those of Cyber-Physical Systems (CPS). Due to their long-range capabilities, LPWANs can specifically target CPS applications distributed over a wide-area, which is referred to as Wide-Area CPS (WA-CPS). Augmenting WA-CPSs with wireless communication would allow for more flexible, low-cost and easily maintainable deployment. However, wireless communications come with problems like reduced reliability and unpredictable latencies, making them harder to use for CPSs. With this intention, this thesis explores the use of LPWANs, specifically LoRa, to meet the communication and control requirements of WA-CPSs. The thesis focuses on using LoRa due to its high resilience to noise, several communication parameters to choose from and a freely modifiable communication stack and servers making it ideal for research and deployment. However, LoRaWAN suffers from low reliability due to its ALOHA channel access method. The thesis posits that "Distributed algorithms would increase the protocol's reliability allowing it to meet the requirements of WA-CPSs". Three different application scenarios are explored in this thesis that leverage unexplored aspects of LoRa to meet their requirements. The application scenarios are delay-tolerant vehicular networks, multi-stakeholder WA-CPS deployments and water distribution networks. The systems use novel algorithms to facilitate communication between the nodes and gateways to ensure a highly reliable system. The results outperform state-of-art techniques to prove that LoRa is currently under-utilised and can be used for CPS applications.Open Acces

Radio Communications

In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modified our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the field of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms