Skip to main content
. 2018 Jul 15;18(7):2291. doi: 10.3390/s18072291
Algorithm 1 Adversary Algorithm
  • 1:

    adversaryLocation = sinkLocation

  • 2:

    Adversary stores the information of all visitedImmediateSenderNode in its memory

  • 3:

    When the adversary overhears a packet adversaryLocation = immediateSenderLocation

  • 4:

    At the adversaryLocation, wait for timer timeout

  • 5:

    while (adversaryLocation ! = sourceNodeLocation) do

  • 6:

      if (packet comes to adversaryLocation from immediateSender before timer timeout) then

  • 7:

       if (immediateSender ! = visitedImmediateSenderNode) then

  • 8:

        adversaryLocation = immediateSender

  • 9:

        Update visitedImmediateSenderNode with adversaryLocation

  • 10:

       else

  • 11:

        discard the packet

  • 12:

       end

  •   else

  • 13:

       move to last visitedImmediateSenderNode

  • 14:

      end

  • 15:

    end

//sourceNodeLocation found