The document discusses techniques for handling selfish nodes in replica allocation over mobile ad hoc networks. It aims to reduce traffic overhead while maintaining high data accessibility. The techniques include a selfish node detection algorithm that considers partial selfishness and novel replica allocation methods to address issues caused by selfish nodes hoarding replicas for their own benefit instead of sharing memory space. Simulations are used to evaluate the performance of these techniques in improving data delivery rates.

1. Handling Selfishness in Replica Allocation
Over a Mobile Ad Hoc Network
Main Objective:
The main objective of our novel replica allocation techniques is to
reduce traffic overhead, while achieving high data accessibility.
Abstract:
In a mobile ad hoc network, the mobility and resource constraints
of mobile nodes may lead to network partitioning or performance
degradation. Several data replication techniques have been proposed to
minimize performance degradation. Most of them assume that all mobile
nodes collaborate fully in terms of sharing their memory space. In
reality, some nodes may selfishly decide only to cooperate partially, or
not at all, with other nodes. These selfish nodes could then reduce the
overall data accessibility in the network. We examine the impact of
selfish nodes in a mobile ad hoc network from the perspective of replica
allocation. We propose a selfish node detection algorithm that considers
partial selfishness and novel replica allocation techniques to properly
cope with selfish replica allocation. Cognitive Radio Cognitive Network
(CRCN) Mechanism which reduces the congestion rate in network
involves the selection of neighbor memory space by handling the selfish
node. Our simulation in NS2 will show the better performance among
the data delivery rate.