.png){kind=icon}
返回
Variable-Width Channel Allocation for Access Points: A Game-Theoretic Perspective
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2012.109.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Channel allocation is a crucial concern in variable-width wireless local area networks. This work aims to obtain the stable and fair nonoverlapped variable-width channel allocation for selfish access points (APs). In the scenario of single collision domain, the channel allocation problem reduces to a channel-width allocation problem, which can be formulated as a noncooperative game. The Nash equilibrium (NE) of the game corresponds to a desired channel-width allocation. A distributed algorithm is developed to achieve the NE channel-width allocation that globally maximizes the network utility. A punishment-based cooperation selfenforcement mechanism is further proposed to ensure that the APs obey the proposed scheme. In the scenario of multiple collision domains, the channel allocation problem is formulated as a constrained game. Penalty functions are introduced to relax the constraints and the game is converted into a generalized ordinal potential game. Based on the best response and randomized escape, a distributed iterative algorithm is designed to achieve a desired NE channel allocation. Finally, computer simulations are conducted to validate the effectiveness and practicality of the proposed schemes.
Keyword:
Wireless local area networks
channel allocation
game theory
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.8K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏Comparative longitudinal study of 2 methods of scheduling maintenance visits: 4‐year data两种计划维护访问方法的纵向比较研究: 4年数据
PREAI
分享收藏
查看更多内容