Shortest Path Minded SPIN Protocol.pdfVIP

1Routing/Data Dissemination in Wireless Sensor Networks Presented by Kalyani Komarasetti Computer Science, WMU Spring 2004 Outline ! Introduction ! Flooding ! Gossiping ! SPIN ! Shortest Path Minded SPIN Protocol ! Directed Diffusion ! LEACH ! TTDD ! SER ! Romer’s Algorithm ! Comparison of routing protocols ! Conclusion Wireless Sensor Network ! A wireless sensor network refers to a group of sensors, or nodes, linked by a wireless medium to perform distributed sensing tasks ? How Sensor Networks differ from Traditional Networks? –sensor networks have severe energy constraints –redundant low-rate data –many-to-one flows –sensor networks are data-centric, unlike traditional networks which are address-centric 2Communication Architecture Internet and Satellite Sink Task manager node User Sensor nodes Sensor field A B C D E Design Factors ! Fault Tolerance the ability to sustain sensor network functionalities without any interruption due to sensor node failures because of lack of power, physical damage, or environmental interference. ! Scalability the density of sensor nodes can range from few sensor nodes to few hundred sensor nodes in a region. ! Production Costs the cost of sensor node should be much less than $1 in order for the sensor network to be feasible ! Environment can work in different environments. ! Transmission Media links between nodes can be formed by radio, infrared, or optical media. ! Power Consumption battery lifetime design of power-aware protocols and algorithms Power consumption: sensing, communication, and data processing Continue.. Design Factors 3Why Separate Routing Protocols? ! Traditional routing protocols cannot be used for sensor networks as they focus on avoiding congestion or maintaining connectivity when faced with mobility and not on limited energy supply ! Challenges ! Energy-limited nodes ! Computation ! Aggregate data ! Suppress redundant information ! Communication ! Bandwidth limited Routing Techniques (Network Layer)