Skip to main content
EURASIP Journal on Wireless Communications and Networking

Table 2 Time to process greedy and Kaplan algorithms.

From: An Information-Theoretic Approach for Energy-Efficient Collaborative Tracking in Wireless Sensor Networks

Number of desired nodes

Greedy Time

Kaplan Time

2

3

4

5

6

Back to article page