The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Après des catastrophes à grande échelle, le partage d’informations entre les populations devient plus important que d’habitude. Ceci est toutefois extrêmement difficile à réaliser dans les zones sinistrées en raison des graves dommages causés à l’infrastructure réseau existante, des pannes de courant et des embouteillages élevés. Pour la fourniture rapide de réseaux alternatifs destinés à répondre aux fortes demandes de communication après une catastrophe, l'établissement de réseaux locaux (LAN) constitués de serveurs portables avec stockage de données a été considéré comme l'une des solutions les plus prometteuses. Sur la base du réseau local établi et d'un serveur de données dans chaque zone, les gens peuvent partager de nombreux types d'informations liées aux catastrophes, telles que des informations d'urgence et des informations sur l'offre et la demande via des serveurs voisins déployés. Cependant, faute de connexion Internet stable, ces serveurs sont isolés et ne peuvent pas être synchronisés en temps réel. Pour permettre et garantir un partage d'informations plus efficace dans l'ensemble de la zone sinistrée, les données stockées sur chaque serveur doivent être synchronisées sans Internet. Notre solution consiste à proposer un schéma de synchronisation de données intermittente qui utilise des véhicules en mouvement comme relais pour échanger des données entre serveurs isolés après des sinistres. Dans le but de maximiser le nombre total de données synchronisées de haute priorité sous les contraintes de capacité des relais mobiles, nous proposons d'abord un schéma d'allocation de données (DAS) d'un serveur à un relais mobile. Après cela, nous proposons un schéma de planification de trajectoire pour les relais qui est formulé comme un problème de programmation fractionnaire linéaire en nombres entiers mixtes (MILFP), et un algorithme pour le résoudre efficacement. Des simulations approfondies et des comparaisons avec d’autres méthodes montrent les performances supérieures de nos propositions.
Kazuya ANAZAWA
University of Aizu
Toshiaki MIYAZAKI
University of Aizu
Peng LI
University of Aizu
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Kazuya ANAZAWA, Toshiaki MIYAZAKI, Peng LI, "Data Synchronization Method among Isolated Servers Using Mobile Relays" in IEICE TRANSACTIONS on Communications,
vol. E101-B, no. 10, pp. 2239-2249, October 2018, doi: 10.1587/transcom.2017EBP3468.
Abstract: After large-scale disasters, information sharing among people becomes more important than usual. This, however, is extremely difficult to achieve in disaster zones due to serious damage to the existing network infrastructure, power outages, and high traffic congestion. For the quick provision of alternative networks to serve heavy communication demands after disasters, establishing local area networks (LANs) consisting of portable servers with data storage has been considered as one of the most promising solutions. Based on the established LAN and a data server in each area, people can share many kinds of disaster-related information such as emergency information and supply/demand information via deployed neighboring servers. However, due to the lack of stable Internet connection, these servers are isolated and cannot be synchronized in real time. To enable and guarantee more efficient information sharing across the whole disaster-hit area, data stored on each server should be synchronized without the Internet. Our solution is to propose an intermittent data synchronization scheme that uses moving vehicles as relays to exchange data between isolated servers after disasters. With the objective of maximizing the total number of synchronized high priority data under the capability constraints of mobile relays, we first propose a data allocation scheme (DAS) from a server to a mobile relay. After that, we propose a trajectory planning scheme for the relays which is formulated as a Mixed Integer Linear Fractional Programming (MILFP) problem, and an algorithm to solve it efficiently. Extensive simulations and comparisons with other methods show the superior performance of our proposals.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2017EBP3468/_p
Copier
@ARTICLE{e101-b_10_2239,
author={Kazuya ANAZAWA, Toshiaki MIYAZAKI, Peng LI, },
journal={IEICE TRANSACTIONS on Communications},
title={Data Synchronization Method among Isolated Servers Using Mobile Relays},
year={2018},
volume={E101-B},
number={10},
pages={2239-2249},
abstract={After large-scale disasters, information sharing among people becomes more important than usual. This, however, is extremely difficult to achieve in disaster zones due to serious damage to the existing network infrastructure, power outages, and high traffic congestion. For the quick provision of alternative networks to serve heavy communication demands after disasters, establishing local area networks (LANs) consisting of portable servers with data storage has been considered as one of the most promising solutions. Based on the established LAN and a data server in each area, people can share many kinds of disaster-related information such as emergency information and supply/demand information via deployed neighboring servers. However, due to the lack of stable Internet connection, these servers are isolated and cannot be synchronized in real time. To enable and guarantee more efficient information sharing across the whole disaster-hit area, data stored on each server should be synchronized without the Internet. Our solution is to propose an intermittent data synchronization scheme that uses moving vehicles as relays to exchange data between isolated servers after disasters. With the objective of maximizing the total number of synchronized high priority data under the capability constraints of mobile relays, we first propose a data allocation scheme (DAS) from a server to a mobile relay. After that, we propose a trajectory planning scheme for the relays which is formulated as a Mixed Integer Linear Fractional Programming (MILFP) problem, and an algorithm to solve it efficiently. Extensive simulations and comparisons with other methods show the superior performance of our proposals.},
keywords={},
doi={10.1587/transcom.2017EBP3468},
ISSN={1745-1345},
month={October},}
Copier
TY - JOUR
TI - Data Synchronization Method among Isolated Servers Using Mobile Relays
T2 - IEICE TRANSACTIONS on Communications
SP - 2239
EP - 2249
AU - Kazuya ANAZAWA
AU - Toshiaki MIYAZAKI
AU - Peng LI
PY - 2018
DO - 10.1587/transcom.2017EBP3468
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E101-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2018
AB - After large-scale disasters, information sharing among people becomes more important than usual. This, however, is extremely difficult to achieve in disaster zones due to serious damage to the existing network infrastructure, power outages, and high traffic congestion. For the quick provision of alternative networks to serve heavy communication demands after disasters, establishing local area networks (LANs) consisting of portable servers with data storage has been considered as one of the most promising solutions. Based on the established LAN and a data server in each area, people can share many kinds of disaster-related information such as emergency information and supply/demand information via deployed neighboring servers. However, due to the lack of stable Internet connection, these servers are isolated and cannot be synchronized in real time. To enable and guarantee more efficient information sharing across the whole disaster-hit area, data stored on each server should be synchronized without the Internet. Our solution is to propose an intermittent data synchronization scheme that uses moving vehicles as relays to exchange data between isolated servers after disasters. With the objective of maximizing the total number of synchronized high priority data under the capability constraints of mobile relays, we first propose a data allocation scheme (DAS) from a server to a mobile relay. After that, we propose a trajectory planning scheme for the relays which is formulated as a Mixed Integer Linear Fractional Programming (MILFP) problem, and an algorithm to solve it efficiently. Extensive simulations and comparisons with other methods show the superior performance of our proposals.
ER -