Grid: Scalable Ad-Hoc Wireless Networking Robert Morris LCS

Slides:



Advertisements
Similar presentations
Overview of CarNet. CarNet Scalable Ad-Hoc wireless network MIT – 849/
Advertisements

1 S4: Small State and Small Stretch Routing for Large Wireless Sensor Networks Yun Mao 2, Feng Wang 1, Lili Qiu 1, Simon S. Lam 1, Jonathan M. Smith 2.
Cs/ee 143 Communication Networks Chapter 6 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech.
NDN in Local Area Networks Junxiao Shi The University of Arizona
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Multicasting in Mobile Ad-Hoc Networks (MANET)
Arsitektur Jaringan Terkini
Carnet: A Scalable Ad Hoc Wireless Network System SIGOPS European Workshop, Authors: Robert Morris, etc., MIT Library of Computer Science Presenter:
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL Presented by: Ao-Jan Su.
Secure Routing in Ad Hoc Wireless Networks
 Idit Keidar, Technion Intel Academic Seminars, February Octopus A Fault-Tolerant and Efficient Ad-hoc Routing Protocol Idit Keidar, Technion Joint.
CS 672 Paper Presentation Presented By Saif Iqbal “CarNet: A Scalable Ad Hoc Wireless Network System” Robert Morris, John Jannotti, Frans Kaashoek, Jinyang.
CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 9 Introduction to Networks and the Internet.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
August 6, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of.
Ad Hoc Wireless Routing COS 461: Computer Networks
BMWnet Wshnt.kuas.edu.tw Mesh Networks Prof. W.S. Hwang.
A Scalable Location Service for Geographic Ad Hoc Routing Jinyang Li, John Jannotti, Douglas S. J. De Couto, David R. Karger, Robert Morris MIT Laboratory.
Chapter 5: Computer Networks
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
Chapter 5 Networks Communicating and Sharing Resources
LECTURE 9 CT1303 LAN. LAN DEVICES Network: Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and.
Copyright © 2006, Dr. Carlos Cordeiro and Prof. Dharma P. Agrawal, All rights reserved. 1 Carlos Cordeiro Philips Research North America Briarcliff Manor,
Introduction to Routing and Routing Protocols By Ashar Anwar.
An Introduction Table Of Context Sensor Network PreviewRouting in Sensor NetworksMobility in Sensor Networks Structure and characteristics of nodes and.
WSN Done By: 3bdulRa7man Al7arthi Mo7mad AlHudaib Moh7amad Ba7emed Wireless Sensors Network.
Computers Are Your Future Tenth Edition Chapter 8: Networks: Communicating & Sharing Resources Copyright © 2009 Pearson Education, Inc. Publishing as Prentice.
Lyon, June 26th 2006 ICPS'06: IEEE International Conference on Pervasive Services 2006 Routing and Localization Services in Self-Organizing Wireless Ad-Hoc.
Carnet: Scalable Ad-Hoc Mobile Networking Robert Morris with Kaashoek and Karger.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
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.
Multicast Routing in Mobile Ad Hoc Networks (MANETs)
Wireless Ad-Hoc Networks
Mobile Networking Challenges1 5.6 Mobile Ad Hoc Networks  Ad hoc network does not have any preexisting centralized server nodes to perform packet routing,
Definitions What is a network? A series of interconnected computers, linked together either via cabling or wirelessly. Often linked via a central server.
Introduction to Computer Networks INTRODUCTION TO COMPUTER NETWORKS.
Routing Protocols in Ad-hoc Networks, OLSR Self configuring systems (SCS) TTM3 – Høst 2004 Jørn Andre Berntzen 22/10/2004.
Computers Are Your Future Eleventh Edition
A Scalable Location Service for Geographic Ad Hoc Routing Jinyang Li, John Jannotti, Douglas S. J. De Couto, David R. Karger, Robert Morris Presented By.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
AD-HOC NETWORK SUBMITTED BY:- MIHIR GARG A B.TECH(E&T)/SEC-A.
MobiQuitous 2007 Towards Scalable and Robust Service Discovery in Ubiquitous Computing Environments via Multi-hop Clustering Wei Gao.
CarNet/Grid: Scalable Ad-Hoc Geographic Routing Robert Morris MIT / LCS
Link State Routing David Holmer Generic Link State Routing  Each node monitors neighbors/local links and advertises them to the network.
6.964 Pervasive Computing Grid: Scalable Ad Hoc Networking 1 November 2001 Douglas S. J. De Couto Parallel and Distributed Operating Systems Group MIT.
1 Presented by Jing Sun Computer Science and Engineering Department University of Conneticut.
Rehab AlFallaj.  Network:  Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and do specific task.
Overview of Wireless Networks: Cellular Mobile Ad hoc Sensor.
Wireless Mesh Networks Myungchul Kim
PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
Intro Wireless vs. wire-based communication –Costs –Mobility Wireless multi hop networks Ad Hoc networking Agenda: –Technology background –Applications.
Grid: Scalable Ad Hoc Wireless Networking Douglas De Couto
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.
Dominik Kaspar, Eunsook Kim, Carles Gomez, Carsten Bormann
Grid: Scalable Ad-Hoc Geographic Routing
CT1303 LAN Rehab AlFallaj.
A Survey of Routing Techniques for Mobile Communication Networks
Chapter 5 Networks Communicating and Sharing Resources
Chapter 6 Networks Communicating and Sharing Resources
Mobile ad hoc networking: imperatives and challenges
Multihop Wireless Networks: What’s Wrong With Min Hopcount?
Presentation transcript:

