CFP last date
20 January 2025
Reseach Article

FeSTA-D: The Effect of Delaunay Triangulation in the Relay Node Placement using FeSTA Algorithm

by Paulo Gabriel Souza Ferreira Da Silva, Rafael Lima De Carvalho, Tiago Da Silva Almeida
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

@article{ 10.5120/ijca2017915835,
author = { Paulo Gabriel Souza Ferreira Da Silva, Rafael Lima De Carvalho, Tiago Da Silva Almeida },
title = { FeSTA-D: The Effect of Delaunay Triangulation in the Relay Node Placement using FeSTA Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { Nov 2017 },
volume = { 178 },
number = { 6 },
month = { Nov },
year = { 2017 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume178/number6/28675-2017915835/ },
doi = { 10.5120/ijca2017915835 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:49:39.102053+05:30
%A Paulo Gabriel Souza Ferreira Da Silva
%A Rafael Lima De Carvalho
%A Tiago Da Silva Almeida
%T FeSTA-D: The Effect of Delaunay Triangulation in the Relay Node Placement using FeSTA Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 178
%N 6
%P 1-6
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Michael William Chorzempa. Key management for wireless sensor networks in hostile environments. 2006.
  2. Lei Shu Guangjie Han Chuan Zhu, Chunlin Zheng. A survey on coverage and connectivity issues in wireless sensor networks. Journal of Networks and Computer Applications, 35, 2012.
  3. M. de Berg. Computational Geometry: Algorithms and Applications. Springer, 2008.
  4. Guoliang Xue Guo-Hui Lin. Steiner tree problem with minimum number of steiner points and bounded edge-length. Information Processing Letters, page 53 57, 1999.
  5. Klaus-Dieter Tuchs Konrad Wrona Michael Winkler, Michael Street. Autonomous Sensor Networks. Springer Berlin Heidelberg, 2012.
  6. Ahmad Nizar Harun Mohamed Rawidean Mohd Kassim, Ibrahim Mat. Wireless sensor network in precision agriculture application. 2014.
  7. Fatih. Senel and Mohamed Younis. Relay node placement in structurally damaged wireless sensor networks via triangular steiner tree approximation. Computer Communications, 34:1932–1941, 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Triangulation Delaunay Optimization