Araştırma Makalesi

Performance of History-based Water-Filling Algorithm for Energy-Efficient Data Transmission over Different Fading Channels

Sayı: 41 30 Kasım 2022
PDF İndir
TR EN

Performance of History-based Water-Filling Algorithm for Energy-Efficient Data Transmission over Different Fading Channels

Abstract

In this paper, we tackle a resource allocation problem over multiple fading channels in wireless networks. This problem is investigated in two ways. First, we consider the problem over the whole multiple fading channels altogether with no power constraint. We look for an optimal solution for this problem by considering an offline waterfillling algorithm. Then, we also propose history-based online waterfilling algorithms for this problem. This online algorithm uses the history partially in order to determine a waterfilling level based on that part of history. Then, the online policy applies this history-based determined waterfilling level to transmit data over the time horizon of the problem. The relative performance of the online and offline policies is evaluated for various types of fading channels (Rayleigh, Rician, Nakagami, Weibull) over various time horizons. The numerical results demonstrate these online waterfilling algorithms shows close performance to offline waterfilling algorithms especially for longer time horizons and by using larger portions of history.

Keywords

Kaynakça

  1. Ajitsinh. N., Jadhav and Sakib. R. Mujawar. (2017). Different power loading allocation schemes for ofdm based cognitive radio system. International Journal of Latest Trends in Engineering and Technology, 8 (1), 350-359.
  2. Boyd, S. and Vandenberghe, L. (2004). Convex Optimization. Cambridge University Press.
  3. Cover, T. and Thomas, J. (2006). Elements of Information Theory, 2nd Edition. Wiley&Sons.
  4. Dai, M., Zhang S., Chen, B., Lin, X., &Wang, H. (2014). A refined convergence condition for iterative waterfilling algorithm. IEEE Communications Letters, 18(2), 269-272.
  5. Elgarhy O. and Reggiani L., "Application of the Water Filling Algorithm to the Sum Rate Problem with Minimum Rate and Power Constraint," 2018 Advances in Wireless and Optical Communications (RTUWO), 2018, pp. 12-16.
  6. Gai, Y.& Krishnamachari, B. (2012). Online Learning Algorithms for Stochastic Water-Filling. IEEE Information Theory and Applications Workshop (ITA), 1-6.
  7. Goldsmith, A. (2005). Wireless Communications. Cambridge University Press.
  8. Goldsmith, A., &Varaiya, P. P. (1996). Capacity, mutual information, and coding for finite-state Markov channels. IEEE Transactions on Information Theory, 42 (3), 868-886.

Ayrıntılar

Birincil Dil

İngilizce

Konular

Mühendislik

Bölüm

Araştırma Makalesi

Yayımlanma Tarihi

30 Kasım 2022

Gönderilme Tarihi

3 Mayıs 2022

Kabul Tarihi

13 Ekim 2022

Yayımlandığı Sayı

Yıl 2022 Sayı: 41

Kaynak Göster

APA
Gul, O. M. (2022). Performance of History-based Water-Filling Algorithm for Energy-Efficient Data Transmission over Different Fading Channels. Avrupa Bilim ve Teknoloji Dergisi, 41, 118-125. https://doi.org/10.31590/ejosat.1112389