Modeling Routing Protocols in Adhoc Networks

DOI10.1007/978-3-540-89985-3_52zbMath1183.68083OpenAlexW106520219WikidataQ57835497 ScholiaQ57835497MaRDI QIDQ3628490

Fatemeh Ghassemi, Ali Movaghar

Publication date: 20 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89985-3_52

zbMATH Keywords

process algebraconnectivityrouting protocolad hoc networksrestricted broadcastingimplicit mobility

Mathematics Subject Classification ID

Network protocols (68M12)

Uses Software

• SPIN
• Uppaal
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebra of communicating processes with abstraction
• Uppaal in a nutshell
• Formal verification of standards for distance vector routing protocols
• Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
• Using Probabilistic Kleene Algebra for Protocol Verification
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Algebraic modeling of an ad hoc network for mobile computing

This page was built for publication: Modeling Routing Protocols in Adhoc Networks