Selfish replica allocation in a mobile ad hoc network with data update In a mobile ad hoc network, many data replication approaches have been proposed to minimize performance degradation caused by network partitioning. However, in reality, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. Recently, new approaches to selfish replica allocation have been proposed to handle the node selfishness. However, we empirically observe that the approaches may suffer from poor data accessibility and long query delay in the existence of data updates, because it does not utilize memory space of nodes for updated data. In this paper, we seek to measure the degree of selfishness and to categorize data items for handling both data update and node selfishness over a mobile ad hoc network. The conducted simulations demonstrate that our methodology outperforms existing selfish replica allocation approaches in terms of data accessibility, communication cost and query delay.