International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 178 - Number 6 |
Year of Publication: 2017 |
Authors: Paulo Gabriel Souza Ferreira Da Silva, Rafael Lima De Carvalho, Tiago Da Silva Almeida |
10.5120/ijca2017915835 |
Paulo Gabriel Souza Ferreira Da Silva, Rafael Lima De Carvalho, Tiago Da Silva Almeida . FeSTA-D: The Effect of Delaunay Triangulation in the Relay Node Placement using FeSTA Algorithm. International Journal of Computer Applications. 178, 6 ( Nov 2017), 1-6. DOI=10.5120/ijca2017915835
In the Wireless Sensor Networks (WSN) literature the connectivity restoration among deployed sensors is a well-known problem. In this paper, a solution called FeSTA is approached, which is deterministic and iterates over a list of triangles composed of the initial sensors (terminals) of an initially disconnected network. FeSTA seeks for the positioning of a set of extra relay nodes, while minimizing the quantity of such sensors, in order to change the initial disconnected network state to a connected one. In this work, the object of study is the effect of changing the originally proposed list of triangles to the Delaunay triangulation. It is shown that the effect on the measures such as number of employed relay nodes remains almost unchanged, while the number of processed triangles drops considerably.