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

Algorithm 4

Construction of transmission paths.

Input: Destination node D; Message transmission radius r

1: Base station retrieves the key and coordinates of D

2: Base station issues the query through GiveOrder() (GiveOrder() represents the query instruction)

3: while Current node N is not D do

4:  Probe a candidate for next intermediate node

5:  if then

6:   Check

7:   Check

8:  else

9:   Check

10:   Check

11:  end if

12:  Determine the next indeterminate node,

13: end while

14: Call ReadOrder() to retrieve the query and process it (ReadOrder() represents reading the received query instruction packet)

15: Return results to base station using ReturnData() (ReturnData() represents queried data package)