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

Byung Gul Ryu, Jae Ho Choi, Sang-Geun Lee

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)2187-2202
Number of pages16
JournalAd Hoc Networks
Volume11
Issue number8
DOIs
Publication statusPublished - 2013 Nov

Keywords

  • Integrated degree of selfishness
  • Mobile ad-hoc networks
  • Node distance
  • Selfish replica allocation

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Impact of node distance on selfish replica allocation in a mobile ad-hoc network'. Together they form a unique fingerprint.

Cite this