基于纳什议价的P2P社会网络资源共享

发布时间：2018-10-24 22:03

【摘要】：针对peer-to-peer(P2P)社会网络中存在的自由下载问题,提出了一种基于纳什议价的节点资源共享博弈。将节点共享资源分为公共品资源和俱乐部资源两类;将社会网络中的节点关系集合分为朋友集合(FS)和普通集合(SS)。节点在FS中共享的资源作为公共品资源,在SS中的作为俱乐部资源。采用纳什议价的方法证明存在节点共享能力、保证不同集合中节点共享资源的最小服务质量以及最大化节点共享资源效用函数的条件下,共享资源节点根据纳什议价权力对不同集合进行资源共享,达到最优的资源共享,并分析了基于纳什议价节点共享资源的公平性。通过仿真验证表明,节点共享资源的收益和资源共享量与不同集合议价权力都正相关,保证最小服务质量的资源共享其公平性因子高于不存在服务质量保证的资源共享公平性因子。仿真结果验证了理论分析结果。
[Abstract]:Aiming at the problem of free download in peer-to-peer (P2P) social network, a node resource sharing game based on Nash bargaining is proposed. The node shared resources are divided into public goods resources and club resources, and the set of node relationships in social network is divided into friend set (FS) and ordinary set (SS). The resources shared by nodes in FS are regarded as public goods resources and those in SS as club resources. The Nash bargaining method is used to prove the existence of node sharing ability to ensure the minimum quality of service (QoS) of shared resources in different sets and to maximize the utility function of shared resources. The shared resource nodes share different sets according to Nash bargaining power to achieve the optimal resource sharing and analyze the fairness of sharing resources based on Nash bargaining power. The simulation results show that the revenue and share amount of shared resources are positively related to the bargaining power of different sets. The fairness factor of resource sharing with minimum quality of service is higher than that with no guarantee of quality of service. The simulation results verify the theoretical analysis results.
【作者单位】：电子科技大学通信学院宽带光纤传输与通信网教育部重点实验室;
【基金】：国家自然科学基金资助项目(61001084)
【分类号】：TP393.02

【相似文献】