Por favor, use este identificador para citar o enlazar este ítem: https://repositorio.cetys.mx/handle/60000/898
Título : A two-player coalition cooperative scheme for the bodyguard allocation problem
Otros títulos : Journal of Computer Science and Technology
Autor : Fernández-Zepeda, J.
Otros Autores: CETYS Universidad
Autor: Brubeck-Salcedo, D.
Fajardo-Delgado, D
Zatarain-Aceves, H.
Palabras clave : Protocols;Mobile handsets;Routing;Comunication Network
Sede: Campus Ensenada
Fecha de publicación : 16-may-2018
Citación : 33;4
Resumen : This paper introduces the maximum uniform message distribution (MUMD) problem, which can be present in delay-tolerant communication networks, where the destination of the messages is not present in the network. This type of behavior arises in scenarios of natural disasters or social conflicts where a global communication network is not available. In these scenarios, the people inside the affected area might use their mobile devices to communicate in an opportunistic manner. During this communication, the devices can duplicate, exchange, and gather messages with the intention of afterward delivering them to the global communication network. A device successfully delivers all messages in its memory when it reaches the global communication network. We model the MUMD as a computational problem and analyze the effectiveness of the existing opportunistic routing algorithms to solve this problem. Furthermore, we design an algorithm for the MUMD and perform experimental simulations to analyze its performance. Our results show that the greater the number of copies of messages and the more uniformly distributed through the network they are, the higher the probability that deliveries will be successful.
metadata.dc.description.url: https://link.springer.com/article/10.1007/s11390-018-1858-8
URI : https://repositorio.cetys.mx/handle/60000/898
Aparece en las colecciones: Artículos de Revistas

Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
08360101.pdf8.91 MBAdobe PDFVista previa

Este ítem está protegido por copyright original

Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons Creative Commons