多源多中继网络效益最大的快速中继选择策略  

Maximizing system benefits and fast convergence relay selection algorithms in multi-source multi-relay networks

作　　者：胡洁[1] 赵祚喜[1] 

机构地区：[1]华南农业大学工程学院,广东广州510642

出　　处：《西安电子科技大学学报》2013年第3期212-220,共9页Journal of Xidian University

基　　金：国家自然科学基金资助项目(61101134;61175081)

摘　　要：在多源多中继无线网络环境下,设计了两种快速收敛且令系统效益最大的分布式中继选择策略,即基于加价式拍卖的中继选择算法(APARS)和基于加价和降价混合拍卖的中继选择算法(HARS).基于拍卖机制,两种策略分别采取用户加价式和用户加价及中继降价混合式竞价的方法,每次竞价为投标者最优和次优选择的效益差,同时引入基本价格增长常量确保算法的收敛性.理论证明和仿真结果都验证了初始价为0的APARS算法和任意初始价的HARS算法均能实现系统效益的近似最优,且收敛快,能够抵抗价格战.在用户数明显多于中继或合作净收益接近的情况下,HARS在收敛速度上更有优势.Two kinds of distributed relay selection algorithm APARS and HARS are designed to achieve maximum system benefits with a fast convergence speed in multi-user multi-relay wireless networks. Based on auction mechanism, APARS is a kind of ascending price auction taken by users, while HARS is a hybrid auction of ascending price by users and descending price by relays; bids are set as the difference between maximum payoff and second largest payoff of bidders, and the basic price increment is introduced to ensure the convergence of the algorithms. Theoretical analysis and simulation results both prove that APARS with the 0 initial price and HARS with an arbitrary initial price can achieve near optimal system benefits, converge quickly and avoid a price war. When the number of users is larger than that of the relays, HARS is superior in convergence speed.

关 键 词：多源多中继 中继选择 价格战 

分 类 号：TN929[电子电信—通信与信息系统]