Fully selfish node detection, deletion and secure replica allocation over MANET

Abstract

In a mobile ad hoc network, several replica allocation techniques have been proposed to minimize performance degradation. If the nodes in a MANET together have sufficient memory space to hold both all the replicas and the original data. Some nodes may act selfishly, selfish nodes decide only to cooperate partially, or not at all, with other node (that is., Non-cooperative actions of misbehavior are usually termed as selfishness, which is notably different from malicious behavior). Selfish node may not share its own memory space to store replica for the benefits of other nodes. To develop a selfish node detection algorithm that considers partial selfishness and novel replica allocation technique to properly cope with selfish replica allocation. Selfish replica allocation refers to a node's non-cooperative action, such that the node refuses to cooperate fully in sharing its memory space with other nodes. Secure Hill cipher algorithm is to provide the security in replica data. Selfish replica allocation techniques significantly reduce communication cost and Simulation result show fully selfish node detection time, fully selfish node deletion time.