分布式网络中基于一致性的信道分配算法  

Consensus-Based Channel Assignment in Decentralized Network

作　　者：胡洁[1] 赵祚喜[1] 陈润恩[1] 

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

出　　处：《电子学报》2014年第6期1132-1138,共7页Acta Electronica Sinica

基　　金：国家自然科学基金(No.61175081)

摘　　要：针对实际分布式网络中节点通信受限的特点,设计了基于一致性的拍卖算法CDACA(Consensus-Based Decentralized Auctions for Channel Assignment),实现多段频谱的最优分配.基于本地信息,次用户在CDACA算法的前向拍卖阶段选择一个信道加价投标,空闲信道未分配的主用户在反向拍卖阶段选择一个次用户降价投标;主用户和次用户利用局部通信基于一致性算法确定竞胜标和解决冲突.理论证明了CDACA算法在实际分布式网络中节点通信受限和局部过时信息的情况下能在有限次迭代后收敛到网络效益最优的分配,同时证明了算法在分布式动态网络中也能收敛.仿真结果验证了不同网络拓扑下CDACA算法在收敛速度和频谱效率上的优越性能.In case of the limited communication capacities of the nodes in the realistic decentralized networks ,a consensus-based auction approaches （CDACA ）was proposed to achieve the optimal multi-assignment for multiple spectrum .Based on local in-formation ,each secondary user conducts an ascending-bid auction for a single channel in CDACA forward auction phase ,and prima-ry users with unassigned channels conduct descending-bid auction for their favorite secondary users in reverse auction phase ;both secondary users and primary users use consensus routine based on local communication as the conflict resolution mechanism to achieve agreement on the winning bid values .Theory analysis proves CDACA always converges to an assignment that maximizes the total network benefits within finite number of iterations ,even for nodes in realistic decentralized networks with limited communica-tion and local outdated information;the algorithm convergence is also proved in dynamic decentralized networks .Under different network topologies in the simulation ,CDACA is shown to be superior on convergence speed and spectrum efficiency .

关 键 词：分布式 一致性 拍卖 信道分配 

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