MDPRP: Markov Decision Process Based Routing Protocol for Mobile WSNs
In this paper we propose a new routing protocol-MDPRP for mobile wireless sensor networks, which adopts Markov Decision Process to make the decision of best next hop to forward the messages. In this scheme, we mainly integrate trust, congestion and distan
- PDF / 702,602 Bytes
- 9 Pages / 439.37 x 666.142 pts Page_size
- 46 Downloads / 206 Views
Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen, China {wk_hit,yym}@hitsz.edu.cn 2 Computer Engineering School, Shenzhen Polytechnic, Shenzhen 518055, Guangdong, China [email protected] 3 National Supercomputing Center in Shenzhen (Shenzhen Cloud Computing Center), Shenzhen, China [email protected]
Abstract. In this paper we propose a new routing protocol-MDPRP for mobile wireless sensor networks, which adopts Markov Decision Process to make the decision of best next hop to forward the messages. In this scheme, we mainly integrate trust, congestion and distance as the main judgment criterion of the next hop decision. We evaluate the protocol by simulations and the performance results are encouraging. Keywords: Routing
Congestion Markov Decision Process
1 Introduction Security and efficiency are two main goals of routing in mobile wireless sensor networks (WSN). However, it is not easy to achieve them both for routing mobile WSN since it has some special features such as limited resources, openness, and mobility which are quite different from traditional computer networks. Since it is an open network or deployed in an open area, malicious nodes can join in or some nodes may be captured by adversaries. Thus the threat may come from inside networks. Traditional network security measures commonly prevent attacks from outsides by increasing the cryptography ability of authentication, encryption and access control. However, threats come from inside of mobile wireless sensor network should be handled. Besides, since it has limited resources, computation and communication should be reduced. Therefore, lightweight secure routing protocol is required. Commonly, a mobile wireless sensor network is a typical wireless multi-hop network. As in our previous work, we found that the crucial factor of routing for WSN is the decision of next hop. How to make optimal decision on finding next hop is an important problem to be solved. Therefore, we study routing techniques and propose a new routing algorithm MDPR-Markov Decision Process based Routing Protocol for mobile WSN, which is able to achieve security, low cost and high efficiency by making optimal decision of at each hop, making it suitable for mobile WSN. © Springer Nature Singapore Pte Ltd. 2017 H. Yuan et al. (Eds.): GRMSE 2016, Part I, CCIS 698, pp. 91–99, 2017. DOI: 10.1007/978-981-10-3966-9_10
92
E.K. Wang et al.
This paper is organized as follows, Sect. 2 introduces related works; the Judgment Criterion to Rationality of Decision Maker is introduced in Sect. 3; Markov Decision Process and routing protocol are described in Sects. 4 and 5. In Sect. 6, we present the simulation result and finally we make a conclusion in Sect. 7.
2 Related Works A natural way of routing for mobile wireless sensor networks is flooding that the message is broadcasted to the network and any node who receives the message can help forwarding it. However, it results in too much storage, communication overhead. Therefore, later on, researchers have proposed many routi
Data Loading...
