An Energy-Efficient One-Shot Scheduling Algorithm for Wireless Sensor Networks

Algorithm 3

Lookahead Search.

Input: an initial slot slice assigned to node ;

the channel which has the minimum traffic load

Output: a new slot slice for node

1: if and is the slot assigned to nodes by all k channels then

2: Calculating the maximum unassigned slot number and a new slot slice

3: for each slot do

4:   is unassigned in channel and so could be allocated to node

5:  if cannot be assigned to node then

6:   

7:   Recalculating slot slice

8:  Assigning slot slice and the channel to node