US5818828A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Hybrid multiple access protocol for wireless frequency hopping microcells with adaptive backhaul and heartbeat
Assignee: Google LLC
•
Filing: 1996-10-04
•
Granted: 1998-10-06
•
Expires: 2016-10-04
Abstract
Abstract In a wireless frequency hopping communication system, a protocol, which does not employ carrier sense or collision detect, is provided for allocating bandwidth fairly and efficiently under varying load conditions, wherein a node is permitted random access to the medium bandwidth under light loading conditions and wherein under higher loading conditions a time/bandwidth allocation is made with a portion of the allocation dedicated to inband backhaul tasks by introducing a form of polling, the size of the reserved time/bandwidth allocation being selected based on traffic pattern. Under such heavy load conditions, non-slave traffic is allocated bandwidth in slots as pseudo-slave packets to guarantee a share of the bandwidth. Depending on the activity of the population of packets, including responsiveness and trend of responsiveness, the relative size of the slots is determined. Random access is always permitted for certain classes of packets, namely handshake packets, which are used to establish the master/slave relationships between nodes, no matter how a node is loaded. Once a master/slave relationship is established, a slave is only allowed to use the random access method to inform its master that it has data pending for transmission to the network when the node has a light load. Polling is always employed when the node at least has one active slave. According to one aspect of the invention, the size of the reserved allocation is based on a variable heartbeat of a multicast poll. Further in accordance with the invention, a handshaking between master and slave permits transition between operation in a random access mode and a polled mode.
Inventors
- 👤 Robert Lawrence Packer
- 👤 Milton Y. Xu
- 👤 John Bettendorff
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 03:53
CPC Classifications
H; H04; H04W; H04W74/00; H04W74/02; H04B; H04B1/00; H04B1/69; H04B1/713; H04W28/00; H04W28/02; H04W28/06; H04W72/00; H04W72/04; H04W72/044; H04W72/0446; H04W72/0453; H04W72/50; H04W72/52; H04W74/04; H04W74/06; H04W74/08
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
232 words
In a distributed control telecommunication system, a method for transitioning a first node between a first communication protocol and a second communication protocol, said second protocol being a slave mode wherein a second node communicates data with said first node when authorized by said first node according to a polling, said method comprising the steps of: receiving at said first node a request from said second node as a candidate slave node, communicated in said first communication protocol, to permit communication according to said second communication protocol; anticipating at said first node a current state of said second node based on prior history of communication; establishing at said first node a state of attachment with said second node according to said second communication protocol in order to establish a link of said first node and said second node; polling at said first node for data communication from said second node on mutually agreed upon channels and a first time schedule via said link; monitoring, at said first node, said link via said mutually agreed upon channels according to said first time schedule for data transmission activity; and upon sensing a cessation of data transmission activity, polling at said first node for data communication from said second node on mutually agreed upon channels and a second time schedule via said link, said second time schedule being less frequent than said first time schedule.
Claim 2
Dependent Claim
232 words
In a distributed control telecommunication system, a method for transitioning a first node between a first communication protocol and a second communication protocol, said second protocol being a slave mode wherein a second node communicates data with said first node when authorized by said first node according to a polling, said method comprising the steps of: receiving at said first node a request from said second node as a candidate slave node, communicated in said first communication protocol, to permit communication according to said second communication protocol; anticipating at said first node a current state of said second node based on prior history of communication; establishing at said first node a state of attachment with said second node according to said second communication protocol in order to establish a link of said first node and said second node; polling at said first node for data communication from said second node on mutually agreed upon channels and a first time schedule via said link; monitoring, at said first node, said link via said mutually agreed upon channels according to said first time schedule for data transmission activity; and upon sensing a cessation of data transmission activity, polling at said first node for data communication from said second node on mutually agreed upon channels and a second time schedule via said link, said second time schedule being less frequent than said first time schedule.
Claim 3
Dependent Claim
38 words
The method according to claim 1, further including allocation time for said second node to establish links and to communicate with any node while remaining in a slave mode and in an attached state with said first node.
Claim 4
Dependent Claim
26 words
The method according to claim 2 wherein said second node can communicate and link contemporaneously according to said first communication protocol and said second communication protocol.
Claim 5
Dependent Claim
160 words
In a data communication system with distributed control of links between a plurality of nodes, a method for communicating packetized information via a common communication medium, including a plurality of channels according to a frequency hopping spread spectrum arrangement, among said plurality of nodes, said method comprising: establishing from a first node a first link to a second node according to a first communication protocol, said first communication protocol permitting random transmissions of first addressed packets during a first time period; establishing from a third node a second link to a fourth node according to a second communication protocol, said second communication protocol permitting transmissions of second addressed packets only according to authorization in response to a poll, said poll being invoked according to a first schedule during a second time period; and allocating available time alternately between exclusive time for said first time period and said second time period whereby random transmissions and polled transmissions can be made contemporaneously.
Claim 6
Dependent Claim
160 words
In a data communication system with distributed control of links between a plurality of nodes, a method for communicating packetized information via a common communication medium, including a plurality of channels according to a frequency hopping spread spectrum arrangement, among said plurality of nodes, said method comprising: establishing from a first node a first link to a second node according to a first communication protocol, said first communication protocol permitting random transmissions of first addressed packets during a first time period; establishing from a third node a second link to a fourth node according to a second communication protocol, said second communication protocol permitting transmissions of second addressed packets only according to authorization in response to a poll, said poll being invoked according to a first schedule during a second time period; and allocating available time alternately between exclusive time for said first time period and said second time period whereby random transmissions and polled transmissions can be made contemporaneously.
Claim 7
Dependent Claim
43 words
The method according to claim 4 wherein each said node can establish a plurality of contemporaneous links and wherein said first node is also said third node, said first node being a slave to control of said fourth node via said second link.
Claim 8
Dependent Claim
28 words
The method according to claim 4 wherein said poll is addressed less frequently to said third node in the absence of data transmission during a preceding polled transmission.
Claim 9
Dependent Claim
131 words
A data communication system with distributed control of links between a plurality of communication nodes for communicating packetized information via a common communication medium via a plurality of channels operative according to a frequency hopping spread spectrum communication arrangement among said plurality of nodes, said system comprising: means, at least one of said plurality of communication nodes, for linking in a peer mode and contemporaneously for linking in a poll mode as a master and for allocating time of said communication arrangement between said poll mode and said peer mode; means, at least one other of said plurality of communication nodes, for linking in said peer mode; and means, at least one other of said plurality of communication nodes, for linking in said poll mode as a slave to a master.
Claim 10
Dependent Claim
131 words
A data communication system with distributed control of links between a plurality of communication nodes for communicating packetized information via a common communication medium via a plurality of channels operative according to a frequency hopping spread spectrum communication arrangement among said plurality of nodes, said system comprising: means, at least one of said plurality of communication nodes, for linking in a peer mode and contemporaneously for linking in a poll mode as a master and for allocating time of said communication arrangement between said poll mode and said peer mode; means, at least one other of said plurality of communication nodes, for linking in said peer mode; and means, at least one other of said plurality of communication nodes, for linking in said poll mode as a slave to a master.
References Cited (Backward Citations)
US5574979A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-10-05 | 2002-04-06 | 2002-10-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-10-05 | 2006-04-06 | 2006-10-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-10-05 | 2010-04-06 | 2010-10-06 | $7700.00 | Window Closed / Lapsed |