Skip to main content
. 2015 Mar 5;15(3):5474–5503. doi: 10.3390/s150305474
Algorithm 5. Search_Target_Node (segment[i]), implemented at each SH node.
  Input: segment[i] (a data structure containing member node ID and tally to count the number of packets stored in the corresponding member node)
  Output: return the target Member Node ID.
  1: sort segment[i] in ascending order based on segment[i].tally
  2: segment[i].tally ← segment[i].tally + 1
  3: memberNodeId ← segment[i].ID
  4: return memberNodeId