Journal ArticleOPEN ACCESS

Automatized verification of Ad Hoc routing protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3235 343-358
DOI: 10.1007/978-3-540-30232-2_22
49Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Numerous specialized ad hoc routing protocols are currently proposed for use, or being implemented. Few of them have been subjected to formal verification. This paper evaluates two model checking tools, SPIN and UPPAAL, using the verification of the Lightweight Underlay Network Ad hoc Routing protocol (LUNAR) as a case study. Insights are reported in terms of identifying important modeling considerations and the types of ad hoc protocol properties that can realistically be verified. © IFIP International Federation for Information Processing 2004.

Author supplied keywords

Cite

CITATION STYLE

APA

Wibling, O., Parrow, J., & Pears, A. (2004). Automatized verification of Ad Hoc routing protocols. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3235, 343–358. https://doi.org/10.1007/978-3-540-30232-2_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free