 |
Conference papers
A Distributed Algorithm to Find Boundaries of Connected Components of a Euclidean Graph
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.
https://hal.univ-brest.fr/hal-01556282
Contributor : Ahcène Bounceur Connect in order to contact the contributor
Submitted on : Tuesday, July 4, 2017 - 8:39:54 PM
Last modification on : Monday, October 11, 2021 - 2:23:45 PM
Contributor : Ahcène Bounceur Connect in order to contact the contributor
Submitted on : Tuesday, July 4, 2017 - 8:39:54 PM
Last modification on : Monday, October 11, 2021 - 2:23:45 PM