Skip to main content
EURASIP Journal on Wireless Communications and Networking
Fig. 10 | EURASIP Journal on Wireless Communications and Networking

Fig. 10

From: Target guiding self-avoiding random walk with intersection algorithm for minimum exposure path problem in wireless sensor networks

Fig. 10

The time computation complexity of TGSARWI with various field scales. a Shows the trend of iteration number of the first path obtained by TGSARWI. b Shows the trend of the first path benefit. c Shows the trend of iteration number for finding all the required connected paths. d Shows the benefit trend of iteration number for finding all the required connected paths

Back to article page