Formal Analysis of Mobility Management for Ad Hoc Networks

Mobility is one of the most challenging issues in Mobile Ad hoc Networks (MANET) where nodes are self organized, there is no infrastructure or centralized control and the nodes move freely. Different protocols have been designed for routing the packets from source to destination, earlier to design of any protocols for MANET one of the most important issues to consider is how these protocols can cope up with the unpredictable motion and the unreliable behavior of mobile nodes. The nodes are free to move from one place to another place this can be greatly achieved by mobility management where it deals with storage, maintenance, and retrieval of the mobile host location information. In this paper, a procedure is described to propose a model for mobility management of the AODV network nodes by using graph theory and formal techniques. The searching technique is based on considering the dynamic graphs in accordance with the nodes in MANET where the nodes are not stable. The Z notation is used to transform the graph model into formal specifications. Finally, the specification is analyzed and validated using Z Eves tool.

[1]  Ayman El-Sayed,et al.  A Survey of Multicast Routing Protocols for Ad-Hoc Wireless Networks , 2008 .

[2]  Alfredo Raúl Teyseyre.  A 3D visualization approach to validate requirements , 2002 .

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

[4]  Djamel Djenouri,et al.  Ad Hoc Networks Routing Protocols and Mobility , 2006, Int. Arab J. Inf. Technol..

[5]  Gongyi Wu,et al.  Hybrid Cluster Routing: An Efficient Routing Protocol for Mobile Ad Hoc Networks , 2006, 2006 IEEE International Conference on Communications.

[6]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[7]  Vincent Park,et al.  Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification , 2001 .

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

[9]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[10]  Paz Morillo,et al.  Cryptographic techniques for mobile ad-hoc networks , 2007, Comput. Networks.

[11]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[12]  Jonathan P. Bowen,et al.  Formal Versus Agile: Survival of the Fittest , 2009, Computer.

[13]  Saleh Ali K.Al-Omari,et al.  An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications , 2010, ArXiv.

[14]  Stephan Olariu,et al.  A two-zone hybrid routing protocol for mobile ad hoc networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[15]  John Nicholls,et al.  Z notation , 1994 .

[16]  Jim Woodcock,et al.  Using Z - specification, refinement, and proof , 1996, Prentice Hall international series in computer science.

[17]  Anthony Hall,et al.  Realising the Benefits of Formal Methods , 2005, J. Univers. Comput. Sci..

[18]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[19]  Thomas Clausen,et al.  The Optimized Link State Routing Protocol: Evaluation through Experiments and Simulation , 2001 .

[20]  Shukor Abd Razak,et al.  A Review of Delay Aware Routing Protocols in MANET , 2009 .

[21]  Zhou Bo,et al.  A REVIEW OF ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS , 2002 .