首页> 外文OA文献 >A Heuristics Based Approach for Cellular Mobile Network Planning
【2h】

A Heuristics Based Approach for Cellular Mobile Network Planning

机译:基于启发式的蜂窝移动网络规划方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

ABSTRACT Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to switches in cellular mobile network, which is considered a planning problem, is addressed. The cell to switch assignment problem which falls under the category of the Quadratic Assignment Problem (QAP) is a proven NP– hard problem. Further, the problem is modelled to include an additional constraint in the formulation. The additional constraint is of the maximum number of switch ports that are used for a cell's Base Station Transceiver System (BTS) connectivity to the switch. The addition of the constraint on the number of ports on a switch has immense practical signicance. This paper presents a non– deterministic heuristic based on Simulated Evolution (SimE) iterative algorithm to provide solutions. The methods adopted in this paper are a completely innovative formulation of the problem and involve application of Evolutionary Computing for this complex problem that may be extended to solutions of similar problems in VLSI design, distributed computing and many other applications.
机译:摘要在蜂窝移动网络中,交换,信令和支持网络的设计和规划是一个相当复杂的过程。在本文中,解决了在蜂窝移动网络中将小区分配给交换机的问题,这被认为是规划问题。属于二次分配问题(QAP)类别的切换单元分配问题是一个经过验证的NP难题。此外,将问题建模为在公式中包括其他约束。额外的限制是用于单元的基站收发器系统(BTS)与交换机的连接的最大交换机端口数。在交换机上增加端口数量的限制具有巨大的实际意义。本文提出了一种基于模拟进化(SimE)迭代算法的非确定性启发式算法来提供解决方案。本文采用的方法是该问题的一种完全创新的表示形式,涉及到针对此复杂问题的进化计算的应用,可以将其扩展到VLSI设计,分布式计算和许多其他应用中类似问题的解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号