A set of topological graphs for 2-D sensor ad hoc networks

  • Authors:

  • Tarek El Salti;Nidal Nasser;Tarik Taleb

  • Affiliations:

  • Department of Computing and Information Science, University of Guelph, Ontario, Canada;Department of Computing and Information Science, University of Guelph, Ontario, Canada;Graduate School of Information Sciences, Tohoku University, Sendai, Japan

  • Venue:
  • ICC'09 Proceedings of the 2009 IEEE international conference on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, different types of sensors have been developed to detect environmental changes (e.g., instability of the earth's crust) and to reduce the associated damage. For an efficient usage of the sensor technology, several design factors (e.g., topology and sensing coverage) should be taken into account. In this paper, we focus on the underlying topology of sensor networks in two-dimensional environments and propose a new set of graphs referred to as the Derived Circles (DCα) graphs. We show that DCα graphs are locally constructed, connected, power efficient, and orientation-invariant. We also show that DCα graphs have a minimum degree of one and an Euclidean dilation of one. Furthermore, via simulations, we demonstrate that DCα graphs outperform the Half Space Proximal (HSP) graph in terms of the network dilation, Euclidean dilation, and power dilation. This, in turn, reduces the energy consumption of nodes and accordingly prolongs the network lifetime.