Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Error-Control Coding for Data Networks
Error-Control Coding for Data Networks
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Location-aware key management scheme for wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Analysis of multipath Routing-Part I: the effect on the packet delivery ratio
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
In network communication, Byzantine attacks, i.e., attacks in consequence of the packet dropping and cheating (modified packets), are usually difficult to guard against. Several multi-path packet routing schemes have been recently proposed to recover lost packets on account of the packet dropping (caused by path failures or attacks), but no effective solutions have been proposed to counter cheating attacks. To this end, we propose a novel approach in multi-path routing to improve resilience to Byzantine attacks. In our approach, we present a multipath source routing scheme based on Prüfer number which allows the receiver to identify packet dropping paths. We also propose a multi-path coding scheme based on Reed-Solomon error-correcting coding scheme which allows the receiver to identify paths that cheat. If (n, k) RS coding scheme is used, our v(≥ 3) node-disjoint paths routing scheme is resilient to t = (n-k)/2 faulty paths, i.e., up to t faulty paths can be identified and the original message can be recovered. Our scheme does not involve interactive communications between the source and the destination. Additionally, we propose a path selection scheme which enables a node to select the most reliable paths (isolating faulty nodes) to transmit data. Our robustness analysis also discusses the tradeoffs between using the single path routing and multi-path routing.