摘要
针对Relay技术研究一种生成无线回传拓扑结构的一般方法:输入站点经纬度坐标及类型,在满足拓扑要求的情况下,以矩阵的方式给出一种以成本为优先级的输出结果,包括站点之间连接情况以及站点类型,同时考虑站点间回传路径损耗.总体思路是先寻找较优初解,再利用改进的模拟退火算法求解.实验结果表明提出的Relay系统构架切实可行,算法的实现具有高速实用的特点,具有很大的实用价值.
A generation wireless backhaul topology of general method is setup in view of the Relay technology: the sites,type of latitude and longitude coordinates are input;then in case that could satisfy the requirement of topology,a kind of the output in the form of matrix is given,of which cost has the priority,including the connection between the site and site’s types,at the same time take into consideration the site comes back path loss.The general idea is to find the optimal initial solution first and then use the improved simulated annealing algorithm to solve the problem.The experimental results show that the Relay system framework proposed is feasible,and the implementation of the algorithm has high speed and practical value.
作者
郭云泰
唐鸿洋
宋多琪
韩海涛
GUO Yun-tai;TANG Hong-yang;SONG Duo-qi;HAN Hai-tao(School of Mathematical Sciences , Inier Mongolia University,Hohhot 010021 China;School of Physical Science and Technology, hiner Mongolia University , Hohhot 010021, China)
出处
《内蒙古大学学报(自然科学版)》
CAS
北大核心
2019年第3期233-239,共7页
Journal of Inner Mongolia University:Natural Science Edition
基金
本科生国家级创新基金(201810126022)资助项目
关键词
整数规划
图论
广度优先算法
模拟退火算法
integer programming
graph theory
breadth-first search
simulated annealing