Scalable Probabilistic Models for 802.11 Protocol Verification

Details Scalable Probabilistic Models for 802.11 Protocol Verification Scalable Probabilistic Models for 802.11 Protocol Verification

2004-03-31

arxiv.org/abs/cs/0403044v2

Computer Science

Logic in Computer Science

Currently in the process of submission

Scientific paper

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 do not scale to networks of even moderate 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 directly optimize the probabilistic timed automata models while preserving probabilistic reachability measures. We substantiate our claims of significant reduction by our results from using the probabilistic model checker PRISM.

Affiliated with

Also associated with

No associations

Rating

Scalable Probabilistic Models for 802.11 Protocol Verification does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scalable Probabilistic Models for 802.11 Protocol Verification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable Probabilistic Models for 802.11 Protocol Verification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-617275