Partial sensing coverage with connectivity in lattice wireless sensor networks

  • Authors:
  • Yun Wang;William Chu;Yanping Zhang;Xiaolong Li

  • Affiliations:
  • Department of Computer Science and Information Systems, Bradley University, Peoria 61625, IL, USA;Department of Computer Science and Information Systems, Bradley University, Peoria 61625, IL, USA;Department of Computer Science, Gonzaga University, Spokane 99258, WA, USA;Electronics and Computer Engineering Technology, Indiana State University, Terre Haute, Indiana 47809, USA

  • Venue:
  • International Journal of Sensor Networks
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work, we investigate the partial sensing coverage with connectivity problem in structured lattice wireless sensor networks WSNs through mathematically modelling, theoretical derivation, computer-based simulations, and performance evaluation. Two popular patterns square and equilateral triangle are considered. We found: 1 a noticeable amount of sensors can be saved in lattice WSNs if a small percentage of application-tolerable sensing coverage is sacrificed; 2 there exists a threshold partial sensing coverage, π/4, belowwhich both square and triangle patterns require the same amount of sensors, above which the triangle pattern is superior; 3 deployment pattern impacts the network detectability and 15.47% more sensors are required to guarantee the worst-case detectability in a triangular lattice WSN; and 4 there exists a critical ratio of communication range to sensing range in employing partial sensing coverage to trade for deployment efficiency. Simulation outcomes are shown to validate the analysis.