Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Formal security evaluation of ad hoc routing protocols
Formal security evaluation of ad hoc routing protocols
Formal verification of secure ad hoc routing protocols using AVISPA: ARAN case study
ECC'10 Proceedings of the 4th conference on European computing conference
Surveying security analysis techniques in manet routing protocols
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
The exhaustive property verification of mobile ad hoc routing protocols has proven difficult, especially for proactive protocols. Several attempts to produce tractable models have failed. This article presents the application of formal methods to verify properties of the Optimized Link-State Routing (OLSR) protocol. An associated framework for topology enumeration automates the verification process over all network configurations, for an N-node network. The model utilizes linear temporal logic to analyze the correct function of OLSR. Verification is applied to both a benign network and one suffering a Byzantine node failure. With the Byzantine failure, verification automatically discovers a routing failure and provides the steps leading to the failure. Verifications are limited to four-node networks, but can be scaled up if non-exhaustive verification is acceptable. The framework and model may be extended to the verification of security properties for the class of secure, proactive routing protocols.