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 |
id |
ndltd-TW-091NCTU0392025 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-091NCTU03920252016-06-22T04:14:05Z http://ndltd.ncl.edu.tw/handle/18481228547125557489 Repacking on Demand for Hierarchical Cellular Networks 階層式行動電話網路隻頻道隨需重整方法 Yung-Chun Lin 林湧鈞 碩士 國立交通大學 資訊工程系 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. Yi-Bing Lin Hsien-Ming Tsai 林一平 蔡憲明 2003 學位論文 ; thesis 60 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 資訊工程系 === 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.
|
author2 |
Yi-Bing Lin |
author_facet |
Yi-Bing Lin Yung-Chun Lin 林湧鈞 |
author |
Yung-Chun Lin 林湧鈞 |
spellingShingle |
Yung-Chun Lin 林湧鈞 Repacking on Demand for Hierarchical Cellular Networks |
author_sort |
Yung-Chun Lin |
title |
Repacking on Demand for Hierarchical Cellular Networks |
title_short |
Repacking on Demand for Hierarchical Cellular Networks |
title_full |
Repacking on Demand for Hierarchical Cellular Networks |
title_fullStr |
Repacking on Demand for Hierarchical Cellular Networks |
title_full_unstemmed |
Repacking on Demand for Hierarchical Cellular Networks |
title_sort |
repacking on demand for hierarchical cellular networks |
publishDate |
2003 |
url |
http://ndltd.ncl.edu.tw/handle/18481228547125557489 |
work_keys_str_mv |
AT yungchunlin repackingondemandforhierarchicalcellularnetworks AT línyǒngjūn repackingondemandforhierarchicalcellularnetworks AT yungchunlin jiēcéngshìxíngdòngdiànhuàwǎnglùzhīpíndàosuíxūzhòngzhěngfāngfǎ AT línyǒngjūn jiēcéngshìxíngdòngdiànhuàwǎnglùzhīpíndàosuíxūzhòngzhěngfāngfǎ |
_version_ |
1718314985910697984 |