By Topic

A sensitivity analysis approach to the optimal policy range of the resource access control in wireless systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Huan Chen ; Dept. of Electr. Eng., Nat. Chung Chen Univ., Ming-Hsiung, Taiwan ; Chih-Chuan Cheng ; Mei-Hsiu Chi ; Hsi-Hsun Yeh

In this paper, the resource access control process is modelled as a Markov decision process. The stationary optimal resource access control policy is determined by solving the associated linear programming problem. Proposed resource access control policy allows employed system to make admission decisions to maximize system rewards according to current traffic condition and QoS metrics. The salient contribution of this research is to find the range for each optimal resource access control policy under specific traffic conditions. Sensitivity analysis technique is used to make it possible to find the range for each optimal policy under specific traffic parameters. Proposed model and sensitivity analysis techniques can be easily extended to a rich service model with multiple traffic types. The performance in terms of the weighted system utilization is analyzed via simulation and the results are compared with those of the complete sharing scheme. The ranges for the optimal policy are illustrated to show that a table-lookup scheme is a prominent application for the real-time resource access control.

Published in:

Wireless Telecommunications Symposium, 2005

Date of Conference:

April 28-30, 2005