Total order in opportunistic networks. (14th December 2016)

• Record Type: Journal Article
• Authors: Costea, Mihail; Ciobanu, Radu‐Ioan; Marin, Radu‐Corneliu; Dobre, Ciprian; Mavromoustakis, Constandinos X.; Mastorakis, George; Xhafa, Fatos
• Is Part Of: Concurrency and computation. Volume 29:Number 10(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2016-12-14
• Subjects: consistency -- delay tolerant -- opportunistic networks -- total order; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4056
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: 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.