LORD: Location based Route Discovery with Maximally Disjoint Multipath

1. LORD: Location based Route Discovery with Maximally Disjoint Multipath Andreas Weiss

2. Outline • Motivation • LORD, the framework • Maximally Disjoint Multipath • Simulations & Results • Questions & Comments

3. Motivation • Random Rebroadcast Delay (RRD) introduced to avoid broadcast storm • I want to do better then random A S D B

4. LORD: Introduction • What LORD can: • Find route with lowest End-to-End delay (no mobility) • Find route with long lifetime and bounded End-to-End delay • Find route with the lowest power consumption used for wireless sensor networks • What LORD needs: • GPS to know its location • Store location information in RREQ

5. LORD: The Core Idea • Neighbor decides on positional attributes how long to wait until it rebroadcasts RREQ A R L3 L1 S C B L2

6. LORD: Functionality • Minimize End-to-End delay • Propagation delay << Transmission delay • Take as next hop the node that is as far away as possible • Maximize Lifetime • Take as next hop the node that leads to a long lifetime of the link AND is far way • Minimize Power consumption • Power needed increases exponentially with a linear increase of the distance • Take as next hop the node that is as close as possible

7. B 130 130 76 105 105 A S T Wireless Sensor Networks • Power needed increases exponentially with a linear increase of the distance • Deployed dense • Limited power and no charging • => Split a long link into shorter links • Path S – T: 1.238W • Path S – A – T: 0.62W • (saving of 50%) • Path S – B – T: 0.95W • (saving of 23%)

8. S S D D Maximally Disjoint Multipath • Do not reply RREQ’s from cache • Forward duplicate RREQ if different incoming link than the first RREQ • Why? Because we want maximally disjoint

9. Maximally Disjoint Multipath • Two ways to use Multipath • Use Disjoint Path if first path breaks • Split traffic between the two paths to increase throughput

10. Simulations • Network area 600m x 600m • 20, 30, 40 or 50 nodes • Maximum speed 20 m/s Simulation

11. End-to-End delay Converge time Simulations • Minimize End-to-End delay • No mobility • Propagation delay << Transmission delay • Take far away node as next hop

12. 2 m/s 20 m/s Simulations • Maximize Path-Lifetime • Take next hop that leads to a long lifetime of the link, but is also far away to keep End-to-End delay bounded

13. Power Consumption Simulations • Minimize Power Consumption • Wireless sensor: • Limited power • No battery charging • Deployed dense • Transmission power increases exponentially • Split long link into shorter links • Take as next hop the closest node

14. Questions & Comments

15. -VS R VRS dRS VR dR’S R’ VS dRX dSX S r X Calculate Lifetime • Calculate relative speed: