Browsing by Author "Noerpel, AR"

Now showing 1 - 4 of 4

Polling deregistration for unlicensed PCS
(1996-05-01)
Noerpel, AR
;
Chang, LF
;
Lin, YB
;
資訊工程學系
;
Department of Computer Science
This paper describes a polling deregistration protocol for a wireless access communications network which would support interoperability between licensed personal communications services (PCS) and unlicensed-PCS (UPCS), We show how the protocol can be efficiently implemented in the personal access communications system (PACS) for licensed PCS and in the PACS-Unlicensed Version B (PACS-UB), An analytical model is proposed to analyze the performance of the polling protocol, A cost function is derived, which can be used to estimate the optimal polling frequency.
Polling deregistration for unlicensed PCS
(1996-05-01)
Noerpel, AR
;
Chang, LF
;
Lin, YB
;
資訊工程學系
;
Department of Computer Science
This paper describes a polling deregistration protocol for a wireless access communications network which would support interoperability between licensed personal communications services (PCS) and unlicensed-PCS (UPCS), We show how the protocol can be efficiently implemented in the personal access communications system (PACS) for licensed PCS and in the PACS-Unlicensed Version B (PACS-UB), An analytical model is proposed to analyze the performance of the polling protocol, A cost function is derived, which can be used to estimate the optimal polling frequency.
The sub-rating channel assignment strategy for PCS hand-offs
(1996-02-01)
Lin, YB
;
Noerpel, AR
;
Harasty, DJ
;
資訊工程學系
;
Department of Computer Science
A new personal communications services (PCS) hand-off scheme is proposed. This scheme provides for hand-off to radio ports on which there is no free channel by ''sub-rating'' an existing connection, With sub-rating, an occupied full-rate channel is temporarily divided into two half-rate channels: one to serve the existing call and the other to serve the hand-off request, The blocking probabilities (combined forced terminations of existing calls and blocking of new call attempts) of this new scheme compare favorably with the standard scheme (nonprioritizing) and the previously proposed prioritizing schemes, The ''costs'' for this scheme are presented and discussed, as well as the additional procedural complexity of implementing on-the-fly sub-rating and the impact of continuing the conversation on a lower rate channel (which may lower speech quality or increase battery drain), Analytical models and simulations investigating the traffic impacts are presented, as are the results that show that even in the highest offered load considered a 3-min conversation in the busy hour experiences less than half a second of sub-rated conversation on average and only about 3% of the calls experience more than 5.12 s of sub-rated conversation. This scheme can increase capacity by 8-35% for systems with 1% call incompletion probability.
Wireless local loop: Architecture, technologies and services
(1998-06-01)
Noerpel, AR
;
Lin, YB
;
資訊工程學系
;
Department of Computer Science
Wireless local loop (WLL) provides two-way calling services to the stationary or "fixed" users, which is intended to replace its wireline counterpart. Today, there are almost 100 WLL systems (either trials or commercial systems). This article describes the WLL architecture, the WLL technologies, WLL service descriptions, and some examples of WLL products.