{"title":"基于马尔可夫转移矩阵的WSN搜索算法","authors":"Guo Pengfei, Bo Yuming, Zhang Jie","doi":"10.1109/CYBER.2013.6705487","DOIUrl":null,"url":null,"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.","PeriodicalId":146993,"journal":{"name":"2013 IEEE International Conference on Cyber Technology in Automation, Control and Intelligent Systems","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A searching algorithm based on Markov transition matrix in WSN\",\"authors\":\"Guo Pengfei, Bo Yuming, Zhang Jie\",\"doi\":\"10.1109/CYBER.2013.6705487\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":146993,\"journal\":{\"name\":\"2013 IEEE International Conference on Cyber Technology in Automation, Control and Intelligent Systems\",\"volume\":\"82 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Cyber Technology in Automation, Control and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CYBER.2013.6705487\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Cyber Technology in Automation, Control and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBER.2013.6705487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.