Wireless in the Real World. Principles

Similar documents
Partial overlapping channels are not damaging

Wireless Intro : Computer Networking. Wireless Challenges. Overview

Chapter 1 Introduction

CS434/534: Topics in Networked (Networking) Systems

Cognitive Wireless Network : Computer Networking. Overview. Cognitive Wireless Networks

Outline / Wireless Networks and Applications Lecture 3: Physical Layer Signals, Modulation, Multiplexing. Cartoon View 1 A Wave of Energy

Simple Algorithm in (older) Selection Diversity. Receiver Diversity Can we Do Better? Receiver Diversity Optimization.

Wireless Networked Systems

INTRODUCTION TO WIRELESS SENSOR NETWORKS. CHAPTER 3: RADIO COMMUNICATIONS Anna Förster

Mathematical Problems in Networked Embedded Systems

Automatic power/channel management in Wi-Fi networks

Living with Interference in Unmanaged Wireless. Environments. Intel Research & University of Washington

Wireless ad hoc networks. Acknowledgement: Slides borrowed from Richard Y. Yale

SourceSync. Exploiting Sender Diversity

Fine-grained Channel Access in Wireless LAN. Cristian Petrescu Arvind Jadoo UCL Computer Science 20 th March 2012

M2M massive wireless access: challenges, research issues, and ways forward

Cellular systems 02/10/06

Background: Cellular network technology

Understanding and Mitigating the Impact of Interference on Networks. By Gulzar Ahmad Sanjay Bhatt Morteza Kheirkhah Adam Kral Jannik Sundø

Cooperation in Random Access Wireless Networks

Information Theory at the Extremes

Multiple Receiver Strategies for Minimizing Packet Loss in Dense Sensor Networks

Page 1. Outline : Wireless Networks Lecture 6: Final Physical Layer. Direct Sequence Spread Spectrum (DSSS) Spread Spectrum

Virtual MISO Triggers in Wi-Fi-like Networks

By Ryan Winfield Woodings and Mark Gerrior, Cypress Semiconductor

ECE 476/ECE 501C/CS Wireless Communication Systems Winter Lecture 3: Cellular Fundamentals

T. Yoo, E. Setton, X. Zhu, Pr. Goldsmith and Pr. Girod Department of Electrical Engineering Stanford University

Multiple Access System

CS649 Sensor Networks IP Lecture 9: Synchronization

Chutima Prommak and Boriboon Deeka. Proceedings of the World Congress on Engineering 2007 Vol II WCE 2007, July 2-4, 2007, London, U.K.

Optimal Power Control Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks

Adapting to the Wireless Channel: SampleRate

Cross-layer Network Design for Quality of Services in Wireless Local Area Networks: Optimal Access Point Placement and Frequency Channel Assignment

Announcement : Wireless Networks Lecture 3: Physical Layer. A Reminder about Prerequisites. Outline. Page 1

Final Exam (ECE 408/508 Digital Communications) (05/05/10, Wed, 6 8:30PM)

CS 457 Lecture 16 Routing Continued. Spring 2010

Announcements : Wireless Networks Lecture 3: Physical Layer. Bird s Eye View. Outline. Page 1

Interference management Within 3GPP LTE advanced

Internet of Things Cognitive Radio Technologies

Chapter 4: Directional and Smart Antennas. Prof. Yuh-Shyan Chen Department of CSIE National Taipei University

BASIC CONCEPTS OF HSPA

Communications Theory and Engineering

Design of an energy efficient Medium Access Control protocol for wireless sensor networks. Thesis Committee

Multiple Access Schemes

SEN366 (SEN374) (Introduction to) Computer Networks

Politecnico di Milano Facoltà di Ingegneria dell Informazione. 3 Basic concepts. Wireless Networks Prof. Antonio Capone

AS-MAC: An Asynchronous Scheduled MAC Protocol for Wireless Sensor Networks

WirelessHART Modeling and Performance Evaluation

MIMO III: Channel Capacity, Interference Alignment

Lecture 21: Links and Signaling

All Beamforming Solutions Are Not Equal

Channel selection for IEEE based wireless LANs using 2.4 GHz band

Simplified Reference Model

Mesh Networks. unprecedented coverage, throughput, flexibility and cost efficiency. Decentralized, self-forming, self-healing networks that achieve

A Practical Approach to Bitrate Control in Wireless Mesh Networks using Wireless Network Utility Maximization

Reti di Telecomunicazione. Channels and Multiplexing

Part I: Introduction to Wireless Sensor Networks. Alessio Di

Wireless Communication

