References

  1. J.S. Baras, V. Tabatabaee, P. Purkayastha & K. Somasundaram (2009): Component Based Performance Modelling of Wireless Routing Protocols. In: International Conference on Communications (ICC'09). IEEE, pp. 1–6, doi:10.1109/ICC.2009.5198840.
  2. T. Bourke (2014): Mechanization of the Algebra for Wireless Networks (AWN). Archive of Formal Proofs. http://isa-afp.org/entries/AWN.html, Formal proof development.
  3. T. Bourke, R. J. van Glabbeek & P. Höfner (2016): Mechanizing a Process Algebra for Network Protocols. Journal of Automated Reasoning 56(3), pp. 309–341, doi:10.1007/s10817-015-9358-9.
  4. T. Bourke, R.J. van Glabbeek & P. Höfner (2014): A mechanized proof of loop freedom of the (untimed) AODV routing protocol. In: F. Cassez & J.-F. Raskin: Automated Technology for Verification and Analysis (ATVA'14), LNCS 8837. Springer, pp. 47–63, doi:10.1007/978-3-319-11936-6_5. Available at http://arxiv.org/abs/1505.05646.
  5. E. Bres, R.J. van Glabbeek & P. Höfner (2016): A Timed Process Algebra for Wireless Networks with an Application in Routing. Technical Report 9145. NICTA. Available at http://arxiv.org/abs/1606.03663.
  6. E. Bres, R.J. van Glabbeek & P. Höfner (2016): A Timed Process Algebra for Wireless Networks with an Application in Routing (Extended Abstract). In: P. Thiemann: Programming Languages and Systems (ESOP'16), LNCS 9632. Springer, pp. 95–122, doi:10.1007/978-3-662-49498-1_5.
  7. T.H. Clausen, C. Dearlove & J. Dean (2011): Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP). RFC 6130 (Proposed Standard), doi:10.17487/RFC6130.
  8. T.H. Clausen, C. Dearlove, P. Jacquet & U. Herberg (2014): The Optimized Link State Routing Protocol Version 2. RFC 7181 (Proposed Standard), doi:10.17487/RFC7181.
  9. T.H. Clausen & P. Jacquet (2003): Optimized Link State Routing Protocol (OLSR). RFC 3626 (Experimental), doi:10.17487/RFC3626.
  10. J. Drury, P. Höfner & W. Wang (2020): Formal Models of the OSPF Routing Protocol. In: A. Fehnker & H. Garavel: Models for Formal Analysis of Real Systems (MARS'20), this volume of EPTCS. Open Publishing Association.
  11. A. Fehnker, R. J. van Glabbeek, P Höfner, A. K. McIver, M. Portmann & W. L. Tan (2012): Automated Analysis of AODV using UPPAAL. In: C. Flanagan & B. König: Tools and Algorithms for the Construction and Analysis of Systems (TACAS'12), LNCS 7214. Springer, pp. 173–187, doi:10.1007/978-3-642-28756-5_13.
  12. A. Fehnker, R.J. van Glabbeek, P. Höfner, A.K. McIver, M. Portmann & W.L. Tan (2012): A Process Algebra for Wireless Mesh Networks. In: H. Seidl: Programming Languages and Systems (ESOP '12), LNCS 7211. Springer, pp. 295–315, doi:10.1007/978-3-642-28869-2_15.
  13. A. Fehnker, R.J. van Glabbeek, P. Höfner, A.K. McIver, M. Portmann & W.L. Tan (2013): A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV. Technical Report 5513. NICTA. Available at http://arxiv.org/abs/1312.7645.
  14. R. J. van Glabbeek, P. Höfner & D. van der Wal (2018): Analysing AWN-Specifications Using mCRL2 (Extended Abstract). In: C. A. Furia & K. Winter: Integrated Formal Methods (iFM'18), LNCS 11023. Springer, pp. 398–418, doi:10.1007/978-3-319-98938-9_23.
  15. R.J. van Glabbeek, P. Höfner, M. Portmann & W.L. Tan (2016): Modelling and Verifying the AODV Routing Protocol. Distributed Computing 29(4), pp. 279–315, doi:10.1007/s00446-015-0262-7.
  16. R.J. van Glabbeek, P. Höfner, W.L. Tan & M. Portmann (2013): Sequence Numbers Do Not Guarantee Loop Freedom —AODV Can Yield Routing Loops—. In: Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM'13). ACM, pp. 91–100, doi:10.1145/2507924.2507943.
  17. ISO/IEC/IEEE 8802-11 (2018): Information Technology — Telecommunications and information exchange between systems — Local and metropolitan area networks — Specific requirements — Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications. Available at https://www.iso.org/standard/73367.html.
  18. M. Kamali, P. Höfner, M. Kamali & L. Petre (2015): Formal Analysis of Proactive, Distributed Routing. In: R. Calinescu & B. Rumpe: Software Engineering and Formal Methods (SEFM'15), LNCS 9276. Springer, pp. 175–189, doi:10.1007/978-3-319-22969-0_13.
  19. M. Kamali & L. Petre (2016): Modelling Link State Routing in Event-B. In: H. Wang & M. Mokhtari: International Conference on Engineering of Complex Computer Systems (ICECCS'16). IEEE Computer Society, pp. 207–210, doi:10.1109/ICECCS.2016.035.
  20. C. E. Perkins, E. M. Belding-Royer & S. Das (2003): Ad hoc On-Demand Distance Vector (AODV) Routing. RFC 3561 (Experimental), Network Working Group. Available at http://www.ietf.org/rfc/rfc3561.txt.
  21. H. Rogge (2018): OLSR.org Network Framework - olsrd v2 / DLEP. https://github.com/OLSR/OONF.
  22. M.F. Steele & T.R. Andel (2012): Modeling the optimized link-state routing protocol for verification. In: G.A. Wainer & P.J. Mosterman: Theory of Modeling and Simulation (TMS/DEVS'12) 35. SCS/ACM. Available at http://dl.acm.org/citation.cfm?id=2346651.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org