完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHsu, YCen_US
dc.contributor.authorLin, YDen_US
dc.contributor.authorChiang, MYen_US
dc.date.accessioned2014-12-08T15:40:25Z-
dc.date.available2014-12-08T15:40:25Z-
dc.date.issued2003-09-01en_US
dc.identifier.issn0916-8516en_US
dc.identifier.urihttp://hdl.handle.net/11536/27595-
dc.description.abstractGeneral packet radio service (GPRS) uses a two-stage mechanism to allocate uplink radio resource to mobile stations (MSs). In stage-1, the base station (BS) assigns several packet data channels (PDCHs) to an MS. Furthermore, a PDCH may be assigned to multiple MSs. In stage-2, therefore, the BS selects one of the multiplexed MSs in a PDCH to use the radio resource. In this paper, maintaining a load balance between PDCHs in stage-1 is examined and several selection schemes to lower the mis-selection rate in stage-2 are proposed. From our simulation results, the cost deduced from the poor load balancing and selection schemes render a lower system throughput and a non-negligible increase in packet queuing delay. Among the various stage-2 selection policies, round robin with linearly-accumulated adjustment (RRLAA) has the lowest mis-selection rate and outperforms the one without any heuristic by up to 50%.en_US
dc.language.isoen_USen_US
dc.subjectGPRSen_US
dc.subjectchannel assignmenten_US
dc.subjectslot assignmenten_US
dc.subjectschedulingen_US
dc.titleTwo-stage dynamic uplink channel and slot assignment for GPRSen_US
dc.typeArticleen_US
dc.identifier.journalIEICE TRANSACTIONS ON COMMUNICATIONSen_US
dc.citation.volumeE86Ben_US
dc.citation.issue9en_US
dc.citation.spage2694en_US
dc.citation.epage2700en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000185275800014-
dc.citation.woscount0-
顯示於類別:期刊論文