Abstract
We use well-known algebraic concepts like semirings and matrices to model and argue about Wireless Mesh Networks. These networks are used in a wide range of application areas, including public safety and transportation. Formal reasoning therefore seems to be necessary to guarantee safety and security. In this paper, we model a simplified algebraic version of the AODV protocol and provide some basic properties. For example we show that each node knows a route to the originator of a message (if there is one). © 2011 Springer-Verlag.
Cite
CITATION STYLE
Höfner, P., & McIver, A. (2011). Towards an algebra of routing tables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6663 LNCS, pp. 212–229). https://doi.org/10.1007/978-3-642-21070-9_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
