Learning-based routing in mobile wireless sensor networks: Applying formal modeling and analysis

Limited energy supply is one of the main concerns when dealing with wireless sensor networks (WSNs). Therefore, routing protocols should be designed with the goal of being energy efficient. In this paper, we select a routing protocol which is capable of handling both centralized and decentralized routing. Mobility, a priori knowledge of the movement patterns of the nodes is exploited to select the best routing path, using a Bayesian learning algorithm. Generally, simulation-based tools cannot prove if a protocol works correctly, but formal modeling methods are able to validate that by searching for failures through all possible behaviors of network nodes. This paper presents a formal model for a learning-based routing protocol for WSNs, based on a Bayesian learning method, using an Structural Operational Semantics (SOS) style. We use the rewriting logic tool Maude to analyze the model. Our experimental results show that decentralized approach is twice as energy-efficient as the centralized scheme. It also outperforms the power-sensitive AODV (PS-AODV) routing protocol (i.e. a non-learning efficient protocol). We use the Maude tool to validate a correctness property of the routing protocol. Our formal model of Bayesian learning integrates a real dataset which forces the model to conform to the real data. This technique seems useful beyond the case study of this paper.

[1]  Ilangko Balasingham,et al.  Formal modeling and validation of a power-efficient grouping protocol for WSNs , 2012, J. Log. Algebraic Methods Program..

[2]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[3]  MeseguerJosé Conditional rewriting logic as a unified model of concurrency , 1992 .

[4]  G. C. Tiao,et al.  Bayesian inference in statistical analysis , 1973 .

[5]  Peter Csaba Ölveczky,et al.  Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude , 2009, Theor. Comput. Sci..

[6]  Thomas G. Dietterich What is machine learning? , 2020, Archives of Disease in Childhood.

[7]  Madhav V. Marathe,et al.  Parametric Probabilistic Routing in Sensor Networks , 2005, Mob. Networks Appl..

[8]  Wang Yi,et al.  Model-based validation of QoS properties of biomedical sensor networks , 2008, EMSOFT '08.

[9]  M. Kendall Probability and Statistical Inference , 1956, Nature.

[10]  Sinem Coleri Ergen,et al.  Lifetime analysis of a sensor network with hybrid automata modelling , 2002, WSNA '02.

[11]  José Meseguer,et al.  PMaude: Rewrite-based Specification Language for Probabilistic Object Systems , 2006, QAPL.

[12]  Jiannong Cao,et al.  An Energy-Aware Routing Protocol in Wireless Sensor Networks , 2009, Sensors.

[13]  Jun Sun,et al.  Specifying and Verifying Sensor Networks: An Experiment of Formal Methods , 2008, ICFEM.

[14]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[15]  Mani B. Srivastava,et al.  SensorSim: a simulation framework for sensor networks , 2000, MSWIM '00.

[16]  George E. P. Box,et al.  Bayesian Inference in Statistical Analysis: Box/Bayesian , 1992 .

[17]  J. Cid-Sueiro,et al.  Q-Probabilistic Routing in Wireless Sensor Networks , 2007, 2007 3rd International Conference on Intelligent Sensors, Sensor Networks and Information.

[18]  Ivan Stojmenovic,et al.  Power-aware localized routing in wireless networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[19]  L.F.W. van Hoesel,et al.  Modelling and Verification of the LMAC Protocol for Wireless Sensor Networks , 2007, IFM.

[20]  Ting Wang,et al.  Adaptive Routing for Sensor Networks using Reinforcement Learning , 2006, The Sixth IEEE International Conference on Computer and Information Technology (CIT'06).

[21]  José Meseguer,et al.  Redesign of the LMST Wireless Sensor Protocol through Formal Modeling and Statistical Model Checking , 2008, FMOODS.

[22]  Kwang-Cheng Chen,et al.  Hop-Based Energy Aware Routing Algorithm for Wireless Sensor Networks , 2010, IEICE Trans. Commun..

[23]  Athanassios Boulis,et al.  From Simulation to Real Deployments in WSN and Back , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[24]  K. J. Ray Liu,et al.  Near-optimal reinforcement learning framework for energy-aware sensor communications , 2005, IEEE Journal on Selected Areas in Communications.

[25]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[26]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..

[27]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[28]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[29]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[30]  Ilangko Balasingham,et al.  Learning-based Routing in Mobile Wireless Sensor Networks , 2012 .

[31]  Natarajan Meghanathan,et al.  A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks , 2010, ArXiv.

[32]  Siddhartha Shakya,et al.  Using a Markov network model in a univariate EDA: an empirical cost-benefit analysis , 2005, GECCO '05.

[33]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[34]  José Alberto Verdejo López,et al.  The EIGRP Protocol in Maude , 2007 .

[35]  G. Raghavendra Rao Formal Modeling of Reinforcement Learning Algorithms Applied for Mobile Ad Hoc Network , 2009 .