DOCSLIB.ORG

Verification of Autonomic Actions in Mobile Communication Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Verification of Autonomic Actions in Mobile Communication Networks Chair of Network Architectures and Services Department of Informatics Technical University of Munich Verification of Autonomic Actions in Mobile Communication Networks Dissertation Tsvetko Ivanchev Tsvetkov Network Architectures and Services NET-2017-07-1 TECHNISCHE UNIVERSITÄT MÜNCHEN Institut für Informatik Lehrstuhl für Netzarchitekturen und Netzdienste Verification of Autonomic Actions in Mobile Communication Networks Tsvetko Ivanchev Tsvetkov Vollständiger Abdruck der von der Fakultät für Informatik der Technischen Universität München zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) genehmigten Dissertation. Vorsitzender: Prof. Dr. Uwe Baumgarten Prüfer der Dissertation: 1. Prof. Dr.-Ing. Georg Carle 2. Prof. Dr. Rolf Stadler KTH Royal Institute of Technology, Stockholm, Sweden Die Dissertation wurde am 27.02.2017 bei der Technischen Universität München eingereicht und durch die Fakultät für Informatik am 29.06.2017 angenommen. Cataloging-in-Publication Data Tsvetko Ivanchev Tsvetkov Verification of Autonomic Actions in Mobile Communication Networks Dissertation, July 2017 Chair of Network Architectures and Services Department of Informatics Technical University of Munich ISBN 978-3-937201-56-6 DOI 10.2313/NET-2017-07-1 ISSN: 1868-2634 (print) ISSN: 1868-2642 (electronic) Network Architectures and Services NET-2017-07-1 Series Editor: Georg Carle, Technical University of Munich, Germany c 2017 Technical University of Munich, Germany Abstract Mobile communication networks are highly complex systems which are comprised of a set of various technologies and automation mechanisms. Today, when we talk about cellular networks we usually think of networks that support the latest standard, which are also backwards compatible to standards developed in the past. The most prominent example is Long Term Evolution (LTE) and the supported fallback to the Global System for Mobile Communications (GSM) or the Universal Mobile Telecommunications Sys- tem (UMTS). Moreover, mobile networks are comprised of a high variety of Network Elements (NEs), e.g., the LTE Radio Access Network (RAN) is typically composed of macro as well as micro and pico cells. As a result, management and automation concepts have been developed to deal with the configuration, optimization, and troubleshooting of the network. One example are Self-Organizing Networks (SONs) which aim to reduce human intervention and automatize those processes. However, having automated entities that actively reconfigure the network raises the question of how to assess their actions and what to do in case they negatively affect the performance of the network. In the terms of SON, those entities are referred to as SON functions, also called online SON, which are implemented as closed control loops that actively monitor Performance Management (PM) / Fault Management (FM) data, and based on their objectives change Configuration Management (CM) parameters. In addition, there are offline SON methods which are comprised of sophisticated optimiza- tion algorithms that require more knowledge about the network and also more time to compute a new configuration. Usually, offline algorithms utilize simulation tools to find the most suitable configuration setup. Nevertheless, both online and offline approaches may face difficulties while they optimize the network and may produce suboptimal or even configurations harming per- formance. The reasons are manifold: they may have inaccurate information about the network, they may not know whether there is another ongoing SON activity, or they may simply have a very limited view on the network. For this reason, in the mobile network area troubleshooting as well as anomaly detection and diagnosis approaches are used to analyze the network performance and state whether configuration changes had a negative impact on the NEs. Thereby, they may also suggest corrective actions that improve the current network state. Unfortunately, such approaches often neglect issues that may occur while rolling back II Abstract configuration changes. First and foremost, verification collisions are often underestimated. They prevent two or more corrective actions from being simultaneously executed and, therefore, delay the process until the network is restored to a previous stable state. Those collisions may also result in the inability to process all corrective actions, that is, we have an over-constrained problem that has no solution for the given conditions. Moreover, the issue of detecting weak collisions, i.e., collisions that may turn out to be false positive, and SON function transactions is neglected as well. Second, dynamic changes in the network topology, e.g., such induced by energy saving mechanisms are often neglected. They may result in incomplete cell profiles and gener- ally complicate the process of assessing the performance impact of other configuration changes. In the worst case scenario, they may lead to the rollback of changes that are necessary for the flawless network operation. In this thesis, a concept for verifying configuration and topology changes is presented. It is realized as three step process that splits the network into areas of interest, assesses their performance, and generates a corrective action plan. The set of corrective actions are undo actions, which restore a cell’s configuration to a previous state, and topology corrective actions, which either enable or disable cells. The presented concept utilizes techniques from graph theory and constraint optimization to resolve the aforementioned issues. For example, it makes use of a Minimum Spanning Tree (MST) clustering technique that eliminates weak collisions. Furthermore, it utilizes Steiner trees to generate the necessary topology corrective actions. The presented concept is evaluated in a simulation environment and observations based on real data are made as well. Acknowledgments This work would not have been possible without the advice and support of many people. Here, I would like to take the opportunity to the express my thankfulness and great appreciation. First of all, I would like to thank Prof. Dr. Georg Carle for giving me the opportunity to write my dissertation under his supervision. I am deeply grateful for his support, advice, and freedom he gave during those four years. I also would like to thank Prof. Dr. Rolf Stadler for being my second examiner and Prof. Dr. Uwe Baumgarten for heading my committee. With the same gratitude, I would like to thank Dr. Henning Sanneck for enabling me to do my research at Nokia. Our numerous discussions over the years were invaluable. Second, I would like to thank all of my colleagues without whom I would not have been able to make it this far. Thank you, Janne Ali-Tolppa, for the various discussions, meetings, and suggestions you gave me. This thesis would not have become reality without your encouragement and your support on the ideas I had. I really enjoyed working with you. Thank you, Christian Mannweiler, for your help, support, and advice. I really do appreciate the time you always had to review my ideas and research results. Thank you, Christoph Frenzel, for your helpfulness and for constantly challenging my ideas. It was amazing to work with you side-by-side, especially during the development phase of the simulation system. I have learned a lot of things from you. Also, special thanks to Szabolcs Nováczki and Christoph Schmelz for making my entry into the research field to go as smooth as possible. Last but not least, I would like to thank my parents, Marusya Monova and Ivancho Monov, for always been there for me whenever I needed them. You have always believed in me, and have always supported me in everything. Thank you, for your unconditional love throughout my life. Munich, July 2017 Tsvetko Ivanchev Tsvetkov Contents I Introduction and Background 1 1 Introduction 3 1.1 Automation of Mobile Networks . .3 1.2 Anomaly Detection and Configuration Restoration . .4 1.3 Research Objectives . .5 1.4 Approach and Contributions . 10 1.4.1 Identification of Requirements, Issues, and Causes . 10 1.4.2 The Concept of SON Verification . 11 1.4.3 Implementation of the Verification Concept . 13 1.4.4 Concept Evaluation . 13 1.5 Thesis Outline . 14 1.6 Publications . 17 1.6.1 Publications in the Context of this Thesis . 17 1.6.2 Publications in the Context of Other SON Related Areas . 19 1.7 Statement on the Author’s Contributions . 19 1.8 Note on Terminology . 20 1.9 Document Structure . 21 1.9.1 Reference to Author’s Publications . 21 1.9.2 Terminology and Notes . 21 1.9.3 Objectives and Tasks . 21 1.9.4 Summary and Findings . 22 1.9.5 Appendix . 22 2 Background 23 2.1 Mobile Communication Networks . 23 2.1.1 Generations of Communication Standards . 23 2.1.2 Collaboration and Standardization Process . 24 2.1.3 Radio Access Network . 25 2.1.4 Core Network . 27 2.1.5 Protocol Architecture . 28 2.2 Mobile Network Management . 28 2.2.1 Operation, Administration and Management Architecture . 29 VI Contents 2.2.2 Network Management Data . 30 2.2.3 Granularity Period . 31 2.3 Self-Organizing Networks . 31 2.3.1 SON Categories . 32 2.3.2 SON Functions . 34 2.3.3 Other Application Areas . 36 2.4 Summary . 38 II Problem Analysis and Related Work 39 3 Problem Analysis 41 3.1 Motivation . 42 3.1.1 Troubleshooting and Anomaly Detection . 42 3.1.2 The Term "Verification" . 44 3.2 Challenges for a Verification Process . 45 3.2.1 SON Function Transactions . 45 3.2.2 Verification Collisions . 47 3.2.3 Over-Constrained Corrective Action Plan . 49 3.2.4 Weak Verification Collisions . 51 3.2.5 Dynamic Topology Changes . 52 3.3 Factors Influencing a Verification Process . 55 3.3.1 Availability of PM and CM Data . 55 3.3.2 Statistical Relevance of PM Data . 57 3.3.3 Network Density, Heterogeneity, and Topology . 58 3.3.4 Characteristics of CM Parameter Changes . 60 3.4 Summary . 63 4 Related work 67 4.1 Pre-Action Analysis .
Load more

