A fully distributed replica allocation scheme for an opportunistic network

Ji Hyeun Yoon, Jae Ho Choi, Kwang Jo Lee, Sung-Bong Yang

Research output: Contribution to journalArticle

Abstract

An opportunistic network (OPPNET) consists of diverse mobile nodes with various mobility patterns. Numerous mobility patterns and the resource constraints of mobile nodes lead to network partitioning that result in system performance degradation including low data accessibility. In a traditional mobile ad hoc network (MANET) which is similar to an OPPNET, replica allocation schemes have been proposed to increase data accessibility. Although the schemes are efficient in a MANET, they may not be directly applicable to an OPPNET because the schemes are based on a grouping of mobile nodes. It is very difficult to build groups based on network topology in an OPPNET because a node in an OPPNET does not keep its network topology information. In this paper, we propose a novel replica allocation scheme for an opportunistic network called the Snooping-based Fully Distributed replica allocation scheme. The proposed scheme allocates replicas in a fully distributed manner without grouping to reduce the communication cost, and fetches allocated replicas utilizing a novel candidate list concept to achieve high data accessibility. In the proposed scheme, a node can fetch replicas opportunistically based on the candidate list. Consequently, the proposed replica allocation scheme achieves high data accessibility while reducing the communication cost significantly. Extensive simulation results demonstrate that the proposed scheme reduces the communication cost and improves data accessibility over traditional schemes.

Original languageEnglish
Pages (from-to)733-745
Number of pages13
JournalWireless Networks
Volume20
Issue number4
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Mobile ad hoc networks
Communication
Topology
Costs
Degradation

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Yoon, Ji Hyeun ; Choi, Jae Ho ; Lee, Kwang Jo ; Yang, Sung-Bong. / A fully distributed replica allocation scheme for an opportunistic network. In: Wireless Networks. 2014 ; Vol. 20, No. 4. pp. 733-745.
@article{a325c833867a4bbfa2f66dc7ee00fd12,
title = "A fully distributed replica allocation scheme for an opportunistic network",
abstract = "An opportunistic network (OPPNET) consists of diverse mobile nodes with various mobility patterns. Numerous mobility patterns and the resource constraints of mobile nodes lead to network partitioning that result in system performance degradation including low data accessibility. In a traditional mobile ad hoc network (MANET) which is similar to an OPPNET, replica allocation schemes have been proposed to increase data accessibility. Although the schemes are efficient in a MANET, they may not be directly applicable to an OPPNET because the schemes are based on a grouping of mobile nodes. It is very difficult to build groups based on network topology in an OPPNET because a node in an OPPNET does not keep its network topology information. In this paper, we propose a novel replica allocation scheme for an opportunistic network called the Snooping-based Fully Distributed replica allocation scheme. The proposed scheme allocates replicas in a fully distributed manner without grouping to reduce the communication cost, and fetches allocated replicas utilizing a novel candidate list concept to achieve high data accessibility. In the proposed scheme, a node can fetch replicas opportunistically based on the candidate list. Consequently, the proposed replica allocation scheme achieves high data accessibility while reducing the communication cost significantly. Extensive simulation results demonstrate that the proposed scheme reduces the communication cost and improves data accessibility over traditional schemes.",
author = "Yoon, {Ji Hyeun} and Choi, {Jae Ho} and Lee, {Kwang Jo} and Sung-Bong Yang",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/s11276-013-0641-6",
language = "English",
volume = "20",
pages = "733--745",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "4",

}

A fully distributed replica allocation scheme for an opportunistic network. / Yoon, Ji Hyeun; Choi, Jae Ho; Lee, Kwang Jo; Yang, Sung-Bong.

In: Wireless Networks, Vol. 20, No. 4, 01.01.2014, p. 733-745.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A fully distributed replica allocation scheme for an opportunistic network

AU - Yoon, Ji Hyeun

AU - Choi, Jae Ho

AU - Lee, Kwang Jo

AU - Yang, Sung-Bong

PY - 2014/1/1

Y1 - 2014/1/1

N2 - An opportunistic network (OPPNET) consists of diverse mobile nodes with various mobility patterns. Numerous mobility patterns and the resource constraints of mobile nodes lead to network partitioning that result in system performance degradation including low data accessibility. In a traditional mobile ad hoc network (MANET) which is similar to an OPPNET, replica allocation schemes have been proposed to increase data accessibility. Although the schemes are efficient in a MANET, they may not be directly applicable to an OPPNET because the schemes are based on a grouping of mobile nodes. It is very difficult to build groups based on network topology in an OPPNET because a node in an OPPNET does not keep its network topology information. In this paper, we propose a novel replica allocation scheme for an opportunistic network called the Snooping-based Fully Distributed replica allocation scheme. The proposed scheme allocates replicas in a fully distributed manner without grouping to reduce the communication cost, and fetches allocated replicas utilizing a novel candidate list concept to achieve high data accessibility. In the proposed scheme, a node can fetch replicas opportunistically based on the candidate list. Consequently, the proposed replica allocation scheme achieves high data accessibility while reducing the communication cost significantly. Extensive simulation results demonstrate that the proposed scheme reduces the communication cost and improves data accessibility over traditional schemes.

AB - An opportunistic network (OPPNET) consists of diverse mobile nodes with various mobility patterns. Numerous mobility patterns and the resource constraints of mobile nodes lead to network partitioning that result in system performance degradation including low data accessibility. In a traditional mobile ad hoc network (MANET) which is similar to an OPPNET, replica allocation schemes have been proposed to increase data accessibility. Although the schemes are efficient in a MANET, they may not be directly applicable to an OPPNET because the schemes are based on a grouping of mobile nodes. It is very difficult to build groups based on network topology in an OPPNET because a node in an OPPNET does not keep its network topology information. In this paper, we propose a novel replica allocation scheme for an opportunistic network called the Snooping-based Fully Distributed replica allocation scheme. The proposed scheme allocates replicas in a fully distributed manner without grouping to reduce the communication cost, and fetches allocated replicas utilizing a novel candidate list concept to achieve high data accessibility. In the proposed scheme, a node can fetch replicas opportunistically based on the candidate list. Consequently, the proposed replica allocation scheme achieves high data accessibility while reducing the communication cost significantly. Extensive simulation results demonstrate that the proposed scheme reduces the communication cost and improves data accessibility over traditional schemes.

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

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

U2 - 10.1007/s11276-013-0641-6

DO - 10.1007/s11276-013-0641-6

M3 - Article

AN - SCOPUS:84899644650

VL - 20

SP - 733

EP - 745

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 4

ER -