Patent EP0441372A2 successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0441372A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Method of assigning optimal channel in multi-station radio communications system

Assignee: Nec Corp En Ntt Mobile Communications Netwo
•
Filing: 1991-02-07
•
Granted: —
•
Expires: 2011-02-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a multi-station radio communications system wherein plural channels are accessible for communication between plural fixed stations and plural mobile units (viz-, dynamic channel assignment) and wherein each of plural fixed stations selects a channel according to channel assignment priority data, the radio channels are grouped into a plurality of channel groups. The channels in each of the channel groups forms a numerically looped sequence of channels. The first channel of the numerically loop sequence in one channel group is different from the first channel of the numerically looped sequence in each of the other channel groups. Each of the plural fixed stations is set to select the channel having the highest priority or to select one of the first channel of the numerically looped sequence and a channel nearest to the first channel in the event that a plurality of channels have the same priority.

Inventors

  • 👤 Susumu Kojima
  • 👤 Tetsuro Hanazawa

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-25 17:36
CPC Classifications
H; H04; H04W; H04W72/00; H04W72/50; H04W72/56; H04W72/563; H04W16/00; H04W16/14; H04W72/02; Y; Y02; Y02D; Y02D30/00; Y02D30/70

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 228 words
A method of assigning radio channels in a multi-station radio communication system wherein plural channels are accessible for communication between plural fixed stations and plural mobile units and wherein each of said plural fixed stations selects a channel according to channel assignment priority, said method comprising steps of: (a) grouping the radio channels which are numbered in ascending or descending order, into a plurality of channel groups each of which includes the same number of the radio channels, the number of the channel groups corresponding to the number of the fixed stations, the radio channel, in each of the channel groups forming a numerically looped sequence of channels wherein each numerically looped sequence finishes at a channel which is numerically adjacent the first channel of the sequence, the first channel of a numerically looped sequence in one channel group being different from the first channel of the numerically looped sequences in each of the other channel groups; (b) assigning said channel groups to said plural fixed stations on a one-to-one basis; and (c) setting each of said plural fixed stations to select one of the channels assigned thereto which has a highest channel assignment priority, or to select one of the first channel of a numerically looped sequence and a channel nearest to the first channel in the event that plural channels have the same channel assignment priority.
Claim 2
Dependent Claim 84 words
A method as claimed in claim 1, further comprising the following step after step (b): raising a channel assignment priority of a given channel, at a given fixed station, which is accessed and used for communication between said given fixed station and one of the plural mobile units, and lowering the channel assignment priority of the given channel, at the given fixed station, which is accessed but fails to establish a communication between said given fixed station and one of the plural mobile units.
Claim 3
Dependent Claim 22 words
A method as claimed in claim 1, wherein a memory for storing said channel assignment priority takes the form or non-volatile memory.
Claim 4
Dependent Claim 22 words
A method as claimed in claim 2, wherein a memory for storing said channel assignment priority takes the form of non-volatile memory.
Claim 5
Independent Claim 92 words
A method as claimed in any one of claims 1 to 4, further comprising a mobile communications controller provided between said plural fixed stations and a telephone network, said mobile communications controller being provided with a control means and a non-volatile memory, said non-volatile memory having a plurality of memory sections which respectively store the channel assignment priorities of said plural fixed stations, said control means instructing periodically said plural fixed stations to apply the channel assignment priority data thereto and storing same into the corresponding memory section of said non-volatile memory.
Claim 6
Dependent Claim 37 words
A method as claim in claim 5, wherein said control means instructs non-periodically said plural fixed stations to apply the channel assignment priority data thereto and storing same into the corresponding memory sections of said non-volatile memory.
Claim 7
Dependent Claim 36 words
A method as claimed in claim 5, wherein each of said plural fixed stations applies the channel assignment priority data stored therein, at a predetermined time interval, to the corresponding memory section of said non-volatile memory.
Claim 8
Dependent Claim 31 words
A method as claimed in claim 5, wherein each of said fixed stations applies the channel assignment priority data stored therein, non-periodically, to the corresponding memory section of said non-volatile memory.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag