Lecture5-Feb4-routing

Lecture5 feb4 routing

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Routing in Sensor Networks Sensor Networks vs. Ad hoc Networks Higher number of sensor nodes (several orders of magnitude) Dense deployment Prone to failures Limited in power, computation and memory May not have global identification (ID) due to high overhead and the total number of sensors Deployment: Randomly Pre-determined or engineered Sensor Networks Preliminaries For large scale environment monitoring applications, dense sensor networks are mainly used Sensing capabilities should be distributed and coordinated amongst the sensor nodes Algorithms deployed should be localized since transmissions between large distances are expensive and lowers networks life time These networks should be self-configuring, scalable, redundant and robust during topology changes Algorithm for Robust Routing in Volatile Environments (ARRIVE) [Karlof+ 2002] Probabilistic algorithm and makes packet forwarding decisions based on localized information Based on a tree-like topology rooted at the sink of the network Uses forward approach to contribute to end-to-end reliability Avoids packet loss by sending multiple packets of the single event Three sources of packets loss expected: Isolated link Patterned node failures Malicious or misbehaving nodes ARRIVE Terminology Event: Identified by [SourceID, EventID] Level: Each node has unique level indicating distance from source to sink (in terms of hops) Parents: Nodes one level closer to the sink Neighbors: Nodes on the same level and be able hear eac...
View Full Document

Ask a homework question - tutors are online