On the Maximum Throughput of Multiple-Path Transmission via Irreducible and Neighbor-Disjoint Paths in Multiple-Hop Wireless Networks

In this paper, we discuss the intra- and inter-path interference problems of multiple-path transmission in multiple-hop wireless networks, and show that classical node-disjoint paths are highly sensible to these problems, thus incapable of providing ideal throughput for multiple-path transmission. To tackle the problems, this paper gives a detailed analysis to the intra- and inter-path interference problems based on graph theory. Being aware that node-disjoint ness is no longer adequate to describe the properties of paths that are capable to provide the maximum throughput for multiple-path transmission, the new concepts of irreducible and neighbor-disjoint paths are proposed. Via detailed discussion, the theoretical upper bound of throughput achievable by multiple-path transmission via irreducible and neighbor-disjoint paths with at least 3 hops is given. It´s proved that, by using irreducible and neighbor-disjoint paths, multiple-path transmission is capable to achieve near capacity throughput.