| 考虑抗毁性及业务需求的站址规划算法 |
| |
| 引用本文： | 高京伟. 考虑抗毁性及业务需求的站址规划算法[J]. 计算机应用, 2005, 25(7): 1704-1706. DOI: 10.3724/SP.J.1087.2005.01704 |
| |
| 作者姓名： | 高京伟 |
| |
| 作者单位： | 中国电子科技集团公司 第54研究所 |
| |
| 摘 要： | 基于用户分布已知的条件下，提出考虑抗毁性和业务分布的图的分离方法；提出折中考虑地理复杂度、抗毁性和业务量的链路重要性衡量指标--链路权衡因子LWF；提出相交圆算法寻找干线节点的实际可行位置；以及寻找网络相对业务中心的虚拟小区方法。站址的规划设计是与地理信息系统紧密结合进行的，这样设计出的结果将是可行的、可用的。
|
| 关 键 词： | 站址规划 割集 抗毁分离 饱和分离 链路权衡因子(LWF) 虚拟小区(VC) |
| 文章编号： | 1001-9081(2005)07-1704-03 |
| 收稿时间： | 2005-01-07 |
| 修稿时间： | 2005-03-08 |
An algorithm for designing communication station to meet service requirement and destroy-resistance target |
| |
| GAO Jing-wei. An algorithm for designing communication station to meet service requirement and destroy-resistance target[J]. Journal of Computer Applications, 2005, 25(7): 1704-1706. DOI: 10.3724/SP.J.1087.2005.01704 |
| |
| Authors: | GAO Jing-wei |
| |
| Affiliation: | No.54th Research Institute, China Electronics Technology Group Corporation |
| |
| Abstract: | The separation method of the graph was proposed for improving destroy-resistance and throughput at the assumption of known user distribution. Link Weight Factor (LWF) that eclectically thinks over geography complexities, destroy-resistance and portfolio is defined. Putting forward the intersection circle algorithm that seeks the feasible seat of nodes and virtual cell algorithm that seeks the service center.The Communication Station design closely combines with the geography information systems, therefore the result is feasible and available. |
| |
| Keywords: | communication station design cutset destroy-resistance separation saturation separation Link Weight Factor (LWF) Virtual Cell(VC) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
