An Energy Saving Mechanism for the Green Radio Base Station
Date Issued
2012
Date
2012
Author(s)
Tung, Chien-Te
Abstract
To satisfy the growing demands in the quality of services of wireless users, future 4-th generation (4G) communication systems are expected to embrace the concept of the multiple component carriers. Though the minimum service requirement can be better maintained in the rush hours with multiple component carriers, the energy consumption due to the use of additional component carriers beyond primary component carrier may be wasted in non-rush hours. However, the traditional radio resource allocation problem focuses only on optimizing the dynamic transmission power and the system performance. As a result, the key related power optimization problem remains unsolved.
In this thesis, we consider a cellular system with dual component carriers. We allow the system to dynamically turn on and turn off the secondary component carrier according to the traffic load while maintain the users’ quality of service. Besides, we also compare two traditional allocation approaches, discussing their advantages and disadvantages, and show how to utilize them into green radio base stations with multiple carriers.
Simulation results show that our energy-saving wireless system can successfully satisfy the users’ minimum capacity requirement, while both the blocking probability and fairness of the system can also be maintained at an acceptable level. Most importantly, we employ two different non-homogeneous Poisson arrival processes to test the energy-saving wireless system, and simulation results show that our system saves more than 40 percent than the system without carrier activation algorithm in two different scenarios, if the ratio of heavy traffic hours and light traffic hours is about 1:1.
Subjects
multiple carriers green radio base station
resource allocation
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-101-R99942051-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):4660c046bfe9f5de8d17e030fc9cf383
