IEEE Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice

These are the authors' versions of the work. The copyright is with ACM. They are posted here by permission of ACM for your personal use. Not for redistribution. See individual publication details for information on the publication of the definitive versions.

Springer-Verlag LNCS Copyright Notice

The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.

Work that appeared before the 1st of September 2003 was published while the authors were with the Lehrstuhl Praktische Informatik IV at the University of Mannheim.

Optimal Replication Based on Optimal Path Hops for Opportunistic Networks

Author(s): Andre Ippisch, Salem Sati, Kalman Graffi.
Title: Optimal Replication Based on Optimal Path Hops for Opportunistic Networks
Published: Proceedings of the IEEE International Conference on Advanced Information Networking and Applications, , pp. 1-8, Cracow, Poland, May 2018
Abstract: Opportunistic Networks are highly mobile networks which may lack a reliable path between some source and destination. Therefore, this type of network uses Store, Carry and Forward and delivers messages based on hop-by-hop routing. Epidemic is the simplest routing protocol for Opportunistic Networks, as it replicates messages to all encountered nodes. For messages spread by Epidemic replication, we study and analyze the trade-off between the messages' delivery ratio, delay, and overhead. We consider that all members of the network, at any given time, know the amount of relay nodes that pass the message and each message carrier knows the amount of infected nodes that already have acquired the message. We address the problem of deriving the optimal closed-loop control for the replication strategy in our network. We draft this issue as a controlled, discrete-time and finite-state Markov Chain with an All Hops Optimal Path formulation. In real life scenarios, however, due to the intermittent correspondence in Opportunistic Networks the nodes do not have insight of the network's global state. We try to solve this issue by obtaining an Ordinary Differential Equation approximation of the Markov Chain for the replication process of messages. Furthermore, our model considers All Hops Optimal Path as network graph analysis for the optimally controlled replication. Lastly, we present the performance evaluation of these replication control conditions in finite networks. Our results show that this proposed Optimal Replication Based on Optimal Path Hops performs better than the omni-directional and contact-based Epidemic routing replication.
Bib entry: [XML] [BibTeX]
Verantwortlich für den Inhalt: E-Mail sendenWE Informatik