Gossiping with interference in radio chain networks (upper bound algorithms)
Résumé
In this paper, we study the problem of gossiping with interference constraint in radio chain networks. Gossiping (or total exchange information) is a protocol where each node in the network has a message and wants to distribute its own message to every other node in the network. The gossiping problem consists in finding the minimum running time (makespan) of a gossiping protocol and efficient algorithms that attain this makespan.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...