Handling selfishness in replica allocation over a mobile ad hoc network

Jae Ho Choi, Kyu Sun Shim, Sang-Geun Lee, Kun Lung Wu

Research output: Contribution to journalArticle

42 Citations (Scopus)

Abstract

In a mobile ad hoc network, the mobility and resource constraints of mobile nodes may lead to network partitioning or performance degradation. Several data replication techniques have been proposed to minimize performance degradation. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. In reality, however, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. These selfish nodes could then reduce the overall data accessibility in the network. In this paper, we examine the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation. We term this selfish replica allocation. In particular, we develop a selfish node detection algorithm that considers partial selfishness and novel replica allocation techniques to properly cope with selfish replica allocation. The conducted simulations demonstrate the proposed approach outperforms traditional cooperative replica allocation techniques in terms of data accessibility, communication cost, and average query delay.

Original languageEnglish
Article number5740900
Pages (from-to)278-291
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume11
Issue number2
DOIs
Publication statusPublished - 2012 Feb 1

Fingerprint

Mobile ad hoc networks
Degradation
Data storage equipment
Communication
Costs

Keywords

  • degree of selfishness
  • Mobile ad hoc networks
  • selfish replica allocation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Software

Cite this

Handling selfishness in replica allocation over a mobile ad hoc network. / Choi, Jae Ho; Shim, Kyu Sun; Lee, Sang-Geun; Wu, Kun Lung.

In: IEEE Transactions on Mobile Computing, Vol. 11, No. 2, 5740900, 01.02.2012, p. 278-291.

Research output: Contribution to journalArticle

Choi, Jae Ho ; Shim, Kyu Sun ; Lee, Sang-Geun ; Wu, Kun Lung. / Handling selfishness in replica allocation over a mobile ad hoc network. In: IEEE Transactions on Mobile Computing. 2012 ; Vol. 11, No. 2. pp. 278-291.
@article{106e7b32366841d0a55ab780a7fdd1fd,
title = "Handling selfishness in replica allocation over a mobile ad hoc network",
abstract = "In a mobile ad hoc network, the mobility and resource constraints of mobile nodes may lead to network partitioning or performance degradation. Several data replication techniques have been proposed to minimize performance degradation. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. In reality, however, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. These selfish nodes could then reduce the overall data accessibility in the network. In this paper, we examine the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation. We term this selfish replica allocation. In particular, we develop a selfish node detection algorithm that considers partial selfishness and novel replica allocation techniques to properly cope with selfish replica allocation. The conducted simulations demonstrate the proposed approach outperforms traditional cooperative replica allocation techniques in terms of data accessibility, communication cost, and average query delay.",
keywords = "degree of selfishness, Mobile ad hoc networks, selfish replica allocation",
author = "Choi, {Jae Ho} and Shim, {Kyu Sun} and Sang-Geun Lee and Wu, {Kun Lung}",
year = "2012",
month = "2",
day = "1",
doi = "10.1109/TMC.2011.57",
language = "English",
volume = "11",
pages = "278--291",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Handling selfishness in replica allocation over a mobile ad hoc network

AU - Choi, Jae Ho

AU - Shim, Kyu Sun

AU - Lee, Sang-Geun

AU - Wu, Kun Lung

PY - 2012/2/1

Y1 - 2012/2/1

N2 - In a mobile ad hoc network, the mobility and resource constraints of mobile nodes may lead to network partitioning or performance degradation. Several data replication techniques have been proposed to minimize performance degradation. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. In reality, however, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. These selfish nodes could then reduce the overall data accessibility in the network. In this paper, we examine the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation. We term this selfish replica allocation. In particular, we develop a selfish node detection algorithm that considers partial selfishness and novel replica allocation techniques to properly cope with selfish replica allocation. The conducted simulations demonstrate the proposed approach outperforms traditional cooperative replica allocation techniques in terms of data accessibility, communication cost, and average query delay.

AB - In a mobile ad hoc network, the mobility and resource constraints of mobile nodes may lead to network partitioning or performance degradation. Several data replication techniques have been proposed to minimize performance degradation. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. In reality, however, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. These selfish nodes could then reduce the overall data accessibility in the network. In this paper, we examine the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation. We term this selfish replica allocation. In particular, we develop a selfish node detection algorithm that considers partial selfishness and novel replica allocation techniques to properly cope with selfish replica allocation. The conducted simulations demonstrate the proposed approach outperforms traditional cooperative replica allocation techniques in terms of data accessibility, communication cost, and average query delay.

KW - degree of selfishness

KW - Mobile ad hoc networks

KW - selfish replica allocation

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

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

U2 - 10.1109/TMC.2011.57

DO - 10.1109/TMC.2011.57

M3 - Article

AN - SCOPUS:84555189278

VL - 11

SP - 278

EP - 291

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 2

M1 - 5740900

ER -