...
首页> 外文期刊>Mobile Computing, IEEE Transactions on >Variable-Width Channel Allocation for Access Points: A Game-Theoretic Perspective
【24h】

Variable-Width Channel Allocation for Access Points: A Game-Theoretic Perspective

机译:接入点的可变宽度信道分配:一种博弈论的观点

获取原文
获取原文并翻译 | 示例
           

摘要

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 self-enforcement 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.
机译:在可变宽度无线局域网中,信道分配是至关重要的问题。这项工作旨在为自私的接入点(AP)获得稳定,公平的,不重叠的可变宽度信道分配。在单冲突域的情况下,信道分配问题简化为信道宽度分配问题,可以将其表述为非合作博弈。游戏的纳什均衡(NE)对应于所需的通道宽度分配。开发了一种分布式算法来实现NE通道宽度分配,该分配可全局最大化网络实用程序。进一步提出了一种基于惩罚的合作自我执行机制,以确保受影响人遵守拟议的计划。在多个冲突域的情况下,信道分配问题被公式化为约束博弈。引入惩罚函数以放松约束,并将博弈转换为广义序数潜在博弈。基于最佳响应和随机逃逸,设计了分布式迭代算法以实现所需的NE信道分配。最后,进行计算机仿真以验证所提出方案的有效性和实用性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号