检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:肖海林[1,2] 刘小兰 林潇瑜 欧阳缮 邱斌[1] XIAO Hai-lin;LIU Xiao-lan;LIN Xiao-yu;OUYANG Shan;QIU Bin(Key Laboratory of Cognitive Radio and Information Processing,Guilin University of Electronic Technology Guilin Guangxi 541004;School of Computer Science and Information Engineering,Hubei University Wuhan 430062)
机构地区:[1]桂林电子科技大学认知无线电与信号处理教育部重点实验室,广西桂林541004 [2]湖北大学计算机与信息工程学院,武汉430062
出 处:《电子科技大学学报》2020年第1期71-80,共10页Journal of University of Electronic Science and Technology of China
基 金:国家自然科学基金(61872406);浙江省重点研发计划(2018C01059);广西研究生科研创新项目(YCSW2018137)
摘 要:针对车载协作通信中由于中继的自私行为会导致通信系统数据传输速率低的问题,提出一种基于信用卡社交网络用户信任度评估的最优中继选择算法。首先,建立一个综合社交网络和物理层的D2D中继协作双层模型,模型刻画了车辆节点人为属性。再从业务需求节点角度,利用信用卡风险评估方式对中继用户的信任度进行评估,并通过决策论对用户进行信任等级划分;从中继用户的角度,对信任度较好的用户进行激励补偿。最后,筛选出信任度高价格合理的最优中继。数值分析结果表明,相比于仅对积极中继用户进行选择的算法,该算法的通信系统数据传输率提高了10%左右。To solve the problem of the low data transmission rate due to the selfish behavior of relay users in vehicular cooperative communication, an optimal relay selection algorithm based on credit card risk assessment is proposed. At the first, a D2 D relay cooperative two-layer(social network and physical layer) model is set up to describe the human behavior characteristics of the vehicle nodes. And then, the relay ’s trust is evaluated by applying the credit risk assessment mechanism from business requirements perspective, relay’s credit levels are rated by the decision theory. On the other hand, the relays with good credit are compensated and motivated from the relay’s perspective. Finally, the optimal relay with high trust and reasonable price is selected. The numerical simulation results show that the data transmission rate of the proposed algorithm is increased about 10% compared with those that only the active relays are selected.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3