Improved Probabilistic Models for 802.11 Protocol Verification

  • Amitabha Roy
  • K. Gopinath
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3576)

Abstract

The IEEE 802.11 protocol is a popular standard for wireless local area networks. Its medium access control layer (MAC) is a carrier sense multiple access with collision avoidance (CSMA/CA) design and includes an exponential backoff mechanism that makes it a possible target for probabilistic model checking. In this work, we identify ways to increase the scope of application of probabilistic model checking to the 802.11 MAC. Current techniques model only specialized cases of minimum size. To work around this problem, we identify properties of the protocol that can be used to simplify the models and make verification feasible. Using these observations, we present generalized probabilistic timed automata models that are independent of the number of stations. We optimize these through a novel abstraction technique while preserving probabilistic reachability measures. We substantiate our claims of a significant reduction due to our optimization with results from using the probabilistic model checker PRISM.

Keywords

Medium Access Control Model Check Contention Window Medium Access Control Layer Carrier Sense Multiple Access 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    The Institute of Electrical and Inc. Electronics Engineers. IEEE Std. 802.11 - Wireless LAN Medium Access Control(MAC) and Physical Layer (PHY) specifications (1999)Google Scholar
  2. 2.
    Kwiatkowska, M., Norman, G., Spronston, J.: Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, pp. 169–187. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Youssef, M., Vasan, A., Miller, R.: Specification and analysis of the dcf and pcf protocols in the 802.11 standard using systems of communicating machines. In: IEEE ICNP (November 2002)Google Scholar
  4. 4.
    Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 75–95. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  5. 5.
    Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic symbolic model checker. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol. 2324, pp. 200–204. Springer, Heidelberg (2002)Google Scholar
  6. 6.
    Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1, 134–152 (1997)MATHCrossRefGoogle Scholar
  7. 7.
    D’Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reduction and refinement strategies for probabilistic analysis. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, p. 57. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
  9. 9.
    Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2(2), 250–273 (1995)MATHMathSciNetGoogle Scholar
  10. 10.
    Kwiatkowska, M.: Model checking for probability and time: from theory to practice invited paper. In: Proc. 18th IEEE Symposium on Logic in Computer Science (LICS 2003), pp. 351–360. IEEE Computer Society Press, Los Alamitos (2003)CrossRefGoogle Scholar
  11. 11.
    Kwiatkowska, M., Norman, G., Sproston, J.: Probabilistic model checking of the 802.11 wireless local area network protocol. Technical Report CSR-02-05, School of Computer Science, University of Birmingham (2002)Google Scholar
  12. 12.
    Baier, C., Kwiatkowska, M.Z.: Model checking for a probabilistic branching time logic with fairness. Distributed Computing 11(3), 125–155 (1998)CrossRefGoogle Scholar
  13. 13.
    Kemeney, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov Chains. Springer, Heidelberg (1976)Google Scholar
  14. 14.
    Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6(5), 512–535 (1994)MATHCrossRefGoogle Scholar
  15. 15.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Comput. Networks 38(4), 393–422 (2002)CrossRefGoogle Scholar
  16. 16.
    International Telecommunication Union. Coding of speech at 8 kbit/s using conjugate-structure algebraic-code-excited linear-prediction, CS-ACELP (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Amitabha Roy
    • 1
  • K. Gopinath
    • 1
  1. 1.Department of Computer Science and AutomationIndian Institute of ScienceBangalore

Personalised recommendations