1 / 23

A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks

A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks. Jian Li and Prasant Mohapatra GlobeCom’03. Speaker︰CHUN-WEI. Outline. Introduction PANDA Design PANDA-LO PANDA-LV PANDA-TP Simulation Conclusion. Introduction. Flooding based route discovery AODV,DSR…etc

ellie
Download Presentation

A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks Jian Li and Prasant Mohapatra GlobeCom’03 Speaker︰CHUN-WEI

  2. Outline • Introduction • PANDA Design • PANDA-LO • PANDA-LV • PANDA-TP • Simulation • Conclusion

  3. Introduction • Flooding based route discovery • AODV,DSR…etc • Broadcast storm problem • In [11]”A Performance Comparison of Multi-hop Wireless Ad-hoc Networking Routing Protocol“ use Random Rebroadcast Delay (RRD) approach to solve the problem

  4. Introduction • RRD approach is not the most suitable one in term of search for a better route • RRD approach may choice the worst next -hop candidate K I L D S J M

  5. Introduction • We propose to use location and velocity information in determining the rebroadcast delay time • Positional Attribute based Next-hop Determination Approach (PANDA)

  6. PANDA Design • Basic idea • Discriminate neighboring node as good or bad candidate for the next hop • Good candidate  Shorter rebroadcast delay • Bad candidate  Longer rebroadcast delay • Algorithm • PANDA-LO (Location Only) • PANDA-LV (Location & Velocity) • PANDA-TP (Transmission Power)

  7. PANDA Design • Assume • Each mobile node is equipped GPS • Location and velocity information

  8. PANDA Design – PANDA-LO • The farther away node form the upstream node, the shorter rebroadcast delay

  9. Random value between 0 to t1 PANDA Design – PANDA-LO

  10. PANDA Design – PANDA-LO • PANDA-LO may lead to fragile path • Not consider the link lifetime

  11. PANDA Design – PANDA-LV • Use both location and velocity information • Estimating the link lifetime • Choosing stable links as the next hop

  12. PANDA Design – PANDA-LV Θ

  13. PANDA Design – PANDA-LV

  14. PANDA Design – PANDA-TP • In wireless sensor network, power conservation is more important than reduction of end-to-end delay • Break a big single hop into several small hops • Demonstrated the following example • Small hops power consumption is smaller than a big single hop

  15. Assume︰ PRXminis theminimal receive power Lis propagation loss PANDA Design – PANDA-TP

  16. PANDA Design – PANDA-TP (α is between 2 and 4)

  17. PANDA Design – PANDA-TP

  18. Simulation • PANDA-LO and PANDA-LV • Use the codebase of DSR in ns-2 simulator • Simulation area is 1500×300 square meter • 100 nodes uniformly deployed • A node’s speed is uniformly distributed in the range of (0, 20) meter per second • Transmission range is 250 meter

  19. Simulation

  20. Simulation

  21. Simulation • PANDA-TP • Simulation program by ourselves • Simulation area is 1500×300 square meter • Nodes can dynamically control their transmission range • In the route discovery phase, the nodes used a fixed transmission range of 250 meter

  22. Simulation

  23. Conclusion • PANDA approach can improving the performance, quality, and energy conservation of routing algorithm

More Related