摘要
建立了中继网络资源复用问题的图论模型，依据该模型设计了自适应资源复用调度算法ARRS（adaptive resource reuse scheduling），以提高中继网络资源利用率．由于ARRS算法的核心步骤涉及顶加权图G（V,E,W）的染色，是NP-hard问题，为此给出了求解最优资源复用约束的顶加权图染色的近似算法ARRS．该算法被证明具有．Greedy时间复杂度D（｜V｜^2），近似比为[（△＋1）／2]（△表示图G顶点度数的最大值）．该近似比是紧的．仿真分析验证了近似算法ARRS_Greedy在应用中取得了与最优解非常接近的性能，证明了ARRS算法能够动态适应网络状态变化，因而与现有算法相比大幅度提高了系统容量．
A graph model of the resource reuse problem for relay networks is constructed. Based on this model, an innovative approach called ARRS （adaptive resource reuse scheduling） is presented to enhance the resource utilization. Since the key process of ARRS involves in graph coloring, which is NP-hard, an approximation algorithm called ARRS_Greedy is provided for optimal resource reuse constrained coloring of vertex weighted graph G（V,E,W）. ARRS_Greedy is proved to obtain a tight approximation ratio of[（△＋1）/2] in time O（｜V｜^2）, where △ is the maximum degree of vertex in graph G. Simulations demonstrate that ARRS_Greedy achieves near optimal performance in practice and prove that ARRS is dynamically adaptive to network status and thus enhances the system capacity more efficiently than previous solutions.
出处
《软件学报》
EI
CSCD
北大核心
2009年第2期425-436,共12页
Journal of Software
关键词
多跳中继
资源复用
图论模型
调度算法
近似算法
multihop relay
resource reuse
graph theory model
scheduling algorithm
approximation algorithm
