Bicriteria Optimization in Wireless Sensor Networks: Link Scheduling and Energy Consumption

Algorithm 2

NSGA-II based link scheduling.

Input: Routing graph , the slot demands of the th link (), the given number of generation , the

population size , the recombination probability , the mutation probability , and the reduction rate of the controlled

elitism

Output: Non-dominated solutions in

() Step  1. (initialization)

()  Set , ;

()  Generate an initial population using coding and initialization strategy;

()  Calculate using Algorithm 1 and for each individual;

() Step  2. (Non-dominated sorting)

()  ;

()  Do  fast non-dominated sorting algorithm, resulting non-dominated fronts ()

() Step  3. (controlled elitism)

()  Set , ;

() While    do

() Calculate according to the controlled elitism scheme;

() Sort in descending order using crowded comparison;

() Put the first members of in , that is, ;

() ;

() Step  4. (Reproduction)

() Generate an offspring (with size of ) from according crossover and mutation operation;

() Calculate and for each individual in ;

() Step  5. (Termination)

() ;

() if   or the required and are met then terminate;

() else go to Step