TY - JOUR
T1 - Total order in opportunistic networks
AU - Costea, Mihail
AU - Ciobanu, Radu Ioan
AU - Marin, Radu Corneliu
AU - Dobre, Ciprian
AU - Mavromoustakis, Constandinos X.
AU - Mastorakis, George
AU - Xhafa, Fatos
PY - 2017/5/25
Y1 - 2017/5/25
N2 - Opportunistic network applications are usually assumed to work only with unordered immutable messages, like photos, videos, or music files, while applications that depend on ordered or mutable messages, like chat or shared contents editing applications, are ignored. In this paper, we examine how total ordering can be achieved in an opportunistic network. By leveraging on existing dissemination and causal order algorithms, we propose a commutative replicated data type algorithm on the basis of Logoot for achieving total order without using tombstones in opportunistic networks where message delivery is not guaranteed by the routing layer. Our algorithm is designed to use the nature of the opportunistic network to reduce the metadata size compared to the original Logoot, and even to achieve in some cases higher hit rates compared to the dissemination algorithms when no order is enforced. Finally, we present the results of the experiments for the new algorithm by using an opportunistic network emulator, mobility traces, and Wikipedia pages.
AB - Opportunistic network applications are usually assumed to work only with unordered immutable messages, like photos, videos, or music files, while applications that depend on ordered or mutable messages, like chat or shared contents editing applications, are ignored. In this paper, we examine how total ordering can be achieved in an opportunistic network. By leveraging on existing dissemination and causal order algorithms, we propose a commutative replicated data type algorithm on the basis of Logoot for achieving total order without using tombstones in opportunistic networks where message delivery is not guaranteed by the routing layer. Our algorithm is designed to use the nature of the opportunistic network to reduce the metadata size compared to the original Logoot, and even to achieve in some cases higher hit rates compared to the dissemination algorithms when no order is enforced. Finally, we present the results of the experiments for the new algorithm by using an opportunistic network emulator, mobility traces, and Wikipedia pages.
KW - consistency
KW - delay tolerant
KW - opportunistic networks
KW - total order
UR - http://www.scopus.com/inward/record.url?scp=85010501184&partnerID=8YFLogxK
U2 - 10.1002/cpe.4056
DO - 10.1002/cpe.4056
M3 - Article
AN - SCOPUS:85010501184
SN - 1532-0626
VL - 29
JO - Concurrency Computation
JF - Concurrency Computation
IS - 10
M1 - e4056
ER -