Efficient Reliable Real-Time Group Communication for Wireless Local Area Networks

Mock, Michael; Nett, Edgar; Schemmer, Stefan

doi:10.1007/3-540-48254-7_26

Cited by 23 publications

(23 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The wireless communication layer needs to deliver both life-critical messages (in particular, notification of trains approaching the worksite), as well as non-life critical messages. The protocol presented in this paper is devised starting from the ALARP requirements and a previous protocol, the Real-time Group Communication Protocol (RGCP, [6] [7]). …”

Section: Introductionmentioning

confidence: 99%

Timed Broadcast via Off-the-Shelf WLAN Distributed Coordination Function for Safety-Critical Systems

Malinowsky

Grønbæk

Schwefel

et al. 2012

2012 Ninth European Dependable Computing Conference

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Timed Broadcast via Off-the-Shelf WLAN Distributed Coordination Function for Safety-Critical Systems

Malinowsky

Grønbæk

Schwefel

et al. 2012

2012 Ninth European Dependable Computing Conference

View full text Add to dashboard Cite

“…To achieve a realtime reliable group communication [8] in wireless local area networks is a hard task: the mobility of the system components has a direct effect on the definition of a co-operative group and the hostility of the environment produces a great loss of messages. The protocol presented in [2], based on extending the IEEE 802.11 standard for wireless local area networks, allows reliable and efficient group communication services.…”

Section: Definition Of the Protocolsmentioning

confidence: 99%

“…The protocols in [2] are developed following these fault assumptions: 1) Messages delivered during the T CFP are delivered correctly within a fixed time-bound (t m ). 2) Messages may be lost (omission faults).…”

Section: Definition Of the Protocolsmentioning

confidence: 99%

See 1 more Smart Citation

QoS Analysis of Group Communication Protocols in Wireless Environment

Bondavalli

Coccoli

Giandomenico³

2002

Concurrency in Dependable Computing

View full text Add to dashboard Cite

QoS analysis is a necessary step for the early verification and validation of an appropriate design, and for taking design decisions about the most rewarding choice, in relation with user requirements. The area of distributed applications, whose development is increasing more and more, favoured by the high connectivity provided by advanced Internet and Web technologies, poses special challenges in this respect. In this chapter, we describe an analytical approach for the evaluation of the QoS offered by two group communication protocols in a wireless environment. Experimental data are used both to feed the models and to validate them. Specific performance and dependability related indicators have been defined and evaluated. To improve the utility of our study, we analysed the protocols taking into account relevant phenomena affecting the environment in which such protocols are called to operate. Specifically, the fading phenomenon and the user mobility have been explicitly introduced in our models, to evaluate their impact on the correlation among successive packet transmissions. Also, in order to enhance the correctness of the derived models, a formal description of the protocols has been performed, adopting the timed asynchronous system model. The aim of this work is to provide a fast, cost effective, and formally sound way to analyse and understand protocols behaviour and their environment.

show abstract

“…WGC [102,21,100] is a variant of the centralized medium access protocol of the IEEE 802.11 standard for wireless local area networks. This protocol support real-time group communication between autonomous mobile stations and is centralized in the sense that the medium access is controlled by a fixed node in the network, the Access Point (AP).…”

Section: Wireless Group Communication Protocol (Wgc)mentioning

confidence: 99%

Model checking Markov Chains: Techniques and Tools

Zapreev¹

View full text Add to dashboard Cite

Probabilistic model checking has been a successful research field in the recent decades. This dissertation deals with four important aspects of model checking Markov chains: the development of efficient model-checking tools, the improvement of model-checking algorithms, the efficiency of the state-space reduction techniques, and the development of simulation-based model-checking procedures.We start by introducing MRMC, a model checker for discrete-time and continuoustime Markov reward models. It supports reward extensions of PCTL and CSL, and allows for the automated verification of properties concerning long-run and instantaneous rewards as well as cumulative rewards. In particular, it supports to check the reachability of a set of goal states (by only visiting legal states before) under a time and an accumulated reward constraint. Several numerical algorithms and extensions thereof are included in MRMC. We study the efficiency of the tool in comparison with several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies. The study considers the model checkers E ⊢MC 2 , PRISM (sparse and hybrid mode), Ymer and VESTA, and focuses on fully probabilistic systems. Several of our experiments show significantly different run times and memory consumptions between the tools -up to various orders of magnitudewithout, however, indicating a clearly dominating tool. For statistical model checking, Ymer prevails whereas for the numerical tools MRMC and PRISM (sparse) are rather close.Further, we consider the time-bounded reachability problem for continuous-time Markov chains (CTMCs), the efficient algorithms for which are at the heart of probabilistic model checkers such as PRISM and E ⊢MC 2 . For large time spans, on-the-fly steady-state detection is commonly applied. To obtain correct results (up to a given accuracy), it is essential to avoid detecting premature stationarity. We give a detailed account of criteria for steady-state detection in the setting of time-bounded reachability. This is done for forward-and backward-reachability algorithms. As a spin-off of this study, new results for on-the-fly steady-state detection during CTMC transient analysis are reported. Based on these results, a precise procedure for steady-state detection for time-bounded reachability is obtained. Experiments show the impact of these results in probabilistic model checking.After that we study the effect of bisimulation minimization in model checking of monolithic discrete-and continuous-time Markov chains as well as variants thereof with rewards. Our results show that -as for traditional model checking -enormous state space reductions (up to logarithmic savings) may be obtained. While in traditional model checking, bisimulation minimisation pays off only rarely (because it is rather, we find often enough that the verification time of the original Markov chain exceeds the minimisation time plus the verification time of the reduced chain. We consider probabilistic bisimula...

show abstract

Efficient Reliable Real-Time Group Communication for Wireless Local Area Networks

Cited by 23 publications

References 9 publications

Timed Broadcast via Off-the-Shelf WLAN Distributed Coordination Function for Safety-Critical Systems

Timed Broadcast via Off-the-Shelf WLAN Distributed Coordination Function for Safety-Critical Systems

QoS Analysis of Group Communication Protocols in Wireless Environment

Model checking Markov Chains: Techniques and Tools

Contact Info

Product

Resources

About