Please use this identifier to cite or link to this item:
Title: Total order in opportunistic networks
Author: Costea, Mihail
Ciobanu, Rado-Ioan
Marin, Radu-Corneliu
Dobre, Ciprian
Mavromoustakis, Constandinos X.
Xhafa, Fatos
Mastorakis, George
Others: University Politehnica of Bucharest
Technological Educational Institute of Crete
University of Nicosia
Universitat Oberta de Catalunya (UOC)
Keywords: opportunistic networks
delay tolerant
total order
Issue Date: 14-Dec-2016
Publisher: Concurrency and computation
Citation: Costea, M., Ciobanu, R.-I., Marin, R.-C., Dobre, C., Mavromoustakis, C.X., Mastorakis, G., & Xhafa, F. (2017). Total order in opportunistic networks. Concurrency and computation, 29(10). doi: 10.1002/cpe.4056
Project identifier: info:eu-repo/grantAgreement/PN-II-PT-PCCA2013-4-0321
Also see:
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.
Language: English
ISSN: 1532-0626MIAR
Appears in Collections:Articles

Files in This Item:
File SizeFormat 
totalorder.pdf952.13 kBAdobe PDFView/Open

Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.