Repacking on Demand for Hierarchical Cellular Networks
碩士 === 國立交通大學 === 資訊工程系 === 91 === In mobile telecommunications operation, radio channels are scarce resources and should be carefully assigned. One possibility is to deploy the hierarchical cellular network (HCN). This thesis studies a HCN channel assignment scheme...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/18481228547125557489 |
| Summary: | 碩士 === 國立交通大學 === 資訊工程系 === 91 === In mobile telecommunications operation, radio channels are scarce resources and should be carefully assigned.
One possibility is to deploy the hierarchical cellular network (HCN).
This thesis studies a HCN channel assignment scheme called repacking on demand (RoD).
RoD was originally proposed for wireless local loop networks.
We expend this work to accommodate mobile networks.
Moreover, for non-speed-sensitive and speed-sensitive cases, we propose different channel assignment and repacking procedures for RoD.
The simulation models are proposed to study the performance of HCN with RoD and some previously proposed schemes.
Our study quantitatively indicates that RoD may significantly outperform the previous proposed schemes on call incompletion and call handoffs.
|
|---|