A Trust Routing Scheme based on Identification of Non-complete Cooperative Nodes in Mobile Peer-to-Peer Networks

被引:1
作者
Qu, Dapeng [1 ]
Zhang, Jiankun [1 ]
Hou, Zhenhuan [1 ]
Wang, Min [1 ]
Dong, Bo [2 ]
机构
[1] Liaoning Univ, Coll Informat, Shenyang 110036, Peoples R China
[2] Liaoning Univ, Coll Innovat & Entrepreneurship, Shenyang 110036, Liaoning, Peoples R China
来源
2020 IEEE 19TH INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM 2020) | 2020年
关键词
non-complete cooperative; individual; collusive; trust; routing; MECHANISM;
D O I
10.1109/TrustCom50675.2020.00017
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile peer-to-peer network (MP2P) attracts increasing attentions due to the ubiquitous use of mobile communication and huge success of peer-to-peer (P2P) mode. However, open p2p mode makes nodes tend to be selfish, and the scarcity of resources in mobile nodes aggravates this problem, thus the nodes easily express a non-complete cooperative (NCC) attitude. Therefore, an identification of non-complete cooperative nodes and a corresponding trust routing scheme are proposed for MP2P in this paper. The concept of octant is firstly introduced to build a trust model which analyzes nodes from three dimensions, namely direct trust, internal state and recommendation reliability, and then the individual non-complete cooperative (INCC) nodes can be identified by the division of different octants. The direct trust monitors nodes' external behaviors, and the consideration of internal state and recommendation reliability contributes to differentiate the subjective and objective non-cooperation, and mitigate the attacks about direct trust values respectively. Thus, the trust model can identify various INCC nodes accurately. On the basis of identification of INCC nodes, cosine similarity method is applied to identify collusive non-complete cooperate (CNCC) nodes. Moreover, a trust routing scheme based on the identification of NCC nodes is presented to reasonably deal with different kinds of NCC nodes. Results from extensive simulation experiments demonstrate that this proposed identification and routing scheme have better performances, in terms of identification precision and packet delivery fraction than current schemes respectively.
引用
收藏
页码:22 / 29
页数:8
相关论文
共 22 条
  • [1] [Anonymous], NETWORK SIMULATOR NS
  • [2] Current unknowns in the three-neutrino framework
    Capozzi, F.
    Lisi, E.
    Marrone, A.
    Palazzo, A.
    [J]. PROGRESS IN PARTICLE AND NUCLEAR PHYSICS, 2018, 102 : 48 - 72
  • [3] Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing
    Chen, Ing-Ray
    Bao, Fenye
    Chang, MoonJeong
    Cho, Jin-Hee
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (05) : 1200 - 1210
  • [4] A Survey on Trust Management for Mobile Ad Hoc Networks
    Cho, Jin-Hee
    Swami, Ananthram
    Chen, Ing-Ray
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2011, 13 (04): : 562 - 583
  • [5] GroupTrust: Dependable Trust Management
    Fan, Xinxin
    Liu, Ling
    Li, Mingchu
    Su, Zhiyuan
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2017, 28 (04) : 1076 - 1090
  • [6] Securing Cooperative Spectrum Sensing Against Collusive False Feedback Attack in Cognitive Radio Networks
    Feng, Jingyu
    Li, Shaoping
    Lv, Shaoqing
    Wang, Honggang
    Fu, Anmin
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (09) : 8276 - 8287
  • [7] Trust Computations and Trust Dynamics in Mobile Adhoc Networks: A Survey
    Govindan, Kannan
    Mohapatra, Prasant
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2012, 14 (02): : 279 - 298
  • [8] Iltaf N, 2013, 2013 IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE (CCNC), P617, DOI 10.1109/CCNC.2013.6488510
  • [9] Trust-based on-demand multipath routing in mobile ad hoc networks
    Li, X.
    Jia, Z.
    Zhang, P.
    Zhang, R.
    Wang, H.
    [J]. IET INFORMATION SECURITY, 2010, 4 (04) : 212 - 232
  • [10] Lian Q., P IEEE ICDCS 2007 P IEEE ICDCS 2007, P56