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

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

Assignee: NTT Docomo Inc
•
Filing: 1991-02-08
•
Granted: 1993-11-16
•
Expires: 2011-02-08
📄 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 US
Data Source google_patents
Last Synchronized 2026-10-24 20:20
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: 9
Claim 1
Independent Claim 238 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 channels in each of the channel groups forming a numerically looped sequence of channels which is scanned in a predetermined sequence wherein each numerically looped sequence finishes at a channel which is the channel immediately before the first channel of the predetermined 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
Independent Claim 238 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 channels in each of the channel groups forming a numerically looped sequence of channels which is scanned in a predetermined sequence wherein each numerically looped sequence finishes at a channel which is the channel immediately before the first channel of the predetermined 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 3
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 4
Dependent Claim 20 words
A method as claimed in claim 1, wherein a memory for storing said channel assignment priority is a non-volatile memory.
Claim 5
Dependent Claim 20 words
A method as claimed in claim 2, wherein a memory for storing said channel assignment priority is a non-volatile memory.
Claim 6
Dependent Claim 91 words
A method as claimed in claim 1, 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 periodically instructing said plural fixed stations to apply the channel assignment priority data thereto and storing the channel assignment priority data in the corresponding memory section of said non-volatile memory.
Claim 7
Dependent Claim 44 words
A method as claimed in claim 5, wherein said control means instructs said plural fixed stations to apply the channel assignment priority data thereto, in a non-periodic manner, and stores the channel assignment priority data in the corresponding memory sections of said non-volatile memory.
Claim 8
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 9
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)

US3764915A Cited
US4747101A Cited
US5111534A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-11-15 1997-05-17 1997-11-16 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-11-15 2001-05-17 2001-11-16 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-11-15 2005-05-17 2005-11-16 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag