首页> 外文会议>IEEE International Conference on Communication Software and Networks >A holding access-point assignment algorithm for wireless local-area networks
【24h】

A holding access-point assignment algorithm for wireless local-area networks

机译:无线局域网的保持接入点分配算法

获取原文

摘要

Nowadays, various types of access-points (APs) and hosts such as dedicated APs, laptop personal computers, and mobile terminals have been used in IEEE802.11 wireless local-area networks (WLANs). As a result, the optimal assignment of holding APs into the network field depending on the host type distribution has become very important to improve the network performance. In this paper, we formulate this holding access-point assignment problem as a combinatorial optimization problem and propose its heuristic algorithm. Because plural non-overlapping channels are available in IEEE802.11 WLANs, we extend the algorithm to finding the channel assignment to the APs such that the total interference among them is minimized. The effectiveness of our proposal is verified through simulations in three instances.
机译:如今,各种类型的接入点(AP)和主机(例如专用AP,膝上型个人计算机和移动终端)已用于IEEE802.11无线局域网(WLAN)中。结果,取决于主机类型分布,将持有的AP最佳分配到网络字段对于提高网络性能变得非常重要。在本文中,我们将此持有接入点分配问题表述为组合优化问题,并提出其启发式算法。因为IEEE802.11 WLAN中有多个不重叠的信道,所以我们将算法扩展到找到分配给AP的信道,以使它们之间的总干扰最小。我们的建议的有效性通过三个实例的仿真得到了验证。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号