Open AccessPSO‐based optimal peer selection approach for highly secure and trusted P2P system
Author(s) -
Nallakannu Senthil Madasamy,
Thiagarajan Revathi
Publication year - 2016
Publication title -
security and communication networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.446
H-Index - 43
eISSN - 1939-0122
pISSN - 1939-0114
DOI - 10.1002/sec.1478
Subject(s) - computer science , peer to peer , bandwidth (computing) , overhead (engineering) , particle swarm optimization , replication (statistics) , selection (genetic algorithm) , computer network , file sharing , distributed computing , encryption , operating system , algorithm , the internet , statistics , mathematics , artificial intelligence
Abstract There is a significant growth of the peer‐to‐peer (P2P) systems over the last few years because of their high potential for sharing file among the peers. Selection of the optimal peer ensures high data transmission rate and reduced network cost. However, it is highly difficult to select the optimal peer because of the variation in the heterogeneous capacity and dynamic capacity of the peers. Efficient peer selection approach is highly required to overcome this difficulty. This paper proposes a particle swarm optimization (PSO)‐based optimal peer selection approach for a highly secure and trusted P2P system, based on the bandwidth and trust level of the peers. File replication is performed to effectively tackle the overloading of the hot files. Replacement of the replicated file is performed, based on their demand rates. The success rate and bandwidth rate of the peer are computed. Bandwidth and trust‐based PSO is applied to select the optimal peer. This improves the success rate for the peer transmission. After selecting the optimal peer, the replicated file is encrypted and transmitted to the selected peer. Finally, the replicated file is decrypted. Our proposed approach achieves minimum average query delay and ensures a highly secure and trusted environment for the P2P systems. The performance of the proposed approach is evaluated by comparing the proposed approach with the existing techniques. From the comparison results, it is clearly evident that the proposed approach achieves higher success rate and lower link stress, delay, communication overhead, finished time and network cost. Copyright © 2016 John Wiley & Sons, Ltd.