journal6 ›› 2010, Vol. 31 ›› Issue (4): 43-46.

• 计算机 • 上一篇    下一篇

基于模糊最小生成树的通信网络架设模型

  

  1. (1.怀化芷江师范学校,湖南 怀化 418008;2.怀化学院计算机科学与技术系,湖南 怀化 418008;3.广东女子职业技术学院,广东 广州511450)
  • 出版日期:2010-07-25 发布日期:2012-04-16
  • 作者简介:谢力军(1964- ),男,湖南会同人,讲师,主要从事数据库技术、计算机网络技术等研究.
  • 基金资助:

    湖南省科技计划项目(2007FJ4232 );湖南省教育厅课题(08C665)

Scheme of Building Communication Network Based on the Fuzzy Minimal Spanning Tree

  1. (1.Department of Computer Science,Zhijiang Normal College,Huaihua 418008,Hunan China;2.Department of Computer Science and Technology,Huaihua College,Huaihua 418008,Hunan China;3.Guangdong Women Professional Technology College,Guangzhou 511450,China)
  • Online:2010-07-25 Published:2012-04-16

摘要:根据图论的要求和模糊集合的原理对现代城域通信网络进行优化,以连接距离最短、网络建设费用最少、网络可靠性最高为目标建立模型,并且保证网络连通性、辐射状运行等约束条件,得到通信网络架设规化的近似最优解.研究了网络建设中一些界限不分明的因素,建立了模糊最小生成树模型,它具有简单、实用、实时性强等特点,在现代城域网络建设中有很强的适用性.

关键词: 通信网络, 图论, 模糊集合, 最小生成树, Kruskal算法

Abstract: The modern city communication network is optimized according to the principle of  the graph theory and the fuzzy set.It will establish a model with the  shortest distance,the lowest expense,the highest network reliability to guarantee certain restraint condition,such as network connectivity and radiation movement.It aims at getting the approximate optimal solution of erecting the communication network.This article studies some factors in the network construction that the boundary is undistinguishable.It has established the fuzzy minimal spanning tree model,and quoted the classical algorithm of building the minimal spanning tree.It is simple,practical,quick for real-time operation.It is applicable in the construction of the modern city network.The algorithm has proven its superiority after the procedure test.

Key words: communications network, graph theory, fuzzy set, minimal spanning tree, Kruskal&rsquo, s algorithm

公众号 电子书橱 超星期刊 手机浏览 在线QQ