Name
Abstract | ||
|---|---|---|
This paper deals with the crucial challenging issue of testing the conformance of the MANET routing protocols. Indeed, because of the inherent constraints of such networks such as a dynamic topology, to formally test these protocols becomes a tough problem. Most of the studies taking into account a formal model of the protocol is faced to the combinatorial state space explosion issue when deploying and analyzing that model. In our work we present how to cope with that problem by drawing inspiration of the model-checker research domain and an integration of a component-based testing algorithm dedicated to the automatic generation of OLSR test sequences from a formal model written in Promela. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/AICCSA.2010.5587040 | Computer Systems and Applications |
Keywords | Field | DocType |
component-based testing algorithm,combinatorial state space explosion,tough problem,olsr test sequence,dynamic topology,crucial challenging issue,automatic generation,inherent constraint,manet routing protocol,formal model,formal specification,model checker,object oriented programming,manet,routing protocol,routing protocols,mobile ad hoc networks,spin,ad hoc networks,automata,testing,topology,network topology,conformance testing | Model checking,Computer science,Computer network,Conformance testing,Formal specification,Network topology,Optimized Link State Routing Protocol,Promela,Wireless ad hoc network,Routing protocol,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-4244-7716-6 | 1 | 0.39 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fatiha Zaidi | 1 | 60 | 4.10 |
| Mounir Lallali | 2 | 77 | 6.33 |
| Stephane Maag | 3 | 229 | 27.21 |