Impact of node distance on selfish replica allocation in a mobile ad-hoc network

초록

Many data replication techniques have been proposed to minimize performance degradation caused by network partitioning in a mobile ad hoc network. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. However, in reality, some nodes may selfishly decide to only cooperate partially, or not at all, with other nodes. Recently, a new approach to selfish replica allocation has been proposed to handle node selfishness. However, there is still much room for improvement. We empirically observe that the previous selfish replica allocation strategy suffers from long query delay and poor data accessibility, because it utilizes only non-selfish nodes that may be faraway nodes. In this paper, we propose a novel replica allocation strategy in the presence of selfish nodes, that takes into account both selfish behavior and node distance. Moreover, through a novel node leveling technique, we utilize the memory space of all connected nodes, including selfish nodes. The conducted simulations demonstrate that the proposed strategy outperforms existing replica allocation techniques in terms of data accessibility, query delay, and communication cost. (C) 2013 Elsevier B.V. All rights reserved.

키워드