Title: Selfish node detection based on evidence by trust authority and selfish replica allocation in DANET
Authors: Deverajan Ganesh Gopal; R. Saravanan
Addresses: School of Computing Science and Engineering, VIT University, Vellore, 632014 India ' School of Information Technology and Engineering, VIT University, Vellore, 632014 India
Abstract: A dynamic ad hoc network (DANET) is a dynamic network of several nodes without any centralised leadership. In DANET, any connecting device and a host is considered as a node. Certain nodes will not take active participation in forwarding messages. In other words, the memory space will not be shared in order to conserve the energy and the resources. Such nodes are called selfish nodes and such nodes are the main reason for reduced data accessibility, query delay and increased communication costs. In this work, selfish nodes are detected by employing evidence based detection. The concern about security is handled by trust authority (TA). TA can find the replicated node too, created by an adversary. An improved self-centred friendship (ISCF) tree is framed and finally, the replica is allocated to the node by taking into account the number of times the data items are accessed and the level of the node. This work outpaces the existing work in terms of selfishness detection accuracy and selfishness detection time in addition to various other factors like data accessibility, query delay and communication cost.
Keywords: selfish nodes; trust authority; dynamic ad hoc networks; DANETs; improved self-centred friendship; ISCF tree; selfish node detection; selfish replica allocation; data accessibility; query delay; communication cost.
International Journal of Information and Communication Technology, 2016 Vol.9 No.4, pp.473 - 491
Available online: 12 Oct 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article