A Study of Acceleration for the Successive Approximation: Taking the Control Policy of the Channel Allocation of Cellular Phone as Example
碩士 === 國立中正大學 === 資訊管理學系 === 89 === With the growth of mobile devices, the resource allocation of wireless network becomes an important issue. While subscribers demand to communicate, the base station must provide a channel for connection. However the base station only has finite channels. System ma...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/64686792072998755219 |
| Summary: | 碩士 === 國立中正大學 === 資訊管理學系 === 89 === With the growth of mobile devices, the resource allocation of wireless network becomes an important issue. While subscribers demand to communicate, the base station must provide a channel for connection. However the base station only has finite channels. System managers have to make the optimal policy with required information and experiences.
We found out a problem resulting from the channel allocation between two stations and tried to establish a two network queuing model. We use Dynamic Programming to solve the problem we mentioned above. The Dynamic Programming is based on system status to build Optimal Equations. According to these equations, we calculate Optimal Value for system managers in order to make the optimal policy. Because of the calculation process is complicated, we propose an algorithm to accelerate the calculation times. In this paper, we can prove that the algorithm would reduce the calculation times effectively.
|
|---|