A Distributed Algorithm to Find Boundaries of Connected Components of a Euclidean Graph - Université de Bretagne Occidentale
Conference Papers Year : 2017

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

Madani Bezoui
Ahcène Bounceur
Reinhardt Euler
Moulaï Mustapha
  • Function : Author

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.
No file

Dates and versions

hal-01556282 , version 1 (04-07-2017)

Identifiers

  • HAL Id : hal-01556282 , version 1

Cite

Madani Bezoui, 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⟩
116 View
0 Download

Share

More