Selfish replica allocation in a mobile ad hoc network with data update

Byung Gul Ryu, Woo Jong Ryu, Yong Ku Lee, Sang-Geun Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In a mobile ad hoc network, many data replication approaches have been proposed to minimize performance degradation caused by network partitioning. However, in reality, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. Recently, new approaches to selfish replica allocation have been proposed to handle the node selfishness. However, we empirically observe that the approaches may suffer from poor data accessibility and long query delay in the existence of data updates, because it does not utilize memory space of nodes for updated data. In this paper, we seek to measure the degree of selfishness and to categorize data items for handling both data update and node selfishness over a mobile ad hoc network. The conducted simulations demonstrate that our methodology outperforms existing selfish replica allocation approaches in terms of data accessibility, communication cost and query delay.

Original languageEnglish
Title of host publication2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages142-149
Number of pages8
ISBN (Print)9781479973033
DOIs
Publication statusPublished - 2015 Mar 30
Event2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015 - Jeju, Korea, Republic of
Duration: 2015 Feb 92015 Feb 11

Other

Other2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015
CountryKorea, Republic of
CityJeju
Period15/2/915/2/11

Fingerprint

Mobile ad hoc networks
Data handling
Data storage equipment
Degradation
Communication
Costs

Keywords

  • data update
  • degree of selfishness
  • mobile ad hoc network
  • selfish replica allocation

ASJC Scopus subject areas

  • Software

Cite this

Ryu, B. G., Ryu, W. J., Lee, Y. K., & Lee, S-G. (2015). Selfish replica allocation in a mobile ad hoc network with data update. In 2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015 (pp. 142-149). [7072824] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/35021BIGCOMP.2015.7072824

Selfish replica allocation in a mobile ad hoc network with data update. / Ryu, Byung Gul; Ryu, Woo Jong; Lee, Yong Ku; Lee, Sang-Geun.

2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 142-149 7072824.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ryu, BG, Ryu, WJ, Lee, YK & Lee, S-G 2015, Selfish replica allocation in a mobile ad hoc network with data update. in 2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015., 7072824, Institute of Electrical and Electronics Engineers Inc., pp. 142-149, 2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015, Jeju, Korea, Republic of, 15/2/9. https://doi.org/10.1109/35021BIGCOMP.2015.7072824
Ryu BG, Ryu WJ, Lee YK, Lee S-G. Selfish replica allocation in a mobile ad hoc network with data update. In 2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 142-149. 7072824 https://doi.org/10.1109/35021BIGCOMP.2015.7072824
Ryu, Byung Gul ; Ryu, Woo Jong ; Lee, Yong Ku ; Lee, Sang-Geun. / Selfish replica allocation in a mobile ad hoc network with data update. 2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 142-149
@inproceedings{03e1f99780c94dda9167c712a93f844b,
title = "Selfish replica allocation in a mobile ad hoc network with data update",
abstract = "In a mobile ad hoc network, many data replication approaches have been proposed to minimize performance degradation caused by network partitioning. However, in reality, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. Recently, new approaches to selfish replica allocation have been proposed to handle the node selfishness. However, we empirically observe that the approaches may suffer from poor data accessibility and long query delay in the existence of data updates, because it does not utilize memory space of nodes for updated data. In this paper, we seek to measure the degree of selfishness and to categorize data items for handling both data update and node selfishness over a mobile ad hoc network. The conducted simulations demonstrate that our methodology outperforms existing selfish replica allocation approaches in terms of data accessibility, communication cost and query delay.",
keywords = "data update, degree of selfishness, mobile ad hoc network, selfish replica allocation",
author = "Ryu, {Byung Gul} and Ryu, {Woo Jong} and Lee, {Yong Ku} and Sang-Geun Lee",
year = "2015",
month = "3",
day = "30",
doi = "10.1109/35021BIGCOMP.2015.7072824",
language = "English",
isbn = "9781479973033",
pages = "142--149",
booktitle = "2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Selfish replica allocation in a mobile ad hoc network with data update

AU - Ryu, Byung Gul

AU - Ryu, Woo Jong

AU - Lee, Yong Ku

AU - Lee, Sang-Geun

PY - 2015/3/30

Y1 - 2015/3/30

N2 - In a mobile ad hoc network, many data replication approaches have been proposed to minimize performance degradation caused by network partitioning. However, in reality, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. Recently, new approaches to selfish replica allocation have been proposed to handle the node selfishness. However, we empirically observe that the approaches may suffer from poor data accessibility and long query delay in the existence of data updates, because it does not utilize memory space of nodes for updated data. In this paper, we seek to measure the degree of selfishness and to categorize data items for handling both data update and node selfishness over a mobile ad hoc network. The conducted simulations demonstrate that our methodology outperforms existing selfish replica allocation approaches in terms of data accessibility, communication cost and query delay.

AB - In a mobile ad hoc network, many data replication approaches have been proposed to minimize performance degradation caused by network partitioning. However, in reality, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. Recently, new approaches to selfish replica allocation have been proposed to handle the node selfishness. However, we empirically observe that the approaches may suffer from poor data accessibility and long query delay in the existence of data updates, because it does not utilize memory space of nodes for updated data. In this paper, we seek to measure the degree of selfishness and to categorize data items for handling both data update and node selfishness over a mobile ad hoc network. The conducted simulations demonstrate that our methodology outperforms existing selfish replica allocation approaches in terms of data accessibility, communication cost and query delay.

KW - data update

KW - degree of selfishness

KW - mobile ad hoc network

KW - selfish replica allocation

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

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

U2 - 10.1109/35021BIGCOMP.2015.7072824

DO - 10.1109/35021BIGCOMP.2015.7072824

M3 - Conference contribution

SN - 9781479973033

SP - 142

EP - 149

BT - 2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -