Total order in opportunistic networks

Mihail Costea, Radu Ioan Ciobanu, Radu Corneliu Marin, Ciprian Dobre, Constandinos X. Mavromoustakis, George Mastorakis, Fatos Xhafa

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Article numbere4056
JournalConcurrency Computation
Volume29
Issue number10
DOIs
Publication statusPublished - 25 May 2017

Keywords

  • consistency
  • delay tolerant
  • opportunistic networks
  • total order

Fingerprint Dive into the research topics of 'Total order in opportunistic networks'. Together they form a unique fingerprint.

  • Cite this

    Costea, M., Ciobanu, R. I., Marin, R. C., Dobre, C., Mavromoustakis, C. X., Mastorakis, G., & Xhafa, F. (2017). Total order in opportunistic networks. Concurrency Computation, 29(10), [e4056]. https://doi.org/10.1002/cpe.4056