By Topic

Optimal Deployment Patterns for Full Coverage and k -Connectivity (k \leq 6) Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Ziqiu Yun ; City Univ. of Hong Kong, Kowloon, China ; Xiaole Bai ; Dong Xuan ; Lai, T.H.
more authors

In this paper, we study deployment patterns to achieve full coverage and k -connectivity (k ≤ 6) under different ratios of the sensor communication range (denoted by Rc) to the sensing range (denoted by Rs) for homogeneous wireless sensor networks (WSNs). In particular, we propose new patterns for 3- and 5-connectivity. We also discover that there exists a hexagon-based universally elemental pattern that can generate all known optimal patterns. The previously proposed Voronoi-based approach cannot be applied to prove the optimality of the new patterns due to their special features. We propose a new deployment-polygon-based methodology. We prove the optimality of deployment patterns to achieve 3-connectivity, 4-connectivity, and 5-connectivity for certain ranges of Rc/Rs, respectively, and prove the optimality of deployment patterns to achieve 6-connectivity under all ranges of Rc/Rs.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:18 ,  Issue: 3 )