Vol. 166, Issue 3, March 2014, pp. 84-90

Abstract: Based on the feature that Voronoi grid is capable of dividing plane domain into simple geometry gatherings and on the theory of parallel collecting, this paper puts forward the approximately minimum connecting and covering algorithm (ACA-RH) for wireless sensor network partitioned by regular hexagons (grids) to construct the minimum connecting coverage set, in which sink nodes divide information collecting area into regular hexagons, and the sensors decide to work or sleep by calculating its distance to the center of the grid it belongs to. Theoretical analysis and simulation show that ACA-RH has better performance in time complexity, and it requires less grids, compared with SCR-CADS and So&Ye algorithms.

Keywords: Partition of regular hexagon, Sensor network, Connecting, Coverage.

Click <here> or title of paper to download the full pages article in pdf format

Subscribe the full-page Sensors & Transducers journal in print (paper) or pdf formats

(shipping cost by standard mail for paper version is included)

(25 % discount for IFSA Members)

Alternatively we accept a money transfer to our bank account. Please contact for details: sales@sensorsportal.com

Download <here> the Library Journal Recommendation Form

Read more about Wireless Sensor Networks

1999 - 2014 Copyright ©, International Frequency Sensor Association (IFSA) Publishing, S.L. All Rights Reserved.

Home - News - Links - Archives - Tools - Voltage-to-Frequency Converters - Standardization - Patents - Marketplace - Projects - Wish List - e-Shop - Sensor Jobs - Membership - Videos - Publishing - Site Map - Subscribe - Search

 Members Area -Sensors Portal -Training Courses - S&T Digest - For advertisers - Bookstore - Forums - Polls - Submit Press Release - Submit White Paper - Testimonies - Twitter - Facebook - LinkedIn