arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1408.0482cs.NIcs.GT
收藏

蜂窝网络中绿色广播传输的博弈分析

Green Broadcast Transmission in Cellular Networks: A Game Theoretic Approach

Cengis Hasan, Jean-Marie Gorce, Eitan Altman

摘要:

本文研究了多小区广播传输中的移动台分配问题,通过同时考虑传输功率和操作功率,寻求最小的总功耗。虽然问题的大规模性质需要找到分布式的解决方案,博弈论似乎是一个自然的工具。我们提出了一种新的分布式算法,称为\textit{the hedonic decision algorithm}的基础上形成的游戏。这种形式主义是建设性的:引入了一类新的群体形成博弈,其中群体内参与者的效用是可分离的并且是对称的,是奇偶联系博弈的广义版本。所提出的特征决策算法也适用于任何集合覆盖问题。为了评估我们的算法的性能,我们提出了其他方法,我们的算法进行比较。我们首先开发了一个集中的递归算法称为\textit{the hold minimum}能够找到最佳的分配。然而,由于移动分配问题的NP-难的复杂性,我们提出了一个集中的多项式时间启发式算法称为\textit{the column control}生产接近最优的解决方案时,考虑到基站的运营功率成本。从这个有效的集中式方法,一个\textit{distributed column control algorithm}也提出了和比较\textit{the hedonic decision algorithm}。我们还实现了最近的基站算法,这是非常简单和直观的,有效地管理快速移动的宏基站服务的用户。广泛的仿真结果,并突出这些算法的相对性能。模拟的情况下,根据泊松点过程的移动台和基站。

英文摘要:

This paper addresses the mobile assignment problem in a multi-cell broadcast transmission seeking minimal total power consumption by considering both transmission and operational powers. While the large scale nature of the problem entails to find distributed solutions, game theory appears to be a natural tool. We propose a novel distributed algorithm based on group formation games, called \textit{the hedonic decision algorithm}. This formalism is constructive: a new class of group formation games is introduced where the utility of players within a group is separable and symmetric being a generalized version of parity-affiliation games. The proposed hedonic decision algorithm is also suitable for any set-covering problem. To evaluate the performance of our algorithm, we propose other approaches to which our algorithm is compared. We first develop a centralized recursive algorithm called \textit{the hold minimum} being able to find the optimal assignments. However, because of the NP-hard complexity of the mobile assignment problem, we propose a centralized polynomial-time heuristic algorithm called \textit{the column control} producing near-optimal solutions when the operational power costs of base stations are taken into account. Starting from this efficient centralized approach, a \textit{distributed column control algorithm} is also proposed and compared to \textit{the hedonic decision algorithm}. We also implement the nearest base station algorithm which is very simple and intuitive and efficiently manage fast-moving users served by macro BSs. Extensive simulation results are provided and highlight the relative performance of these algorithms. The simulated scenarios are done according to Poisson point processes for both mobiles and base stations.

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

↑