Main Article Content
Abstract
In a mobile ad hoc network, the mobility and resource constraints of mobile nodes may lead to network partition or performance degradation. Several data replication techniques have been proposed to minimize presentation degradation. Most of them assume that all mobile nodes work together fully in terms of sharing their memory space. In reality, however, some nodes may uncaringly 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. In this paper, we examine the collision of selfish nodes in a mobile ad hoc network from the perspective of replica allotment. We term this selfish replica allocation. In particular, we develop a selfish node finding algorithm that considers partial selfishness and novel replica allocation technique to properly cope with selfish replica allocation. The conducted simulations demonstrate the proposed approach outperforms conventional cooperative replica allocation techniques in terms of data accessibility, statement cost, and average query delay.