Impact of Interference on Multi-hop Wireless Network Performance

Slides:



Advertisements
Similar presentations
Impact of Interference on Multi-hop Wireless Network Performance
Advertisements

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.
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Wireless Network Capacity
The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
The Capacity of Wireless Networks
Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs Jianping Li Department of Mathematics Yunnan University Jointed by M.X. Chen.
ECE 667 Synthesis and Verification of Digital Circuits
Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3f: Medium Access Control Protocols.
Introduction to Algorithms
Interconnect throughput modeling. Important network performance metrics Throughput – Point to point (link bandwidth + end host software overheads) – Aggregate.
End-to-End Fair Bandwidth Allocation in Multi-hop Wireless Ad Hoc Networks Baochun Li Department of Electrical and Computer Engineering University of Toronto.
Price-based Resource Allocation in Wireless Ad Hoc Networks Yuan Xue, Baochun Li and Klara Nahrstedt University of Illinois at Urbana-Champaign University.
Predictable Performance Optimization for Wireless Networks Lili Qiu University of Texas at Austin Joint work with Yi Li, Yin Zhang,
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
O ptimal routingpower allocation full-duplex o ptimal routing and power allocation for wireless networks with imperfect full-duplex nodes David Ramírez.
Interference Considerations for QoS in MANETs Rajarshi Gupta, John Musacchio, Jean Walrand {guptar, musacchj, University of California,
1 Estimation of Link Interference in Static Multi-hop Wireless Networks Jitendra Padhye, Sharad Agarwal, Venkat Padmanabhan, Lili Qiu, Ananth Rao, Brian.
Distributed Algorithms for Secure Multipath Routing
The Capacity of Wireless Ad Hoc Networks
Placement of Integration Points in Multi-hop Community Networks Ranveer Chandra (Cornell University) Lili Qiu, Kamal Jain and Mohammad Mahdian (Microsoft.
ASWP – Ad-hoc Routing with Interference Consideration June 28, 2005.
Achieving End-to-End Fairness in Wireless Networks Ananth Rao Ion Stoica OASIS Retreat, Jul 2005.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
Quality of Service for Flows in Ad-Hoc Networks SmartNets Research Group Dept of EECS, UC Berkeley NMS PI Meeting, Nov 2004.
1 TDMA Scheduling in Competitive Wireless Networks Mario CagaljHai Zhan EPFL - I&C - LCA February 9, 2005.
Smart Networks Project University of California, Berkeley DARPA NMS PI Meeting Miami, Jan 21-23, 2004.
S. Suri, M, Waldvogel, P. Warkhede CS University of Washington Profile-Based Routing: A New Framework for MPLS Traffic Engineering.
Interference Minimization and Uplink Relaying For a 3G/WLAN Network Ju Wang Virginia Commonwealth University May, 2005.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Capacity Scaling with Multiple Radios and Multiple Channels in Wireless Mesh Networks Oguz GOKER.
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
Rensselaer Polytechnic Institute Rajagopal Iyengar Combinatorial Approaches to QoS Scheduling in Multichannel Wireless Systems Rajagopal Iyengar Rensselaer.
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
Some Networking Aspects of Multiple Access Muriel Medard EECS MIT.
On the Topology of Wireless Sensor Networks Sen Yang, Xinbing Wang, Luoyi Fu Department of Electronic Engineering, Shanghai Jiao Tong University, China.
On Selfish Routing In Internet-like Environments Lili Qiu Microsoft Research Feb. 13, 2004 Johns Hopkins University.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.
1 Measuring and Modeling the Impact of Wireless Interference Lili Qiu UT Austin Rice University Nov. 21, 2005.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
1 Chapter 6 Reformulation-Linearization Technique and Applications.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
authored by: Shigang Chen, Yuguang Fang and Ye Xia
ECE 720T5 Fall 2012 Cyber-Physical Systems
Presented by Tae-Seok Kim
Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks
Group Multicast Capacity in Large Scale Wireless Networks
Abdul Kader Kabbani (Stanford University)
Resource Allocation in Non-fading and Fading Multiple Access Channel
CS223 Advanced Data Structures and Algorithms
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
INFOCOM 2013 – Torino, Italy Content-centric wireless networks with limited buffers: when mobility hurts Giusi Alfano, Politecnico di Torino, Italy Michele.
Robustness of wireless ad hoc network topologies
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
Distributed Channel Assignment in Multi-Radio Mesh Networks
Robustness of wireless ad hoc network topologies
Capacity of Ad Hoc Networks
Javad Ghaderi, Tianxiong Ji and R. Srikant
Pradeep Kyasanur Nitin H. Vaidya Presented by Chen, Chun-cheng
A Better Approximation for Minimum Total Routing Path Clustering Problem in 2-D Underwater Sensor Networks Wei Wang, Donghyun Kim, and Weili Wu, A Better.
Power Efficient Communication ----Joint Routing, Scheduling and Power Control Design Presenter: Rui Cao.
A Topology Control Approach for Utilizing Multiple Channels in Multi-Radio Wireless Mesh Networks (broadnet2005) Mahesh K. Marina, Samir R. Das 2006/9/14.
How MAC interacts with Capacity of Ad-hoc Networks – Interference problem Capacity of Wireless Networks – Part Page 1.
Information Sciences and Systems Lab
Presentation transcript:

Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond

Motivation There has been a lot of research on capacity of multi-hop wireless networks in past few years. Inference is one of the main limiting factors Most of it talks about asymptotic, pessimistic bounds on performance. Gupta and Kumar 2000: O(1/sqrt(N)) We present a framework to answer questions about capacity of specific topologies with specific traffic patterns

Community Networking Scenario 4 houses talk to the central ITAP. What is the maximum possible throughput? Asymptotic analysis is not useful in this case

Sample Results Using Our Framework Scenario Aggregate Throughput Baseline 0.5 Double range Two ITAPs 1 Two Radios Houses talk to immediate neighbors, all links are capacity 1, 802.11-like MAC, Multipath routing

Overview of Our Framework Model the problem as a standard network flow problem Described as a linear program Represent interference among wireless links using a conflict graph Derive constraints on utilization of wireless links using cliques in the conflict graph Augment the linear program to obtain upper bound on optimal throughput Derive constraints on utilization of wireless links using independent sets in the conflict graph Augment the linear program to obtain lower bound on optimal throughput Iterate over Steps 3 and 4 to find progressively tighter bounds on optimal throughput

Assumptions No mobility Fluid model of data transmission Data transmissions can be finely scheduled by an omniscient central entity

Overview of Our Framework Model the problem as a standard network flow problem Described as a linear program Represent interference among wireless links using a conflict graph Derive constraints on utilization of wireless links using cliques in the conflict graph Augment the linear program to obtain upper bound on optimal throughput Derive constraints on utilization of wireless links using independent sets in the conflict graph Augment the linear program to obtain lower bound on optimal throughput Iterate over Steps 3 and 4 to find progressively tighter bounds on optimal throughput

Step 1: Network Flow Model Create a connectivity graph Each vertex represents a wireless node Draw a directed edge from vertex A to vertex B if B is within range of A Write a linear program that solves the basic MAXFLOW problem on this connectivity graph Several generalizations possible Discussed later in the talk.

Example: Network Flow Model A (Sender) C (Receiver) B A B C Connectivity Graph Link capacity = 1 2 1 4 3 Linear Program: Maximize Flow out of A Subject to: Flow on any link can not exceed 1 At node B, Flow in == Flow out. Answer: 1 (Link 1, Link 2)

Overview of Our Framework Model the problem as a standard network flow problem Described as a linear program Represent interference among wireless links using a conflict graph Derive constraints on utilization of wireless links using cliques in the conflict graph Augment the linear program to obtain upper bound on optimal throughput Derive constraints on utilization of wireless links using independent sets in the conflict graph Augment the linear program to obtain lower bound on optimal throughput Iterate over Steps 3 and 4 to find progressively tighter bounds on optimal throughput

Step 2: Model Interference using Conflict Graph A conflict graph that shows which wireless links interfere with each other Each edge in the connectivity graph represented by a vertex Draw an edge between two vertices if the links interfere with each other Several generalizations possible Discussed later in the talk.

Example: Conflict Graph Connectivity Graph 1 2 A B C 4 3 Conflict Graph 1 2 3 4

Versatility of Conflict Graphs

Overview of Our Framework Model the problem as a standard network flow problem Described as a linear program Represent interference among wireless links using a conflict graph Derive constraints on utilization of wireless links using cliques in the conflict graph Augment the linear program to obtain upper bound on optimal throughput Derive constraints on utilization of wireless links using independent sets in the conflict graph Augment the linear program to obtain lower bound on optimal throughput Iterate over Steps 3 and 4 to find progressively tighter bounds on optimal throughput

Step 3: Clique Constraints Consider Maximal Cliques in the conflict graph A maximal clique is a clique to which we can not add any more vertices At most one of the links in a clique can be active at any given instant Sum of utilization of links belonging to a clique is <= 1 MAXFLOW LP can be augmented with these clique constraints to get a better upper bound

Example: Clique Constraints 1 2 1 2 3 4 A B C 4 3 Link capacity = 1 Clique = {1, 2, 3, 4} Linear Program: Maximize Flow out of A Subject to: Flow on any link can not exceed 1 * link utilization Link utilization can not exceed 100% Sum of utilizations of links 1, 2, 3 and 4 can not exceed 100% At node B, Flow in == Flow out. Answer = 0.5 (Link1, Link 2)

Properties of Clique Constraints Finding all cliques can take exponential time Moreover, finding all cliques does not guarantee optimal solution (will discuss later in talk) The upper bound is monotonically non-increasing as we find and add new cliques As we add each clique, the link utilizations are constrained further More computing time can provide better solution

Overview of Our Framework Model the problem as a standard network flow problem Described as a linear program Represent interference among wireless links using a conflict graph Derive constraints on utilization of wireless links using cliques in the conflict graph Augment the linear program to obtain upper bound on optimal throughput Derive constraints on utilization of wireless links using independent sets in the conflict graph Augment the linear program to obtain lower bound on optimal throughput Iterate over Steps 3 and 4 to find progressively tighter bounds on optimal throughput

Step 4:Independent Set Constraints Consider Maximal Independent sets in the conflict graph All links belonging to an independent set can be active at the same time. No two independent sets are active at the same time. MAXFLOW LP can be augmented with constraints derived from independent sets to get a lower bound

Example: Independent Set Constraints 1 2 1 2 A B C 3 4 4 3 Link capacity = 1 Independent sets: {1}, {2}, {3}, {4} Linear Program: Maximize Flow out of A Subject to: Flow on any link can not exceed 1 * link utilization Sum of utilizations of independent sets can not exceed 100% Utilization of a link can not exceed the sum of utilization of independent sets it belongs to. At node B, Flow in == Flow out. Answer = 0.5 (Link1, Link 2)

Properties of Independent Set Constraints Lower bound is always feasible LP also outputs a transmission schedule Finding all independent sets can take exponential time If we do find all independent sets, the resulting lower bound is guaranteed to be optimal Lower bound is monotonically non-decreasing as we find and add more independent sets More computing time provides better answers If upper and lower bounds converge, optimality is guaranteed

Putting It All Together Houses talk to immediate neighbors, all links are capacity 1, 802.11-like MAC, Multipath routing

Advantages of Our Approach “Real” numbers instead of asymptotic bounds This is the optimal bound, unlikely to be achieved in practice for a variety of reasons The model permits several generalizations: Multiple radios/channels Directional antennas Single path or Multi-path routing Different ranges, data rates Different wireless interference models Different topologies Senders with limited (but constant) demand Optimize for fairness or revenue instead of throughput Useful for “what if” analysis

Some Generalizations Multiple radios on orthogonal channels Represent with multiple, non-interfering links between nodes Directional antennas Include appropriate edges in the connectivity graph Conflict graph can accommodate any interference pattern Multiple senders and/or receivers Write LP to solve Multi-commodity flow problem Non-greedy sender Create a virtual sender Include a “virtual link” of limited capacity from the virtual sender to the real sender in the connectivity graph This link does not conflict with any other links LP maximizes flow out of virtual sender

Some Generalizations: Physical model of interference Directed conflict graph Edge between every pair of vertices Vertices in conflict graphs are wireless links. Weight on edge X->Y represents noise generated at the source of Y when X is active Non-schedulable sets instead of cliques Schedulable sets instead of independent sets

Limitations Linear programs can take a long time to solve Especially when single path routing is used There is no guarantee that optimal solution will be found in less than exponential time Upper bound might not converge to optimal even if we find all cliques Graphs with odd-holes and anti-holes

Related Work Gupta and Kumar, 2000. Li et. al., 2001 Asymptotic bound of 1/sqrt(N) Li et. al., 2001 Impact of other traffic patterns, esp. power-law patterns Grossglauser and Tse, 2001 Impact of mobility Gastpar and Vetterli, 2002 Impact of network coding and arbitrary node co-operation

Related Work (cont) Nandagopal et. al., 2000 Yang and Vaidya, 2000 Flow contention graphs to study MAC fairness Yang and Vaidya, 2000 Flow-based conflict graph used to study unfairness introduced by interference Kodialam and Nandagopal, 2003 (previous presentation) Same aim as ours! Limited model of interference (node may not send or receive simultaneously) Polynomial time algorithm to approximate throughput within 67% of optimal

Conclusion We presented a flexible framework to answer questions about capacity of specific topologies with specific traffic patterns The framework can accommodate sophisticated models of connectivity and wireless interference The framework computes upper and lower bounds on optimal throughput Finding optimal throughput can take exponential amount of time.

Future Work Better convergence of upper and lower bounds Interference-aware routing Can we generate/maintain the conflict graph, or its approximation in a distributed manner? If yes, can we design a routing algorithm that attempts to minimize interference? Initial idea: minimize number of links interfered with

Salient Features Out framework can accommodate sophisticated connectivity and interference models The problem of finding optimal throughput is NP complete, so we compute upper and lower bounds on optimal throughput The previous example was simple enough to find optimal throughputs (i.e. upper and lower bounds were equal)

Sample Results Using Our Framework Scenario Aggregate Throughput Baseline 0.5 Double range Two ITAPs 1 Two Radios Houses talk to immediate neighbors, all links are capacity 1, 802.11-like MAC, Multipath routing