Loading...

Verification of mobile ad hoc networks: An algebraic approach

Ghassemi, F ; Sharif University of Technology | 2011

444 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.tcs.2011.03.017
  3. Publisher: 2011
  4. Abstract:
  5. We introduced Computed Network Process Theory to reason about protocols for mobile ad hoc networks (MANETs). Here we explore the applicability of our framework in two regards: model checking and equational reasoning. 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 analyze mobility scenarios of MANET protocols. Furthermore, we show how by equational theory one can reason about MANETs consisting of a finite but unbounded set of nodes, in which all nodes deploy the same protocol. Model checking and equational reasoning together provide us with an appropriate framework to prove the correctness of MANETs. We demonstrate the applicability of our framework by a case study on a simple routing protocol
  6. Keywords:
  7. Mobility ; Axiomatization ; Local broadcast ; Process theory ; Symbolic verification ; Uniform MANET ; Computer programming languages ; Mobile ad hoc networks ; Model checking ; Semantics ; Ad hoc networks
  8. Source: Theoretical Computer Science ; Volume 412, Issue 28 , June , 2011 , Pages 3262-3282 ; 03043975 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S0304397511002477