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

下一代无线网络中中继站之间的组网博弈

Network Formation Games Among Relay Stations in Next Generation Wireless Networks

Walid Saad, Zhu Han, Tamer Başar, Mérouane Debbah, Are Hjørungnes

摘要:

中继站(RS)节点的引入是诸如3GPP的高级长期演进(LTE-Advanced)或即将到来的IEEE 802.16j WiMAX标准的下一代无线网络中的关键特征。本文利用博弈论提出了一种在下一代无线多跳系统的\emph{uplink}中形成连接RS及其服务基站的树结构的新方法。与现有文献主要集中在性能分析,我们提出了一个分布式算法研究网络的\emph{structure}和\emph{dynamics}。我们制定的RS之间的网络形成游戏,每个RS的目的是最大限度地提高跨层效用函数,考虑到合作传输的好处,在减少比特出错率方面,和由于多跳传输的延迟方面的成本。为了形成树结构,设计了一种分布式近视算法。使用所提出的算法,每个RS可以单独地选择通过其他RS将其连接到BS的路径,同时优化其效用。我们展示了算法的收敛到一个纳什树网络,我们研究如何RS可以适应网络的拓扑结构的环境变化,如移动性或新的移动台的部署。仿真结果表明,该算法提出了显着的增益,在每个移动台的平均效用,这是至少17.1%,相对于没有RS的情况下,达到40.3%的改善相比,最近邻算法(10个RS的网络)。结果还表明,即使对于具有多达25个RS的网络,平均跳数也不超过3。

英文摘要:

The introduction of relay station (RS) nodes is a key feature in next generation wireless networks such as 3GPP's long term evolution advanced (LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper presents, using game theory, a novel approach for the formation of the tree architecture that connects the RSs and their serving base station in the \emph{uplink} of the next generation wireless multi-hop systems. Unlike existing literature which mainly focused on performance analysis, we propose a distributed algorithm for studying the \emph{structure} and \emph{dynamics} of the network. We formulate a network formation game among the RSs whereby each RS aims to maximize a cross-layer utility function that takes into account the benefit from cooperative transmission, in terms of reduced bit error rate, and the costs in terms of the delay due to multi-hop transmission. For forming the tree structure, a distributed myopic algorithm is devised. Using the proposed algorithm, each RS can individually select the path that connects it to the BS through other RSs while optimizing its utility. We show the convergence of the algorithm into a Nash tree network, and we study how the RSs can adapt the network's topology to environmental changes such as mobility or the deployment of new mobile stations. Simulation results show that the proposed algorithm presents significant gains in terms of average utility per mobile station which is at least 17.1% better relatively to the case with no RSs and reaches up to 40.3% improvement compared to a nearest neighbor algorithm (for a network with 10 RSs). The results also show that the average number of hops does not exceed 3 even for a network with up to 25 RSs.

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

↑