Introduction

1. Application of GPS to Mobile IP and Routing in Wireless NetworksMustafa Ergen, Sinem Coleri, Baris Dundar, Rahul Jain, Anuj Puri, Pravin Varaiya{ergen,csinem,dundar,rjain,anuj,varaiya}@eecs.berkeley.eduUniversity of California BerkeleyIEEE VTC, Vancouver, Canada, September, 2002.

2. Introduction • Scenario • Motivation • Architecture • Components • Performance • Conclusion

3. Scenario

4. Scenario 2

5. Let`s put GPS to the cars and base stations Internet Management Center Mobile IP with position Ad Hoc Network with position • Overhead of Ad Hoc routing Sensor Network User Architecture • Limitations: • Power constraints of Sensors • Overhead of Sensor Network • Limited # of Base Stations • Smooth Handoff Problem

6. Architecture Mobile IP Position based Mobile IP Ad hoc routing Geographical Routing Sensor Network Sensor Network

7. Architecture

8. Geographical Routing Algorithm Geographical network • Assumptions: • Each node knows its own position and its neighbors’ position • Nodes don’t know the global topology • Destination address is a geographical position to which the packet is to be delivered

9. A Simple Routing Algorithm Routing Decision: Route to the neighbor which is nearest to the packet destination Destination Source

10. Problem with Simple Routing Wall Destination Source • Simple routing doesn’t always work • The Geographical routing algorithm is an extension of the • simple routing algorithm.

11. Route Discovery • Packet gets “stuck” when a node does not have a neighbor to which it can forward the packet • When a packet is stuck, a Route Discovery is started to destination D • A path p = s(0) s(1)...s(k)is found to D • Entry [ position(D), s(i+1) ] is added to the routing table of s(i)

12. Pos(D) C B Pos(D) Route Discovery Pos(D) Pos(C) --- Pos(A) = (1,1) Pos(B) = (2,2) Pos(C) = (3,1) Pos(D) = (2.5,0) Links: A ---- B B ---- C C ---- D B B Pos(B) --- Pos(D) Pos(B) Pos(D) Pos(D) D Pos(D) A Pos(A) C A C Pos(C) --- Pos(A) Pos(D) --- B Pos(B) D Pos(C) C Pos(D) • A gets a packet for Pos(D) • Packet gets stuck at A because Pos(A) is closest to Pos(D) • Initiate route discovery for D from A • Update the routing tables and forward the packet

13. Routing Table for Station n: Vornoi View: (x,y) position Neighbor a Position of n - Position of neighbor a n b a Position of neighbor b b (12,4) a (12,4) A Geometrical View • Route discovery is initiated if packet destination falls within • the cell containing station n • Each route discovery causes the cell with station n to get split

14. Routing Table Size • How many “splits” before station n is alone in its cell ? • Each split reduces the cells area ~ 1/2 • The cell’s area when station n is alone in the cell ~ 1/N • where N is the number of stations in a unit area • => log(N) splits before station n is alone in its cell • Each split causes a route discovery • Each route discovery causes L entries to be added to the routing • tables where L is the average route discovery path length • => O( L log(N) ) entries in routing table of each station

15. Performance of GRA

16. Position based Fast Handover Algorithm

17. Fast Handover Mini Base Stations Internet / DataBase Server Intermediate Network Mobile

18. Performance of FASTMIP • A Handoff Scheme compared to • vanilla Mobile IP. • Buffering and Positioning increase the performance of the handoff.

19. Sensor Network • Initiated by the Mobile • Localization scheme • Small scale tree type sensor network configuration • Time < seconds

20. Conclusion • Using Mobile Stations as a mobile base for sensors -Reduces power loss and routing overhead • Using GPS on mobiles • -Reduces the adhoc routing overhead • -Reduces the routing table size • Using GPS on base stations • -Reduces the packet loss and delay • -Integrate easily with the GRA