Wireless Capacity. A lot of hype Self-organizing sensor networks reporting on everything everywhere Bluetooth personal networks connecting devices City.

Slides:



Advertisements
Similar presentations
University At Buffalo Capacity Of Ad-Hoc Networks Ajay Kumar.
Advertisements

The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
The Capacity of Wireless Networks
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
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.
CCNA3: Switching Basics and Intermediate Routing v3.0 CISCO NETWORKING ACADEMY PROGRAM Switching Concepts Introduction to Ethernet/802.3 LANs Introduction.
SELF-ORGANIZING MEDIA ACCESS MECHANISM OF A WIRELESS SENSOR NETWORK AHM QUAMRUZZAMAN.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
The Capacity of Wireless Ad Hoc Networks
Self-Management in Chaotic Wireless Deployments A. Akella, G. Judd, S. Seshan, P. Steenkiste Presentation by: Zhichun Li.
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
Efficient Hop ID based Routing for Sparse Ad Hoc Networks Yao Zhao 1, Bo Li 2, Qian Zhang 2, Yan Chen 1, Wenwu Zhu 3 1 Lab for Internet & Security Technology,
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Mobile Ad hoc Networks COE 549 Delay and Capacity Tradeoffs II Tarek Sheltami KFUPM CCSE COE 8/6/20151.
Capacity of Ad Hoc Networks Quality of Wireless links Physical Layer Issues The Channel Capacity Path Loss Model and Signal Degradation MAC for.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Network Coding vs. Erasure Coding: Reliable Multicast in MANETs Atsushi Fujimura*, Soon Y. Oh, and Mario Gerla *NEC Corporation University of California,
Chapter 11 Extending LANs: Fiber Modems, Repeaters, Bridges, & Switches Hub Bridge Switch.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
 Network Segments  NICs  Repeaters  Hubs  Bridges  Switches  Routers and Brouters  Gateways 2.
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
Wireless LANs Wireless Technologies for LANs –Radio –Infrared light (as in TV remote control) –Ideal for mobile devices –Useful when wiring would.
EPL 476 Fundamental Concepts in Wireless Networks
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.
Wireless Networks Spring 2005 Capacity of Ad Hoc Networks.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Geo Location Service CS218 Fall 2008 Yinzhe Yu, et al : Enhancing Location Service Scalability With HIGH-GRADE Yinzhe Yu, et al : Enhancing Location Service.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
CCNA3 Module 4 Brierley Module 4. CCNA3 Module 4 Brierley Topics LAN congestion and its effect on network performance Advantages of LAN segmentation in.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Grid: Scalable Ad-Hoc Wireless Networking Douglas De Couto
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
12.Nov.2007 Capacity of Ad Hoc Wireless Networks Jinyang Li Charles Blake Douglas S. J. De Coutu Hu Imm Lee Robert Morris Paper presentation by Tonio Gsell.
Routing Metrics for Wireless Mesh Networks
IMPROVING OF WIRELESS MESH NETWORKS.
Delay-Tolerant Networks (DTNs)
Routing Metrics for Wireless Mesh Networks
What is Mobile Network? Why is it called Ad Hoc?
Mrinalini Sawhney CS-710 Presentation 2006/09/12
Ad Hoc Networks - Performance
Routing Metrics for Wireless Mesh Networks
Hidden Terminal Decoding and Mesh Network Capacity
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
The Capacity of Wireless Networks
Capacity of Ad Hoc Networks
How MAC interacts with Capacity of Ad-hoc Networks – Interference problem Capacity of Wireless Networks – Part Page 1.
Presentation transcript:

Wireless Capacity

A lot of hype Self-organizing sensor networks reporting on everything everywhere Bluetooth personal networks connecting devices City wide networks run by individuals and companies No more Cat5 in homes/businesses

Capacity As systems researchers, the most glaring question is “Does this scale?” What do we mean by scaling? What is the aggregate network capacity? What is the per-node capacity for node- originated data

Observed capacity Das et al. simulation of 100 nodes 2Mbps base throughput 7 simultaneous transmissions Per-node bandwidth few kbps Others see similar capacity

Physical limit Competition for physical bandwidth Signal power degrades with distance as 1/r  for some  As an order of magnitude, in ns transmission range ~250 meters, interference ~550 meters

Network capacity Upper bound total capacity,arbitrary destination Why? Intuitively, assuming constant density: total area/capacity ~n, diameter/average path length ~  n Global scheduling can achieve:

What is the limit? As density increases, the number of nodes a packet interferes with increases Constant power, nodes per unit area larger Lower power/more hops, total transmissions increase

Chain propagation (simulation) Achieve 1/7 of maximum 1.7Mbps Expected ¼ of maximum 1.7Mbps

MAC inefficiency? works until offered load exceeds capacity Waste bandwidth at first node Waste time backed off

Simulation vs. Reality

Solutions? Smaller networks? Suggested in papers Only helpful if lower overall use Add extra repeater nodes Requires exorbitant number of nodes Factor of k repeaters,  k extra per-node capacity Local communication patterns? Widespread base stations Local data processing Be sneaky

Traffic pattern Power law traffic pattern Per-node capacity  Approaches constant  O(1/log(n)): GLS uses this  O(1/  n)

Be sneaky If we achieve three properties, we should be able to get scalability All direct communication is local Message paths are short (preferably O(1)) Squander no opportunities to send Can we still achieve full connectivity? Maybe: Mobility

Mobility Nodes move randomly Ergodic (uniform space filling) motion No proof that this is NECESSARY Persistent communication patterns Random source/destination patterns Unlimited data Buffering Nodes can buffer data

Mobility To achieve scalability, we want three properties All direct communication is local Send messages only to nearest neighbor Distant communication depends on chance movement Message paths are short (preferably O(1)) Squander no opportunities

Mobility To achieve scalability, we want three properties All direct communication is local Message paths are short (preferably O(1)) Never forward along paths longer than 2 hops Squander no opportunities

Mobility To achieve scalability, we want three properties All direct communication is local Message paths are short (preferably O(1)) Squander no opportunities Send data through everyone Whenever you are near any node, give it a (new) packet for the destination. On average should have data for every possible destination

Requirements Know closest node/range Schedule local transmissions They found the standard MAC may be ok Buffering Scales with radio bandwidth? Scales with expected time to see a destination node?

Model Is this useful? Potentially very long time to delivery Potentially wide variance in delivery times Unknown dependence on movement model Space filling unrealistic(destructive to homes) Another submission claims that travel along random line segments also works Unclear generalization to multiple hops Static population model/bounded movement model unrealistic for many random movement models Existing applications seem unlikely consumers

What next? Radio people MAC layers tuned to ad hoc mode Wasn’t clear from results presented this is more than a moderate constant factor Systems/applications people Communication patterns with good locality Take advantage of external sources of bandwidth (fiber optics or station wagons of tapes)