Improvement of data sharing over mobile ad hoc network based on self-stabilize replica allocation

In a mobile ad hoc network, disconnections occur frequently due to various factors like power failure, mobility of the nodes, atmosphere conditions etc. This result in data inaccessibility, thereby causing selfishness. The reply from source node holding a target data item may not reach its destination due to two reasons, disconnections and node selfishness. In a frequent time interval, replica allocation will be performed based on the Self Centered Friendship (SCF) tree of each node in order to avoid selfishness. The source node fail to assign replica to a particular node in which the destination node cannot tell its status, since their impacts are high, i.e., data inaccessibility. Faulty Root Alarm (FRA) occurs when a particular node and its sub SCF tree vanishes unexpectedly and a massive data loses arises. In this paper we develop and Faulty Root Alarm to retain all the replicas that will be accessible in the remaining networks and a Self-Stabilize Replica Allocation (SSRA) algorithm for data allocation based on selfishness. The SSRA technique decreases query delay, improves the efficiency and reduce communication cost.