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

2020 
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.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    18
    References
    0
    Citations
    NaN
    KQI
    []