IMFES:
Input: A set of   wireless nodes, .
Output: A -fault resistant energy-t-spanner.
First Step:
1: Compute original topology
2: For each edge , compute
3: sort all edges in   by ascending weight.
4:
5: For each edge in
6: if u and v is not k connected in
7:  
8:  
9:  else if all nodes are k connected in
10:   go to step two
11: end if
12: end for
Second Step:
13: For each edge
14: if
15:  
16:  end if
17: end for
18: Return
Algorithm 1