Stony Brook Mesh Router: Architecting a Multi-Radio Multihop Wireless LAN Samir R. Das (Joint work with Vishnu Navda, Mahesh Marina and Anand Kashyap)

Slides:

Advertisements

Similar presentations

Architecture and Algorithms for an IEEE 802

Advertisements

Cross-layer Design in Wireless Mesh Networks Hu Wenjie Computer Network and Protocol Testing Laboratory, Dept. of Computer Science & Technology, Tsinghua.

1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.

How does a network identify computers and transmissions?

Wide Area Wi-Fi Sam Bhoot. Wide Area Wi-Fi  Definition: Wi-Fi (Wireless Fidelity) n. – popular term for high frequency wireless local area networks operating.

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.

Price-based Resource Allocation in Wireless Ad Hoc Networks Yuan Xue, Baochun Li and Klara Nahrstedt University of Illinois at Urbana-Champaign University.

Fault Tolerant Routing in Tri-Sector Wireless Cellular Mesh Networks Yasir Drabu and Hassan Peyravi Kent State University Kent, OH

Networking Research in Stony Brook University. Faculty and Labs Lab NameAcronym Experimental Computer Systems Lab ECSL Wireless Networking and Simulation.

Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005.

Routing and Scheduling in Wireless Grid Mesh Networks Abdullah-Al Mahmood Supervisor: Ehab Elmallah Graduate Students’ Workshop on Networks Research Department.

Wireless Mesh Networks 1. Architecture 2 Wireless Mesh Network A wireless mesh network (WMN) is a multi-hop wireless network that consists of mesh clients.

CS541 Advanced Networking 1 Wireless Mesh Networks Neil Tang 1/26/2009.

Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.

A Survey on Wireless Mesh Networks Sih-Han Chen 陳思翰 Department of Computer Science and Information Engineering National Taipei University of Technology.

Wide Area Networks School of Business Eastern Illinois University © Abdou Illia, Spring 2007 (Week 11, Thursday 3/22/2007)

CS541 Advanced Networking 1 Dynamic Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/10/2009.

ASWP – Ad-hoc Routing with Interference Consideration June 28, 2005.

SANS A Simple Ad hoc Network Simulator Nicolas Burri Roger Wattenhofer Yves Weber Aaron Zollinger.

Issues in ad-hoc networks Miguel Sanchez Nov-2000.

ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.

Design and Analysis of an MST-Based Topology Control Algorithm Ning Li and Jennifer Hou Department of Computer Science University of Illinois at Urbana-Champaign.

Topology Control, Interference, and Throughput for Wireless Mesh Networks presented by Qin LIU.

Wireless LAN Provides network connectivity over wireless media An Access Point (AP) is installed to act as Bridge between Wireless and Wired Network.

August 6, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of.

Mesh Network Technical Guide for the Mesh AP Topic 2 Installation Knowledge / Network Design Copyright © PLANET Technology.

1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

Jadavpur University Centre for Mobile Computing & Communication Implementation of Ad-Hoc Mesh Network Presentation by: Sudipto Das Rajesh Roy.

High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.

1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.

COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,

Capacity of Wireless Mesh Networks: Comparing Single- Radio, Dual-Radio, and Multi- Radio Networks By: Alan Applegate.

A Survey on Channel Assignment for Multi-Radio Meshed Networks

Fast Spectrum Allocation in Coordinated Dynamic Spectrum Access Based Cellular Networks Anand Prabhu Subramanian*, Himanshu Gupta*,

SwitchR: Reducing System Power Consumption in a Multi-Client Multi-Radio Environment Yuvraj Agarwal (University of California, San Diego) Trevor Pering,

Wave Relay System and General Project Details. Wave Relay System Provides seamless multi-hop connectivity Operates at layer 2 of networking stack Seamless.

Capacity Scaling with Multiple Radios and Multiple Channels in Wireless Mesh Networks Oguz GOKER.

