DocumentCode :
670471
Title :
A searching algorithm based on Markov transition matrix in WSN
Author :
Guo Pengfei ; Bo Yuming ; Zhang Jie
Author_Institution :
Sch. of Autom., Nanjing Univ. of Sci. & Technol., Nanjing, China
fYear :
2013
fDate :
26-29 May 2013
Firstpage :
446
Lastpage :
449
Abstract :
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.
Keywords :
Markov processes; complex networks; matrix algebra; wireless sensor networks; Markov probability transition matrix; Markov transition matrix; WSN; maximum degree search algorithm; randomly walk algorithm; scale-free network search; wireless sensor network; Algorithm design and analysis; Barium; Complex networks; Markov processes; Peer-to-peer computing; Search problems; Wireless sensor networks; Markov transition matrix; Wireless Sensor Network; maximum degree search; randomly walk search;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cyber Technology in Automation, Control and Intelligent Systems (CYBER), 2013 IEEE 3rd Annual International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4799-0610-9
Type :
conf
DOI :
10.1109/CYBER.2013.6705487
Filename :
6705487
Link To Document :
بازگشت