A searching algorithm based on Markov transition matrix in WSN

摘要

In this paper, we present a searching algorithm in Wireless Sensor Network based on Markov probability transition matrix. For the unsuitable of maximum degree search algorithm in scale-free network search, we put forward an algorithm combines maximum degree search and randomly walk algorithm, and on this basis, by construct a Markov probability transition matrix, select node with maximum transition probability when searching loop emergences until reach the target node. Finally, choose different size of Wireless Sensor Network, simulation verifies the effectiveness of the proposed algorithm.