Trust-based backpressure routing in wireless sensor networks Online publication date: Sun, 22-Feb-2015
by Revathi Venkataraman; Scott Moeller; Bhaskar Krishnamachari; T. Rama Rao
International Journal of Sensor Networks (IJSNET), Vol. 17, No. 1, 2015
Abstract: In this paper, we apply a vector autoregression (VAR) based trust model over the backpressure collection protocol (BCP), a collection mechanism based on dynamic backpressure routing in wireless sensor networks (WSNs). The backpressure scheduling is known for being throughput optimal. In the presence of malicious nodes, the throughput optimality no longer holds. This affects the network performance in collection tree applications of sensor networks. We apply an autoregression based scheme to embed trust into the link weights, so that the trusted links are scheduled. We have evaluated our work in a real sensor network testbed and shown that by carefully setting the trust parameters, substantial benefit in terms of throughput can be obtained with minimal overheads. Our results show that even when 50% of network nodes are malicious, VAR trust offers approximately 73% throughput and ensures reliable routing, with a small trade-off in the end-to-end packet delay and energy consumptions.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook