This preview shows page 1. Sign up to view the full content.
Unformatted text preview: h other Push: Push packet to one of the neighbors Forward: Forward packet to one of the parents Forwarding Probability: Included in the packet header and used to probabilistically select whether to push or forward Reputation History: Each node keeps this information for each of its parents and neighbors Convergence: Prevents multiple packets of the same event being sent to same source of failure ARRIVE Achieves diversity in paths in two ways: Upon receiving a packet, the next hop is selected probabilistically based on link reliability and node reputation When more than two or more packets of the same event are processed, these packets are ensured to follow different outgoing links Takes advantage of passive participation and needs to be used cautiously Each nodes keeps the following information: Level Neighbors list Parents list Reputation history of neighbors and parents Convergence history of specific events ARRIVE
Assumptions The networks is assumed to be dense enough that sufficient multiplicity of paths between sources and sink for algorithm to perform well The network is almost considered as a static network Sensors are considered to have a low per-node cost Routes used by the packets are unlikely to be optimal due to the probabilistic nature of the algorithm Messages flow from nodes to sink, not the other way around There is only one sink available Performance Metrics Event delivery ratio Three other metrics measuring the cost of deploying ARRIVE ARRIVE
View Full Document
- Spring '08