Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks

  • Authors:

  • Xiaole Bai;Dong Xuan;Ziqiu Yun;Ten H. Lai;Weijia Jia

  • Affiliations:

  • The Ohio State University, Columbus, OH, USA;The Ohio State University, Columbus, OH, USA;Suzhou University, Su Zhou, China;The Ohio State University, Columbus, OH, USA;City University of Hong Kong, Hong Kong, China

  • Venue:
  • Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose deployment patterns to achieve full coverage and three-connectivity, and full coverage and five-connectivity under different ratios of sensor communication range (denoted by Rc) over sensing range (denoted by Rs) for wireless sensor networks (WSNs). We also discover that there exists a hexagon-based universally elemental pattern which can generate all known optimal patterns. The previously proposed Voronoi-based approach can not be applied to prove the optimality of the new patterns due to their special features. We propose a new deployment-polygon based methodology, and prove their optimality among regular patterns when Rc/Rs ≥ 1. We conjecture that our patterns are globally optimal to achieve full coverage and three-connectivity, and full coverage and five-connectivity, under all ranges of Rc/Rs. With these new results, the set of optimal patterns to achieve full coverage and k-connectivity (k≤6) is complete, for the first time.