In this paper we provide a distributed way to transform the network topology underlying a set of agents embedded in a bi-dimensional space into a planar graph, and specifically into a Gabriel graph. Moreover, a distributed algorithm based on synchronized consensus methodologies is provided in order to gather some useful pieces of meta-information (number of faces, average size of the faces, size of the boundary, etc.) and to let each node in the Gabriel graph identify its "role" (i.e., node that links two subgraphs, node on a branch ending with a leaf, node belonging to a face, etc.). The insights obtained by means of the proposed approach may contribute to develop better geographic routing techniques as well as to improve the local decision capability of the agents in distributed environments.
Distributed gabriel graph construction and meta-information gathering
Oliva G;Setola R;
2014-01-01
Abstract
In this paper we provide a distributed way to transform the network topology underlying a set of agents embedded in a bi-dimensional space into a planar graph, and specifically into a Gabriel graph. Moreover, a distributed algorithm based on synchronized consensus methodologies is provided in order to gather some useful pieces of meta-information (number of faces, average size of the faces, size of the boundary, etc.) and to let each node in the Gabriel graph identify its "role" (i.e., node that links two subgraphs, node on a branch ending with a leaf, node belonging to a face, etc.). The insights obtained by means of the proposed approach may contribute to develop better geographic routing techniques as well as to improve the local decision capability of the agents in distributed environments.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
