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
Security-aware ad hoc routing for wireless networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A Secure Routing Protocol for Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Rushing attacks and defense in wireless ad hoc network routing protocols
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Black hole attack in mobile Ad Hoc networks
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
A Novel Gray Hole Attack Detection Scheme for Mobile Ad-Hoc Networks
NPC '07 Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops
Cryptographic Versus Trust-based Methods for MANET Routing Security
Electronic Notes in Theoretical Computer Science (ENTCS)
WAP: Wormhole Attack Prevention Algorithm in Mobile Ad Hoc Networks
SUTC '08 Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008)
Stationary Distributions for the Random Waypoint Mobility Model
IEEE Transactions on Mobile Computing
TIGR in Iraq and Afghanistan: network-adaptive distribution of media rich tactical data
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Routing security in wireless ad hoc networks
IEEE Communications Magazine
Wormhole attacks in wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We present a new approach to secure routing in mobile ad-hoc networks based solely on the relative transmission times of overhead packets. Unlike most previous works aimed at securing route computation, we eliminate a key vulnerability (explicitly stated routing metrics) altogether. We introduce the Secure Time-Ordered routing Protocol (STOP), which uses time-based orderings to ensure the establishment of multiple loop-free paths between a source and a destination. STOP is the first routing protocol to use performance-based path selection without source routing, path vectors, or complete topology information, making it far more efficient that similar approaches. We prove that adversaries cannot take any action to manipulate the time-based ordering so as to unfairly gain control of the forwarding topology and, by design, nodes which drop data packets will be avoided. Furthermore, at convergence, traffic load is evenly distributed over the well-performing paths, so adversaries cannot gain complete control over the data flow through temporary good behavior. Simulation results show that the countermeasures in STOP are effective against a variety of attacks from independent and colluding adversaries, and that this improved security does not come at the expense of routing performance.