Formal modeling and analysis of ad hoc Zone Routing Protocol in Event-B

Ad hoc routing protocols are responsible for searching a route from the source to the destination under the dynamic network topology. Hybrid routing protocols combine the features of proactive and reactive approaches. So, the formal specification of a hybrid routing protocol in the dynamic network environment is a challenge. In this paper, we formally analyze the Zone Routing Protocol (ZRP), a hybrid routing framework, using Event-B. We develop the formal specification by the refinement mechanism. It allows us to gradually model the network environment, the construction of routing zones, route discovery based on bordercasting service and routing update. We prove the stabilization property in the inactive environment. In addition, we demonstrate that discovered routes hold the loop freedom and validity in each reachable system state. To present that the formalization is consistent with the informally expressed requirements, we adopt an animator, ProB, to validate our model. Our work provides reference to analyze extensions of the ZRP and other hybrid routing protocols.

[1]  Zygmunt J. Haas,et al.  The Intrazone Routing Protocol (IARP) for Ad Hoc Networks , 2002 .

[2]  Dominique Cansell,et al.  Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm , 2006, Theor. Comput. Sci..

[3]  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.

[4]  Yuanyuan Wang,et al.  A Correctness Proof of the DSR Protocol , 2006, MSN.

[5]  Jean-Raymond Abrial,et al.  The B-book - assigning programs to meanings , 1996 .

[6]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

[7]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[8]  Dominique Méry,et al.  Analysis of DSR Protocol in Event-B , 2011, SSS.

[9]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[10]  Thai Son Hoang,et al.  Developing topology discovery in Event-B , 2009, Sci. Comput. Program..

[11]  Zygmunt J. Haas,et al.  The Bordercast Resolution Protocol (BRP) for Ad Hoc Networks , 2002 .

[12]  Timothy Bourke,et al.  A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol , 2014, ATVA.

[13]  Arnold Pears,et al.  Automatized Verification of Ad Hoc Routing Protocols , 2004, FORTE.

[14]  Jean-Raymond Abrial,et al.  Modeling in event-b - system and software engineering by Jean-Raymond Abrial , 2010, SOEN.

[15]  Michael J. Butler,et al.  ProB: an automated analysis toolset for the B method , 2008, International Journal on Software Tools for Technology Transfer.

[16]  Thai Son Hoang,et al.  Rodin: an open toolset for modelling and reasoning in Event-B , 2010, International Journal on Software Tools for Technology Transfer.

[17]  Zygmunt J. Haas,et al.  Independent zone routing: an adaptive hybrid routing framework for ad hoc wireless networks , 2004, IEEE/ACM Transactions on Networking.

[18]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[19]  Eryk Dutkiewicz,et al.  A review of routing protocols for mobile ad hoc networks , 2004, Ad Hoc Networks.

[20]  Zygmunt J. Haas,et al.  The Interzone Routing Protocol (IERP) for Ad Hoc Networks , 2002 .

[21]  Christophe Metayer,et al.  The Event-B Mathematical Language , 2009 .

[22]  Yuanyuan Wang,et al.  A correctness proof of the SRP protocol , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[23]  Huibiao Zhu,et al.  Formalizing Hybrid Systems with Event-B , 2012, ABZ.

[24]  Carl A. Gunter,et al.  Formal verification of standards for distance vector routing protocols , 2002, JACM.

[25]  Philippe Jacquet,et al.  Internet Engineering Task Force (ietf) the Optimized Link State Routing Protocol Version 2 , 2022 .