In this paper, we address the problem of selfishness in the context of replica allocation in a MANET, i.e., a selfish node may not share its own memory space to store replica for the benefit of other nodes. In this paper, we shall refer to such a problem as the selfish replica allocation. Simply, selfish replica allocation refers to a node’s noncooperative action, such that the node refuses to cooperate fully in sharing its memory space with other nodes. Our strategy consists of three parts: 1) detecting selfish nodes, 2) building the SCF-tree, and 3) allocating replica. At a specific period, or relocation period each node executes the following procedures: Each node detects the selfish nodes based on credit risk scores, each node makes its own (partial) topology graph and builds its own SCF-tree by excluding selfish nodes. Based on SCF-tree, each node allocates replica in a fully distributed manner.IEEE