EILEEN BALCI GPSR: Greedy Perimeter Stateless Routing for Wireless Networks.

Slides:



Advertisements
Similar presentations
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Advertisements

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets R. Fonseca, Berkeley; S. Ratnasamy, Intel Research; J. Zhao, ICI; C. T. Ee,
A Presentation by: Noman Shahreyar
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.
Delay bounded Routing in Vehicular Ad-hoc Networks Antonios Skordylis Niki Trigoni MobiHoc 2008 Slides by Alex Papadimitriou.
ROUTING TECHNIQUES IN WIRELESS SENSOR NETWORKS: A SURVEY.
Geo – Routing in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Hannes Frey, Ivan Stojmenovic MobiCom 2006
Jorge Hortelano, Juan Carlos Ruiz, Pietro Manzoni
An Implementation Framework for Trajectory-Based Routing in Ad Hoc Networks Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman Electrical, Computer,
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
1 Distributed Navigation Algorithms for Sensor Networks Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri Dept. of Computer Science, University of.
Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas Guibas, John Hershberger, Li Zhang, An Zhu.
Wireless Ad Hoc Network Routing Protocols CSE Maya Rodrig.
Georouting in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed some Richard Yang‘s slides.
Sensor Network Routing Romit Roy Choudhury and Pradeep Kyasanur (Some slides are based on Dr. Nitin Vaidya’s tutorial)
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks Brad Karp; Harvard University H. T. Kung; Harvard University.
An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks - IEEE/ACM Trans. on Networking, Vol 16, Number 1, February 2008 D
Geographic Routing: GPSR Brad Karp UCL Computer Science CS M038 / GZ06 19 th January, 2009.
Multihop wireless networks Geographical Routing Karp, B. and Kung, H.T., Greedy Perimeter Stateless Routing for Wireless Networks, in MobiCom Using.
2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Proposed ad hoc Routing Approaches Conventional wired-type schemes (global routing, proactive): –Distance Vector; Link State Proactive ad hoc routing:
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Dynamic Routing in Mobile Ad Hoc Network 報告者:呂佐鴻 指導教授:李鴻璋.
Networking and internetworking devices. Repeater.
 Copyright 2007 Digital Enterprise Research Institute. All rights reserved. Digital Enterprise Research Institute Geographic Routing in Wireless.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Fall 2015 Ki-Joune Li Pusan.
UNIT 2 LESSON 8 CS PRINCIPLES. UNIT 2 LESSON 8 OBJECTIVES Students will be able to: Describe how routers develop routing tables to determine how to send.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
指導教授:許子衡 教授 學 生:黃群凱 2016/2/251 Proceedings of the 2008 IEEE International Conference on Vehicular Electronics and Safety Columbus, OH, USA. September 22-24,
Fundamentals of Computer Networks ECE 478/578
A New Recovery Method for Greedy Routing Protocols in High Mobile Vehicular Communications 指導教授:許子衡 教授 學 生:董藝興.
ProgessFace: An Algorithm to Improve Routing Efficiency of GPSR-like Routing Protocols in Wireless Ad Hoc Networks Chia-Hung Lin, Shiao-An Yuan, Shih-Wei.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
1 Routing in Internet vs. Sensor Network. 2 Sensor Network Routing –I Location/Geographic Based Routing Tian He Some materials are adapted from I. Stojmenovic.
Spatial Aware Geographic Forwarding for Mobile Ad Hoc Networks Jing Tian, Illya Stepanov, Kurt Rothermel {tian, stepanov,
Survey of Ad Hoc Network Routing Protocols Team Adhocracy Presentation 2 – April 12, 2007 Jason Winnebeck Benjamin Willis Travis Thomas.
Survey of Ad Hoc Network Routing Protocols Team Adhocracy Presentation 3 – April 23, 2007 Jason Winnebeck Benjamin Willis Travis Thomas.
Survey of Ad Hoc Network Routing Protocols Team Adhocracy Presentation 4 – May 10, 2007 Jason Winnebeck Benjamin Willis Travis Thomas.
Wireless Ad Hoc Network Routing Protocols
Routing protocols for sensor networks.
A Location-Based Routing Method for Mobile Ad Hoc Networks
Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman
MOBILE AD-HOC NETWORKS
GPSR Greedy Perimeter Stateless Routing
Surviving Holes and Barriers in Geographic Data Reporting for
Trajectory Based Forwarding
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks
Sensor Network Routing
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks
Overview of Unicast Routing Protocols for Multihop Wireless Networks
Distance Vector Routing
Intra-Domain Routing Jacob Strauss September 14, 2006.
Routing: Distance Vector Algorithm
Kevin C. Lee, Uichin Lee, Mario Gerla Network Research Lab, UCLA
COS 461: Computer Networks Spring 2014
Greedy Distributed Spanning tree routing (gdstr)
CMPE 252A : Computer Networks
COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.
OSPF Protocol.
Presentation transcript:

EILEEN BALCI GPSR: Greedy Perimeter Stateless Routing for Wireless Networks

About GPSR GPSR allows nodes to figure out who its closest neighbors are (using beacons) that are also close to the final destination the information is supposed to travel to To calculate a path, GPSR uses a greedy forwarding algorithm that will send the information to the final destination using the most efficient path possible. If the greedy forwarding fails, perimeter forwarding will be used which routes around the perimeter of the region.

About the Greedy Forwarding Algorithm Assuming the wireless routers [nodes] know their own locations the Greedy forwarding algorithm will try to find the closest router which is also the closest to the final destination

Greedy Forwarding Algorithm Benefits A node just has to remember the location of neighbors with in one-hop Routing decisions can be dynamically made

Greedy Forwarding Algorithm Drawback If the network is dense enough that each interior node has a neighbor in every 2  /3 angular sector, Greedy Forwarding will always succeed. However, the greedy forwarding algorithm can fail: Greedy Forwarding fails

Perimeter Forwarding Algorithm Benefits When the Greedy Forwarding algorithm fails, the Perimeter Forwarding algorithm will be used Apply the right-hand rule to traverse the edges of the void and find a path using the topology’s perimeter

Perimeter Forwarding Algorithm Drawback The Perimeter Forwarding Algorithm uses a longer path to the destination so the perimeter forwarding algorithm less efficient and cannot be used alone

Greedy Perimeter Stateless Routing - GPSR Putting Greedy Forwarding and Perimeter Forwarding together makes the final GPSR which will use the necessary algorithm(s) to find the best path in a given topology Greedy ForwardingPerimeter Forwarding greedy fails have left local maxima greedy works greedy fails

GPSR The GPSR is a responsive and efficient routing protocol for mobile, wireless networks. GPSR can be applied to Sensor networks, Rooftop networks, Vehicular networks and ad-hoc networks.

Credits gpsr.ppt gpsr.ppt kung.pdf kung.pdf