Resource Allocation Method for Improving Energy Efficiency and Receiver Fairness in Wireless Networks 


Vol. 40,  No. 5, pp. 826-832, May  2015


PDF
  Abstract

In wireless networks, it is important to guarantee the energy efficiency and receiver fairness for satisfying service provider and customer at the same time. In this paper, we propose a resource allocation algorithm which improves energy efficiency as well as receiver fairness based on optimization techniques. In the proposed algorithm, subchannel and power are allocated to receivers iteratively in the consideration of channel state information, amount of dissipated power, and receiver rate, in order to improve energy efficiency and receiver fairness. Through simulation, we show the effectiveness and superiority of the proposed algorithm in terms of energy efficiency and receiver fairness.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Lee, D. Cho, B. C. Chung, "Resource Allocation Method for Improving Energy Efficiency and Receiver Fairness in Wireless Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 5, pp. 826-832, 2015. DOI: .

[ACM Style]

Kisong Lee, Dong-Ho Cho, and Byung Chang Chung. 2015. Resource Allocation Method for Improving Energy Efficiency and Receiver Fairness in Wireless Networks. The Journal of Korean Institute of Communications and Information Sciences, 40, 5, (2015), 826-832. DOI: .

[KICS Style]

Kisong Lee, Dong-Ho Cho, Byung Chang Chung, "Resource Allocation Method for Improving Energy Efficiency and Receiver Fairness in Wireless Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 5, pp. 826-832, 5. 2015.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880