The Community for Technology Leaders
Green Image
Issue No. 07 - July (2011 vol. 22)
ISSN: 1045-9219
pp: 1206-1213
Wei Shu , University of New Mexico, Albuquerque
Sudharman K. Jayaweera , University of New Mexico, Albuquerque
Jorge Crichigno , Northern New Mexico College, Española
Min-You Wu , Shanghai Jiao Tong University, Shanghai
ABSTRACT
Recent advances in the physical layer have enabled the simultaneous reception of multiple packets by a node in wireless networks. We address the throughput optimization problem in wireless networks that support multipacket reception (MPR) capability. The problem is modeled as a joint routing and scheduling problem, which is known to be NP-hard. The scheduling subproblem deals with finding the optimal schedulable sets, which are defined as subsets of links that can be scheduled or activated simultaneously. We demonstrate that any solution of the scheduling subproblem can be built with \vert E\vert + 1 or fewer schedulable sets, where \vert E\vert is the number of links of the network. This result is in contrast with previous works that stated that a solution of the scheduling subproblem is composed of an exponential number of schedulable sets. Due to the hardness of the problem, we propose a polynomial time scheme based on a combination of linear programming and approximation algorithm paradigms. We illustrate the use of the scheme to study the impact of design parameters on the performance of MPR-capable networks, including the number of transmit interfaces, the beamwidth, and the receiver range of the antennas.
INDEX TERMS
Wireless networks, multihop, multipacket reception, directional antennas, NP-hard.
CITATION
Wei Shu, Sudharman K. Jayaweera, Jorge Crichigno, Min-You Wu, "Throughput Optimization in Multihop Wireless Networks with Multipacket Reception and Directional Antennas", IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 1206-1213, July 2011, doi:10.1109/TPDS.2010.202
93 ms
(Ver )