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.
Bibliographical noteFunding Information:
This work was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (No. 2011-0010325).
SangKeun Lee received the BS, MS, and PhD degrees in computer science and engineering from Korea University, South Korea, in 1994, 1996, and 1999, respectively. He was a recipient of the Japan Society for the Promotion of Science (JSPS) Postdoctoral Fellowship in 2000. Also, he was an academic visitor to IBM T.J. Watson Research Center, United States, in 2009. Since 2003, he has been an assistant/associate/full professor in the College of Information and Communication, Korea University, Republic of Korea. His recent research interests include mobile Internet technologies, contextual advertising, mobile/pervasive computing, XML databases, and mobile ad hoc networks.
- Integrated degree of selfishness
- Mobile ad-hoc networks
- Node distance
- Selfish replica allocation
ASJC Scopus subject areas
- Hardware and Architecture
- Computer Networks and Communications