Show simple item record

dc.contributor.authorMokdad, Lynda
dc.contributor.authorCastel-Taleb, Hind
dc.contributor.authorBen Othman, Jalel
HAL ID: 18231
ORCID: 0000-0001-6942-5435
dc.subjectWireless networksen
dc.subjectQuality of Serviceen
dc.subjectPerformance evaluationen
dc.subjectStochastic boundsen
dc.subjectStochastic ordersen
dc.titlePerformance Evaluation of Mobile Networks based on stochastic ordering of Markov chainsen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherUniversite de Versailles Saint-Quentin;France
dc.contributor.editoruniversityotherInstitut National des Telecommunications;France
dc.description.abstractenThe modeling of mobile networks is difficult because of the number of users and their mobilities. In this study, we present a new methodology based upon stochastic ordering of Markov chains in order to evaluate the performance measures in wireless networks. These kind of networks are based on cellular systems. The cellular systems use different frequency coverage in order to increase system capacity. During a communication, a user may move from one cell to another which is named the handover. We propose to compute the dropping handover probabilities. The system is represented by a continuous time Markov chain which is too large to be solved by a numerical method. Our approach is to define a new Markov chain with a smaller state space size, and which provides an upper bound for the dropping handover probabilities. We define an aggregation process based on the weak stochastic orderings in order to define the aggregated upper Markov chain. We have proved using the stochastic comparison that the aggregatedMarkov chain provides an upper bound for the dropping handover probabilities.en
dc.relation.isversionofjnlnameStudia Informatica Universalis
dc.subject.ddclabelProbabilités et mathématiques appliquéesen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record