无线光通信网络拓扑形成问题研究
|
摘要
无线光通信网络初始化过程中,面临着通信对象的优选和节点度的限制。将该问题通过图论中的度约束最小生成树模型来进行表达,并引入度约束最小生成树的一种近似快速算法来加以求解。通过实例证明,该模型和求解算法能够解决网络的拓扑形成问题。
Optimal destination selection and limited node degree are major challenges facing the wireless optical communication in the process of its initialization. In this paper, using degree-constrained minimum spanning tree(DCMST) model in graph theory is proposed as a solution and a fast approximate algorithm is introduced on the basis of(DCMST). It is proved by some practical examples that this model and algorithm are effectively operative.
Optimal destination selection and limited node degree are major challenges facing the wireless optical communication in the process of its initialization. In this paper, using degree-constrained minimum spanning tree(DCMST) model in graph theory is proposed as a solution and a fast approximate algorithm is introduced on the basis of(DCMST). It is proved by some practical examples that this model and algorithm are effectively operative.
引文
[1]张斯珩.我国光纤通信技术的发展研究[J].民营科技,2015(11):85.
[2]Hirya Richard Edymond.Using a Directional Antenna toAchieve Quality Transmission on a Wireless Ad Hoc Net-work under Jamming Attacks[D].长沙:湖南大学,2013.
[3]Zhuang J F,Casey M J.Multi-objective optimizationtechniques in topology control of free space optical net-works.IEEE Mi ICOM,Maryland University,MD.USA,2004:430-435.
[4]刘锋,何东武,袁学海.模糊时间预测系统的Heuristic模型的改进[J].辽宁师范大学学报(自然科学版),2002,25(2):116-119.
[5]Desai A,Topology control and routing over wireless opticalbackbone networks[M].Technical Report,Department ofElectrical Engineering,University of Maryland,2003.
[6]A.Desai and S.Milner,Autonomous reconguration infree-space optical sensor networks[J].IEEE J.Sel.AreasCommun.2005(23):1556-1563.
[7]L.Hu,Topology control for multihop packet radio networks[J].IEEE Trans Commun,1993(41):1474-1481.
[8]冷明.基于多水平方法的无向图剖分及其在VLSI设计中的应用研究[D].上海:上海大学,2008.
[9]顾立尧.带有度约束的最小耗费生成树的分支限界算法[J].计算机应用与软件,1989,6(6):49-54.
[10]马良,蒋馥.度约束最小生成树的快速算法[J].运筹与管理,1998,7(1):1-5.
[11]宋海洲.求解度约束最小生成树的快速近似算法[J].系统工程学报,2006,21(3):232-236.
[12]黄敏,李尔达,袁媛,郑健.基于路网拓扑的聚类分析算法研究与实现[J].中山大学学报(自然科学版),2015,54(6):99-103.
[2]Hirya Richard Edymond.Using a Directional Antenna toAchieve Quality Transmission on a Wireless Ad Hoc Net-work under Jamming Attacks[D].长沙:湖南大学,2013.
[3]Zhuang J F,Casey M J.Multi-objective optimizationtechniques in topology control of free space optical net-works.IEEE Mi ICOM,Maryland University,MD.USA,2004:430-435.
[4]刘锋,何东武,袁学海.模糊时间预测系统的Heuristic模型的改进[J].辽宁师范大学学报(自然科学版),2002,25(2):116-119.
[5]Desai A,Topology control and routing over wireless opticalbackbone networks[M].Technical Report,Department ofElectrical Engineering,University of Maryland,2003.
[6]A.Desai and S.Milner,Autonomous reconguration infree-space optical sensor networks[J].IEEE J.Sel.AreasCommun.2005(23):1556-1563.
[7]L.Hu,Topology control for multihop packet radio networks[J].IEEE Trans Commun,1993(41):1474-1481.
[8]冷明.基于多水平方法的无向图剖分及其在VLSI设计中的应用研究[D].上海:上海大学,2008.
[9]顾立尧.带有度约束的最小耗费生成树的分支限界算法[J].计算机应用与软件,1989,6(6):49-54.
[10]马良,蒋馥.度约束最小生成树的快速算法[J].运筹与管理,1998,7(1):1-5.
[11]宋海洲.求解度约束最小生成树的快速近似算法[J].系统工程学报,2006,21(3):232-236.
[12]黄敏,李尔达,袁媛,郑健.基于路网拓扑的聚类分析算法研究与实现[J].中山大学学报(自然科学版),2015,54(6):99-103.