We present two novel distributed algorithms for hole detection in a wireless sensor network (WSN) based on the distributed Delaunay triangulation of the underlying communication graph. The first, which we refer to as the distance-vector hole determination (DVHD) algorithm, is based on traditional distance vector routing for multi-hop networks and shortest path lengths between node pairs. The second, which we refer to as the Gaussian curvature-based hole determination (GCHD) algorithm, applies the Gauss-Bonnet theorem on the Delaunay graph to calculate the number of holes based on the graph's Gaussian curvature. We present a detailed comparative performance analysis of both methods based on simulations, showing that while DVHD is conceptually simpler, the GCHD algorithm shows better performance with respect to run-time and message count per node.

Ghosh, P., Krishnamachari, B., Gao, J., & Gasparri, A. (2014). Distributed hole detection algorithms for wireless sensor networks. In Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014 (pp.257-261). Institute of Electrical and Electronics Engineers Inc. [10.1109/MASS.2014.25].

Distributed hole detection algorithms for wireless sensor networks

Gasparri, Andrea
2014

Abstract

We present two novel distributed algorithms for hole detection in a wireless sensor network (WSN) based on the distributed Delaunay triangulation of the underlying communication graph. The first, which we refer to as the distance-vector hole determination (DVHD) algorithm, is based on traditional distance vector routing for multi-hop networks and shortest path lengths between node pairs. The second, which we refer to as the Gaussian curvature-based hole determination (GCHD) algorithm, applies the Gauss-Bonnet theorem on the Delaunay graph to calculate the number of holes based on the graph's Gaussian curvature. We present a detailed comparative performance analysis of both methods based on simulations, showing that while DVHD is conceptually simpler, the GCHD algorithm shows better performance with respect to run-time and message count per node.
9781479960354
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11590/332627
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 16
  • ???jsp.display-item.citation.isi??? 11
social impact