Repacking on demand for hierarchical cellular networks
| dc.citation.epage | 728 | en_US |
| dc.citation.issue | 6 | en_US |
| dc.citation.spage | 719 | en_US |
| dc.citation.volume | 11 | en_US |
| dc.citation.woscount | 1 | |
| dc.contributor.author | Tsai, HM | en_US |
| dc.contributor.author | Pang, AC | en_US |
| dc.contributor.author | Lin, YC | en_US |
| dc.contributor.author | Lin, YB | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:18:11Z | |
| dc.date.available | 2014-12-08T15:18:11Z | |
| dc.date.issued | 2005-11-01 | en_US |
| dc.description.abstract | 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 paper 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 HCN. A simulation model is 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. | en_US |
| dc.identifier.doi | 10.1007/s11276-005-3526-5 | en_US |
| dc.identifier.issn | 1022-0038 | en_US |
| dc.identifier.journal | WIRELESS NETWORKS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1007/s11276-005-3526-5 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/13150 | |
| dc.identifier.wosnumber | WOS:000232531900006 | |
| dc.language.iso | en_US | en_US |
| dc.subject | channel assignment | en_US |
| dc.subject | channel repacking | en_US |
| dc.subject | hierarchical cellular network | en_US |
| dc.subject | repacking on demand | en_US |
| dc.title | Repacking on demand for hierarchical cellular networks | en_US |
| dc.type | Article | en_US |