基于随机图的CRAdHoc网络频谱管理方案  

Spectrum management based on random graph for cognitive radio Ad Hoc networks

作　　者：周健[1,2,3] 余永红[1] 孙丽艳[1] 

机构地区：[1]安徽财经大学管理科学与工程学院,安徽蚌埠233041 [2]北京科技大学计算机与通信工程学院,北京100083 [3]北京邮电大学计算机学院,北京100083

出　　处：《计算机工程与科学》2013年第12期84-89,共6页Computer Engineering & Science

基　　金：安徽省高等学校自然基金资助项目(KJ2013B001)

摘　　要：针对认知无线电网络Ad Hoc共享频段协商困难问题,提出了一种基于随机图的频谱管理方案,通信实体根据频谱数量、网络规模和链路连通概率选择合理规模的备选频段,在保证网络有效连通性的前提下,限制通信实体的频谱规模。实验表明,节点从频谱池中选择较少的频段就可以保证连通性,节点间的通信路径长度不会因为频谱选择而增加。该方案适合快速部署CR Ad Hoc网络应用环境。Base station is not supplied to supported spectrum management for cognitive radio net-works Ad Hoc,so communication among nodes may be failed because there is not a shared frequency between communication nodes.In order to deal with this question,a scheme of spectrum management based on random graph theory is proposed.Users select part of spectrums from the spare spectrum set whose number is computed by the parameter including spectrums size,network scale,link connection probability before joining in network.In communications the communication efficiency is not reduced even if every user＇s spectrum resource is limited.In experiments the scheme guarantees the high probability of connective for each node having few frequencies; and the path of communication does not increase due to small spectrum scale.Therefore this scheme is suitalble to the surrounding that CR Ad Hoc network can be deployed quickly and flexibly.

关 键 词：认知无线电网络 频谱管理 随机图 连接概率 路径长度 

分 类 号：TP309.02[自动化与计算机技术—计算机系统结构]