A formal validation methodology for MANET routing protocols based on nodes’ self similarity

Maag, Stéphane; Grepet, C.; Cavalli, Ana

doi:10.1016/j.comcom.2007.10.031

Cited by 18 publications

(20 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reader is referred to [25] for a comprehensive survey of formal and informal protocol validation techniques for wireless ad hoc networks. The authors in [31] proposed a formal specification based conformance testing methodology to validate the state-ofthe-art DSR routing protocol for MANET. Ö lveczky and Thorvaldsen have used Real-Time Maude for modeling, performance estimation and model checking of the OGDC algorithm for sensor networks in [32].…”

Section: Formal Methodsmentioning

confidence: 99%

Formal verification and validation of a movement control actor relocation algorithm for safety–critical applications

et al. 2015

View full text Add to dashboard Cite

Wireless sensor and actor networks (WSAN) are captivating significant attention because of their suitability for safety-critical applications. Efficient actor placement in such applications is extremely desirable to perform effective and timely action across the deployment region. Nonetheless, harsh application environment inherently favors random placement of actors that leads to high concentration deployment and strangles coverage. Moreover, most of the published schemes lack rigorous validation and entirely rely on informal techniques (e.g., simulation) for evaluating nonfunctional properties of algorithms. This paper presents a localized movement control actor relocation (MCAR) algorithm that strives to improve connected coverage while minimizing movement overhead. MCAR pursues post-deployment actor repositioning in such a way that actors repel each other for better coverage while staying connected. We employ complementary formal and informal techniques for MCAR verification and validation. We model WSAN as a dynamic graph and transform MCAR to corresponding formal specification using Z notation. The resulting specification is analyzed and validated using Z eves tool. We simulate the specification to quantitatively demonstrate the efficiency of MCAR. Simulation results confirm the efficiency of MCAR in terms of movement overhead and connected coverage compared to contemporary schemes. The results show that MCAR can reduce distance movement up to 32 % while improving coverage up to 29 % compared to published schemes.

show abstract

Section: Formal Methodsmentioning

confidence: 99%

Formal verification and validation of a movement control actor relocation algorithm for safety–critical applications

et al. 2015

View full text Add to dashboard Cite

show abstract

“…Since they were provided from a Promela model, they are represented as input/outputs sequences. Therefore, a following work is to formulate them in a executable manner and to apply them on a real implementation under test of OLSR as it is mentioned in a previous work [18] in which we define testing architectures.…”

Section: B Results and Discussionmentioning

confidence: 99%

A component based testing technique for a MANET routing protocol

Zaïdi

Lallali

Maag³

2010

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…In this way, the recovery process is completed by cascading, that is, backup B of A is moved to position of A and newly backup of B is moved to position of B (lines [34][35][36][37][38][39]. If backup node B is critical and its backup is other than its primary, then it notifies to its backup and moves to position of its primary by cascading (lines [40][41][42][43] [34][35][36][37][38][39]. If the backup is critical and its backup is other than its primary, then the recovery procedure takes time NK (lines [40][41][42][43].…”

Section: Proposed Algorithmmentioning

confidence: 99%

“…38 Routing protocol for mobile ad hoc network (MANET) is validated through testing methodology. 39 Wireless sensor and actuator networks are modeled using colored Petri nets. 40 Algorithm proposed for mobile ad hoc and sensor networks (MAHSNs) is verified using Z and Vienna Development Method (VDM).…”

Section: Related Workmentioning

confidence: 99%

Hybrid subnet-based node failure recovery formal procedure in wireless sensor and actor networks

Afzaal

Zafar

Alhumaidan

2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

An unattended deployment of wireless sensor and actor networks in a harsh and inhospitable environment may cause its failure by partitioning it into the disjoint segments. Although many variants of this problem are addressed using different approaches, it still needs to be investigated due to its various applications. In this article, an efficient, localized, hybrid failure detection and recovery algorithm is proposed which assumes planned deployment of nodes. The algorithm is approximate and distributed as its topology is partitioned into subnets localizing failure recovery procedure and efficient as the time complexity is reduced from nondeterministic polynomial-time-hard to polynomial time. The algorithm is hybrid as pre-failure planning and post-failure recovery is assumed for the critical nodes. Graph-based model is designed to represent static part which is then transformed into a formal model using Vienna Development Method-specification language. The static model consists of subnets, circular topology, sensors, actors, and gateways as composite objects in Vienna Development Method-specification language. The dynamic model is developed by defining its state space, functions, and possible operations to describe the failure recovery procedure. Invariants are defined on static model to assure correctness, and pre/post conditions are used in the dynamic model to control the behavior preventing system to enter into an unwanted situation. The formal specification is analyzed using Vienna Development Method-specification language Toolbox to visualize the model.

show abstract

A formal validation methodology for MANET routing protocols based on nodes’ self similarity

Cited by 18 publications

References 8 publications

Formal verification and validation of a movement control actor relocation algorithm for safety–critical applications

Formal verification and validation of a movement control actor relocation algorithm for safety–critical applications

A component based testing technique for a MANET routing protocol

Hybrid subnet-based node failure recovery formal procedure in wireless sensor and actor networks

Contact Info

Product

Resources

About