Practical Conflict Graphs for Dynamic Spectrum Distribution Xia Zhou, Zengbin Zhang, Gang Wang, Xiaoxiao Yu *, Ben Y. Zhao and Haitao Zheng Department.

Slides:



Advertisements
Similar presentations
1 Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms) Robin Pomplun.
Advertisements

Pricing for Utility-driven Resource Management and Allocation in Clusters Chee Shin Yeo and Rajkumar Buyya Grid Computing and Distributed Systems (GRIDS)
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Chapter 1 The Study of Body Function Image PowerPoint
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 11 Information.
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
Reconsidering Reliable Transport Protocol in Heterogeneous Wireless Networks Wang Yang Tsinghua University 1.
UNITED NATIONS Shipment Details Report – January 2006.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
1 Multi-Channel Wireless Networks: Capacity and Protocols Nitin H. Vaidya University of Illinois at Urbana-Champaign Joint work with Pradeep Kyasanur Chandrakanth.
and 6.855J Spanning Tree Algorithms. 2 The Greedy Algorithm in Action
Wireless Networks Should Spread Spectrum On Demand Ramki Gummadi (MIT) Joint work with Hari Balakrishnan.
1 The Case for Heterogeneous Wireless MACs Chun-cheng Chen Haiyun Luo Dept. of Computer Science, UIUC.
Interference Avoidance and Control Ramki Gummadi (MIT) Joint work with Rabin Patra (UCB) Hari Balakrishnan (MIT) Eric Brewer (UCB)
OFDMA with Optimized Transmit and Receive Waveforms for Better Interference Immune Communications in Next Generation Radio Mobile Communication Systems.
Summary of Convergence Tests for Series and Solved Problems
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Year 6 mental test 5 second questions
Year 6 mental test 10 second questions
1 Discreteness and the Welfare Cost of Labour Supply Tax Distortions Keshab Bhattarai University of Hull and John Whalley Universities of Warwick and Western.
Chapter 1 Introduction Copyright © Operating Systems, by Dhananjay Dhamdhere Copyright © Introduction Abstract Views of an Operating System.
Designing Multi-User MIMO for Energy Efficiency
Solve Multi-step Equations
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
MIMO Broadcast Scheduling with Limited Feedback Student: ( ) Director: 2008/10/2 1 Communication Signal Processing Lab.
Randomized Algorithms Randomized Algorithms CS648 1.
ABC Technology Project
1 Generating Network Topologies That Obey Power LawsPalmer/Steffan Carnegie Mellon Generating Network Topologies That Obey Power Laws Christopher R. Palmer.
Chapter 7 Transmission Media
Hash Tables.
A Quest for an Internet Video Quality-of-Experience Metric
1 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. On the Capacity of Wireless CSMA/CA Multihop Networks Rafael Laufer and Leonard Kleinrock Bell.
Copyright © Chang Gung University. Permission required for reproduction or display. On Femto Deployment Architecture and Macrocell Offloading Benefits.
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
IP Multicast Information management 2 Groep T Leuven – Information department 2/14 Agenda •Why IP Multicast ? •Multicast fundamentals •Intradomain.
VOORBLAD.
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
1 Developing a Predictive Model for Internet Video Quality-of-Experience Athula Balachandran, Vyas Sekar, Aditya Akella, Srinivasan Seshan, Ion Stoica,
BIOLOGY AUGUST 2013 OPENING ASSIGNMENTS. AUGUST 7, 2013  Question goes here!
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
© 2012 National Heart Foundation of Australia. Slide 2.
Universität Kaiserslautern Institut für Technologie und Arbeit / Institute of Technology and Work 1 Q16) Willingness to participate in a follow-up case.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
KAIST Computer Architecture Lab. The Effect of Multi-core on HPC Applications in Virtualized Systems Jaeung Han¹, Jeongseob Ahn¹, Changdae Kim¹, Youngjin.
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
25 seconds left…...
Januar MDMDFSSMDMDFSSS
Analyzing Genes and Genomes
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Intracellular Compartments and Transport
PSSA Preparation.
© 2007 Levente Buttyán and Jean-Pierre Hubaux Security and Cooperation in Wireless Networks Chapter 11: Wireless operators in.
Essential Cell Biology
TRUST: A General Framework for Truthful Double Spectrum Auctions Xia Zhou Heather Zheng (University of California, Santa Barbara) Presenter: Emil Huang.
I Am the Antenna Accurate Outdoor AP Location Using Smartphones Zengbin Zhang†, Xia Zhou†, Weile Zhang†§, Yuanyang Zhang†, Gang Wang†, Ben Y. Zhao† and.
Presentation transcript:

Practical Conflict Graphs for Dynamic Spectrum Distribution Xia Zhou, Zengbin Zhang, Gang Wang, Xiaoxiao Yu *, Ben Y. Zhao and Haitao Zheng Department of Computer Science, UC Santa Barbara * Tsinghua University, China

Inefficient Spectrum Distribution Explosive wireless traffic growth The well-know problem: artificial spectrum shortage –Spectrum is assigned statically –Hard to get new spectrum –Current spectrum utilization is low 2 Need efficient spectrum distribution

Dynamic Spectrum Distribution Key requirements – Reuse spectrum in space whenever possible – Exclusive spectrum access for allocated users 3 Spectru m ? ? ? B C A Must characterize interference conditions among users

Conflict Graphs Binary representation of pairwise interference conditions 4 C B A B C A Coverage area: all receiver locations

Benefits of Conflict Graphs Simple abstraction –Reduce spectrum allocation to graph coloring problems Leverage numerous graph algorithms –Many efficient allocation algorithms Widely used 5

