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 language | English |
|---|---|
| Title of host publication | 2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 142-149 |
| Number of pages | 8 |
| ISBN (Print) | 9781479973033 |
| DOIs | |
| Publication status | Published - 2015 Mar 30 |
| Event | 2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015 - Jeju, Korea, Republic of Duration: 2015 Feb 9 → 2015 Feb 11 |
Other
| Other | 2015 International Conference on Big Data and Smart Computing, BIGCOMP 2015 |
|---|---|
| Country | Korea, Republic of |
| City | Jeju |
| Period | 15/2/9 → 15/2/11 |
Fingerprint
Keywords
- data update
- degree of selfishness
- mobile ad hoc network
- selfish replica allocation
ASJC Scopus subject areas
- Software
Cite this
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 proceeding › Conference contribution
}
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 -