Résumé: The mobility of nodes in ad hoc networks can lead to frequent network partitioning. This partitioning disconnects many nodes from a centralised server. Being aware of a future partitioning can help to provide a continuous service availability for all mobile nodes. In this paper, we propose a service replication protocol consisting of three distributed algorithms. This protocol (i) predicts the occurrence of network partitioning, which allows to create service replicas in the future separate partitions and (ii) constructs a dynamic service replicas deployment scheme. Using linear-time temporal logic, we show that each detection of network partitioning can be predicted before its occurrence. Our simulation results show that the proposed protocol guarantees service availability to all mobile nodes without incurring high cost.

Langue: Anglais