Routing protocol on wireless sensor network

  • View
    2.005

  • Download
    0

Embed Size (px)

DESCRIPTION

 

Transcript

  • 1. Router protocol on wireless sensor network Yuping SUN 155169552@163.com SOFTWARE ENGINEERING LABORATORY Department of Computer Science, Sun Yat-Sen University
  • 2. Outline
    • WSN Introduction
      • The definition of WSN
      • The nodes of WSN
      • The difference between WSN and Ad hoc
    • WSN Routing Protocol
    • Conclusion
    • Reference
  • 3. The definition of WSN
    • Definition[1]:
      • consist of large amount of sensor nodes
      • Multi-hop, self-organize
      • wireless communication
      • cooperative sensing, collection, process
      • Send to observe.
      • [1] , , . . , 2003 (10) : 1717- 1725
  • 4. the nodes of WSN
  • 5. The difference between WSN and Ad hoc (1/2)[1]
    • The number of nodes
    • Sensor nodes are densely deployed
    • Sensor nodes are prone to failures
    • The topology of a sensor network changes very frequently
    [1]Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci Georgia Institute of Technology A Survey on Sensor Networks IEEE Communications Magazine August 2002
  • 6. The difference between WSN and Ad hoc (2/2)[1]
    • WSN broadcast but ad hoc point-to point
    • Sensor node are limited in power computation capacities and memory
    • Sensor nodes may not have global identification
  • 7. Outline
    • WSN Introduction
      • The definition of WSN
      • The nodes of WSN
      • The difference between WSN and Ad hoc
    • WSN Routing Protocol
    • Conclusion
    • Reference
  • 8. Routing protocol survey
    • Traditional technique
    • Flooding
    • Gossiping
    • Current routing technique
    • Flat-routing
    • Hierarchical-routing
    • Location-based routing
    [1]Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci Georgia Institute of Technology A Survey on Sensor Networks IEEE Communications Magazine August 2002
  • 9. Flooding(1/2)
    • A classical mechanisms to relay data in sensor networks without the need for any routing algorithms and topology maintenance.
    • drawbacks:
      • Implosion
      • Overlap
      • Resource blindness
  • 10. Flooding(2/2)
  • 11. Gossiping
    • A slightly enhanced version of flooding where the receiving node sends the packet to a randomly selected neighbor which picks another neighbor to forward the packet to and so on.
    • Advantage: avoid the implosion
    • Drawback: Transmission delay
  • 12. Router protocol survey
    • Traditional routing technique
      • Flooding
      • Gossiping
    • Current routing technique[1]
      • Flat-routing
      • Hierarchical-routing
      • Location-based routing
    [1]JAMAL N. AL-KARAKI, AHMED E. KAMAL, ROUTING TECHNIQUES IN WIRELESS SENSOR NETWORKS: A SURVEY , IEEE Wireless Communications December 2004
  • 13. Flat-routing
    • SPIN (Sensor Protocols for Information via Negotiation)
    • DD (Directed diffusion)
    • Rumor routing
  • 14. SPIN(1/3)[1]
    • A family of adaptive protocols called Sensor Protocols for Information via Negotiation
    • assign a high-level name to completely describe their collected data (called meta-data)
    • Use thee types of messages ADV (advertisement), REQ (request) and DATA
    [1]W. Heinzelman, J. Kulik, and H. Balakrishnan, Adaptive Protocols for Information Dissemination in Wireless Sensor Networks, Proc. 5 th ACM/IEEE Mobicom , Seattle, WA, Aug. 1999. pp. 17485.
  • 15. SPIN(2/3)
  • 16. SPIN(3/3)
    • Topological changes are localized
    • provides more energy savings than flooding, and metadata negotiation almost halves the redundant data.
    • Drawback: SPINs data advertisement mechanism cannot guarantee delivery of data.
  • 17. Flat-routing
    • SPIN (Sensor Protocols for Information via Negotiation)
    • DD (Directed diffusion)
    • Rumor routing
  • 18. DD(1/3)[1]
    • Propagate interest
    • Set up gradients
    • Send data and path reinforcement
    [1]C. Intanagonwiwat, R. Govindan, and D. Estrin, Directed Diffusion: a Scalable and Robust Communication Paradigm for Sensor Networks, Proc. ACM Mobi- Com 2000 , Boston, MA, 2000, pp.5667.
  • 19. DD(2/3)
  • 20. DD(3/3)
    • Directed diffusion differs from SPIN in two aspects.
      • Query method
      • Communication method
    • directed diffusion may not be applied to applications (e.g., environmental monitoring)
    • Matching data to queries might require some extra overhead
  • 21. Flat-routing
    • SPIN (Sensor Protocols for Information via Negotiation)
    • DD (Directed diffusion)
    • Rumor routing
  • 22. Rumor routing[1]
    • A variation of directed diffusion
    • Use an events table and a agent
    • The number of events is small and the number of queries is large
    [1]D. Braginsky and D. Estrin, Rumor Routing Algorithm for Sensor Networks, Proc. 1st Wksp. Sensor Networks and Apps. , Atlanta, GA, Oct. 2002.
  • 23. Rumor routing
  • 24. Router protocol survey
    • Traditional routing technique
    • Flooding
    • Gossiping
    • Current routing technique
    • Flat-routing
    • Hierarchical-routing
    • Location-based routing
  • 25. Hierarchical-routing
    • LEACH (Low Energy Adaptive Clustering Hierarchy )
    • PEGASIS (Power-Efficient Gathering in Sensor Information Systems)
    • TEEN(APTEEN) (Threshold-Sensitive Energy Efficient Protocols)