Patent EP0912016A2 successfully refreshed from Google Patents.
EP0912016A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method for access control in a multiple access system for communications networks
Assignee: Nokia of America Corp
•
Filing: 1998-10-13
•
Granted: —
•
Expires: 2018-10-13
Abstract
Abstract A method for access control in a wireless network having a base station and a plurality of remote hosts includes the optional abilities of making dynamic adjustments of the uplink/downlink transmission ratio, making dynamic adjustments of the total number of reservation minislots, and assigning access priorities by message content type within a single user message stream. The method of the invention further provides for remote wireless host paging and for delayed release of active channels by certain high priority users in order to provide low latency of real-time packets by avoiding the need for repeated channel setup signaling messages. In the preferred embodiment, there are N minislots available for contention in the next uplink frame organized into a plurality of access priority classes. The base station allows m access priority classes. Each remote host of access priority class i randomly picks one contention minislot and transmits an access request, the contention minislot picked being in a range from 1 to N i where N (i+1) < N i and N 1 =N. In an alternate embodiment of a method for access control according to the present invention, each remote host of access priority class i and with a stack level that equals 0, then transmits an access request with a probability P i where P (i+1) < P i and P 1 =1.
Inventors
- 👤 Mooi Choo Chuah
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-04 21:49
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/70; H04L47/82; H04L47/824; H04L43/00; H04L47/10; H04L47/15; H04L47/28; H04L47/286; H04L47/30; H04L47/32; H04L47/72; H04L47/78; H04L47/788; H04L47/80; H04L47/805; H04W; H04W28/00; H04W28/02; H04W52/00; H04W52/04; H04W52/06; H04W52/10; H04W52/38; H04W52/50; H04W74/00; H04W74/08; H04W74/0866; H04W74/0875; H04W8/00; H04W8/02; H04W8/04; H04L43/08; H04L43/0823; H04L43/0829; H04L43/16; H04W28/10; H04W28/14; H04W28/16; H04W28/26; H04W88/00; H04W88/08; H04W92/00; H04W92/04; H04W92/10
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
194 words
A method for access control in a wireless communications
network, said network having a base station and a plurality of remote hosts between
which uplink and downlink frames flow, said base station having a downlink queue,
each of said remote hosts having an uplink queue, each of said uplink frames containing
contention minislots, said contention minislots being organized into a plurality of access
priority classes, each of said access priority classes being characterized by a different
priority, the method comprising the steps, in combination, of: configuring N of said contention minislots in each of said uplink frames; allowing for m access priority classes at said base station; at each of said remote hosts of access priority class i, randomly picking
one of said contention minislots in which to send an access request, said picked
contention minislot being in a range from 1 to N i where N (i+1) < N i and N 1 = N; receiving at least one of said access requests at said base station; identifying uncollided ones of said received access requests; and granting access to one of said remote hosts that made an uncollided one
of said access requests.
Claim 2
Independent Claim
193 words
A method for access control in a wireless communications network,
said network having a base station and a plurality of remote hosts between which uplink
and downlink frames flow, said base station having a downlink queue, each of said
remote hosts being characterized by a respective stack level and having an uplink queue,
each of said uplink frames containing contention minislots, said contention minislots
being organized into a plurality of access priority classes, each of said access priority
classes being characterized by a different priority, the method comprising the steps, in
combination, of: configuring N of said contention minislots in each of said uplink frames; allowing for m access priority classes at said base station; at each of said remote hosts having a stack level that equals 0 and being
of access priority class i, transmitting an access request with a probability P i where
P (i+1) < P i and P 1 = 1; receiving at least one of said access requests at said base station; identifying uncollided ones of said received access requests; and granting access to one of said remote hosts that made an uncollided one
of said access requests.
Claim 3
Dependent Claim
38 words
The method of claim 1 or claim 2, wherein the maximum value of N is dynamically
adjustable based on the percentage of idle ones of said contention minislots and the
combined lengths of all of said uplink queues.
Claim 4
Dependent Claim
158 words
The method of claim 3, wherein each of said uplink frames also contains
dataslots, the value of N being dynamically adjusted by the steps, in combination, of: if the total length of all said uplink queues is greater than a high
threshold, and the percentage of said idle ones of said contention minislots is greater than
a first idle threshold, and a state value is not "1", decreasing N by k, increasing the
number of said dataslots by 1, and setting said state value to "1"; and if the total length of all said uplink queues is not greater than said high
threshold, and said total uplink queue length is less than a low threshold, and the
percentage of said idle ones of said contention minislots is less than a second idle
threshold and said state value is "1", increasing N by k, decreasing the number of said
dataslots by 1, and setting said state value to "0".
Claim 5
Dependent Claim
428 words
The method of claim 3, wherein each of said uplink frames also
contains dataslots, the value of N being dynamically adjusted by the steps, in
combination, of: if the total length of all said uplink queues is greater than a first high
threshold and the percentage of said idle ones of said contention minislots is greater than
a first idle threshold and a state value is "0", decreasing N by 2k, increasing the number
of said dataslots by 2, and setting said state value to "2"; if the total length of all said uplink queues is greater than a first high
threshold and the percentage of said idle ones of said contention minislots is greater than
said first idle threshold and said state value is "1", decreasing N by k, increasing the
number of said dataslots by 1, and setting said state value to "2"; if said total uplink queue length is not greater than said first high
threshold, and if said total uplink queue length is greater than a second high threshold
and the percentage of said idle ones of said contention minislots is greater than said first
idle threshold, and said state value is "0", decreasing N by k, increasing the number of
said dataslots by 1, and setting said state value to "1"; if said total uplink queue length is not greater than said first and said
second high threshold, and is not lower than a first low threshold, but is lower than a
second low threshold, and the percentage of said idle ones of said contention minislots is
less than a second idle threshold, and said state value is "2", increasing N by k,
decreasing the number of said dataslots by 1, and setting said state to "1"; if said total uplink queue length is not greater than said first and said
second high threshold and is lower than said first low threshold, and the percentage of
said idle ones of said contention minislots is less than a second idle threshold, and said
state value is "1", increasing N by k, decreasing the number of said dataslots by 1, and
setting said state to "0"; and if said total uplink queue length is not greater than said first and said
second high threshold and is lower than said first low threshold, and the percentage of
said idle ones of said contention minislots is less than said second idle threshold and said
state value is "2", increasing N by 2k, decreasing the number of said dataslots by 2, and
setting said state value to "0".
Claim 6
Dependent Claim
162 words
The method of claim 3, wherein each of said uplink frames also contains
dataslots and wherein N has a minimum and maximum allowable value, the value of
N being dynamically adjusted by the steps, in combination, of: if the total length of all said uplink queues is greater than a high
threshold, and the percentage of said idle ones of said contention minislots is greater than
a first idle threshold, and if N is greater than said minimum allowable value, decreasing N
by k and increasing the number of said dataslots by 1; and if the total length of all said uplink queues is not greater than said high
threshold, and said total uplink queue length is less than a low threshold, and the
percentage of said idle ones of said contention minislots is less than a second idle
threshold, and N is less than said maximum allowable value, increasing N by k and
decreasing the number of said dataslots by 1.
Claim 7
Dependent Claim
296 words
The method of claim 3, wherein each of said uplink frames also contains
dataslots and wherein N has a minimum and maximum allowable value, the value of
N being dynamically adjusted by the steps, in combination, of: if the total length of all said uplink queues is greater than a first high
threshold, and the percentage of said idle ones of said contention minislots is greater than
a first idle threshold, and N is greater than said minimum allowable value, decreasing N
by 2k and increasing the number of said dataslots by 2; if said total uplink queue length is not greater than said first high
threshold, and said total uplink queue length is greater than a second high threshold, and
the percentage of idle minislots is greater than said first idle threshold, and N is greater
than the minimum number allowable, decreasing N by k and increasing the number of
said dataslots by 1; if said total uplink queue length is not greater than said first high
threshold and said second high threshold, and is not lower than said a low threshold, but
is lower than a second low threshold, and the percentage of said idle ones of said
contention minislots is less than a second idle threshold, and N is less than the maximum
allowable, increasing N by k and decreasing the number of dataslots by 1; and if said total uplink queue length is not greater than said first high
threshold and said second high threshold, and is lower than said first low threshold, and
the percentage of said idle ones of said contention minislots is less than said second idle
threshold, and N is less than the maximum allowable, increasing N by 2k and decreasing
the number of said dataslots by 2.
Claim 8
Dependent Claim
51 words
The method of claim 1 or claim 2, further including the step of dynamically
allocating the ratio of uplink to downlink transmission time based on the size of said
downlink queue and information about the size of said remote host uplink queues
received by said base station from said remote hosts.
Claim 9
Dependent Claim
42 words
The method of claim 1 or claim 2, wherein each of said uplink frames is associated
with a content type, further including the step of assigning said access priority classes
to said uplink frames based on said content type of said messages.
Claim 10
Independent Claim
215 words
A method for paging in a wireless network, said network having a base
station and a plurality of remote hosts between which uplink and downlink messages
flow, each of said remote hosts being associated with a home registration server,
comprising the steps, in combination, of: initiating a paging request at a first one of said remote hosts, said
paging request being intended for a target one of said remote hosts; identifying said home registration server of said target remote host; relaying a Call_Initiate message to said base station from said first
remote host; sending said Call_Initiate message from said base station to a wireless
modem with which said target remote host is associated; relaying said Call_Initiate message from said wireless modem to said
target remote host; accepting said Call_Initiate message at said target remote host by
sending a Call_Accept message and a Connect_Request message from said target
remote host to said wireless modem; responding from said wireless modem to said base station with said
Call_Accept message, as well as with said Connect_Request message if there is
currently no connection between said wireless modem and said base station; relaying a Connect_Reply message from said home registration server
to said target remote host; and relaying said Call_Accept message from said base station to said first
remote host.
Claim 11
Independent Claim
207 words
A method for access without contention in a communications network
having a base station and supporting connection to plural classes of remote hosts, said
base station maintaining a bandwidth reserved list of those of said remote hosts
admitted to communication with said base station, said plural classes of remote hosts
including at least one higher priority class and at least one lower priority class, said
network supporting admission of a maximum total number of remote hosts, each of
said remote hosts having an associated modem the method comprising the steps, in
combination, of: observing an empty input queue at the associated modem of an
admitted one of said remote hosts belonging to a higher priority class; triggering a timer having an interval of operation at said associated
modem prior to any removal of said higher priority remote host from said bandwidth
reserved list; delaying any removal of said higher priority remote host from said
bandwidth reserved list for at least said interval of operation of said timer, in order to
allow for the potential arrival of additional packets; and completing removal of said higher priority remote host from said
bandwidth reserved list only if additional packets fail to arrive during said interval of
operation of said timer.
References Cited (Backward Citations)
US5615212A
Cited
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.