Next Article in Journal / Special Issue
The Sensor Web: A Macro-Instrument for Coordinated Sensing
Previous Article in Journal / Special Issue
Communication Buses and Protocols for Sensor Networks
Sensors 2002, 2(7), 258-269; doi:10.3390/s20700258
Article

Optimal Energy Aware Clustering in Sensor Networks

* , ,  and
Computer Science Department, University of California at Los Angeles, USA
* Author to whom correspondence should be addressed.
Received: 1 July 2002 / Accepted: 6 July 2002 / Published: 12 July 2002
(This article belongs to the Special Issue Networked Sensors and Wireless Sensor Platforms)
Download PDF [104 KB, uploaded 20 June 2014]

Abstract

Sensor networks is among the fastest growing technologies that have the potential of changing our lives drastically. These collaborative, dynamic and distributed computing and communicating systems will be self organizing. They will have capabilities of distributing a task among themselves for efficient computation. There are many challenges in implementation of such systems: energy dissipation and clustering being one of them. In order to maintain a certain degree of service quality and a reasonable system lifetime, energy needs to be optimized at every stage of system operation. Sensor node clustering is another very important optimization problem. Nodes that are clustered together will easily be able to communicate with each other. Considering energy as an optimization parameter while clustering is imperative. In this paper we study the theoretical aspects of the clustering problem in sensor networks with application to energy optimization. We illustrate an optimal algorithm for clustering the sensor nodes such that each cluster (which has a master) is balanced and the total distance between sensor nodes and master nodes is minimized. Balancing the clusters is needed for evenly distributing the load on all master nodes. Minimizing the total distance helps in reducing the communication overhead and hence the energy dissipation. This problem (which we call balanced k-clustering) is modeled as a mincost flow problem which can be solved optimally using existing techniques.
Keywords: Sensor networks; Balanced; Clustering; Energy dissipation; Optimal algorithm; Master node; Capacity constraint Sensor networks; Balanced; Clustering; Energy dissipation; Optimal algorithm; Master node; Capacity constraint
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote
MDPI and ACS Style

Ghiasi, S.; Srivastava, A.; Yang, X.; Sarrafzadeh, M. Optimal Energy Aware Clustering in Sensor Networks. Sensors 2002, 2, 258-269.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here

Comments

Cited By

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert