DocumentCode :
2247699
Title :
Selfish replica allocation in a mobile ad hoc network with data update
Author :
Byung-Gul Ryu ; Woo-Jong Ryu ; Yong-Ku Lee ; Sangkeun Lee
Author_Institution :
Dept. of Comput. Sci. & Eng., Korea Univ., Seoul, South Korea
fYear :
2015
fDate :
9-11 Feb. 2015
Firstpage :
142
Lastpage :
149
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 :
mobile ad hoc networks; communication cost; data accessibility; data replication approach; data update handling; mobile ad hoc network partitioning; node selfishness handling; query delay; selfish replica allocation; Delays; Frequency measurement; Mobile ad hoc networks; Mobile communication; Nickel; Peer-to-peer computing; Resource management; data update; degree of selfishness; mobile ad hoc network; selfish replica allocation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Big Data and Smart Computing (BigComp), 2015 International Conference on
Conference_Location :
Jeju
Type :
conf
DOI :
10.1109/35021BIGCOMP.2015.7072824
Filename :
7072824
Link To Document :
بازگشت