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 journalArticle

12 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 1

Fingerprint

Mobile ad hoc networks
Data storage equipment
Degradation
Communication
Costs

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Impact of node distance on selfish replica allocation in a mobile ad-hoc network. / Ryu, Byung Gul; Choi, Jae Ho; Lee, Sang-Geun.

In: Ad Hoc Networks, Vol. 11, No. 8, 01.11.2013, p. 2187-2202.

Research output: Contribution to journalArticle

Ryu, Byung Gul ; Choi, Jae Ho ; Lee, Sang-Geun. / Impact of node distance on selfish replica allocation in a mobile ad-hoc network. In: Ad Hoc Networks. 2013 ; Vol. 11, No. 8. pp. 2187-2202.
@article{ed5c490435f64a66819b9c05229e906e,
title = "Impact of node distance on selfish replica allocation in a mobile ad-hoc network",
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.",
keywords = "Integrated degree of selfishness, Mobile ad-hoc networks, Node distance, Selfish replica allocation",
author = "Ryu, {Byung Gul} and Choi, {Jae Ho} and Sang-Geun Lee",
year = "2013",
month = "11",
day = "1",
doi = "10.1016/j.adhoc.2013.05.001",
language = "English",
volume = "11",
pages = "2187--2202",
journal = "Ad Hoc Networks",
issn = "1570-8705",
publisher = "Elsevier",
number = "8",

}

TY - JOUR

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

AU - Ryu, Byung Gul

AU - Choi, Jae Ho

AU - Lee, Sang-Geun

PY - 2013/11/1

Y1 - 2013/11/1

N2 - 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.

AB - 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.

KW - Integrated degree of selfishness

KW - Mobile ad-hoc networks

KW - Node distance

KW - Selfish replica allocation

UR - http://www.scopus.com/inward/record.url?scp=84885296940&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885296940&partnerID=8YFLogxK

U2 - 10.1016/j.adhoc.2013.05.001

DO - 10.1016/j.adhoc.2013.05.001

M3 - Article

AN - SCOPUS:84885296940

VL - 11

SP - 2187

EP - 2202

JO - Ad Hoc Networks

JF - Ad Hoc Networks

SN - 1570-8705

IS - 8

ER -