首页> 外文会议>International Symposium on Wireless Communication Systems >MOGAMESH: A Multi-Objective Algorithm for Node Placement in Wireless Mesh Networks based on Genetic Algorithms
【24h】

MOGAMESH: A Multi-Objective Algorithm for Node Placement in Wireless Mesh Networks based on Genetic Algorithms

机译:MogAMesh:基于遗传算法的无线网状网络中节点放置的多目标算法

获取原文

摘要

The optimal placement of mesh nodes of an infrastructure wireless mesh network is considered. The optimization is performed w.r.t. two objectives, i.e. installation cost and coverage probability. Mesh nodes with directional antennae are assumed. In this regard, we propose MOGAMESH, a 2-stages multi-objective evolutionary optimization algorithm which tries to optimize the two objectives by means of genetic algorithms, where individuals or solutions are represented by network graphs. In the first stage, candidate network topologies are found by letting a population of graphs evolve. Iteratively, a non-dominated sorting technique classifies individuals which are then selected for the evolution process. Solutions are individuals belonging to the Pareto front, i.e. the set of all non-dominated solutions. In the second stage, a link elimination algorithm further reduces the number of links of the network. In this way, MOGAMESH can provide the network designer with the maximum number of devices to install for every mesh node along with candidate network topologies. We analyze the performance of MOGAMESH for realistic instances of a wireless mesh network with increasing user density.
机译:考虑基础设施无线网状网络的网状节点的最佳放置。优化是执行w.r.t.两个目标,即安装成本和覆盖概率。假设具有定向天线的网状节点。在这方面,我们提出了MogAMesh,一个2阶段的多目标进化优化算法,该算法试图通过遗传算法来优化两个目标,其中个体或解决方案由网络图表表示。在第一阶段,通过让图形群体发展来发现候选网络拓扑。迭代地,非主导的分类技术对作为演进过程选择的个体进行分类。解决方案是属于Pareto Front的个人,即所有非主导解决方案的集合。在第二阶段,链路消除算法还减少了网络的链路数量。通过这种方式,MogAMesh可以提供具有最大设备数量的网络设计器,以便与候选网络拓扑一起安装每个网格节点。我们分析了MogAMesh的性能,以增加用户密度的无线网状网络的现实实例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号