Skip to main content
. 2019 May 26;19(10):2402. doi: 10.3390/s19102402
Algorithm 2 GetAcknowledgement(Pu).
  • 1:

    NoCv = ϕ             ▹ initially number of child of Node v (NoCv) is empty

  • 2:

    if (count(NoCv) ≥PTH) then

  • 3:

        Ack ←Overflow

  • 4:

    else

  • 5:

        Add in NoCv                 ▹ Add Pu into the number of child set

  • 6:

        Ack ←True

  • 7:

    end if

  • 8:

    return Ack