Grid: Scalable Ad-Hoc Wireless Networking Robert Morris LCS

Goal: Networks out of Chaos AFDBECGJIH

Solution: Multi-hop Forwarding AFDBECGJIH “A to J: Hello!”

System Status Software distributions for Linux, BSD PC, iPaq Works with unmodified Internet software Two Grid nets deployed

LCS Grid Net static nodes on 5 th /6 th floors A dozen iPaq hand-helds wired gateway

Roof-Top Grid Net LCS

Completed Research Scalable routing: Geographic forwarding Distributed P2P location database Low-power forwarding Understanding capacity limits Avoiding malicious nodes

Does Grid Find Useful Paths? AFDBECGJIH

Mistake: Shortest-Path Routes AFDBECGJIH A’s max range

Link Quality Isn’t Bi-modal

Obstacles to Better Routing Use low-loss paths, but… Loss rate masked by re-sends Changes quickly with time, motion What’s the best metric to minimize? Expected total packet transmissions Fight strong bias towards shortest paths

Grid Summary Grid routing protocols are Self-configuring Easy to deploy Scalable

Application: Smart Devices Internet Access Point Print Share Remote Control

Application: Rooftop Nets Game server School/Homework Server Internet Access

Application: Disaster Services Disaster may have damaged phone system &c Want to avoid N 2 plans for N services to communicate

Direct Contact Scales Badly AFDBECGJIH “Hello J!”

Design Challenges Cope with mobile nodes Finding routes Conserving battery power Coping with malicious/faulty nodes Scaling to large networks

Topology Distribution Scales Badly 1. “C can reach A and B.” ABCDF 3. Data from F to B. 2. “D can reach A, B, and C.” G

Geographic Forwarding Scales Well Longitude Latitude AFDBECG “Send towards lat G / lon G.”

Location Database Longitude Latitude AFDBECG DB 1. “G is at lat G / lon G” 2. “Where is G?”

Distributed Location Database Each node is DB for a few other nodes How to find a node’s location server(s)? Every node has an unchanging ID hash(ID) maps ID to position in unit square

G’s Location Server is a Point G hash(G) = 0.1,0.9 x (0,0) H I

Spatial Grid Hierarchy All nodes agree on the global origin of the Grid hierarchy

Multiple Servers per Node G c ba

Lookups Expand in Scope G c ba A ?

Grid Protocol Overhead Grows Slowly Protocol packets include: Grid update, Grid query/reply. Number of nodes Protocol Overhead (packets per second)