Recommended publications
  • MAC Protocols for IEEE 802.11Ax: Avoiding Collisions on Dense Networks Rafael A
    MAC Protocols for IEEE 802.11ax: Avoiding Collisions on Dense Networks Rafael A. da Silva1 and Michele Nogueira1;2 1Department of Informatics, Federal University of Parana,´ Curitiba, PR, Brazil 2Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA E-mails: [email protected] and [email protected] Wireless networks have become the main form of Internet access. Statistics show that the global mobile Internet penetration should exceed 70% until 2019. Wi-Fi is an important player in this change. Founded on IEEE 802.11, this technology has a crucial impact in how we share broadband access both in domestic and corporate networks. However, recent works have indicated performance issues in Wi-Fi networks, mainly when they have been deployed without planning and under high user density. Hence, different collision avoidance techniques and Medium Access Control protocols have been designed in order to improve Wi-Fi performance. Analyzing the collision problem, this work strengthens the claims found in the literature about the low Wi-Fi performance under dense scenarios. Then, in particular, this article overviews the MAC protocols used in the IEEE 802.11 standard and discusses solutions to mitigate collisions. Finally, it contributes presenting future trends arXiv:1611.06609v1 [cs.NI] 20 Nov 2016 in MAC protocols. This assists in foreseeing expected improvements for the next generation of Wi-Fi devices. I. INTRODUCTION Statistics show that wireless networks have become the main form of Internet access with an expected global mobile Internet penetration exceeding 70% until 2019 [1]. Wi-Fi Notice: This work has been submitted to the IEEE for possible publication.
    [Show full text]
  • Migrating Backoff to the Frequency Domain
    No Time to Countdown: Migrating Backoff to the Frequency Domain Souvik Sen Romit Roy Choudhury Srihari Nelakuditi Duke University Duke University University of South Carolina Durham, NC, USA Durham, NC, USA Columbia, SC, USA [email protected] [email protected] [email protected] ABSTRACT 1. INTRODUCTION Conventional WiFi networks perform channel contention in Access control strategies are designed to arbitrate how mul- time domain. This is known to be wasteful because the chan- tiple entities access a shared resource. Several distributed nel is forced to remain idle while all contending nodes are protocols embrace randomization to achieve arbitration. In backing off for multiple time slots. This paper proposes to WiFi networks, for example, each participating node picks a break away from convention and recreate the backing off op- random number from a specified range and begins counting eration in the frequency domain. Our basic idea leverages the down. The node that finishes first, say N1, wins channel con- observation that OFDM subcarriers can be treated as integer tention and begins transmission. The other nodes freeze their numbers. Thus, instead of picking a random backoff duration countdown temporarily, and revive it only after N1’s trans- in time, a contending node can signal on a randomly cho- mission is complete. Since every node counts down at the sen subcarrier. By employing a second antenna to listen to same pace, this scheme produces an implicit ordering among all the subcarriers, each node can determine whether its cho- nodes. Put differently, the node that picks the smallest ran- sen integer (or subcarrier) is the smallest among all others.
    [Show full text]
  • Collision Detection
    Computer Networking Michaelmas/Lent Term M/W/F 11:00-12:00 LT1 in Gates Building Slide Set 3 Evangelia Kalyvianaki [email protected] 2017-2018 1 Topic 3: The Data Link Layer Our goals: • understand principles behind data link layer services: (these are methods & mechanisms in your networking toolbox) – error detection, correction – sharing a broadcast channel: multiple access – link layer addressing – reliable data transfer, flow control • instantiation and implementation of various link layer technologies – Wired Ethernet (aka 802.3) – Wireless Ethernet (aka 802.11 WiFi) • Algorithms – Binary Exponential Backoff – Spanning Tree 2 Link Layer: Introduction Some terminology: • hosts and routers are nodes • communication channels that connect adjacent nodes along communication path are links – wired links – wireless links – LANs • layer-2 packet is a frame, encapsulates datagram data-link layer has responsibility of transferring datagram from one node to adjacent node over a link 3 Link Layer (Channel) Services • framing, physical addressing: – encapsulate datagram into frame, adding header, trailer – channel access if shared medium – “MAC” addresses used in frame headers to identify source, dest • different from IP address! • reliable delivery between adjacent nodes – we see some of this again in the Transport Topic – seldom used on low bit-error link (fiber, some twisted pair) – wireless links: high error rates 4 Link Layer (Channel) Services - 2 • flow control: – pacing between adjacent sending and receiving nodes • error control: – error
    [Show full text]
  • How Computers Share Data
    06 6086 ch03 4/6/04 2:51 PM Page 41 HOUR 3 Getting Data from Here to There: How Computers Share Data In this hour, we will first discuss four common logi- cal topologies, starting with the most common and ending with the most esoteric: . Ethernet . Token Ring . FDDI . ATM In the preceding hour, you read a brief definition of packet-switching and an expla- nation of why packet switching is so important to data networking. In this hour, you learn more about how networks pass data between computers. This process will be discussed from two separate vantage points: logical topologies, such as ethernet, token ring, and ATM; and network protocols, which we have not yet discussed. Why is packet switching so important? Recall that it enables multiple computers to send multiple messages down a single piece of wire, a technical choice that is both efficient and an elegant solution. Packet switching is intrinsic to computer network- ing—without packet switching, no network. In the first hour, you learned about the physical layouts of networks, such as star, bus, and ring technologies, which create the highways over which data travels. In the next hour, you learn about these topologies in more depth. But before we get to them, you have to know the rules of the road that determine how data travels over a network. In this hour, then, we’ll review logical topologies. 06 6086 ch03 4/6/04 2:51 PM Page 42 42 Hour 3 Logical Topologies Before discussing topologies again, let’s revisit the definition of a topology.
    [Show full text]
  • Listen Before You Talk but on the Frequency Domain
    1 Listen Before You Talk But On The Frequency Domain Souvik Sen Romit Roy Choudhury Srihari Nelakuditi Duke University Duke University University of South Carolina Abstract Access control strategies are designed to arbitrate how multiple entities access a shared resource. Several dis- tributed protocols embrace randomization to achieve arbitration. In WiFi networks, for example, each participating node picks a random number from a specified range and begins counting down. The device that reaches zero first wins the contention and initiates transmission. This core idea – called backoff – is known to be inherently wasteful because the channel must remain idle while all contending nodes are simultaneously counting down. This wastage has almost been accepted as a price for decentralization. In this paper, we ask whether the entire backoff operation can be migrated to the frequency domain, thereby eliminating a long-standing source of channel inefficiency. Our core idea draws on OFDM subcarriers in modern WiFi radios, treating each subcarrier as an integer number. By transmitting a signal on a random subcarrier frequency, and using a second antenna to listen for all active frequencies, each node may be able to detect its rank among all contenders. Since signaling on subcarriers is almost instantaneous, the wastage from backoff can become negligible. We design such an unconventional backoff scheme called Back2F, implement it on a software- radio testbed, and demonstrate its feasibility with real-world experiments. A natural next step would be to revisit today’s protocols, and ask what other operations may be similarly migrated to the frequency domain. I. PROBLEM &MOTIVATION Accessing a shared resource in a decentralized manner has been studied for several decades.
    [Show full text]
  • Ethernet Basics Ethernet Basics
    2016-09-24 Ethernet Basics based on Chapter 4 of CompTIA Network+ Exam Guide, 4th ed., Mike Meyers Ethernet Basics • History • Ethernet Frames • CSMA/CD • Obsolete versions • 10Mbps versions • Segments • Spanning Tree Protocol 1 2016-09-24 Ethernet – Early History • 1970: ALOHAnet, first wireless packet-switched network - Norman Abramson, Univ. of Hawaii - Basis for Ethernet’s CSMA/CD protocol - 1972: first external network connected to ARPANET • 1973: Ethernet prototype developed at Xerox PARC - (Palo Alto Research Center) - 2.94 Mbps initially • 1976: "Ethernet: Distributed Packet Switching for Local Computer Networks" published in Communications of the ACM. - Bob Metcalfe and David Boggs - sometimes considered “the beginning of Ethernet” Ethernet goes Mainstream • 1979: DEC, Intel, Xerox collaborate on a commercial Ethernet specification - Ethernet II, a.k.a. “DIX” Ethernet - (Digital Equipment Corporation) • 1983: IEEE 802.3 specification formally approved - Differs from Ethernet II in the interpretation of the third header field • 1987: alternatives to coaxial cables - IEEE 802.3d: FOIRL, Fiber Optic Inter-Repeater Link - IEEE 802.3e: 1 Mbps over Twisted Pair wires (whoopee!) • 1990: Twisted-Pair wiring takes over - IEEE 802.3i: 10 Mbps over Twisted-Pair – 10Base-TX, 10Base-T4 2 2016-09-24 the Future is Now (next chapter) (and Now is so Yesteryear…) 1995 – Now: speed and cabling improvements • 1995: 100Mbps varieties • 1999: 1Gbps on twisted-pair • 2003-2006: 10Gbps on optical fiber and UTP • 2010: 40Gbps, 100Gbps (802.3ba) - optical fiber or twinaxial cable - point-to-point physical topology; for backbones • 2016, September: 2.5GBase-T, 5GBase-T ? - who knows? What Is Ethernet? • Protocols, standards for Local Area Networks » Ethernet II, IEEE 802.3 • Specifies Physical-layer components - Cabling, signaling properties, etc.
    [Show full text]
  • The Nominal Capacity of Wireless Mesh Networks Jangeun Jun and Mihail L
    MERGING IP AND WIRELESS NETWORKS THE NOMINAL CAPACITY OF WIRELESS MESH NETWORKS JANGEUN JUN AND MIHAIL L. SICHITIU, NORTH CAROLINA STATE UNIVERSITY broadband Internet access using seven gate- GW ABSTRACT ways (the larger red nodes) connected to the 1 Wireless mesh networks are an alternative Internet. In WMNs, each user node operates technology for last-mile broadband Internet not only as a host but also as a wireless router, access. In WMNs, similar to ad hoc networks, forwarding packets on behalf of other nodes 2 each user node operates not only as a host but that may not be within direct wireless transmis- also as a router; user packets are forwarded to sion range of a gateway. The gateways are con- 4 and from an Internet-connected gateway in nected to the Internet (the backhaul multihop fashion. The meshed topology pro- connection itself may also be wireless). The vides good reliability, market coverage, and network is dynamically self-organizing and self- 7 scalability, as well as low upfront investments. configuring, with the nodes in the network 5 Despite the recent startup surge in WMNs, automatically establishing and maintaining much research remains to be done before routes among themselves. Users can be station- Wireless mesh WMNs realize their full potential. This article ary or comparatively mobile [3]. The main dif- tackles the problem of determining the exact ference between a WMN and an ad hoc networks (WMNs) capacity of a WMN. The key concept we intro- network is perhaps the traffic pattern: in duce to enable this calculation is the bottleneck WMNs, practically all traffic is either to or are an alternative collision domain, defined as the geographical from a gateway, while in ad hoc networks the area of the network that bounds from above the traffic flows between arbitrary pairs of nodes.
    [Show full text]
  • MAC Protocols
    CN2 ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE The MAC layer Jean-Yves Le Boudec Fall 2007 1 Contents 1. MAC as Shared Medium 2. MAC as interconnection at small scale 3. MAC and Link layer 2 © Jean-Yves Le Boudec, EPFL CN2 1: Shared Medium Access Why did engineers invent the MAC layer ? Share a cable (Ethernet, Token Ring, 1980s) Use a wireless radio link (GSM, WiFi, WiMax, etc) What is the problem ? If several systems talk together, how can we decode ? Solution 1: joint decoding (decode everyone) used in CDMA cellular networks – complex Solution 2: mutual exclusion protocol Only one system can talk at a time 3 What is the goal of the MAC layer ? MAC = medium access control What does it do ? Implement a mutual exclusion protocol Without any central system – fully distributed How does it work ? there are many solutions, called: Token Passing, Aloha, CSMA, CMSA/CA, CSMA/CD, RMAC, etc We describe here the most basic one, called CSMA/CA, used on Ethernet cables Radio links (WiFi) is similar, with a few complications – see course on mobility for a very detailed explanation 4 © Jean-Yves Le Boudec, EPFL CN2 CSMA/CA derives from Aloha Aloha is the basis of all non-deterministic access methods. The Aloha protocol was originally developped for communications between islands (University of Hawaï) that use radio channels at low bit rates. The Aloha protocol requires acknowledgements and timers. Collisions occur when two packet transmissions overlap, and if a packet is lost, then source has to retransmit; the retransmission strategy is not specified here; many possibilities exist.
    [Show full text]
  • COMP/ELEC 429/556 Introduction to Computer Networks
    COMP/ELEC 429/556 Introduction to Computer Networks Broadcast network access control Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at cs.rice.edu Rice University 1 Let’s Begin with the Most Primitive Network T. S. Eugene Ng eugeneng at cs.rice.edu Rice University 2 500 meters Good Old 10BASE5 Ethernet (1976) T. S. Eugene Ng eugeneng at cs.rice.edu Rice University 3 200 meters Then Came 10BASE2 Ethernet (1980s) T. S. Eugene Ng eugeneng at cs.rice.edu Rice University 4 Twisted pair, 100 meters Then Came 10BASE-T Ethernet (1990) More: 100BASE-TX, 1000BASE-T At >= 10Gbit/s, broadcast no longer supported. T. S. Eugene Ng eugeneng at cs.rice.edu Rice University 5 Overview • Ethernet (< 10Gbps) and Wi-Fi are both “multi- access” technologies – Broadcast medium, shared by many nodes/hosts • Simultaneous transmissions will result in collisions • Media Access Control (MAC) protocol required – Rules on how to share medium T. S. Eugene Ng eugeneng at cs.rice.edu Rice University 6 Media Access Control Strategies • Channel partitioning – Divide channel into smaller “pieces” (e.g., time slots, frequencies) – Allocate a piece to each host For exclusive use – E.g. Time-Division-Multi-Access (TDMA) cellular network • Taking-turns – Tightly coordinate shared access to avoid collisions – E.g. Token ring network • Contention – Allow collisions – “Recover” From collisions – E.g. Ethernet, Wi-Fi T. S. Eugene Ng eugeneng at cs.rice.edu Rice University 7 Contention Media Access Control Goals • To share medium – If two hosts send at the same time, collision results in no packet being received – Thus, want to have only one host to send at a time • Want high network utilization • Want simple distributed algorithm • Take a walk through history – ALOHAnet 1971 – Ethernet 1973 – Wi-Fi 1997 T.
    [Show full text]
  • A Practical Approach for Achieving Scheduled Wifi in a Single Collision Domain ∗
    Look Who’s Talking: A Practical Approach for Achieving Scheduled WiFi in a Single Collision Domain ∗ Chao-Fang Shih, Yubing Jian, and Raghupathy Sivakumar Georgia Institute of Technology {cshih,yubing,siva}@ece.gatech.edu ABSTRACT a set of parameters including the maximum contention win- We ask the following question in this paper: Can the goals dow that are adaptively adjusted based on local information. of centralized WiFi scheduling be achieved using purely dis- While the approach is simple and scalable, the goal of DCF tributed operations? We present a solution called Look Who’s is to achieve coarse-level fairness and efficiency in the net- Talking (LWT) that allows for arbitrary schedules to be dis- work. Any finer-level goals are beyond the scope of DCF. tributed to nodes in a WiFi network. The nodes in the net- The IEEE 802.11 point coordination function (PCF) mode work then use purely local and distributed operations to achieve on the other hand relies on centralized scheduling by the the prescribed schedule. The scope of LWT in this paper access-point (AP) [1]. Theoretically, the scheduling algo- is restricted to a single collision domain (single or multiple rithm at the AP can be arbitrarily defined. The problems cells), but we discuss how LWT can be extended to multi- with PCF are two-fold: i) it uses a polling process that incurs ple collision domains. We use both experimental evaluations heavy overheads, especially in dynamic load conditions, and (using a WARP-based testbed) and simulation-based analy- ii) the standard does not specify how APs should coordinate sis (using ns3) to evaluate LWT.
    [Show full text]
  • Chapter 6 Medium Access Control Protocols and Local Area Networks
    Chapter 6 Medium Access Control Protocols and Local Area Networks Part I: Medium Access Control Part II: Local Area Networks Chapter Overview l Broadcast Networks l Medium Access Control l All information sent to all l To coordinate access to users shared medium l No routing l Data link layer since direct l Shared media transfer of frames l Radio l Local Area Networks l Cellular telephony l High-speed, low-cost l Wireless LANs communications between co-located computers l Copper & Optical l Typically based on l Ethernet LANs broadcast networks l Cable Modem Access l Simple & cheap l Limited number of users Chapter 6 Medium Access Control Protocols and Local Area Networks Part I: Medium Access Control Multiple Access Communications Random Access Scheduling Channelization Delay Performance Chapter 6 Medium Access Control Protocols and Local Area Networks Part II: Local Area Networks Overview of LANs Ethernet Token Ring and FDDI 802.11 Wireless LAN LAN Bridges Chapter 6 Medium Access Control Protocols and Local Area Networks Multiple Access Communications Multiple Access Communications l Shared media basis for broadcast networks l Inexpensive: radio over air; copper or coaxial cable l M users communicate by broadcasting into medium l Key issue: How to share the medium? 3 2 4 1 Shared multiple access medium M 5 … Approaches to Media Sharing Medium sharing techniques Static Dynamic medium channelization access control l Partition medium Scheduling Random access l Dedicated allocation to users l Polling: take turns l Loose l Satellite l Request
    [Show full text]
  • A Novel Channel Access Scheme for Full-Duplex Wireless Networks Based on Contention in Time and Frequency Domains
    1 RCFD: A Novel Channel Access Scheme for Full-Duplex Wireless Networks Based on Contention in Time and Frequency Domains Michele Luvisotto, Student Member, IEEE, Alireza Sadeghi Student Member, IEEE, Farshad Lahouti Senior Member, IEEE, Stefano Vitturi, Senior Member, IEEE, Michele Zorzi, Fellow, IEEE Abstract—In the last years, the advancements in signal processing and integrated circuits technology allowed several research groups to develop working prototypes of in–band full–duplex wireless systems. The introduction of such a revolutionary concept is promising in terms of increasing network performance, but at the same time poses several new challenges, especially at the MAC layer. Consequently, innovative channel access strategies are needed to exploit the opportunities provided by full–duplex while dealing with the increased complexity derived from its adoption. In this direction, this paper proposes RTS/CTS in the Frequency Domain (RCFD), a MAC layer scheme for full–duplex ad hoc wireless networks, based on the idea of time–frequency channel contention. According to this approach, different OFDM subcarriers are used to coordinate how nodes access the shared medium. The proposed scheme leads to efficient transmission scheduling with the result of avoiding collisions and exploiting full–duplex opportunities. The considerable performance improvements with respect to standard and state–of–the–art MAC protocols for wireless networks are highlighted through both theoretical analysis and network simulations. Index Terms—Full–duplex wireless, time–frequency channel access, orthogonal frequency–division multiplexing (OFDM), medium access control (MAC), IEEE 802.11 F 1 Introduction Innovation in Medium Access Control (MAC) plays a cru- of a reduction in the achievable throughput.
    [Show full text]