Resource allocation for visible light communication systems using simulated annealing based on a problem-specific neighbor function

Name: Resource allocation for visible light communication systems using simulated annealing based on a problem-specific neighbor function
Author: Siddiqi, U. F., Sait, S. M., Demir, Muhammet Selim, Uysal, Murat

İsim	Resource allocation for visible light communication systems using simulated annealing based on a problem-specific neighbor function
Yazar	Siddiqi, U. F., Sait, S. M., Demir, Muhammet Selim, Uysal, Murat
Basım Tarihi:	2019
Basım Yeri	- IEEE
Konu	Visible light communications, Resource allocation, Optimization, Simulated annealing, Heuristics
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	2169-3536
Kayıt Numarası	58e954d4-d471-4900-b36d-25919c082ebd
Lokasyon	Electrical & Electronics Engineering
Tarih	2019
Notlar	King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia ; TÜBİTAK
Örnek Metin	In this paper, we consider a visible light communication (VLC) system with direct current-biased orthogonal frequency division multiplexing (DC-OFDM) and investigate resource allocation for a multi-user environment. Based on the user satisfaction index as a function of data rate, we aim to optimally determine the allocation of the users to different LEDs (acting as access points) and 0I-DM subcarriers. We propose a simulated annealing-based heuristic to maximize the average user satisfaction index. In an effort to make the proposed solution practically feasible, the runtime of the proposed heuristic is kept less than the channel coherence time, whose value is in order of tens of milliseconds. We evaluate the performance of the proposed heuristic algorithm in different scenarios that vary in the number of users, the number of LEDs, and the separation between users. Our results demonstrate that the proposed heuristic outperforms other well-known heuristics (such as standard simulated annealing, iterative greedy, particle swarm optimization, and tabu search) while achieving good quality solutions within a short execution time, i.e., 40-80 ms.
DOI	10.1109/ACCESS.2019.2917051
Cilt	7

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Resource allocation for visible light communication systems using simulated annealing based on a problem-specific neighbor function

Yazar Siddiqi, U. F., Sait, S. M., Demir, Muhammet Selim, Uysal, Murat

Basım Tarihi 2019

Basım Yeri - IEEE

Konu Visible light communications, Resource allocation, Optimization, Simulated annealing, Heuristics

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 2169-3536

Kayıt Numarası 58e954d4-d471-4900-b36d-25919c082ebd

Lokasyon Electrical & Electronics Engineering

Tarih 2019

Notlar King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia ; TÜBİTAK

Örnek Metin In this paper, we consider a visible light communication (VLC) system with direct current-biased orthogonal frequency division multiplexing (DC-OFDM) and investigate resource allocation for a multi-user environment. Based on the user satisfaction index as a function of data rate, we aim to optimally determine the allocation of the users to different LEDs (acting as access points) and 0I-DM subcarriers. We propose a simulated annealing-based heuristic to maximize the average user satisfaction index. In an effort to make the proposed solution practically feasible, the runtime of the proposed heuristic is kept less than the channel coherence time, whose value is in order of tens of milliseconds. We evaluate the performance of the proposed heuristic algorithm in different scenarios that vary in the number of users, the number of LEDs, and the separation between users. Our results demonstrate that the proposed heuristic outperforms other well-known heuristics (such as standard simulated annealing, iterative greedy, particle swarm optimization, and tabu search) while achieving good quality solutions within a short execution time, i.e., 40-80 ms.

DOI 10.1109/ACCESS.2019.2917051

Cilt 7