Measuring the cost of deploying arrive arrive

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: hm Description Bread first search rooted at sink is used to initialize level, parents, neighbors state information at each node When a nodes hears a packets, it checks to see if the packet is addressed for it If so, threshold processing takes place. Nodes are filtered by their reputation and convergence history of the neighbors and parents A decision needs to be made to either to choose to forward the packet to a parent or push it to one of its neighbors with the probability value found in the packet header. This is randomly determined by the forwarding probability function Pr(f). Each node is weighed by their reputation. The destination is randomly selected from the rest of the nodes (since bad reputation nodes are eliminated) If the the packet is forwarded to one of the parents, Pr(f) is not changed; however, its value is increased ARRIVE Advantages: High end-to-end reliability Provides security by eliminating the compromised or malicious nodes By using multiple paths to forward the same event, the probability of the event reaching sink is increased and this also ensures to avoid packets being forwarded to the same broken link Reputation history assists in establishing a reliable path ARRIVE Disadvantages: Extra power consumption for inactive nodes (passive listeners) are not considered Better mechanism to take care problems caused by passive listening There is only one sink, packets are sent from sources to sink and not the other way around Sensor may have storage prob...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online