Name
Abstract | ||
|---|---|---|
The IEEE 802.16 standard uses Orthogonal Frequency Division Multiple Access (OFDMA) for mobility support. Therefore, the medium access control frame extends in two dimensions, i.e., time and frequency. At the beginning of each frame, i.e., every 5 ms, the base station is responsible both for scheduling packets, based on the negotiated quality of service requirements, and for allocating them into the frame, according to the restrictions imposed by 802.16 OFDMA. To break down the complexity, a split approach has been proposed in the literature, where the two tasks are solved in separate and subsequent stages. In this paper we focus on the allocation task alone, which is addressed in its full complexity, i.e., by considering that data within the frame must be allocated as bursts with rectangular shape, each consisting of a set of indivisible sub-bursts, and that a variable portion of the frame is reserved for in-band signaling. After proving that the resulting allocation problem is NP-hard, we develop an efficient heuristic algorithm, called Recursive Tiles and Stripes (RTS), to solve it. RTS, in addition to handle a more general problem, is shown to perform better than state-of-the-art solutions via numerical analysis with realistic system parametrization. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/TNET.2013.2282965 | IEEE/ACM Transactions on Networking (TON) |
Keywords | DocType | Volume |
Resource management,IEEE 802.16 Standards,Downlink,Shape,Quality of service,OFDM,Complexity theory | Conference | 22 |
Issue | ISSN | ISBN |
5 | 1063-6692 | 978-1-4244-5836-3 |
Citations | PageRank | References |
8 | 0.57 | 12 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Cicconetti | 1 | 233 | 18.53 |
| L. Lenzini | 2 | 596 | 66.46 |
| A. Lodi | 3 | 13 | 1.69 |
| Silvano Martello | 4 | 2362 | 218.73 |
| Enzo Mingozzi | 5 | 1055 | 100.39 |
| M. Monaci | 6 | 54 | 4.26 |