Secure multi-path data deliver in sensor networks

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 multi-path 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.

在网络通信中，拜占庭攻击，即由丢包和欺骗（修改数据包）导致的攻击，通常很难防范。最近已经提出了几种多路径数据包路由方案，以恢复由于丢包（由路径故障或攻击引起）而丢失的数据包，但尚未提出有效的解决方案来应对欺骗攻击。为此，我们在多路径路由中提出了一种新方法，以提高对拜占庭攻击的抵御能力。在我们的方法中，我们提出了一种基于普吕弗数的多路径源路由方案，该方案允许接收方识别丢包路径。我们还提出了一种基于里德 - 所罗门纠错编码方案的多路径编码方案，该方案允许接收方识别欺骗路径。如果使用（n；k）RS编码方案，我们的v（≥3）节点不相交路径路由方案对t =（n - k）/ 2条故障路径具有弹性，即最多可以识别t条故障路径，并且可以恢复原始消息。我们的方案不涉及源和目的地之间的交互通信。此外，我们提出了一种路径选择方案，使节点能够选择最可靠的路径（隔离故障节点）来传输数据。我们的稳健性分析还讨论了使用单路径路由和多路径路由之间的权衡。