• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Performance Evaluation of Mobile Networks based on stochastic ordering of Markov chains

Thumbnail
Date
2006
Dewey
Probabilités et mathématiques appliquées
Sujet
Wireless networks; mobility; Quality of Service; Performance evaluation; Stochastic bounds; Stochastic orders
Journal issue
Studia Informatica Universalis
Volume
4
Number
2
Publication date
2006
Article pages
191-208
Publisher
Hermann
URI
https://basepub.dauphine.fr/handle/123456789/1810
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Mokdad, Lynda
Castel-Taleb, Hind
Ben Othman, Jalel
Type
Article accepté pour publication ou publié
Abstract (EN)
The 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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.