US6480505B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Batched fair exhaustive polling scheduler
Assignee: Telefonaktiebolaget LM Ericsson AB
•
Filing: 1999-12-06
•
Granted: 2002-11-12
•
Expires: 2019-12-06
Abstract
Abstract A method and apparatus for improving channel utilization and throughput in an ad-hoc wireless communication system is provided. A master unit and one or more slave units are coupled to a shared communication channel having at least an uplink (UL) channel and a downlink channel (DL) for each master unit-slave unit pair. A group of active nodes is established corresponding to slave units having UL and/or DL data associated therewith for transfer. The group of active nodes may be polled according to Fair Exhaustive Polling (FEP) and information alternately transferred on a TDD. Accumulated information may be transferred in a batch and feedback information collected and used to adjust polling. One or more links may be identified as lossy links due to increased Bit Error Rate (BER) and accompanying information loss resulting in lower throughput. Virtual active nodes added to the group of active nodes to compensate therefor. A transmission parameter such as number of retransmissions may be evaluated against a predetermined threshold to identify lossy links. If lossy links improve, virtual active nodes may be removed from the group of active nodes. Information associated with the one or more slaves units may be circuit switched synchronous information or non-circuit switched asynchronous information. Feedback information such as timeout information associated with the slave units may be evaluated. If a time out signal associated with a slave unite is received the slave unit may be scheduled for polling responsive to the time out signal.
Inventors
- 👤 Per Johansson
- 👤 Niklas Johansson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 10:08
CPC Classifications
H; H04; H04W; H04W72/00; H04W72/12; H04W72/121; H04W74/00; H04W74/04; H04W74/06; H04W84/00; H04W84/18
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
110 words
A method for improving channel utilization and throughput in an ad-hoc wireless communication system having a master unit and one or more slave units coupled with a shared communication channel having at least an uplink (UL) channel and a downlink channel (DL) for each master unit-slave unit pair, the method comprising the steps of: establishing a group of active nodes corresponding to one or more of the one or more slave units having UL and/or DL data associated therewith for transfer; polling the group of active nodes according to Fair Exhaustive Polling (FEP); and alternately transferring information between the master and a next slave unit as polled according to FEP.
Claim 2
Independent Claim
110 words
A method for improving channel utilization and throughput in an ad-hoc wireless communication system having a master unit and one or more slave units coupled with a shared communication channel having at least an uplink (UL) channel and a downlink channel (DL) for each master unit-slave unit pair, the method comprising the steps of: establishing a group of active nodes corresponding to one or more of the one or more slave units having UL and/or DL data associated therewith for transfer; polling the group of active nodes according to Fair Exhaustive Polling (FEP); and alternately transferring information between the master and a next slave unit as polled according to FEP.
Claim 3
Dependent Claim
76 words
The method of claim 1 , further comprising the steps of: accumulating information to be transferred to the next slave unit and one or more subsequently polled slave units in a batch; and alternately transferring respective portions the batch of information between the next slave unit and the one or more subsequently polled slave units during a polling interval associated with each of the next slave unit and the one or more subsequently polled slave units.
Claim 4
Dependent Claim
46 words
The method of claim 2 , further comprising the steps of: collecting feedback information from the next slave unit and the one or more subsequently polled slave units related to the alternately transferred portions of the batch; and adjusting the polling according to the feedback information.
Claim 5
Dependent Claim
65 words
The method of claim 1 , further comprising the steps of: identifying one or more links associated with the one or more slave units as lossy links; adding one or more virtual active nodes to the group of active nodes, wherein one or more of the one or more virtual active nodes is associated with the each of the identified one or more lossy links.
Claim 6
Dependent Claim
57 words
The method of claim 4 , wherein the step of identifying further includes evaluating a transmission parameter against a predetermined threshold for each of the one or more links and wherein if the threshold is exceeded the link is identified as lossy, and wherein if the threshold is not exceeded the link is not identified as lossy.
Claim 7
Dependent Claim
70 words
The method of claim 4 , further including the steps of: identifying one or more links associated with the one or more slave units as no longer lossy links; removing one or more virtual active nodes from the group of active nodes, wherein one or more of the one or more removed virtual active nodes is associated with the each of the identified one or more no longer lossy links.
Claim 8
Dependent Claim
25 words
The method of claim 1 , wherein the information is associated with one or more of circuit switched synchronous information and non-circuit switched asynchronous information.
Claim 9
Dependent Claim
27 words
The method of claim 1 , wherein the step of polling further includes the step of evaluating feedback information associated with the one or more slave units.
Claim 10
Dependent Claim
51 words
The method of claim 1 , wherein the step of polling further includes the steps of: receiving a time out signal associated with one or more of the one or more slave units; and scheduling; the one or more timed out slave units for polling responsive to the time out signal.
Claim 11
Independent Claim
137 words
An apparatus for improving channel utilization and throughput in an ad-hoc wireless communication system, the apparatus comprising: a master unit; one or more slave units; and a shared communication channel having at least an uplink (UL) channel and a downlink channel (DL) for each master unit-slave unit pair; the master unit and the one or more slave units coupled to the shared communication channel, the master device having at least a transceiver, a memory, and a processor, the processor configured to: establish a group of active nodes corresponding to one or more of the one or more slave units having UL and/or DL data associated therewith for transfer; poll the group of active nodes according to Fair Exhaustive Polling (FEP); and alternately transfer information between the master and a next slave unit as polled according to FEP.
Claim 12
Independent Claim
137 words
An apparatus for improving channel utilization and throughput in an ad-hoc wireless communication system, the apparatus comprising: a master unit; one or more slave units; and a shared communication channel having at least an uplink (UL) channel and a downlink channel (DL) for each master unit-slave unit pair; the master unit and the one or more slave units coupled to the shared communication channel, the master device having at least a transceiver, a memory, and a processor, the processor configured to: establish a group of active nodes corresponding to one or more of the one or more slave units having UL and/or DL data associated therewith for transfer; poll the group of active nodes according to Fair Exhaustive Polling (FEP); and alternately transfer information between the master and a next slave unit as polled according to FEP.
Claim 13
Dependent Claim
78 words
The apparatus of claim 10 , wherein the processor is further configured to: accumulate information to be transferred to the next slave unit and one or more subsequently polled slave units in a batch; and alternately transfer respective portions the batch of information between the next slave unit and the one or more subsequently polled slave units during a polling interval associated with each of the next slave unit and the one or more subsequently polled slave units.
Claim 14
Dependent Claim
48 words
The apparatus of claim 11 , wherein the processor is further configured to: collect feedback information from the next slave unit and the one or more subsequently polled slave units related to the alternately transferred portions of the batch; and adjust the polling according to the feedback information.
Claim 15
Dependent Claim
67 words
The apparatus of claim 10 , wherein the processor is further configured to: identify one or more links associated with the one or more slave units as lossy links; add one or more virtual active nodes to the group of active nodes, wherein one or more of the one or more virtual active nodes is associated with the each of the identified one or more lossy links.
Claim 16
Dependent Claim
59 words
The apparatus of claim 13 , wherein the processor, in identifying is further configured to evaluate a transmission parameter against a predetermined threshold for each of the one or more links and wherein if the threshold is exceeded the link is identified as lossy, and wherein if the threshold is not exceeded the link is not identified as lossy.
Claim 17
Dependent Claim
72 words
The apparatus of claim 13 , wherein the processor is further configured to: identify one or more links associated with the one or more slave units as no longer lossy links; remove one or more virtual active nodes from the group of active nodes, wherein one or more of the one or more removed virtual active nodes is associated with the each of the identified one or more no longer lossy links.
Claim 18
Dependent Claim
25 words
The apparatus of claim 10 , wherein the information is associated with one or more of circuit switched synchronous information and non-circuit switched asynchronous information.
Claim 19
Dependent Claim
26 words
The apparatus of claim 10 , wherein the processor, in polling, is further configured to evaluate feedback information associated with the one or more slave units.
Claim 20
Dependent Claim
50 words
The apparatus of claim 10 , wherein the processor, in polling, is further configured to: receive a time out signal associated with one or more of the one or more slave units; and schedule; the one or more timed out slave units for polling responsive to the time out signal.
References Cited (Backward Citations)
EP0294233A2
Cited
US5065399A
Cited
US5051984A
Cited
GB2229895A
Cited
US5235599A
Cited
US5056085A
Cited
US5173689A
Cited
US5740366A
Cited
EP0599764A1
Cited
EP0715478A2
Cited
US5719861A
Cited
US5748611A
Cited
EP0883265A2
Cited
WO1999011025A1
Cited
EP0913965A1
Cited
WO1999023799A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-11-11 | 2006-05-13 | 2006-11-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-11-11 | 2010-05-13 | 2010-11-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-11-11 | 2014-05-13 | 2014-11-12 | $7700.00 | Window Closed / Lapsed |