Secure multipath routing in wireless multihop networks based on erasure channel modeling

Multipath routing can offer various advantages for wireless multihop networks. Among these advantages, in this paper, we focus on secure multipath routing using the notion of the information-theoretic security. The rate allocation problem for multipath routing is considered to maximize the throughput from a source node to a destination node with information-theoretic security constraints as a linear optimization problem. We also perform an asymptotic analysis to see whether or not multipath routing (with equal rate allocation) could be secure in terms of the information-theoretic security point of view.