MANAGING SELFISH NODES THROUGH NODE COOPERATIVE INCENTIVES IN MANETS
Mobile ad hoc networks are low in resources. This constraint leads to problems such as performance degradation or network partition. In order to overcome this problem data is replicated in mobile nodes. The replicas ensure that the performance is not degraded. Towards this all nodes are expect to work together and share the available memory. However, chances are that some nodes may not cooperate and rather behave selfishly. The selfishness of some of the nodes may lead to the performance degradation in terms of accessing data. Many replica allocation techniques came into existence. This paper implements that for detecting selfish nodes and replication allocation using simulation tool NS2. The empirical results revealed that the proposed algorithm I effective in terms of communication cost, data accessibility and average query delay.