Sentence examples for fake sink from inspiring English sources

We create a fake sink i as an item z i, and traffic volume generated by Mixnodes located in the range of the fake sink i as a v i.

Similarly to [5], whenever a fake sink receives a packet and broadcasts it locally, it will make the attacker believe that a real sink could be in the range of the fake sink.

Define Ω k, j) be the number of hops from the fake sink k to the fake sink j and hmax be the maximum number of hops between all nodes and the real sink.

ϵ should be satisfied: (i) To avoid the case without any fake sink, ϵ should be less than (equal to) hmax/2.

Current literatures describe techniques that employ fake sink(s) [5, 26], dummy messages [25], dummy trajectories [36], random message forwarding delay [1], multipath [24] routing, and false distances between nodes to the sink(s) [37].

Lines 4 to 11 try to find the first fake sink which satisfies the condition of hop(i) ≥ d and min (X − x(i), x(i), Y − y(i), y(i))/r1 ≥ ε.

Theorem 1: The fake sinks' placement problem is NP-hard.

Line 31 gives the best placements of fake sinks.

Figure 10 gives an example of optimal fake sinks' placement.

Position changes of fake sinks may cause recalculations for traffic volume, numbers of fake sinks, and so on.

Thus, we conclude that this fake sinks' placement problem is NP-hard [14].