Name
Title | ||
|---|---|---|
A joint routing and scheduling scheme for wireless networks with multi-packet reception and directional antennas |
Abstract | ||
|---|---|---|
In this paper, we present a linear programming formulation for the throughput optimization problem in wireless networks that support multi-packet reception (MPR) capability. The formulation takes into account the use of both directional and omni-directional antennas as well as the use of multiple transmitter interfaces per node. The joint routing and scheduling problem is decoupled into routing and scheduling subproblems. We show that the scheduling subproblem is intractable, and propose a polynomial time scheduling algorithm to solve it. We further demonstrate that, for certain type of networks, the completion time of the scheduling algorithm is at most two times the completion time of the the optimal scheduler, which is unknown. We use the proposed scheme for a preliminary study of several design parameters on the performance of MPR-capable networks, including the number of interfaces, the MPR capability and the beamwidth of the antennas. In this paper, we present a linear programming formulation for the throughput optimization problem in wireless networks that support multi-packet reception (MPR) capability. The formulation takes into account the use of both directional and omni-directional antennas as well as the use of multiple transmitter interfaces per node. To simplify the problem, we decompose it into routing and scheduling subproblems. The routing subproblem is solved by using linear programming. For the scheduling subproblem, we propose a heuristic al- gorithm, which is shown to be a factor two optimal under certain conditions. The remainder of this paper is organized as follows. Section II discusses related work. Section III presents background terminology used in the paper, and defines the feasibility conditions for link scheduling in MPR-capable networks. Section IV formulates the throughput optimiza- tion problem in MPR networks as a joint routing and link scheduling problem, and Section V presents a polynomial time heuristic to approximate to the optimal solution. Section VI shows numerical results, and Section VII concludes and discusses our future work. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/WOWMOM.2009.5282471 | WoWMoM |
Keywords | Field | DocType |
linear programming,transmitters,wireless networks,wireless network,scheduling problem,throughput,directional antennas,schedules,directional antenna,polynomial time,scheduling algorithm,routing,linear program,optimization problem,polynomials | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Scheduling (computing),Computer network,Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-4244-4439-7 | 3 | 0.52 |
References | Authors | |
15 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jorge Crichigno | 1 | 168 | 14.41 |
| Min-you Wu | 2 | 1600 | 140.81 |
| Joud Khoury | 3 | 17 | 5.43 |
| Wei Shu | 4 | 669 | 61.88 |