1 / 12

Routing protocols in mobile sensor networks -Rajiv Menon

Routing protocols in mobile sensor networks -Rajiv Menon. Agenda. Introduction Types of Routing Protocols Important Routing Protocols for Moving Sensor Nets (GAF, GEAR, PAGER-M) Summary Conclusion. Introduction. Mobile vs. Moving Sensor nets Challenges For Routing Protocol Design

leola
Download Presentation

Routing protocols in mobile sensor networks -Rajiv Menon

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. Routing protocols in mobile sensor networks -Rajiv Menon

  2. Agenda • Introduction • Types of Routing Protocols • Important Routing Protocols for Moving Sensor Nets (GAF, GEAR, PAGER-M) • Summary • Conclusion

  3. Introduction • Mobile vs. Moving Sensor nets • Challenges For Routing Protocol Design • Scalability • Energy Efficiency

  4. Types of Routing Protocols • Query/Data Driven • Cluster based • Location • GAF • GEAR • PAGER-M

  5. GAF (Geographic Adaptive Fidelity) • Energy aware and Location based • Virtual Grid • States in GAF: • Discovery • Active • Sleep

  6. GEAR (Geographic and Energy Aware Routing) • Based on query driven Protocols • Estimated cost and Learned cost • Forwarding packets towards target region depends on estimated and learned cost • Forwarding packets within region using recursive geographic forwarding

  7. PAGER-M (Partial-partition Avoiding GeographicRouting-Mobile) The mobile sensor network model. (a) At t0, node x has node z as a neighbor that is moving out of its communication range. (b) At t1, node z has moved out of the communication range of node x, while node y has moved into the communication range of node x and become a new neighbor of x. (a) (b)

  8. A Novel Scheme based on polar bonds

  9. Summary • Mobile vs Moving • Routing Protocol Challenges • Types of Routing Protocols • Location based protocols: GAF, GEAR, PAGER-M • A Novel routing scheme for high mobility sensor nets

  10. Conclusion • Can we ever have a single Protocol? • TCP/IP for WWW • Can we have a standard/framework? • Can it be easier?

  11. Questions?

  12. References • [1] J Tateson and I W Marshall,In Willig Karl and Wolisz, editors, A Novel Mechanism for Routing in Highly Mobile Ad-hoc Sensor Networks, Wireless Sensor Networks, number 2920 in LNCS, pages 204-218. 2004. • [2] K. Akkaya and M. Younis, "A Survey of Routing Protocols in Wireless Sensor Networks, " in the Elsevier Ad Hoc Network Journal, Vol 3/3 pp. 325-349, 2005 • [3] W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive protocols for information dissemination in wireless sensor networks,” in the Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’99), Seattle, WA, August 1999. • [4] R. Shah and J. Rabies, "Energy Aware Routing for Low Energy Ad Hoc Sensor Networks", in the Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), Orlando, FL, March 2002. • [5] Y. Yu, D. Estrin, and R. Govindan, “Geographical and Energy-Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks,” UCLA Computer Science Department Technical Report, UCLA-CSD TR-01-0023, May 2001. Thank you!

More Related