Distributed User Association in Energy Harvesting Small Cell Networks: A Probabilistic Bandit Model

Distributed User Association in Energy Harvesting Small Cell Networks: A Probabilistic Bandit Model
复制标题

DOI:
10.1109/twc.2017.2647946
复制
发表时间:
2016-01
影响因子:
10.4
通讯作者:
S. Maghsudi;E. Hossain
S. Maghsudi;E. Hossain
中科院分区:
计算机科学1区
文献类型:
--
作者:
S. Maghsudi;E. Hossain

文献摘要

被引文献

相似文献

我们研究动态小型蜂窝网络中的分布式下行链路用户关联问题,其中每个小型基站(SBS)通过环境能量收集获得其所需的能量。一方面,能量收集本质上是机会主义的,因此可用能量的量是一个随机变量。另一方面,用户随机到达并需要不同的无线服务,使得能耗成为随机变量。在本文中,我们开发了一个概率框架来对能量收集和能量消耗的随机行为进行数学建模和分析。我们进一步分析每个用户对每个 SBS 的 QoS 满意概率(成功概率)。所提出的用户关联方案是分布式的,即每个用户独立地选择其相应的SBS,并以成功概率作为性能度量。然而,成功概率取决于各种随机因素,例如能量收集、信道质量和网络流量,其分布或统计特征可能不为用户所知。由于在密集网络中获取这些随机变量(甚至是统计变量)的知识非常昂贵,因此我们开发了一种老虎机理论公式,用于在用户没有先验信息时进行分布式 SBS 选择。对性能进行了理论和数值分析。
We investigate a distributed downlink user association problem in a dynamic small cell network, where every small base station (SBS) obtains its required energy through ambient energy harvesting. On the one hand, energy harvesting is inherently opportunistic, so that the amount of available energy is a random variable. On the other hand, users arrive at random and require different wireless services, rendering the energy consumption a random variable. In this paper, we develop a probabilistic framework to mathematically model and analyze the random behavior of energy harvesting and energy consumption. We further analyze the probability of QoS satisfaction (success probability), for each user with respect to every SBS. The proposed user association scheme is distributed in the sense that every user independently selects its corresponding SBS with the success probability serving as the performance metric. The success probability however depends on a variety of random factors such as energy harvesting, channel quality, and network traffic, whose distribution or statistical characteristics might not be known at users. Since acquiring the knowledge of these random variables (even statistical) is very costly in a dense network, we develop a bandit-theoretical formulation for distributed SBS selection when no prior information is available at users. The performance is analyzed both theoretically and numerically.