Abstract:
Multi-Packet Reception (MPR) enables simultaneous receptions from different transmitters to a single receiver, which has been demonstrated to bring capacity improvement i...Show MoreMetadata
Abstract:
Multi-Packet Reception (MPR) enables simultaneous receptions from different transmitters to a single receiver, which has been demonstrated to bring capacity improvement in wireless network. However, MPR does not improve the transmission capability of intermediate relay nodes in a multi-hop routing and thus these nodes may become the bottlenecks for increasing throughput despite of great reception capability. We investigate the scheduling for multi-hop routing with MPR to improve the network throughput under multiple data flows. We formulate the optimization problem under K-MPR model and analyze the performance upper bound with ideal scheduling. We propose a distributed scheduling scheme based on a k-Connected k-Dominating Set backbone to eliminate bottleneck effects on intermediate relay nodes as to enhance the network throughput. We show the effectiveness of our scheme by comparing its performance with the upper bound and node-disjoint routing.
Date of Conference: 05-09 June 2011
Date Added to IEEE Xplore: 28 July 2011
ISBN Information: