Toward Performant and Energy-Efficient Network Queries: A Parallel and Stateless Approach

Algorithm 3

Preprocessing of collected data.

Input: k sensor nodes ; Current time slice t

1: Sensor nodes collect event fragments in t, notify others

2: Sensor nodes perform intersection of local and received events

3: for do IN PARALLEL

4:  if intersection is then

5:   Delete the received events

6:  else

7:   Update the set of event neighbors

8:  end if

9: end for

10: while Delegation is not unique do

11:  Calculate s of remaining candidates

12:  Send out new s and select the new

13:  The new sensor node applies union of its neighbors

14:  Eliminate non- nodes

15: end while

16: The node sends data to the parent storage node

17: All sensor nodes delete collected data in t

18: Storage node generates the address table

19: Storage node sends the table to the base station

20: Base station updates its table for future queries