Mobile & Wireless Networking. Lecture 4: Cellular Concepts & Dealing with Mobility. [Reader, Part 3 & 4]

Randomized Channel Access Reduces Network Local Delay

CS 438 Communication Networks Spring 2014 Homework 2 Due Date: February 19

International Journal of Scientific & Engineering Research, Volume 7, Issue 2, February ISSN

Mobile Communication Systems. Part 7- Multiplexing

802.11n. Suebpong Nitichai

Wireless LAN Applications LAN Extension Cross building interconnection Nomadic access Ad hoc networks Single Cell Wireless LAN

Lecture 5 Transmission

Opportunistic Communications under Energy & Delay Constraints

SELF OPTIMIZING NETWORKS

Lecture 5 Transmission. Physical and Datalink Layers: 3 Lectures

Media Independent MAC Enhancements for RF Management of Wireless 802 Networks

5G: New Air Interface and Radio Access Virtualization. HUAWEI WHITE PAPER April 2015

Probabilistic Link Properties. Octav Chipara

Wireless Network Pricing Chapter 2: Wireless Communications Basics

4G Mobile Broadband LTE

Data and Computer Communications. Tenth Edition by William Stallings

EEG473 Mobile Communications Module 2 : Week # (6) The Cellular Concept System Design Fundamentals

Reliable Videos Broadcast with Network Coding and Coordinated Multiple Access Points

Lecture 8: Media Access Control

Chapter 2 Overview. Duplexing, Multiple Access - 1 -

Vulnerability modelling of ad hoc routing protocols a comparison of OLSR and DSR

Energy-Efficient Communication Protocol for Wireless Microsensor Networks

ENERGY EFFICIENT SENSOR NODE DESIGN IN WIRELESS SENSOR NETWORKS

Mesh Networks with Two-Radio Access Points

Wireless Networks. Why Wireless Networks? Wireless Local Area Network. Wireless Personal Area Network (WPAN)

CE693: Adv. Computer Networking

Energy-Efficient Data Management for Sensor Networks

THROUGHPUT AND CHANNEL CAPACITY OF MULTI-HOP VIRTUAL CELLULAR NETWORK

Transport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks

Data Dissemination in Wireless Sensor Networks

Introduction to Wireless and Mobile Networking. Hung-Yu Wei g National Taiwan University

G.T. Hill.

GTBIT ECE Department Wireless Communication

Maximizing Spatial Reuse In Indoor Environments

Last Time. Transferring Information. Today (& Tomorrow (& Tmrw)) Application Layer Example Protocols ftp http Performance.

TIME- OPTIMAL CONVERGECAST IN SENSOR NETWORKS WITH MULTIPLE CHANNELS

Understanding Single Radio, Dual Radio and Multi-Radio Wireless Mesh Networks

Link Activation with Parallel Interference Cancellation in Multi-hop VANET

Performance of ALOHA and CSMA in Spatially Distributed Wireless Networks

Project = An Adventure : Wireless Networks. Lecture 4: More Physical Layer. What is an Antenna? Outline. Page 1

Data and Computer Communications

Transcription:

Wireless in the Real World Principles Make every transmission count E.g., reduce the # of collisions E.g., drop packets early, not late Control errors Fundamental problem in wless Maximize spatial reuse Allow concurrent sends in different places While not goofing up #1 and #2! 1

Problems Today: Deployments are chaotic Unplanned: Lots of people deploy APs More planned inside a campus, enterprise, etc. Less planned at Starbucks Unmanaged Many deployments are plug-and-go Becoming increasingly common as 802.11 becomes popular. Not just geeks! And it s hard in general. Making Transmissions Count See previous lecture! 2

Error Control Three techniques ARQ (just like in wired networks) FEC (also just like, but used more in wireless) And.. Rate control. Remember our Shannon s law discussion Reminder: Capacity = B x log(1 + S/N) Higher bitrates use encodings that are more sensitive to noise If too many errors, can fall back to a lower rate encoding that s more robust to noise. Often called rate adaptation General idea: Rate Adaptation Observe channel conditions like SNR (signalto-noise ratio), bit errors, packet errors Pick a transmission rate that will get best goodput There are channel conditions when reducing the bitrate can greatly increase throughput e.g., if a ½ decrease in bitrate gets you from 90% loss to 10% loss. 3

Simple rate adaptation scheme Watch packet error rate over window (K packets or T seconds) If loss rate > thresh high (or SNR <, etc) Reduce Tx rate If loss rate < thresh low Increase Tx rate Most devices support a discrete set of rates 802.11 1, 2, 5.5, 11, etc. Challenges in rate adaptation Channel conditions change over time Loss rates must be measured over a window SNR estimates from the hardware are coarse, and don t always predict loss rate May be some overhead (time, transient interruptions, etc.) to changing rates 4

