###
DOI:
Journal of Software:2009.20(2):425-436

多跳中继无线网络资源复用的建模及算法设计
郭欣,马文超,郭子华,侯紫峰
(中国科学技术大学 计算机科学与技术系,安徽 合肥 230027;联想研究院,北京 100085;联想研究院,北京 100085;中国科学院 计算技术研究所,北京 100190)
Modeling and Algorithm Designing of Resource Reuse for Multihop Relay Wireless Network
GUO Xin,MA Wen-Chao,GUO Zi-Hua,HOU Zi-Feng
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3280   Download 5158
Received:July 16, 2007    Revised:October 12, 2007
> 中文摘要: 建立了中继网络资源复用问题的图论模型,依据该模型设计了自适应资源复用调度算法ARRS(adaptive resource reuse scheduling),以提高中继网络资源利用率.由于ARRS算法的核心步骤涉及顶加权图G(V,E,W)的染色,是NP-hard问题,为此给出了求解最优资源复用约束的顶加权图染色的近似算法ARRS_Greedy.该算法被证明具有时间复杂度O(|V|2),近似比为?(Δ+1)/2?(Δ表示图G顶点度数的最大值).该近似比是紧的.仿真分析验证了近似算法ARRS_Greedy在应用中取得了与最优解非常接近的性能,证明了ARRS算法能够动态适应网络状态变化,因而与现有算法相比大幅度提高了系统容量.
Abstract: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.
文章编号:     中图分类号:    文献标志码:
基金项目:
Foundation items:
Reference text:

郭欣,马文超,郭子华,侯紫峰.多跳中继无线网络资源复用的建模及算法设计.软件学报,2009,20(2):425-436

GUO Xin,MA Wen-Chao,GUO Zi-Hua,HOU Zi-Feng.Modeling and Algorithm Designing of Resource Reuse for Multihop Relay Wireless Network.Journal of Software,2009,20(2):425-436