Optimal Patterns for Four-Connectivity and Full Coverage in Wireless Sensor Networks

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

  • Affiliations:
  • The Ohio State University, Columbus;Suzhou University, Suzhou;The Ohio State University, Columbus;The Ohio State University, Columbus;City University of Hong Kong, Hong Kong

  • Venue:
  • IEEE Transactions on Mobile Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study optimal deployment in terms of the number of sensors required to achieve four-connectivity and full coverage under different ratios of sensors' communication range (denoted by r_c) to their sensing range (denoted by r_s). We propose a new pattern, the Diamond pattern, which can be viewed as a series of evolving patterns. When r_c/r_s \ge \sqrt{3}, the Diamond pattern coincides with the well-known triangle lattice pattern; when r_c/r_s \le \sqrt{2}, it degenerates to a Square pattern (i.e., a square grid). We prove that our proposed pattern is asymptotically optimal when r_c/r_s \sqrt{2} to achieve four-connectivity and full coverage. We also discover another new deployment pattern called the Double-strip pattern. This pattern provides a new aspect to research on optimal deployment patterns. Our work is the first to propose an asymptotically optimal deployment pattern to achieve four-connectivity and full coverage for WSNs. Our work also provides insights on how optimal patterns evolve and how to search for them.