An Energy-Aware Routing Protocol for Query-Based Applications in Wireless Sensor Networks

Algorithm 1

The decision maker (DM) algorithm.

   Input: {ID^(𝑀1), ℰ^(𝑀1)_ID, 𝐻^(𝑀1)_ID}

   Input: {ID^(𝑀2), ℰ^(𝑀2)_ID, 𝐻^(𝑀2)_ID}

   Output: next-hop node

(1)  foreach  packet to be forwarded do

(2)  If (ID^(𝑀1) == ID^(𝑀2))

(3)    send the packet to the selected neighbor;

(4)  // If IDs do not match then run tie-breaking rules;

(5)  else  if (ℰ^(𝑀1)_ID > ℰ^(𝑀2)_ID) && (𝐻^(𝑀1)_ID < 𝐻^(𝑀2)_ID) then

(6)     choose ID^(𝑀1) as the next-hop;

(7)  else  if (ℰ^(𝑀1)_ID < ℰ^(𝑀2)_ID) && (𝐻^(𝑀1)_ID > 𝐻^(𝑀2)_ID) then

(8)    choose ID^(𝑀2) as the next-hop;

(9)  else choose the one with the highest energy;