Home // ICWMC 2011, The Seventh International Conference on Wireless and Mobile Communications // View article

An Algorithmic Approach for Analyzing Wireless Networks with Retrials and Heterogeneous Servers

Authors:
Nawel Gharbi
Leila Charabi

Keywords: Retrial phenomenon; Heterogeneous servers; Wireless networks; Generalized Stochastic Petri nets; Performance indices.

Abstract:
Models with retrial phenomenon and heterogeneous servers arise invarious wireless networks. This paper aims at presenting an approach for modeling and analyzing finite-source wireless networks with retrial phenomenon and heterogeneous servers using the Generalized Stochastic Petri Nets. This high-level formalism allows a simple representation of complex systems. Moreover, from the GSPN model, a Continuous Time Markov Chain can be automatically derived for the performance analysis. However, for important retrial networks, generating the Markov chain from the GSPN and solving it, require large storage space and long execution time. Hence, using the GSPN model as a support, we propose an algorithm for directly computing the infinitesimal generator of the GSPN model without generating neither the reachability graph nor the underlying Markov chain. In addition, we develop the formulas of the main stationary performance indices, as a function of the network parameters, the stationary probabilities and independently of the reachability set markings. Through numerical examples, we discuss the effect of the system parameters on performance.

Pages: 151 to 156

Copyright: Copyright (c) IARIA, 2011

Publication date: June 19, 2011

Published in: conference

ISSN: 2308-4219

ISBN: 978-1-61208-140-3

Location: Luxembourg City, Luxembourg

Dates: from June 19, 2011 to June 24, 2011