完整後設資料紀錄
DC 欄位語言
dc.contributor.authorTsai, HMen_US
dc.contributor.authorPang, ACen_US
dc.contributor.authorLin, YCen_US
dc.contributor.authorLin, YBen_US
dc.date.accessioned2014-12-08T15:18:11Z-
dc.date.available2014-12-08T15:18:11Z-
dc.date.issued2005-11-01en_US
dc.identifier.issn1022-0038en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s11276-005-3526-5en_US
dc.identifier.urihttp://hdl.handle.net/11536/13150-
dc.description.abstractIn 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.language.isoen_USen_US
dc.subjectchannel assignmenten_US
dc.subjectchannel repackingen_US
dc.subjecthierarchical cellular networken_US
dc.subjectrepacking on demanden_US
dc.titleRepacking on demand for hierarchical cellular networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s11276-005-3526-5en_US
dc.identifier.journalWIRELESS NETWORKSen_US
dc.citation.volume11en_US
dc.citation.issue6en_US
dc.citation.spage719en_US
dc.citation.epage728en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000232531900006-
dc.citation.woscount1-
顯示於類別:期刊論文


文件中的檔案:

  1. 000232531900006.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。