A study of robust call admission control in wireless/mobile multimedia networks | |
| Author | Chagkrit Sribariwut |
| Call Number | AIT RSPR no.TC-02-03 |
| Subject(s) | Mobile communication systems Multimedia systems Wireless communication systems |
| Note | research submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Research studies project report ; no. TC-02-03 |
| Abstract | The call admission control (CAC) for mobile communication is one of the most important engineering issues since it belongs to the category of resource management and the radio spectrum is a very scarce resource. In future mobile cellular systems, the CAC scheme should be efficient for multimedia services as well as for voice services. This paper proposes a robust CAC scheme for mobile communication. A characteristic of the proposed scheme is that it tolerate to the offer load variation in mobile environments. This research measures the performance of the proposed scheme using the event based simulation. The performances are the return of revenue, the utilization of resources and the blocking probability of handoff call and new calls. In the research work, we study in the low channel capacity case which the optimal CAC is selected to operate for the robust CAC. This optimal CAC is applied for the feasible region of variable offer load with the required upper-bound blocking probability of handoff calls and new calls. A semi-Markov decision process (SMDP) is employed to determine an optimal CAC policy that is optimal form the standpoint of providers since it maximizes their revenue. Moreover, we use the linear programming technique to compute an optimal solution of that SMDP problem. Furthermore the system performances of the optimal policy are measured by using the model simulation and compare its results with other policy, complete sharing and threshold scheme. According to the simulation results, the Simplex method can compute an optimal CAC for the case of low capacity. And our optimal CAC can guarantee upper-bound blocking probability that we require at 10% and robust to the offer load variation in the feasible region. Moreover the comparison of simulation results show that our optimal policy give superior the ratio of average return of revenue and utilization to the complete sharing. However, it gives that ratio lower than the threshold scheme. |
| Year | 2002 |
| Corresponding Series Added Entry | Asian Institute of Technology. Research studies project report ; no. TC-02-03 |
| Type | Research Study Project Report (RSPR) |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Telecommunications (TC) |
| Chairperson(s) | Teerapat Sanguankotchakorn; |
| Examination Committee(s) | Ahmed, Kazi M.;Erke, Tapio; |
| Scholarship Donor(s) | Aeronautical Radio of Thailand; |
| Degree | Research Studies Project Report (M.Eng.) - Asian Institute of Technology, 2002 |