Name
Abstract | ||
|---|---|---|
Resource management in wireless networks is an important issue because of the scarceness of communication resource. So optimization schemes for efficient resource usage have been extensively researched. Throughput maximization under the condition of limited total power or power minimization under the condition of minimum bit rate are usually considered objective in many papers. These researches focused on the power allocation, but they did not consider time slot allocation which can be also used to improve the efficiency. In this paper, we introduce a time slot allocation problem for multiuser wireless networks to achieve minimum rate guarantee under the condition of fixed total power. We solve the allocation problem by using dynamic programming method, which has the complexity of O(K3) where K is the number of users. This complexity is lower than the nonpolynomial complexity of exhaustive searching for the optimal solution. The performance of our proposed algorithm is compared with that of the water-filling algorithm. An advantage of using the time slot optimization approach is that it can support high mobility users with QoS requirements. From simulation results, we demonstrate that our proposed algorithm shows better performance than a conventional scheme that does not use any time slot allocation. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/WCNC.2004.1311439 | WCNC |
Keywords | Field | DocType |
multiuser wireless networks,optimisation,minimum bit rate,quality of service,power minimization,optimal time slot allocation,computational complexity,resource management,mobile radio,telecommunication network management,nonpolynomial complexity,optimization schemes,dynamic programming,qos requirements,water-filling algorithm,dynamic programming method,water filling algorithm,wireless network,computer science,ofdm,scheduling algorithm,wireless networks,exhaustive search,throughput | Resource management,Wireless network,Dynamic programming,Computer science,Scheduling (computing),Computer network,Water filling algorithm,Real-time computing,Throughput,Orthogonal frequency-division multiplexing,Distributed computing,Computational complexity theory | Conference |
Volume | ISSN | ISBN |
4 | 1525-3511 | 0-7803-8344-3 |
Citations | PageRank | References |
3 | 0.70 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Neung-hyung Lee | 1 | 34 | 5.64 |
| Keun Chul Hwang | 2 | 15 | 2.38 |
| Saewoong Bahk | 3 | 1024 | 112.58 |
| Kwang Bok Lee | 4 | 1249 | 128.45 |