Error control Most fast modulations already include some form of FEC Part of the difference between the rates is how much FEC is used. 802.11, etc. also include link-layer retransmissions Relate to end-to-end argument? Compare timescale involved Needed to make 802.11 link layer work within the general requirements of IP ( reasonably low loss) Spatial Reuse Three knobs we can tune: Scheduling: Who talks when (spatial div) A B C D E -- F.. A->B, C->D, E-F B->C, D->E Frequency assignment (frequency div) 802.11 has 11 channels in the US, but they re not completely independent (draw frequency overlap) Power assignment Many radios can Tx at multiple power levels 5

Cellular Reuse Transmissions decay over distance Spectrum can be reused in different areas Different LANs Decay is 1/R 2 in free space, 1/R 4 in some situations Frequency Allocation To have dense coverage Must have some overlap But this will interfere. (Even w/out interference if you want 100% coverage) Recv Interfere Answer: Channel allocation for nearby nodes Easy way: Cellular deployment. Offline, centralized graph coloring Hard way: Ad hoc, distributed, untrusting, 6

Ad hoc deployment Typically multiple hops between nodes Unplanned or semi-planned Typical applications: Roofnet Disaster recovery Military Even though most wireless deployments are cellular systems, they exhibit many of the same challenges of ad hoc (diagram) Power Control Goal: Transmit at minimum necessary power to reach receiver Minimizes interference with other nodes Paper: Can double or more capacity, if done right. 7

Detils of Power Control Hard to do per-packet with many NICs Some even might have to re-init (many ms) May have to balance power with rate Reasonable goal: lowest power for max rate But finding ths empirically is hard! Many {power, rate} combinations, and not always easy to predict how each will perform Alternate goal: lowest power for max needed rate But this interacts with other people because you use more channel time to send the same data. Uh-oh. Nice example of the difficulty of local vs. global optimization Power control summary More power: Higher received signal strength May enable faster rate (more S in S/N) May mean you occupy media for less time Interferes with more people Less power Interfere with fewer people Less power + less rate Fewer people but for a longer time 8

Scaling Ad Hoc Networks Aggregate impact of far-away nodes Each transmitter raises the noise level slightly, even if not enough on its own to degrade the signal enough (S/N ) The price of cooperation: In a multi-hop ad hoc network, how much time do you spend forwarding others traffic? Routing protocol scalability (Next lecture! :-) Aggregate Noise Assume that you can treat concurrent transmissions as noise Example: CDMA spread-spectrum networks do exactly this Nodes in a 2d space with constant density p Nodes talk to nearest node (multi-hop for far away) (This model applies to cooperation, too) (diagram) 9

contd Distance to neighbor ~ R 0 = 1/sqrt(p) Power level P, attenuation at distance r propto r -2 (free space), so signal strength propto r 2 Total nodes in annulus @ distance r, width dr from recv: 2 π r p dr Total interference:! " 0 2#rpdr 2 r Noise Aggregate noise is infinite! But the world isn t. Phew. If M nodes total, Rmax node distance is pi R^2 maxp = M Solving,integrate from 0 Rmax total signalto-noise falls off as 1/log M Not too bad 10

The Price of Cooperation In ad hoc, how much of each nodes capacity is used for others? Answer depends strongly on workload. If random senders with random receivers: Path from sender receiver is length N So every transmission consumes N 1 = of the network capacity N N Network has a total capacity of N transmits/time Aggregate network capacity of N nodes scales as sqrt(n) 1 Per-node capacity is N Locality Previous model assumed random-random communication Locality can help you E.g., geographically dispersed sinks to the Internet: Roofnet-style communication E.g., local computation and summary: sensor-network communication Example: Computing the avg, max, min temp Data or content -centric networking (caching, etc.) 11

Aside: Flipping Power On Its Head: Power Savings Which uses less power? Direct sensor -> base station Tx Total Tx power: distance^2 Sensor -> sensor -> sensor -> base station? Total Tx power: n * (distance/n) ^2 =~ d^2 / n Why? Radios are omnidirectional, but only one direction matters. Multi-hop approximates directionality. Power savings often makes up for multi-hop capacity These devices are *very* power constrained! Reality: Many systems don t use adaptive power control. This is active research, and fun stuff. Summary Make every transmission count MAC protocols from last time, mostly Control errors ARQ, FEC, and rate adaptation Maximize spatial reuse Scheduling (often via MAC), channel assignment, power adaptation Scaling through communication locality e.g., sensor net-style communication 12