A Distributed Algorithm to Find Boundaries of Connected Components of a Euclidean Graph

Bezoui Madani 1 Ahcène Bounceur 2 Reinhardt Euler 3 Moulaï Mustapha
2 Lab-STICC_UBS_CACS_MOCS
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : Euclidean graphs are widely used in various fields, such as computing sciences, space exploration, neural networks, etc. In many cases, the majority of these graphs have vertices randomly deployed. This random aspect can make the graph divided into disjoint connected components with a topology that needs to be built. We propose a new technique to find the connected components and their boundaries using only connectivity information between a vertex and their neighbors. We show by an extensive simulation that the algorithm gives good results with a random generation of Wireless Sensors Networks.
Type de document :
Communication dans un congrès
GDR SoC SIP, Jun 2017, Bordeaux, France
Liste complète des métadonnées

http://hal.univ-brest.fr/hal-01556282
Contributeur : Ahcène Bounceur <>
Soumis le : mardi 4 juillet 2017 - 20:39:54
Dernière modification le : mardi 16 janvier 2018 - 15:54:24

Identifiants

  • HAL Id : hal-01556282, version 1

Citation

Bezoui Madani, Ahcène Bounceur, Reinhardt Euler, Moulaï Mustapha. A Distributed Algorithm to Find Boundaries of Connected Components of a Euclidean Graph. GDR SoC SIP, Jun 2017, Bordeaux, France. 〈hal-01556282〉

Partager

Métriques

Consultations de la notice

91