arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.02598cs.NIcs.ITmath.IT
收藏

VLC网络中基于T-Step Look-Ahead策略的移动性感知资源分配

Mobility-Aware Resource Allocation in VLC Networks Using T-Step Look-Ahead Policy

Mohammad Amir Dastgheib, Hamzeh Beyranvand, Jawad A. Salehi, Martin Maier

摘要:

可见光通信(VLC)利用可见光的巨大免许可光谱带宽进行高速无线通信。由于每个VLC接入点覆盖的区域很小,移动用户的增加是不可避免的。为了处理这些干扰,开发快速有效的资源分配算法是一个挑战。本文介绍了移动性感知的VLC网络中的资源优化问题,使用T步前瞻策略和采用切换效率的概念。它示出的切换效率可以相关的网络的整体性能与未来的行动的基础上的用户的移动性。由于室内光无线信道的静态特性,可以通过预测用户的未来位置来预测未来的信道状态信息(CSI)。因此,提出了一种资源分配算法,该算法使用CSI来动态地为用户分配网络资源。为了解决这个数学上难以解决的问题,提出了一种新的松弛方法,这被证明是一个有用的工具,开发有效的算法与比例公平效用函数的网络优化问题。由此产生的算法是非常快的速度比以前的方法和流动性的认识,提高了网络的整体性能的速率和公平效用函数。

英文摘要:

Visible light communication (VLC) uses huge license-free spectral bandwidth of visible light for high-speed wireless communication. Since each VLC access point covers a small area, handovers of mobile users are inevitable. In order to deal with these handovers, developing fast and effective resource allocation algorithms is a challenge. This paper introduces the problem of mobility-aware optimization of resources in VLC networks using the T-step look-ahead policy and employing the notion of handover efficiency. It is shown that the handover efficiency can correlate the overall performance of the network with future actions based on the mobility of users. Due to the stationary nature of indoor optical wireless channels, future channel state information (CSI) can be predicted by anticipating the future locations of users. A resource allocation algorithm is thus proposed, which uses CSI to dynamically allocate network resources to users. To solve this mathematically intractable problem, a novel relaxation method is proposed, which proves to be a useful tool to develop efficient algorithms for network optimization problems with a proportional fairness utility function. The resulting algorithm is extremely faster than the previous method and awareness of mobility enhances the overall performance of the network in terms of rate and fairness utility function.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