Sensor network connectivity with multiple directional antennae of a given angular sum

  • Authors:
  • Binay Bhattacharya; Yuzhuang Hu; Qiaosheng Shi;Evangelos Kranakis;Danny Krizanc

  • Affiliations:
  • School of Computing Science, Simon Fraser University, 8888 University Drive, Burnaby, BC V5A1S6, Canada;School of Computing Science, Simon Fraser University, 8888 University Drive, Burnaby, BC V5A1S6, Canada;School of Computing Science, Simon Fraser University, 8888 University Drive, Burnaby, BC V5A1S6, Canada;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada;Department of Mathematics and Computer Science, Wesleyan University, Middletown CT 06459, USA

  • Venue:
  • IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate the problem of converting sets of sensors into strongly connected networks of sensors using multiple directional antennae. Consider a set S of n points in the plane modeling sensors of an ad hoc network. Each sensor uses a fixed number, say 1 ≤ k ≤ 5, of directional antennae modeled as a circular sector with a given spread (or angle) and range (or radius). We give algorithms for orienting the antennae at each sensor so that the resulting directed graph induced by the directed antennae on the nodes is strongly connected. We also study trade-offs between the total angle spread and range for maintaining connectivity.