LoboVault Home
 

Throughput optimization in MPR-capable multi-hop wireless networks

LoboVault

Please use this identifier to cite or link to this item: http://hdl.handle.net/1928/10337

Throughput optimization in MPR-capable multi-hop wireless networks

Show full item record

Title: Throughput optimization in MPR-capable multi-hop wireless networks
Author: Crichigno, Jorge
Advisor(s): Shu, Wei
Committee Member(s): Wu, Min-You
Ghani, Nasir
Jordan, Ramiro
Department: University of New Mexico. Dept. of Electrical and Computer Engineering
Subject(s): Wireless networks
Multi-packet reception
Multi-access channel
Convex optimization
LC Subject(s): Wireless communication systems.
Packet switching (Data transmission)
Routing (Computer network management)
Computer scheduling.
Multiple access protocols (Computer network protocols)
Degree Level: Doctoral
Abstract: Recent advances in the physical layer have enabled the simultaneous reception of multiple packets by a node in wireless networks. This capability has the potential of improving the performance of multi-hop wireless networks by a logarithmic factor with respect to current technologies. However, to fully exploit multiple packet reception (MPR) capability, new routing and scheduling schemes must be designed. These schemes need to reformulate a historically underlying assumption in wireless networks which states that any concurrent transmission of two or more packets results in a collision and failure of all packet receptions. In this work, we present a generalized model for the throughput optimization problem in MPR-capable multi-hop wireless networks. The formulation incorporates not only the MPR protocol model to quantify interference, but also the multi-access channel. The former is related with the MAC and routing layers, and considers a packet as the unit of transmission. The latter accounts for the achievable capacity of links used by simultaneous packet transmissions. The problem is modeled as a joint routing and scheduling problem. The scheduling subproblem deals with finding the optimal schedulable sets, which are defined as subsets of links that can be scheduled or activated simultaneously. Among other results, we demonstrate that any solution of the scheduling subproblem can be built with |E| + 1 or fewer schedulable sets, where |E| is the number of links of the network. This result contrasts with a conjecture that states that a solution of the scheduling subproblem, in general, is composed of an exponential number of schedulable sets. The model can be applied to a wide range of networks, such as half and full duplex systems, networks with directional and omni-directional antennas with one or multiple transmit antennas per node. Due to the hardness of the problem, we propose several polynomial time schemes based on a combination of linear programming, approximation algorithm and greedy paradigms. We illustrate the use of the proposed schemes to study the impact of several design parameters such as decoding capability and number of transmit antennas on the performance of MPR-capable networks.
Graduation Date: December 2009
URI: http://hdl.handle.net/1928/10337

Files in this item

Files Size Format View
final.pdf 1.951Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record

UNM Libraries

Search LoboVault


Advanced Search

Browse

My Account