An Energy Efficient Algorithm Based on Clustering Formulation and Scheduling for Proportional Fairness in Wireless Sensor Networks

In this paper, we investigate the problem of achieving proportional fairness in hierarchical wireless sensor networks. Combining clustering formulation and scheduling, we maximize total bandwidth utility for proportional fairness while controlling the power consumption to a minimum value. This problem is decomposed into two sub-problems and solved in two stages, which are Clustering Formulation Stage and Scheduling Stage, respectively. The above algorithm, called CSPF_PC, runs in a network formulation sequence. In the Clustering Formulation Stage, we let the sensor nodes join to the cluster head nodes by adjusting transmit power in a greedy strategy; in the Scheduling Stage, the proportional fairness is achieved by scheduling the time-slot resource. Simulation results verify the superior performance of our algorithm over the compared algorithms on fairness index.