Skip to Main content Skip to Navigation
Conference papers

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
3 Lab-STICC_UBO_CID_DECIDE
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.
Document type :
Conference papers
Complete list of metadatas

https://hal.univ-brest.fr/hal-01556282
Contributor : Ahcène Bounceur <>
Submitted on : Tuesday, July 4, 2017 - 8:39:54 PM
Last modification on : Wednesday, June 24, 2020 - 4:19:35 PM

Identifiers

  • 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⟩

Share

Metrics

Record views

198