Systematic selection of cluster heads for data collection

  • Authors:
  • Kranthi K. Mamidisetty;Michael J. Ferrara;Shivakumar Sastry

  • Affiliations:
  • Department of Electrical and Computer Engineering, The University of Akron, Akron OH 44325-3904, USA;Department of Mathematical and Statistical Science, University of Colorado Denver, Denver, CO 80217-3364, USA;Department of Electrical and Computer Engineering, The University of Akron, Akron OH 44325-3904, USA

  • Venue:
  • Journal of Network and Computer Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a systematic approach to selecting cluster heads (CHs) in networked sensing systems for data aggregation based on the idea of dominating sets of a graph. A set of vertices, D of a graph G=(V,E) is a k-dominating set if every vertex v@?V, is connected to some vertex in D via path of length less than or equal to k. By focusing on regular mesh topologies, in which each node has q neighbors, q=3,4,6,8, we demonstrate an intuitive approach for identifying the CHs. If E is the energy required for a node to send a message to a collection point, e is the energy required to send a similar message to its adjacent node in the system, and C is the compression ratio achieved by aggregation techniques at a CH, we show that CHs selected in our approach are viable whenever k