Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/48028
Title: On the Optimality of Non-Uniform Clustering in Wireless Sensor Networks
Authors: Dabirmoghaddam, Ali
Ghaderi, Majid
Williamson, Carey
Keywords: energy-efficiency, clustering, data correlation, wireless sensor networks
Issue Date: 9-Aug-2010
Abstract: In wireless sensor networks, cluster-based data gathering has been pursued as a means to achieve network scalability as well as energy efficiency. By dividing a network into clusters, data aggregation and compression can be conveniently implemented in each cluster resulting in significant reduction in overall network energy consumption. Although many clustering algorithms have been proposed in the literature for minimizing energy consumption in sensor networks, a comprehensive and systematic analysis of optimal clustering subject to inherent network attributes such as data correlation, node density, and distance to the sink is still lacking. In particular, existing clustering schemes are designed to form uniform clusters in the network, where, on average, clusters have the same size. In this paper, we exploit spatial data correlation present among sensor readings to form optimal-sized clusters that minimize the total energy cost of the network. We develop a generalized multi-region network model that captures the interplay between clustering and data correlation, and postulate that a heterogeneous clustering scheme, with larger clusters at further distances from the sink, is more energy-efficient than uniform clustering. Based on this model, we develop a distributed randomized clustering algorithm that generates optimal-sized non-uniform clusters throughout the network. Simulation results confirm the superiority of our novel algorithm against uniform clustering schemes.
URI: http://hdl.handle.net/1880/48028
Appears in Collections:Ghaderi, Majid
Williamson, Carey

Files in This Item:
File Description SizeFormat 
2010-969-18.pdf437.17 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.