Key Issues on Conflict Graphs Hard to get it accurate –Wireless propagation is complex –Exhaustive measurements are not scalable –Solutions w/o measurements give errors, poor performance Fail to capture accumulative interference –A fundamental graph limitation –Interference cumulate from multiple transmissions 6 C A B Are conflict graphs useful in practice?

Overview Goal: understand practical usability of conflict graphs Contributions –A practical method of building conflict graphs –Measurement validation of graph accuracy –Graph augmentation to address accumulative interference 7

Outline Introduction Measurement-Calibrated Conflict Graphs Validation Results Graph Augmentation 8

Building Practical Conflict Graphs Our approach: measurement-calibrated conflict graphs 9 Measurement overhead Accurac y Exhaustive measurements Non-measurement methods Our Goal

Measurement-Calibrated Conflict Graphs 10 Calibrated Propagation Model Predicted Signal Maps Estimated Conflict Graph Sampled Signal Measurements Exhaustive Signal Measurements Measured Conflict Graph Monitor ?

Evaluating Conflict Graphs Compare estimated and measured conflict graphs 11 Exhaustive Signal Measurements Measured Conflict Graph Spectrum Allocation Results Spectrum Allocation Benchmark s Graph Similarity Signal Prediction Accuracy Sampled Signal Measurements Calibrated Propagation Model Predicted Signal Maps Estimated Conflict Graph Spectrum Allocation Results Monitor

Measurement Datasets Exhaustive signal measurements at outdoor WiFi networks Our own dataset collected at GoogleWifi –Capture weak signals using radio with higher sensitivity 12 DatasetLocation Area (km 2 ) #of APs Avg # of APs heard per location # of measured locations MetroFi Portland, OR ,991 TFA Network Houston, TX ,855 GoogleWiF i Mountain View, CA ,447

Outline Introduction Measurement-Calibrated Conflict Graphs Validation Results Graph Augmentation 13

Evaluating Conflict Graphs 14 Exhaustive Signal Measurements Measured Conflict Graph Spectrum Allocation Results Spectrum Allocation Benchmark s Graph Similarity Signal Predictio n Accuracy Predicted Signal Maps Estimated Conflict Graph Spectrum Allocation Results

Signal Prediction Results Predict signal values using a sample of measurements –Models: Uniform, Two-Ray, Terrain, and Street –Street model achieves the best accuracy Location-dependent pattern in prediction errors 15 Overpredict RSS values at farther locations Underpredict RSS values at closer locations

Evaluating Conflict Graphs 16 Exhaustive Signal Measurements Measured Conflict Graph Spectrum Allocation Results Spectrum Allocation Benchmark s Graph Similarity Signal Predictio n Accuracy Predicted Signal Maps Estimated Conflict Graph Spectrum Allocation Results

Conflict Graph Accuracy Extra edge: in estimated graph but not measured graph Missing edge: in measured graph but not estimated graph 17 Correct edge Extra edge Missing edge Extra edges dominate!

Why Do Extra Edges Dominate? Signal prediction errors are location-dependent –An edge exists if Signal-to-Interference-and-Noise Ratios (SINRs) < a threshold 18 SINR = Interferenc e + Noise Signal Under-estimate receivers’ SINR values  more conflict edges

Evaluating Conflict Graphs 19 Exhaustive Signal Measurements Measured Conflict Graph Spectrum Allocation Results Spectrum Allocation Benchmark s Graph Similarity Signal Predictio n Accuracy Predicted Signal Maps Estimated Conflict Graph Spectrum Allocation Results Utilization Reliability

Spectrum Allocation Benchmarks Estimated graphs are conservative Estimated graphs has lower spectrum utilization –Utilization: spectrum reuse Estimated graph has higher reliability –Reliability: % of users receive reliable spectrum use –Still, users suffer accumulative interference 20 Need to address accumulative interference!

Graph Augmentation Key idea: add edges selectively to improve reliability Our solution: greedy augmentation –Integrate spectrum allocation to identify edges to add –More details in the paper Result: 96%+ users receive reliable spectrum use 21

Our Conclusion: 22 Conflict Graphs Work!

BACKUP 23

Collecting GoogleWifi Dataset 3-day wardriving 3 co-located laptops, each monitoring one channel Locations have 5m separation on average 24

Impact of Sampling Rate 34 monitors per km 2 achieve the best tradeoff for the urban street environment Determine sampling rate –Depends on AP density, propagation environment, and monitor’s sensitivity 25

Signal Prediction Errors Errors are noticeable, Gaussian distribution –Align with prior studies 26

Building Conflict Graphs Coverage-based conflict graph –Node: a spectrum user with its coverage region –Edge: e AB exists if when A and B use the same channel, A or B fails to maintain γ of its receptions successful 27 Interference I Signal S Reception succeeds if SINR is above a threshold A B

Spectrum Allocation Benchmarks Allocation algorithm –Multi-channel allocation: maximize proportional fairness Metric #1: spectrum efficiency –Average fraction of spectrum received per user 28 Extraneous edges lead to moderate efficiency loss (< 30%)

Spectrum Allocation Benchmarks Metric #2: spectrum reliability –Fraction of users with exclusive spectrum usage –Consider interference from all the others on the same channel 29 Extraneous edges reduce the impact of accumulative interference Need to address accumulative interference!

Graph Augmentation Results Augmentation improves graph accuracy –Some edges added in measured graph are already in estimated graph 30

Efficacy of Graph Augmentation Address accumulative interference –Eliminate reliability violations for measured graphs –96+% reliability for estimated graphs –Add minimal edges, leading to efficiency loss < 15% for estimated graph 31