Full metadata record
DC FieldValueLanguage
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:35:49Z-
dc.date.available2014-12-08T15:35:49Z-
dc.date.issued2005-01-14en_US
dc.identifier.issn1389-1286en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.comnet.2004.07.017en_US
dc.identifier.urihttp://hdl.handle.net/11536/24204-
dc.description.abstractIn mobile telecommunications networks, radio channels are limited resources that should be carefully allocated. To increase network capacity, channel assignment can be exercised in a hierarchical cellular network (HCN). By considering the speeds of MSs, we propose an HCN channel assignment approach called repacking on demand (RoD). A simulation model is developed to investigate the performance of RoD and some previously proposed approaches for HCN. Our study quantitatively shows that RoD significantly outperforms the previous proposed approaches. (C) 2004 Elsevier B.V. All rights reserved.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 speed-sensitive channel assignmenten_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.comnet.2004.07.017en_US
dc.identifier.journalCOMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKINGen_US
dc.citation.volume47en_US
dc.citation.issue1en_US
dc.citation.spage129en_US
dc.citation.epage146en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000225553800007-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. 000225553800007.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.