Energy Efficient Clustering Algorithm in Wireless Sensor Networks based on Geometric Programming

A wireless network consisting of a large number of small sensors with low-power transceivers can be ail effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. A critical aspect of applications with wireless sensor networks is net work lifetime. Power-constrained wireless sensor networks are usable as long as they can communicate sensed data to a processing node. Sensing and communications consume energy, therefore judicious power management can effectively extend network lifetime. In this paper we propose a geometric programming model to extend the sensor network life time by clustering sensor nodes into groups. Also, an efficient algorithm for solving this programming, use a newly developed iterative method, is established. The method can be applied to the case where other objectives and constraints are taken into account. Simulation results show the efficiency of the proposed algorithm.