초록 ▼

A dynamic channel allocation process successively allocates channels of higher priorities to requests for channel allocation. When a priority change count overflows or reaches an upper limit, the priority change count is cleared to zero. However, past data are not eliminated, and a change in a base

A dynamic channel allocation process successively allocates channels of higher priorities to requests for channel allocation. When a priority change count overflows or reaches an upper limit, the priority change count is cleared to zero. However, past data are not eliminated, and a change in a base station service area can be handled. Specifically, when the priority change count reaches an upper limit n, the priority at that time is stored as M.sub.1, and fixed as it is until the priority change count reaches the upper limit n next time. When priority change count reaches the upper limit n twice, the priority at that time is updated to M.sub.2 and stored fixedly for use as the priority until the priority change count subsequently reaches the upper limit n.

대표청구항 ▼

[ What is claimed is:] [1.] A method of dynamic channel allocation in a mobile communication system, comprising the steps of:assigning priority (P.sub.i) to each of the channels between radio base stations (2.sub.1 .about.2.sub.4) and radio mobile stations (5.sub.1 .about.5.sub.2);incrementing by "1

[ What is claimed is:] [1.] A method of dynamic channel allocation in a mobile communication system, comprising the steps of:assigning priority (P.sub.i) to each of the channels between radio base stations (2.sub.1 .about.2.sub.4) and radio mobile stations (5.sub.1 .about.5.sub.2);incrementing by "1" a priority change count a which represents the number of times that the channel has been selected to check for assignment to channel allocation with respect to a radio mobile station;selecting a channel having higher priority in response to each request for channel allocation;allocating the selected channel to the request for channel allocation and increasing the priority of the selected channel by a first priority function .DELTA.P(a) depending on said priority change count a, if the selected channel is not busy;reducing the priority of the selected channel by a second priority function .DELTA.P'(a) depending on said priority change count a, if the selected channel is busy;clearing said priority change count a to "0" when the priority change count a reaches an predetermined upper limit n, cyclically; said method further comprises the steps of:updating and saving the priority as M.sub.i =P.sub.Mi for each time the piority change count a reaches the upper limit n, where i represents times of reaching the priority change count a to upper limit n so that the M.sub.i is derived from priority change count n.times.i; andusing said priority M.sub.i consecutively without change as the priority of the channel for channel selection until said priority change count a reaches the upper limit n at the next time.