Architecture and Algorithms for an IEEE based Multi-channel Wireless Mesh Network Ashish Raniwala, Tzi-cker Chiueh Stony Brook University Infocom2005.

City Univ of Hong Kong1 Minimal cost deployment of mesh networks with QoS requirements for indoor environment Xiaohua Jia Dept of Computer Science.

Clustering in Mobile Ad hoc Networks. Why Clustering? –Cluster-based control structures provides more efficient use of resources for large dynamic networks.

1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.

Addressing Deafness and Hidden Terminal Problem in Directional Antenna Based Wireless Multi-hop Networks Anand Prabhu Subramanian and Samir R. Das {anandps,

Multicast Algorithms for Multi- Channel Wireless Mesh Networks Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt Mutka Department of Computer Science and.

1 Next Few Classes Networking basics Protection & Security.

June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.

Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.

Advanced Communication Network Joint Throughput Optimization for Wireless Mesh Networks R 戴智斌 R 蔡永斌 Xiang-Yang.

Architectures and Algorithms for Future Wireless Local Area Networks  1 Chapter Architectures and Algorithms for Future Wireless Local Area.

Distributed Channel Assignment and Routing Multiradio Mutlichannel Multihop Wireless Networks Haitao Wu, Fan Yang, Kun Tan, Jie Chen, Qian Zhang, and Zhenshrng.

Rate-Based Channel Assignment Algorithm for Multi-Channel Multi- Rate Wireless Mesh Networks Sok-Hyong Kim and Young-Joo Suh Department of Computer Science.

FPOC: A Channel Assignment Strategy using Four Partially Overlapping Channels in Mid-scale Wireless Mesh Networks Broadband Mobile Wireless Networks Lab.

Wireless Mesh Networks Myungchul Kim

Sebastian Max Radio and Frequency Assignment in Multi-Radio Multi-Channel Wireless Mesh Networks Radio and Frequency Assignment in Multi-Radio Multi-Channel.

1 11 Distributed Channel Assignment in Multi-Radio Mesh Networks Bong-Jun Ko, Vishal Misra, Jitendra Padhye and Dan Rubenstein Columbia University.

Ασύρματες και Κινητές Επικοινωνίες Ενότητα # 12: Ασύρματα Δίκτυα Πλέγματος (Wireless Mesh Networks) Διδάσκων: Βασίλειος Σύρης Τμήμα: Πληροφορικής.

Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.

A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.

A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks Bahador Bakhshi and Siavash Khorsandi WCNC 2008.

-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.

COSC 6590 Fall Multi-channel, multi-radio wireless networks.

Architecture and Algorithms for an IEEE 802

Presented by Tae-Seok Kim

Wireless Modes.

Multi-channel, multi-radio wireless networks

High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks

Distributed Channel Assignment in Multi-Radio Mesh Networks

Javad Ghaderi, Tianxiong Ji and R. Srikant

Multi-channel, multi-radio

Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh

A Topology Control Approach for Utilizing Multiple Channels in Multi-Radio Wireless Mesh Networks (broadnet2005) Mahesh K. Marina, Samir R. Das 2006/9/14.

Presentation transcript:

Stony Brook Mesh Router: Architecting a Multi-Radio Multihop Wireless LAN Samir R. Das (Joint work with Vishnu Navda, Mahesh Marina and Anand Kashyap) Computer Science Department SUNY at Stony Brook samir@cs.sunysb.edu http://www.cs.sunysb.edu/~samir

A New Opportunity Has Arrived! Linksys WRT54G access point/router runs Linux. User programmable. Decent processor and memory. Costs $70. Several router platforms provide multiple PC/mini-PCI/PCI card interfaces. Decent processor and memory. Can run FreeBSD/Linux. Costs $250-$400. What a systems researcher can do with all these?

Stony Brook Wireless Router Wired Backbone Access Points Clients Ethernet Traditional Wireless LAN needs “wired” connectivity to access points. Deployment slow and expensive, particularly for wide area.

Get rid of the wires! Use a mesh routing backbone. Access Points/ Mesh Routers Clients Wired Backbone Ethernet Use a mesh routing backbone. Clients can associate with any access point/router. Complete transparency. Multiple radio interfaces on each router assigned to different bands/channels.

Architectural Choices Clients run on infrastructure mode. Associate to a nearby AP. Unaware of the wireless backbone. Use WDS (wireless distribution system) for inter-AP communication. Use a routing protocol for inter-AP routing. Link state-based routing. Choice of link cost metric? Multiple radios on each AP Channel assignment problem.

Routing Layer 2 handoff triggers routing updates. Mesh network cloud of APs Layer 2 handoff triggers routing updates.

Routing Mesh network cloud of APs Handoff delay with Prism2-based cards and HostAP driver = 240ms at L2 + 28ms per hop at L3.

Multihop Relaying Performance with Multiple Channels TCP throughput Setup: 802.11b prism2-based cards. HostAP driver. Relaying on WDS links. Gains over single channel not always spectacular. Suspect radio leakage. Base case: 1 hop throughput 5.5 Mbps

Channel Assignment Problem: Observations and Approaches Channel switching takes time (~100ms) in COTS hardware Rule out dynamic approaches. Statically? Semi-dynamically? Channel assignment is a topology control problem. Two neighboring node can talk only when they have a radio on a common channel. Ideally, one should jointly solve channel assignment and routing. Our approach: Assign channels to radios to minimize interference (objective), but preserve original topology (constraint).

Conflict Graph-based Greedy Algorithm Visits nodes in a certain order and assigns channels to radios such that all links from this node gets a channel. Channel selection based on a greedy heuristic. Maintain a conflict graph on the side to model interference. Compute the heuristic on this graph. Centralized; but can be distributed. 3 nodes 2 radios/node 3 non-overlapping channels

Conflict Graph-based Greedy Algorithm Visits nodes in a certain order and assigns channels to radios such that all links from this node gets a channel. Channel selection based on a greedy heuristic. Maintain a conflict graph on the side to model interference. Compute the heuristic on this graph. Centralized; but can be distributed. 3 nodes 2 radios/node 3 non-overlapping channels

Conflict Graph-based Greedy Algorithm Visits nodes in a certain order and assigns channels to radios such that all links from this node gets a channel. Channel selection based on a greedy heuristic. Maintain a conflict graph on the side to model interference. Compute the heuristic on this graph. Centralized; but can be distributed. 3 nodes 2 radios/node 3 non-overlapping channels

Conflict Graph-based Greedy Algorithm Visits nodes in a certain order and assigns channels to radios such that all links from this node gets a channel. Channel selection based on a greedy heuristic. Maintain a conflict graph on the side to model interference. Compute the heuristic on this graph. Centralized; but can be distributed. 3 nodes 2 radios/node 3 non-overlapping channels

The Devil is in the Model Interference model (used in objective) Current model: Two links on the same channel with a common node interferes. Nothing else interferes. Future: Model overlapping channels and radio leakage. Model interference beyond one hop. Factor in load? What to optimize? Minimize max interference. Maximize no. of concurrent transmissions. Topology (used as a constraint) Current model: Preserve the original topology. Future: Use the sub-topology actually used by routing.

Can iterative approaches help in lieu of joint optimization? Routing Influences interference Influences topology Channel Assignment Convergence? Practicality?

Random Graph-based Simulations 50 nodes. Dense network. 12 independent channels.

NS-2 Simulations 50 node. Dense network. 9.5 x Several orders of magnitude 50 node. Dense network. MAC layer capacity with Poisson traffic on each link.

Summary Extend infrastructure-mode WLAN to a mesh network. Complete client transparency. Handoff driven routing update. Multiple radio on each router. Channel assignment problem.