ACM Transactions on Computer Systems (TOCS)
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Securing ad hoc routing protocols
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
An on-demand secure routing protocol resilient to byzantine failures
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Towards provable security for ad hoc routing protocols
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Wireless device identification with radiometric signatures
Proceedings of the 14th ACM international conference on Mobile computing and networking
Operational semantics of security protocols
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
Secure routing for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
MoteAODV – an AODV implementation for TinyOS 2.0
WISTP'10 Proceedings of the 4th IFIP WG 11.2 international conference on Information Security Theory and Practices: security and Privacy of Pervasive Systems and Smart Devices
Adversarial attacks against intrusion detection systems: Taxonomy, solutions and open issues
Information Sciences: an International Journal
| Hi-index | 0.00 |
Mobile ad-hoc networks are becoming ever more popular due to their flexibility, low cost, and ease of deployment. However, to achieve these benefits the network must employ a sophisticated routing protocol. Early proposed routing protocols were not designed to operate in the presence of attackers. There have been many subsequent attempts to secure these protocols, each with its own advantages and disadvantages. To allow for a comparison of these secure protocols, a single common attacker model is needed. Our first contribution in this work is to develop a comprehensive attacker model categorizing attackers based on their capabilities. This is in contrast to the existing models which seek to categorize attacks and then map that categorization back onto the attackers. Our second contribution is an analysis of the SAODV routing protocol using our new model, which demonstrates the structured approach inherent in our model and its benefits compared to existing work.