GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Towards resilient geographic routing in WSNs
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
A Secure Routing Protocol for Wireless Ad Hoc Networks
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
Trust Establishment In Pure Ad-hoc Networks
Wireless Personal Communications: An International Journal
Security in wireless sensor networks: Research Articles
Wireless Communications & Mobile Computing
EAGR: Energy Aware Greedy Routing in Sensor Networks
FGCN '07 Proceedings of the Future Generation Communication and Networking - Volume 02
Energy-Efficient Geographic Relay for Ad-Hoc Wireless Networks
IIH-MSP '07 Proceedings of the Third International Conference on International Information Hiding and Multimedia Signal Processing (IIH-MSP 2007) - Volume 01
A survey of routing attacks in mobile ad hoc networks
IEEE Wireless Communications
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Self-Adjustable Trust-Based Energy Efficient Routing for Smart Grid Systems
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Hi-index | 0.00 |
Efficient defense against security attacks is a challenging task in the wireless sensor network environment. Although significant research effort has been spend on the design of trust models to detect malicious nodes based on direct and indirect evidence, this comes at the cost of additional energy consumption. The situation is further aggravated as the next generation wireless sensor network will be larger and larger. To face this problem, we propose a secure routing protocol (Ambient Trust Sensor Routing, ATSR) which adopts the geographical routing principle to cope with the network dimensions and relies on a distributed trust model for the detection of malicious nodes. Both direct and indirect trust information is taken into account to evaluate the trustworthiness of each neighbour. An important feature of the proposed routing solution is that it takes into account the remaining energy of each neighbour, thus allowing for better load balancing and network lifetime extension. Based on computer simulation results we evaluate the additional energy consumption caused by the exchange of indirect trust information and the benefits stemming from the adoption of our algorithm.