Bounds of performance measures in large-scale mobile communication networks

Authors:
Toshiomi Takahashi;Toshihisa Ozawa;Yukio Takahashi
Affiliations:
Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2-12-1, Oh-okayama, Meguro, Tokyo 152-8552, Japan;Department of Business Administration, Komazawa University, 1-23-1 Komazawa, Setagaya-ku, Tokyo 154-8525, Japan;Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2-12-1, Oh-okayama, Meguro, Tokyo 152-8552, Japan
Venue:
Performance Evaluation
Year:
2003

Citing 1
Cited 1

Introduction to matrix analysis (2nd ed.)

Introduction to matrix analysis (2nd ed.)

A mobile communication simulation system for urban space with user behavior scenarios

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new method for evaluating performance measures in a mobile communication network having a large number of base stations. Each base station has its own zone where its radio wave reaches. These zones are overlapping with neighboring zones, and handovers become possible. However, the existence of overlapping zones makes the analysis of a network difficult. To overcome this difficulty, we introduce an aggregated process on a smaller state space. For each of the important performance measures, using this aggregated process, we can construct a Markov decision problem that derives an exact upper (or lower) bound. Further, under some condition, we can specify a situation at which the upper (lower) bound is attained. This situation is analyzed with a far smaller model, and we can get the upper (lower) bound numerically or even by simulation.