Date Added: Mar 2010
This paper covers the first seven months of the progress towards the completion of SARP. In particular, the authors begin with stating the problem space, assumptions about sensor network deployment, and the attacks they considered. Next the authors in great detail explain the trust framework including the multi-dimensional trust metrics, mathematical quantification of trust, initialization and dynamic forgetting. The authors present a distributed, dynamic, efficient treebased routing algorithm that uses the multi-dimensional trust-metrics in order to find the most trusted paths. The integration of the algorithm and trust framework including how new routes are formed avoiding the suspected nodes (less trusted nodes) are explained in great detail.