GeoMote: Geographic Network Architecture for Sensor Networks Joe Polastre Rachel Rubin.

Slides:



Advertisements
Similar presentations
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.
Advertisements

1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
IP Forwarding Relates to Lab 3.
Computer Networking A Top-Down Approach Chapter 4.7.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
A Presentation by: Noman Shahreyar
Sensor Network 教育部資通訊科技人才培育先導型計畫. 1.Introduction General Purpose  A wireless sensor network (WSN) is a wireless network using sensors to cooperatively.
Rumor Routing Algorithm For sensor Networks David Braginsky, Computer Science Department, UCLA Presented By: Yaohua Zhu CS691 Spring 2003.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Progress Report Wireless Routing By Edward Mulimba.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Mod 10 – Routing Protocols
DTNLite: Reliable Data Delivery in Sensornets Rabin Patra and Sergiu Nedevschi UCB Nest Retreat 2004.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Highly Dynamic Destination- Sequenced Distance-Vector Routing (DSDV) for Mobile Computers C. E. Perkins & P. Bhagwat Presented by Paul Ampadu.
Directed Diffusion for Wireless Sensor Networking C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, F. Silva Mobicom 2000.
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 06/04/2007.
Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
MobiSteer: Using Steerable Beam Directional Antenna for Vehicular Network Access Vishnu Navda, Anand Prabhu Subramanian, Kannon Dhanasekaran, Andreas Timm-Giel,
Ad Hoc Wireless Routing COS 461: Computer Networks
The OSI Model and the TCP/IP Protocol Suite
The Pulse Protocol: Mobile Ad hoc Network Performance Evaluation Baruch Awerbuch, David Holmer, Herbert Rubens {baruch dholmer WONS Jan.
ECE 544 Project3 Kush Patel Siddharth Paradkar Ke Dong.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Dr. John P. Abraham Professor University of Texas Pan American Internet Routing and Routing Protocols.
Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks.
Chapter 2 The Infrastructure. Copyright © 2003, Addison Wesley Understand the structure & elements As a business student, it is important that you understand.
Routing in mobile ad-hoc networks (MANETs). 1. WHAT IS A MANET ? A MANET can be defined as a system of autonomous mobile nodes A MANET can be defined.
Routing and Routing Protocols Routing Protocols Overview.
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Scalable Routing Protocols for Mobile Ad Hoc Networks Xiaoyan Hong, Kaixin Xu, and Mario Gerla at UCLA.
Submission doc.: IEEE /1015r1 September 2015 Guido R. Hiertz et al., EricssonSlide 1 Proxy ARP in ax Date: Authors:
Routers. What is a Router? A multi-port connectivity device Can connect different types of LANs as well as WANS Works at Layer 3 – Network Layer using.
ROUTING ALGORITHMS IN AD HOC NETWORKS
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
1 Multicast Algorithms for Multi- Channel Wireless Mesh Networks Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt Mutka Michigan State University ICNP 2007.
Ad Hoc Routing: The AODV and DSR Protocols Speaker : Wilson Lai “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks”, C. Perkins.
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
REED: Robust, Efficient Filtering and Event Detection in Sensor Networks Daniel Abadi, Samuel Madden, Wolfgang Lindner MIT United States VLDB 2005.
Lecture 6 Page 1 Advanced Network Security Review of Networking Basics Advanced Network Security Peter Reiher August, 2014.
A Survey of Geocast Routing Protocols 指導教授:許子衡 教授 報告學生:馬敏修 指導教授:許子衡 教授 報告學生:馬敏修.
Communication Support for Location- Centric Collaborative Signal Processing in Sensor Networks Parmesh Ramanathan University of Wisconsin, Madison Acknowledgements:K.-C.
Data Dissemination in Sensor Networks Challenges and Solutions by Sovrin Tolia.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Evaluation of ad hoc routing over a channel switching MAC protocol Ethan Phelps-Goodman Lillie Kittredge.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
4: Network Layer4-1 Chapter 4: Network Layer Last time: r Internet routing protocols m RIP m OSPF m IGRP m BGP r Router architectures r IPv6 Today: r IPv6.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
EmberNet – Wireless Networks for Industrial Systems Presented by Ryan Wu April 11, 2003 Some slides and figures courtesy EmberNet, Rob Poor and Cliff Bowman.
Autonomous prototype sensors (motes) 4 MHz, 8bit MCU, 4 KB RAM, 8KB ROM short-range (1-10ft.) radio light and other sensors LED and serial port outputs.
11 ROUTING IP Chapter 3. Chapter 3: ROUTING IP2 CHAPTER INTRODUCTION  Understand the function of a router.  Understand the structure of a routing table.
1 Chapter 14-16a Internet Routing Review. Chapter 14-16: Internet Routing Review 2 Introduction Motivation: Router performance is critical to overall.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Building Wireless Efficient Sensor Networks with Low-Level Naming J. Heihmann, F.Silva, C. Intanagonwiwat, R.Govindan, D. Estrin, D. Ganesan Presentation.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
Configuration for routing example
IP Forwarding Covers the principles of end-to-end datagram delivery in IP networks.
Wireless Sensor Network Architectures
Mobility in based Multihop networks
IP Forwarding Relates to Lab 3.
IP Forwarding Relates to Lab 3.
IP Forwarding Relates to Lab 3.
IP Forwarding Relates to Lab 3.
ECE 544 Project3 Team member.
IP Forwarding Relates to Lab 3.
IP Forwarding Relates to Lab 3.
Presentation transcript:

GeoMote: Geographic Network Architecture for Sensor Networks Joe Polastre Rachel Rubin

Motivation Sensor Network Data is typically interpreted based on a sensor’s location Current multihop beacon-based routing –Requires too much overhead –Only allows multihop to one node Routing by shortest number of hops results in large distance between hops Sensors often overloaded with participating in the network; not enough time to sense!

Goals Separate client sensing functions from network functions Enable clients with geographic information Provide a generalized architecture suitable for all client communications Maintain the same or less overhead in the geographic network architecture as in traditional multihop architectures

Applications of Geographic Services Geographic Multicast (GeoCast) Nearest Neighbor Service Discovery Geographic Network Reprogramming and Reconfiguration Low Power Pursuer/Evader Games

Low-Power Pursuer Evader Evader

Components Allow Geographic Architecture to be plugable service for client applications GENERIC_COMM Localization Location Services / Routing Client Application

Why Use Location? Permits messages to be sent between any two nodes in the network Gives routing algorithms an additional parameter to analyze Provides additional information to client applications

GeoCast Architecture Three Layer Architecture: GeoHosts GeoGateways GeoRouters Designed for powerful Internet workstations (Julio Navas, Tomasz Imielinski, 1997)

GeoHosts Endpoints of the network Run client processes Initiate message transfer Determines if a packet is destined for its current geographic region

GeoGateways Entry and exit points of the network Communicate with GeoRouters and GeoHosts through broadcast messages Cover a given region specified by a radius

GeoRouters Perform intelligent routing and message delivery tasks Know the location of nearby GeoRouters and GeoGateways Route packets to GeoRouters and GeoGateways to deliver the packet to the destination geographic region

Geographic Routing Architecture Client Process Client Process Direct Message Router Host Gateway Event

Geographic vs. Internet Architecture Geographic (sensor) –Routers may never talk to Hosts and vice versa –Gateways are entry/exit points but have no routing info –Broadcast medium dependant on distance from source Internet –Functions of the gateway and router are typically merged –Gateways perform routing functions and are entry/exit points –Broadcast medium dependant on physical network

Network Hierarchy 2 layers –Simple Implementation Layer 1: Hosts Layer 2: Routers –Reduced Overhead –Less hops per packet from source to destination n layers –More Complex –Can dedicate nodes to specific network functions –Allows optimization of resource usage Its not obvious what the optimum number of network layers is.

Geographic Routing Naïve Method: Route to “closest” router Probabilistic Algorithms –Local Search Directed Diffusion (Estrin et al) Beam Forming (Algorithms, Antennae)

Experimental Results Figure 2 Packet Throughput

Experimental Results Number of Hops

Future Work / Ideas Utilize the wireless broadcast medium to allow intermediate nodes to cache and aggregate data passively Evaluate and design new routing algorithms that leverage location information Collect and analyze results for controlled large-scale experiments