Constructing low-connectivity and full-coverage three dimensional sensor networks

  • Authors:
  • Chuanlin Zhang;Xiaole Bai;Jin Teng;Dong Xuan;Weijia Jia

  • Affiliations:
  • Department of Mathematics, Jinan University, Ouangzhou, P. R. China;Department of Computer Science of University of Massachusetts Dartmouth, MA;Department of Computer Science and Engineering, The Ohio State University, Columbus, OH;Department of Computer Science and Engineering, The Ohio State University, Columbus, OH;Department of Computer Science, City University of Hong Kong, Hong Kong SAR, China

  • Venue:
  • IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k disjoint paths between any two sensor nodes in a WSN, where k ≤ 4. In this paper, we design a set of patterns to achieve 1-,2-, 3- and 4-connectivity and full-coverage, and prove their optimality under any value of the ratio of communication range rc over sensing range rs, among regular lattice deployment patterns. We further investigate the evolutions among all the proposed low-connectivity patterns. Finally, we study the proposed patterns under several practical settings.