%0 Journal Article
%T Markov Game Theory Based Routing Countering Eavesdropping<br>针对窃听问题的马尔可夫博弈路由模型的研究
%A MA Zheng-xian
%A DONG Rong-sheng
%A WANG Yu-bin
%A LIU Jian-ming
%A <br>马争先
%A 董荣胜
%A 王玉斌
%A 刘建明
%J 计算机科学
%D 2011
%I 
%X To reduce the probability of eavesdropping in wireless sensor networks, this paper proposed a Markov game theory based routing(MGBR) to counter tapping problems under stochastic routing. The sender and the eavesdropper are considered as the two players of the game. Data is transmitted by senders with probability, determining the data transmission to effective tap is hence difficult for the eavesdroppers. With the tool of PRISM, simulation results demonstrate that there is a Nash Ectuilibrium point in MGBR, where the probability to be eavesdropped can be minimized. Furthermore,we presented the probability variation tendency of information to be eavesdropped on the Nash Equilibrium point. Compared with protocol based on minimal-hop algorithm, MGI3R can reduce the probability of information to be eavesdropped effectively.
%K WSN
%K MGBR
%K Probability<br>无线传感器网络，马尔可夫博弈路由模型，概率
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=17DDCED190714E7945DA7901136B65DC&yid=9377ED8094509821&vid=16D8618C6164A3ED&iid=708DD6B15D2464E8&sid=339D79302DF62549&eid=0EF0FC44FDDF939F&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=0