Loading...

Formal Analysis of Ad Hoc Network Protocols Using Process Algebra

Ghassemi Esfahani, Fatemeh | 2011

594 Viewed
  1. Type of Document: Ph.D. Dissertation
  2. Language: Farsi
  3. Document No: 41926 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Movaghar Rahimabadi, Ali
  7. Abstract:
  8. Wireless Ad hoc Networks (MANET) are decentrilized networks, without any static infrastructure.In these networks, nodes communicate directly or indirectly via other nodes. They could move arbitrary, which makes the underlying topology dynamic. Therefore, MANET protocols not only should operate correctly, but they should be able to tolerate faults that
    may arise due to unreliable wireless communication and unexpected changes in the underlying topology, while the quality of service metrics in benchmarks are satisfied. Therefore a unified framework for verification and evaluation of MANET protocols would alleviate the design process of such protocols.In this thesis, we provide a formal framework, based on process algebra to analyse MANETs. We introduce Restricted Broadcast Process Theory (RBPT), to specify and verify ad hoc networks, taking into account mobility. The operational semantics of our framework is based on constrained labeled transition systems (CLTSs), in which each transition label is parameterized with the set of topologies for which this transition is enabled. We illustrate how through model checking on CLTSs one can analyse mobility scenarios of MANET protocols.We exploit an extended algebra called Computed Network Theory (CNT) to axiomatize restricted broadcast. It allows one to define the behavior of an ad hoc network with respect to the underlying topologies. We give a sound and ground-complete axiomatization for CNT terms with finite-state behavior, modulo what we call rooted branching computed network bisimilarity. To reason about MANET protocols for large networks, or protocols based on infinite data domains, we extend CNT framework with symbolic verification technique which can be used to verify the correctness of MANETs consisting of a finite but unbounded set of nodes, in which all nodes deploy the same protocol.To provide a unified compositional framework for modeling and analyzing the qualitative and quantitative aspects of mobile ad hoc network (MANET) protocols above the data-link layer, we extend RBPT: delay functions are assigned to actions while the semantics captures the interplay between stochastic behavior of underlying network layers, namely data-link and physical layer, and the dynamic topology. A continuous Markov chain can be derived from our semantics model, if non-determinism can be resolved due to existence of internal (immediate) actions using our weak Markovian network bisimilarity. Finally we illustrate how MANETs can be evaluated automatically by using the Prism, a probabilistic model checker tool
  9. Keywords:
  10. Markov Model ; Stochastic Process ; Ad Hoc Network ; MANET Simulator ; Equational Theory ; Symbolic Verification ; Process Theory

 Digital Object List

 Bookmark

...see more