首页> 外文期刊>Journal of computer and system sciences >Solving mesh router nodes placement problem in Wireless Mesh Networks by Tabu Search algorithm
【24h】

Solving mesh router nodes placement problem in Wireless Mesh Networks by Tabu Search algorithm

机译:通过禁忌搜索算法解决无线网状网络中的网状路由器节点放置问题

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

摘要

Wireless Mesh Networks (WMNs) are an important networking paradigm that offer cost effective Internet connectivity. The performance and operability of WMNs depend, among other factors, on the placement of network nodes in the area. Among the most important objectives in designing a WMN is the formation of a mesh backbone to achieve high user coverage. Given a number of router nodes to deploy, a deployment area and positions of client nodes in the area, an optimization problem can be formulated aiming to find the placement of router nodes so as to maximize network connectivity and user coverage. This optimization problem belongs to facility location problems, which are computationally hard to solve to optimality. In this paper we present the implementation and evaluation of Tabu Search (TS) for the problem of mesh router node placement in WMNs. The experimental evaluation showed the efficiency of TS in solving a benchmark of instances.
机译:无线网状网络(WMN)是一种重要的联网范例,可提供具有成本效益的Internet连接。 WMN的性能和可操作性除其他因素外,还取决于该区域中网络节点的位置。设计WMN的最重要目标之一是形成网状骨干网以实现较高的用户覆盖率。给定要部署的多个路由器节点,部署区域和客户端节点在该区域中的位置,可以制定优化问题,旨在找到路由器节点的位置,从而最大化网络连接性和用户覆盖范围。该优化问题属于设施位置问题,这些问题在计算上难以解决。在本文中,我们介绍了禁忌搜索(TS)的实现和评估,以解决WMN中的网状路由器节点放置问题。实验评估显示了TS在解决实例基准方面的效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号