← Back to Patent Explorer
US6807165B2 Expired / Lapsed US ⏱️ 0.0 years remaining

Time division protocol for an ad-hoc, peer-to-peer radio network having coordinating channel access to shared parallel data channels with separate reservation channel

Assignee: Arris Enterprises LLC
•
Filing: 2001-03-22
•
Granted: 2004-10-19
•
Expires: 2021-03-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A novel protocol for an ad-hoc, peer-to-peer radio network that provides collision-free channel access with an emphasis on improving geographic reuse of the frequency spectrum. The protocol of the invention is executed on the reservation or control channel, and provides a method for allocating data transactions on the data channels. The system of the invention utilizes multiple parallel data channels that are coordinated by a single reservation channel. The transceiver of the system employs two modems to solve the channel reliability issues with multiple channel designs, where one is dedicated as a receive-only modem for gathering channel usage information on the reservation channel. High quality voice, video and data may be transmitted. The reservation channel implements a time division multiple access algorithm with dynamic slot allocation. In a distributed manner, nodes determine geographic reuse of slots based on channel quality extracted from the modem. Signal quality calculations are used to determine the likelihood of a slot reuse causing destructive interference within a node's neighborhood. Requests for slot usage are compared with the known traffic pattern and accepted or rejected by nodes within RF signal range based on the signal quality calculations.

Inventors

  • 👤 John M. Belcea

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 21:41
CPC Classifications
H; H04; H04W; H04W48/00; H04W48/08; H04L; H04L45/00; H04W40/00; H04W40/02; H04W40/04; H04W40/08; H04W52/00; H04W52/04; H04W52/38; H04W52/383; H04W52/46; H04W52/50; H04B; H04B7/00; H04B7/24; H04B7/26; H04B7/2643; H04W52/18; H04W52/24; H04W52/247; H04W52/30; H04W52/32; H04W52/325; H04W52/36; H04W52/367; H04W60/00; H04W74/00; H04W74/04; H04W76/00; H04W76/10; H04W84/00; H04W84/18; H04W88/00; H04W88/02; Y; Y02; Y02D; Y02D30/00; Y02D30/70

Claims Analysis

Total Claims: 69
Claim 1
Independent Claim 305 words
In an ad-hoc, peer-to-peer radio system comprising a series of terminals where each said terminal is capable of making at least one of an outgoing call or receiving an incoming call, each said terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, the improvement comprising: said memory means comprising software means for creating connectivity messaging and data transfer plan messaging information for transmission to other said terminals, and for receiving similar said information from other said terminals from which said terminal can receive; said software means comprising means for delivering said connectivity and data transfer plan information messaging to a configuration channel for transmission to said other terminals belonging to the same service group (SG); said connectivity messaging comprising a utilization map, the power used for transmitting the messaging, and the level of the environmental noise at the transmission site of the transmitting terminal; said data transfer plan information messaging comprising messaging for use in changing the transmit power level and for determining routing paths; and said utilization map comprising information messaging on the availability of time slots of a previous time frame based on whether time slots were used in said previous time frame or were unavailable for use due to high-level noise; said software means further comprising means for generating at least one optimal connection path of a call based on said messaging received from other said terminals in said service group (SG), whereby said call is routed to its destination by routing said call along a route utilizing at least one of some of said terminals of said series of terminals based on least-energy routing, so that the least amount of energy over a selected route is chosen for completing a call.
Claim 2
Dependent Claim 305 words
In an ad-hoc, peer-to-peer radio system comprising a series of terminals where each said terminal is capable of making at least one of an outgoing call or receiving an incoming call, each said terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, the improvement comprising: said memory means comprising software means for creating connectivity messaging and data transfer plan messaging information for transmission to other said terminals, and for receiving similar said information from other said terminals from which said terminal can receive; said software means comprising means for delivering said connectivity and data transfer plan information messaging to a configuration channel for transmission to said other terminals belonging to the same service group (SG); said connectivity messaging comprising a utilization map, the power used for transmitting the messaging, and the level of the environmental noise at the transmission site of the transmitting terminal; said data transfer plan information messaging comprising messaging for use in changing the transmit power level and for determining routing paths; and said utilization map comprising information messaging on the availability of time slots of a previous time frame based on whether time slots were used in said previous time frame or were unavailable for use due to high-level noise; said software means further comprising means for generating at least one optimal connection path of a call based on said messaging received from other said terminals in said service group (SG), whereby said call is routed to its destination by routing said call along a route utilizing at least one of some of said terminals of said series of terminals based on least-energy routing, so that the least amount of energy over a selected route is chosen for completing a call.
Claim 3
Dependent Claim 106 words
The ad-hoc, peer-to-peer radio system according to claim 1 , wherein said means for generating at least one optimal connection path of a call based on said messaging received from other said terminals in said service group comprises determining the smallest path loss relative to said other terminals from which it has received similar messaging; said means for generating at least one optimal connection path of a call causing the said software means to initiate a request-to-register message in said connectivity messaging, whereby said terminal will register with the closest of said other terminals for serving as at least a first node of said optimal path.
Claim 4
Dependent Claim 122 words
In an ad-hoc, peer-to-peer radio system comprising a series of terminals where each said terminal is capable of making at least one of an outgoing call or receiving an incoming call, each said terminal comprising computer means, and memory means for storing program software means therein, the improvement comprising: each said terminal of said series of terminals comprising a modem means for transmitting first communications information on at least one data channel (DC) at a first chosen power level, and for transmitting second communications information on a control channel (CC) at a second chosen power level; said first power level being one of equal to or less than said second power level, whereby RF interference among said series of terminals is minimized.
Claim 5
Dependent Claim 122 words
In an ad-hoc, peer-to-peer radio system comprising a series of terminals where each said terminal is capable of making at least one of an outgoing call or receiving an incoming call, each said terminal comprising computer means, and memory means for storing program software means therein, the improvement comprising: each said terminal of said series of terminals comprising a modem means for transmitting first communications information on at least one data channel (DC) at a first chosen power level, and for transmitting second communications information on a control channel (CC) at a second chosen power level; said first power level being one of equal to or less than said second power level, whereby RF interference among said series of terminals is minimized.
Claim 6
Dependent Claim 28 words
The ad-hoc, peer-to-peer radio system according to claim 3 , wherein said software means of each said terminal comprises means for generating communications-information based on time division messaging.
Claim 7
Dependent Claim 68 words
The ad-hoc, peer-to-peer radio system according to claim 4 , wherein said communications-information comprises a series of time frames (TM) each divided into a series of time slots (TS); said communications-information comprising at least one time slot in which said control-channel messaging data is transmitted via said modem means, and at least two time slots in which is transmitted channel data (CD) messaging data via said modem means.
Claim 8
Dependent Claim 66 words
The ad-hoc, peer-to-peer radio system according to claim 5 , wherein said software means of each said terminal for generating said communications-information based also generates said communications-information based on frequency division multiple access (FDMA), said software means for generating said communications-information transmitting said control-channel (CC) information at a first frequency, and said data-channel (DC) information at at least one other frequency different from said first frequency.
Claim 9
Dependent Claim 99 words
The ad-hoc, peer-to-peer radio system according to claim 6 , wherein each said time frame comprises a first said time slot (TS) in which said control-channel (CC) information is transmitted at said second power level, and at least three other time slots (TS) in which said data-channel(DC) information is transmitted at said first power level; said first time slot transmitting said control-channel information at said first frequency of F 0 , and said at least three subsequent time slots (TS) transmitting said data-channel (DC) information at frequencies of F 1 , F 2 , and F 3 , respectively.
Claim 10
Dependent Claim 226 words
A protocol for use in an ad-hoc, peer-to-peer radio system comprising a series of terminals where each said terminal is capable of making at least one of an outgoing call or receiving an incoming call, and where each said terminal comprising computer means, memory means for storing program software means therein, and where each said terminal is capable of being hop of a routing path connecting a call from a source to a destination, comprising: software means for said memory means of each said terminal, said software means comprising means for generating communications-information for transmission based on time-division messaging; said communications-information comprising a series of time frames (TM) each divided into a series of time slots (TS); said communications-information comprising at least one time slot in which control-channel (CC) messaging information is transmitted, and other time slots in which is transmitted channel data (CD) messaging information; said at least one time slot transmitting said control-channel information at a first frequency of F 0 , and said other time slots (TS) transmitting said data-channel (DC) information at frequencies of F 1 , F 2 , and F 3 , respectively; each said time frame (TF) comprising an inter-frame time gap (IFTG) at the end of each said time frame (TF) in which no communications-information is transmitted, whereby each said terminal is allowed time to perform necessary calculations.
Claim 11
Dependent Claim 226 words
A protocol for use in an ad-hoc, peer-to-peer radio system comprising a series of terminals where each said terminal is capable of making at least one of an outgoing call or receiving an incoming call, and where each said terminal comprising computer means, memory means for storing program software means therein, and where each said terminal is capable of being hop of a routing path connecting a call from a source to a destination, comprising: software means for said memory means of each said terminal, said software means comprising means for generating communications-information for transmission based on time-division messaging; said communications-information comprising a series of time frames (TM) each divided into a series of time slots (TS); said communications-information comprising at least one time slot in which control-channel (CC) messaging information is transmitted, and other time slots in which is transmitted channel data (CD) messaging information; said at least one time slot transmitting said control-channel information at a first frequency of F 0 , and said other time slots (TS) transmitting said data-channel (DC) information at frequencies of F 1 , F 2 , and F 3 , respectively; each said time frame (TF) comprising an inter-frame time gap (IFTG) at the end of each said time frame (TF) in which no communications-information is transmitted, whereby each said terminal is allowed time to perform necessary calculations.
Claim 12
Dependent Claim 32 words
The protocol for use in an ad-hoc, peer-to-peer radio system according to claim 8 , wherein the length of each said time slot for transmitting said communications-information is equal to each other.
Claim 13
Dependent Claim 61 words
The protocol for use in an ad-hoc, peer-to-peer radio system according to claim 9 , said software means further comprises means for switching transmission of initial control communications-information from said last time slot (TS) to another, free, earlier time slot of a subsequent time frame (TF) in order to reduce the chance of collision with other said terminals also initially registering.
Claim 14
Dependent Claim 50 words
The protocol for use in an ad-hoc, peer-to-peer radio system according to claim 10 , said initial control communications-information in said last time slot (TS) and in said another, free, earlier time slot of a subsequent time frame (TF) are transmitted at a frequency F 0 of said control channel.
Claim 15
Dependent Claim 53 words
The protocol for use in an ad-hoc, peer-to-peer radio system according to claim 8 , wherein said at least one time slot (TS) for said control-channel (CC) information is transmitted at a first power level, and said other time slots (TS) for said data-channel (DC) information are transmitted at a second power level.
Claim 16
Dependent Claim 35 words
The protocol for use in an ad-hoc, peer-to-peer radio system according to claim 12 , wherein said second power level is equal to or less than said first power level, whereby RF interference is reduced.
Claim 17
Dependent Claim 160 words
In a radio terminal for use in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, said radio terminal capable of making at least one of an outgoing call or receiving an incoming call, and comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, the improvement comprising: said memory means comprising software means for setting the power level of a transmission of control-channel messaging to be transmitted by said transceiver means; said software means further comprising means for generating routing messaging including said power level set by said means for setting for use in determining the connection path of a call; said software means further comprising means for determining the optimal connection path of an outgoing call based on least energy use, so that the least amount of energy over a selected route is chosen for completing the call.
Claim 18
Dependent Claim 160 words
In a radio terminal for use in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, said radio terminal capable of making at least one of an outgoing call or receiving an incoming call, and comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, the improvement comprising: said memory means comprising software means for setting the power level of a transmission of control-channel messaging to be transmitted by said transceiver means; said software means further comprising means for generating routing messaging including said power level set by said means for setting for use in determining the connection path of a call; said software means further comprising means for determining the optimal connection path of an outgoing call based on least energy use, so that the least amount of energy over a selected route is chosen for completing the call.
Claim 19
Dependent Claim 41 words
The radio terminal for use in an ad-hoc, peer-to-peer radio system according to claim 14 , wherein said software means comprises message-generating means for generating a routing table based on said least energy use, said routing table comprising time-frame based messaging.
Claim 20
Dependent Claim 25 words
The radio terminal for use in an ad-hoc, peer-to-peer radio system according to claim 15 , wherein time-frame based messaging is based on time division.
Claim 21
Dependent Claim 69 words
The radio terminal for use in an ad-hoc, peer-to-peer radio system according to claim 15 , wherein time-frame based messaging comprises a series of time frames (TM) each divided into a series of time slots (TS), one said time slot being used for transmitting said control-channel (CC) messaging including said power level, said routing messaging, and said optimal path connection of an outgoing call based on least energy use.
Claim 22
Dependent Claim 35 words
The radio terminal for use in an ad-hoc, peer-to-peer radio system according to claim 17 , wherein other time slots of said series of time-slots based are used for transmitting channel data (CD) messaging information.
Claim 23
Dependent Claim 57 words
The radio terminal for use in an ad-hoc, peer-to-peer radio system according to claim 18 , wherein said one time slot transmits said control-channel information at a first frequency of F 0 , and said at other time slots (TS) transmit said data-channel (DC) information at frequencies different from said first frequency and different from each other.
Claim 24
Dependent Claim 53 words
The radio terminal for use in an ad-hoc, peer-to-peer radio system according to claim 18 , wherein each said time frame (TF) further comprises an inter-frame time gap (IFTG) at the end of each said time frame (TF) in which no communications-information is transmitted, in order to allow time to perform necessary calculations.
Claim 25
Dependent Claim 56 words
The radio terminal for use in an ad-hoc, peer-to-peer radio system according to claim 20 , wherein each said time frame (TF) further comprises a last time slot (LTS) at said first frequency in which is contained initial control communications-information indicating initial presence of said radio terminal in order to start communicating with other said terminals.
Claim 26
Dependent Claim 63 words
The radio terminal for use in an ad-hoc, peer-to-peer radio system according to claim 21 , wherein said software means further comprises means for switching transmission of initial control communications-information from said last time slot (TS) to another, free, earlier time slot of a subsequent time frame (TF) in order to reduce the chance of collision with other said terminals also initially registering.
Claim 27
Dependent Claim 51 words
The radio terminal for use in an ad-hoc, peer-to-peer radio system according to claim 18 , wherein said first time slot (TS) for said control-channel (CC) information is transmitted at a first power level, and said other time slots (TS) for said data-channel(DC) information are transmitted at a second power level.
Claim 28
Dependent Claim 36 words
The radio terminal for use in an ad-hoc, peer-to-peer radio system according to claim 23 , wherein said second power level is equal to or less than said first power level, whereby RF interference is reduced.
Claim 29
Independent Claim 233 words
A method of selecting an optimal routing path of a call in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, comprising: (a) creating a service group (SG) of said radio terminals where each said radio terminal of said service group may be connected to any other of said radio terminals of said service group via at least one connecting path; (b) creating in each said radio terminal of said service group (SG) via said software means connectivity messaging and data transfer plan messaging information for transmission to other said radio terminals of said service group, and for receiving similar said information from said other radio terminals; (c) delivering said connectivity and data transfer plan information messaging to a configuration channel for transmission to said other radio terminals belonging to the same service group (SG); (d) said step (b) comprising developing by said software means a utilization map, the power used for transmitting the messaging, and the level of the environmental noise at the transmission site of the transmitting terminal; (e) said step (b) further comprising using said data transfer plan information messaging for use in adjusting the transmit power level and for determining at least one routing path.
Claim 30
Independent Claim 233 words
A method of selecting an optimal routing path of a call in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, comprising: (a) creating a service group (SG) of said radio terminals where each said radio terminal of said service group may be connected to any other of said radio terminals of said service group via at least one connecting path; (b) creating in each said radio terminal of said service group (SG) via said software means connectivity messaging and data transfer plan messaging information for transmission to other said radio terminals of said service group, and for receiving similar said information from said other radio terminals; (c) delivering said connectivity and data transfer plan information messaging to a configuration channel for transmission to said other radio terminals belonging to the same service group (SG); (d) said step (b) comprising developing by said software means a utilization map, the power used for transmitting the messaging, and the level of the environmental noise at the transmission site of the transmitting terminal; (e) said step (b) further comprising using said data transfer plan information messaging for use in adjusting the transmit power level and for determining at least one routing path.
Claim 31
Dependent Claim 67 words
The method of selecting an optimal routing path of a call in an ad-hoc, peer-to-peer radio system according to claim 25 , wherein said step (d) comprises: (f) developing said utilization map with information messaging based on time division on the availability of time slots of a previous time frame based on whether time slots were used in said previous time frame or were unavailable for use.
Claim 32
Dependent Claim 91 words
The method of selecting an optimal routing path of a call in an ad-hoc, peer-to-peer radio system according to claim 25 , further comprising: (f) transmitting said connectivity and data transfer plan information messaging to other said radio terminals of said service group of radio terminals via said configuration channel; (g) receiving said connectivity and data transfer plan information messaging at said other radio terminals; (h) determining the optimal routing path of a call to or from a said radio terminal based on said received connectivity and data transfer plan information.
Claim 33
Dependent Claim 39 words
The method according to claim 25 , wherein said step (b) comprises: (c) applying a power-perturbation to said service group of terminals to cause at least some of said terminals to adjust the power level to a lower value.
Claim 34
Dependent Claim 50 words
The method according to claim 28 , wherein said time-dependent messaging is made up of a series of time frames with each time frame having a plurality of time slots, said step (c) comprising applying said perturbation in the same time frame on all said terminals of said service group.
Claim 35
Dependent Claim 41 words
The method according to claim 28 , wherein said time-dependent messaging is made up of a series of time frames with each time frame having a plurality of time slots, said step (b) comprising utilizing at least three said time frames.
Claim 36
Independent Claim 255 words
A method of reducing radio interference in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals forming a service group, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, where a call for sending packet data from one radio terminal may be connected utilizing at least one other said radio terminal as a node in the routing connection of the call to a destination other said other radio terminal, comprising: (a) transmitting connectivity messaging from said one radio terminal to at least one other radio terminal of said service group; (b) said step (a) comprising transmitting said connectivity messaging using time division signaling having a series of time frames (TF) with each said time frame consisting of a plurality of time slots (TS); (c) said step (b) comprising dedicating one of said time slots (TS) of each said time frame (TF) as a configuration channel in which said connectivity messaging is transmitted; (d) said step (b) comprising dedicating other of said time slots (TS) of each said time frame (TF) as data channels in which data information messaging is transmitted; (e) said step (b) comprising transmitting said connectivity messaging of said configuration channel of at a power level equal to or greater than the power level at which said data information on said data channels is transmitted. terminals of said series of terminals, computer means and memory means for storing.
Claim 37
Independent Claim 255 words
A method of reducing radio interference in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals forming a service group, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, where a call for sending packet data from one radio terminal may be connected utilizing at least one other said radio terminal as a node in the routing connection of the call to a destination other said other radio terminal, comprising: (a) transmitting connectivity messaging from said one radio terminal to at least one other radio terminal of said service group; (b) said step (a) comprising transmitting said connectivity messaging using time division signaling having a series of time frames (TF) with each said time frame consisting of a plurality of time slots (TS); (c) said step (b) comprising dedicating one of said time slots (TS) of each said time frame (TF) as a configuration channel in which said connectivity messaging is transmitted; (d) said step (b) comprising dedicating other of said time slots (TS) of each said time frame (TF) as data channels in which data information messaging is transmitted; (e) said step (b) comprising transmitting said connectivity messaging of said configuration channel of at a power level equal to or greater than the power level at which said data information on said data channels is transmitted. terminals of said series of terminals, computer means and memory means for storing.
Claim 38
Dependent Claim 40 words
The method of transmitting radio calls in an ad-hoc, peer-to-peer radio system according to claim 31 , wherein said step (e) comprises making the length of said inter-frame time gap (IFTG) longer than the lengths of said time slots (TS).
Claim 39
Independent Claim 178 words
A method of transmitting radio calls in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals forming a service group, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, comprising: (a) establishing a call from a said radio terminal based on time-division access; (b) said step (a) comprising creating messaging consisting of a series of time frames (TF) with each said time frame consisting of a plurality of time slots (TS); (c) said step (b) comprising dedicating one said time slot for use as a configuration channel for transmitting information useful in establishing a routing path of a call; (d) said step (b) further comprising dedicating other of said time slots for use as a data channels for transmitting the actual call information; (e) said step (b) further comprising forming an inter-frame time gap (IFIG) between said time frames (TF) during which each radio terminal may process said data received from another terminal.
Claim 40
Independent Claim 178 words
A method of transmitting radio calls in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals forming a service group, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, comprising: (a) establishing a call from a said radio terminal based on time-division access; (b) said step (a) comprising creating messaging consisting of a series of time frames (TF) with each said time frame consisting of a plurality of time slots (TS); (c) said step (b) comprising dedicating one said time slot for use as a configuration channel for transmitting information useful in establishing a routing path of a call; (d) said step (b) further comprising dedicating other of said time slots for use as a data channels for transmitting the actual call information; (e) said step (b) further comprising forming an inter-frame time gap (IFIG) between said time frames (TF) during which each radio terminal may process said data received from another terminal.
Claim 41
Dependent Claim 189 words
In a method of transmitting radio calls in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, said radio system based on time-dependent messaging having multiple parallel data channels and a control channel, comprising: (a) said radio terminal monitoring said control channel for information about the power level at which other said terminals are transmitting over said control channel; and (b) adjusting the power level of said terminal based on the information received on said control channel in said step (a); and before said step (a): (c) said terminal transmitting a registration request signal over said control channel for registering with at least one of: another said radio terminal and a gateway; (d) said step (a) monitoring the evolution of path loss to all radio terminals receiving said registration request of said step (c); (e) said step (b) comprising adjusting said power level in accordance with path-loss variation and noise level from said step (d).
Claim 42
Dependent Claim 189 words
In a method of transmitting radio calls in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means and memory means for storing program software means therein, said radio system based on time-dependent messaging having multiple parallel data channels and a control channel, comprising: (a) said radio terminal monitoring said control channel for information about the power level at which other said terminals are transmitting over said control channel; and (b) adjusting the power level of said terminal based on the information received on said control channel in said step (a); and before said step (a): (c) said terminal transmitting a registration request signal over said control channel for registering with at least one of: another said radio terminal and a gateway; (d) said step (a) monitoring the evolution of path loss to all radio terminals receiving said registration request of said step (c); (e) said step (b) comprising adjusting said power level in accordance with path-loss variation and noise level from said step (d).
Claim 43
Dependent Claim 61 words
The method of transmitting radio calls in an ad-hoc peer-to-peer radio system comprising a series of radio terminals according to claim 34 , further comprising: (f) said radio terminal registering with at least one other said radio terminal, said at least one other radio terminal serving as a node of a connection routing path of a call for said radio terminal.
Claim 44
Dependent Claim 137 words
The method of transmitting radio calls in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals according to claim 35 , wherein said step (f) comprises: (g) registering with a plurality of other said radio terminals for forming a multi-node connection routing path; (h) each said other radio terminal forming a said node of said connection routing path storing information in said memory means thereof about said registration (i) each said radio-terminal storing registration information in said memory means thereof about any other said radio terminal serving as a node therefor through which it has been registered; and (j) each said radio-terminal also storing registration information in said memory means thereof about any other said radio terminal for which it serves as a node therefor through which said any other radio terminal has been registered.
Claim 45
Dependent Claim 90 words
The method of transmitting radio calls in an ad-hoc, peer-to-peer radio system according to claim 34 , further comprising before said step (a): (f) initiating an outgoing call from one said radio terminal; (g) said step (f) comprising registering with another said radio terminal for serving as a node in the call connection by transmitting a registration request; (h) said step (g) comprising initially transmitting said registration message on the last time slot (TS) of a respective said time frame (TF), said last time slot serving as said configuration channel.
Claim 46
Dependent Claim 71 words
The method of transmitting radio calls in an ad-hoc, peer-to-peer radio system according to claim 37 , further comprising after said step (h): (i) selecting in a time frame (TF), subsequent to said respective said time frame in which said registration messaging was sent by said step (h), a time slot (TS) earlier than said last time slot of said subsequent time frame as said configuration channel for transmitting configuration messaging.
Claim 47
Dependent Claim 174 words
The method of transmitting radio calls in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals according to claim 34 , further comprising: (f) said step (c) comprising registering initially with one other said radio terminal for forming a node by which a call to and from said radio terminal may be completed; (g) said one other radio terminal submitting said registration request signal from said radio terminal to at least one of another said radio terminal or a gateway; (h) said one other radio terminal monitoring said control channel for information about the power level at which other said terminals are transmitting over said control channel; and (i) adjusting the power level of said one other radio terminal based on the information received on said control channel in said step (a); (j) said step (h) monitoring the evolution of path loss to all radio terminals receiving the registration request; and (k) said step (i) comprising adjusting said power level in accordance with path-loss variation and noise level from said step (j).
Claim 48
Dependent Claim 74 words
The method of transmitting radio calls in an ad-hoc, peer-to-peer radio system comprising a series of radio terminals according to claim 39 , further comprising: (l) said step (g) comprising submitting the registration request directly to a gateway; (m) recording in said gateway said registration request from said radio terminal; (n) said step (m) comprising storing information about the connection path, consisting of at least one node, from said radio terminal to said gateway.
Claim 49
Dependent Claim 164 words
In a protocol for use in a network of terminals each having computer means, memory means for storing a program, and software means therein, said software means of each said terminal comprising means for generating communications-information for transmission based on time division messaging, said communications-information comprising a series of time frames (TF) each divided into a series of time slots (TS); said communications-information comprising at least one time slot in which control channel (CC) messaging information is transmitted, and other time slots in which is transmitted data-channel (DC) messaging information, the improvement comprising: said at least one time slot transmitting said control-channel information at a first frequency of F 0 , and said other time slots (TS) transmitting said data-channel (DC) messaging information at different respective frequencies; each said time frame (TF) comprising an inter-frame time gap (IFTG) at the end of each said time frame (TF) in which no communications-information is transmitted, whereby each said terminal is allowed time to perform necessary calculations.
Claim 50
Dependent Claim 164 words
In a protocol for use in a network of terminals each having computer means, memory means for storing a program, and software means therein, said software means of each said terminal comprising means for generating communications-information for transmission based on time division messaging, said communications-information comprising a series of time frames (TF) each divided into a series of time slots (TS); said communications-information comprising at least one time slot in which control channel (CC) messaging information is transmitted, and other time slots in which is transmitted data-channel (DC) messaging information, the improvement comprising: said at least one time slot transmitting said control-channel information at a first frequency of F 0 , and said other time slots (TS) transmitting said data-channel (DC) messaging information at different respective frequencies; each said time frame (TF) comprising an inter-frame time gap (IFTG) at the end of each said time frame (TF) in which no communications-information is transmitted, whereby each said terminal is allowed time to perform necessary calculations.
Claim 51
Dependent Claim 21 words
The protocol according to claim 41 , wherein said inter-frame time gap (ITFG) has a length different than said time slots.
Claim 52
Dependent Claim 63 words
The protocol according to claim 42 , wherein each said time frame (TF) further comprises a last time slot (LTS); said software means further comprising means for generating initial control communications-information in a respective said last time slot (LTS) of a respective said time frame (TF) indicating initial presence of a respective said terminal in order to start communicating with other said terminals.
Claim 53
Dependent Claim 51 words
The protocol according to claim 43 , wherein said software means further comprises means for switching transmission of initial control communications-information from said last time slot (TS) to another, free, earlier time slot of a subsequent time frame (TF) in order to reduce the chance of collision with other said terminals.
Claim 54
Dependent Claim 38 words
The protocol according to claim 44 , wherein said initial control communications-information in said last time slot (TS) and in said another, free, earlier time slot of a subsequent time frame (TF) are transmitted at said first frequency.
Claim 55
Dependent Claim 38 words
The protocol according to claim 43 , wherein said software means comprises means for encoding the communications-information in said last time slot (LTS) using code-division multiple access (CDMA), whereby collisions in said last time slot (LTS) are avoided.
Claim 56
Dependent Claim 45 words
The protocol according to claim 43 , wherein said at least one time slot (TS) for said control-channel (CC) information is transmitted at a first power level, and said other time slots (TS) for said data-channel (DC) information are transmitted at a second power level.
Claim 57
Dependent Claim 22 words
The protocol according to claim 47 , wherein said second power level is equal to or less than said first power level.
Claim 58
Dependent Claim 276 words
A radio terminal for an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means, memory means for storing program software means therein, and software means, said radio system based on time-dependent messaging having multiple parallel data channels and a control channel, the improvement comprising: said software means comprising means for generating communications-information for transmission based on time-division messaging; said communications-information comprising a series of time frames (TM) each divided into a series of time slots (TS); said communications-information comprising at least one time slot in which control-channel (CC) messaging information is transmitted, and other time slots in which is transmitted channel data (CD) messaging information; said software means further comprising sending means for sending out message-signaling toward other said radio terminals for finding and registering with at least one other of said other radio terminals; said sending means comprising transmitting status messaging over said control channel; said software means also comprising listening means for listening to a response to said status messaging from at least another said radio terminal on said control channel; said software means further comprising random means for randomly selecting at least another said time slot of at least one subsequent said time frame for said sending means to transmit said status messaging when said listening means receives no response; said software means comprising power-incrementing means for increasing the power of transmission of said status messaging over a subsequent, selected, respective said time slot as compared with a previous said time slot in which said status messaging was transmitted.
Claim 59
Dependent Claim 276 words
A radio terminal for an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means, memory means for storing program software means therein, and software means, said radio system based on time-dependent messaging having multiple parallel data channels and a control channel, the improvement comprising: said software means comprising means for generating communications-information for transmission based on time-division messaging; said communications-information comprising a series of time frames (TM) each divided into a series of time slots (TS); said communications-information comprising at least one time slot in which control-channel (CC) messaging information is transmitted, and other time slots in which is transmitted channel data (CD) messaging information; said software means further comprising sending means for sending out message-signaling toward other said radio terminals for finding and registering with at least one other of said other radio terminals; said sending means comprising transmitting status messaging over said control channel; said software means also comprising listening means for listening to a response to said status messaging from at least another said radio terminal on said control channel; said software means further comprising random means for randomly selecting at least another said time slot of at least one subsequent said time frame for said sending means to transmit said status messaging when said listening means receives no response; said software means comprising power-incrementing means for increasing the power of transmission of said status messaging over a subsequent, selected, respective said time slot as compared with a previous said time slot in which said status messaging was transmitted.
Claim 60
Dependent Claim 73 words
The method according to claim 49 , wherein said step (h) comprises continually increasing the power level for each subsequent time frame until a maximum level has been reached; and further comprising: (i) identifying the radio terminal as being isolated and for causing the radio terminal to be a root of an isolated network (IN) if said step (f) does not receive a response from the transmitted status message after said step (h).
Claim 61
Dependent Claim 53 words
The radio terminal for an ad-hoc, peer-to-peer radio system according to claim 49 , wherein said step (g) comprises sending out the status messaging at a random rate varying between a first, preselected minimum time and a maximum time N determined by three times the number of member-terminals in the isolated network (IN).
Claim 62
Dependent Claim 259 words
In a radio terminal for an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means, memory means for storing program software means therein, and software means, said radio system based on time-dependent messaging having multiple parallel data channels and a control channel, the method comprising: (a) generating communications-information for transmission based on time-division messaging; (b) said step (a) comprising generating a series of time frames (TM) each divided into a series of time slots (TS); (c) said step (b) comprising dedicating at least one time slot for control-channel (CC) messaging information is transmitted, and other time slots in which is transmitted channel data (CD) messaging information; (d) sending out message-signaling toward other said radio terminals for finding and registering with at least other radio terminal; (e) said step (d) comprising transmitting status messaging over the control channel; (f) listening to a response to said status messaging from at least another radio terminal on the control channel; (g) randomly selecting at least another time slot of at least one subsequent time frame for retransmitting the status messaging when said step (f) did not hear a response from another terminal; (h) incrementally increasing the power of transmission of the status messaging over a subsequent, selected, respective time slot as compared with a previous time slot in which said status messaging was transmitted, and repeating said step (e) using the new time slot in the new time frame.
Claim 63
Dependent Claim 259 words
In a radio terminal for an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means, memory means for storing program software means therein, and software means, said radio system based on time-dependent messaging having multiple parallel data channels and a control channel, the method comprising: (a) generating communications-information for transmission based on time-division messaging; (b) said step (a) comprising generating a series of time frames (TM) each divided into a series of time slots (TS); (c) said step (b) comprising dedicating at least one time slot for control-channel (CC) messaging information is transmitted, and other time slots in which is transmitted channel data (CD) messaging information; (d) sending out message-signaling toward other said radio terminals for finding and registering with at least other radio terminal; (e) said step (d) comprising transmitting status messaging over the control channel; (f) listening to a response to said status messaging from at least another radio terminal on the control channel; (g) randomly selecting at least another time slot of at least one subsequent time frame for retransmitting the status messaging when said step (f) did not hear a response from another terminal; (h) incrementally increasing the power of transmission of the status messaging over a subsequent, selected, respective time slot as compared with a previous time slot in which said status messaging was transmitted, and repeating said step (e) using the new time slot in the new time frame.
Claim 64
Dependent Claim 92 words
The radio terminal for an ad-hoc, peer-to-peer radio system according to claim 52 , said power-incrementing means continually increases the power level for each subsequent said time frame until a maximum level has been reached; said software means further comprising means for identifying said radio terminal as being isolated and for setting said radio terminal as a root of an isolated network (IN) if said listening means does not receive a response from said status message after said power-incrementing means has sent out over a time slot at said maximum power level.
Claim 65
Dependent Claim 56 words
The radio terminal for an ad-hoc, peer-to-peer radio system according to claim 53 , wherein said random means sends out said status messaging from said sending means at a random rate varying between a first, preselected minimum time and a maximum time N determined by three times the number of member-terminals in said isolated network (IN).
Claim 66
Dependent Claim 176 words
In an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means, and memory means for storing program software means therein, said radio system based on time-dependent messaging having multiple parallel data channels and a control channel, the method comprising: (a) generating communications-information for transmission based on time-division messaging; (b) said step (a) comprising generating a series of time frames (TM) each divided into a series of time slots (TS); (c) said step (b) comprising dedicating at least one time slot for control-channel (CC) messaging information is transmitted, and other time slots in which is transmitted channel data (CD) messaging information; (d) when said transceiver is idle from transmitting or receiving messaging information in said step (a), sending out maintenance message-signaling toward other said radio terminals for maintaining a link with at least one other said radio terminal; (e) said step (d) comprising transmitting said maintenance status messaging message-signaling over the control channel.
Claim 67
Dependent Claim 176 words
In an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means, and memory means for storing program software means therein, said radio system based on time-dependent messaging having multiple parallel data channels and a control channel, the method comprising: (a) generating communications-information for transmission based on time-division messaging; (b) said step (a) comprising generating a series of time frames (TM) each divided into a series of time slots (TS); (c) said step (b) comprising dedicating at least one time slot for control-channel (CC) messaging information is transmitted, and other time slots in which is transmitted channel data (CD) messaging information; (d) when said transceiver is idle from transmitting or receiving messaging information in said step (a), sending out maintenance message-signaling toward other said radio terminals for maintaining a link with at least one other said radio terminal; (e) said step (d) comprising transmitting said maintenance status messaging message-signaling over the control channel.
Claim 68
Dependent Claim 241 words
In an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means, and memory means for storing program software means therein, said radio system based on time-dependent messaging having multiple parallel data channels and a control channel, the method comprising: (a) building a link between a source terminal and a destination radio terminal or gateway; (b) said step (b) comprising sending out link message-signaling from said source terminal toward said destination over said control channel at a first power level; (c) after said step (b), said source terminal listening to said control channel for a response to said step (b) by any other said radio terminal; (d) if said step (c) indicated no response, increasing said power level; (e) if said step (c) indicated a response, said destination adjusting its power of transmission in accordance with the length of the path from said source to said destination and the type of service; (f) sending out a dummy Clear-to-Send (CTS) from said destination at the power set in said step (e); (g) a terminal receiving said dummy CTS of said step (f), and which was part of said link to said destination, answering said destination with a Ready-to-Link (RTL) message; and (h) selecting the first hop of the link for which a connecting routing path is to be formed.
Claim 69
Dependent Claim 241 words
In an ad-hoc, peer-to-peer radio system comprising a series of radio terminals, each said radio terminal comprising transceiver means for transmitting and receiving signals from other like terminals of said series of terminals, computer means, and memory means for storing program software means therein, said radio system based on time-dependent messaging having multiple parallel data channels and a control channel, the method comprising: (a) building a link between a source terminal and a destination radio terminal or gateway; (b) said step (b) comprising sending out link message-signaling from said source terminal toward said destination over said control channel at a first power level; (c) after said step (b), said source terminal listening to said control channel for a response to said step (b) by any other said radio terminal; (d) if said step (c) indicated no response, increasing said power level; (e) if said step (c) indicated a response, said destination adjusting its power of transmission in accordance with the length of the path from said source to said destination and the type of service; (f) sending out a dummy Clear-to-Send (CTS) from said destination at the power set in said step (e); (g) a terminal receiving said dummy CTS of said step (f), and which was part of said link to said destination, answering said destination with a Ready-to-Link (RTL) message; and (h) selecting the first hop of the link for which a connecting routing path is to be formed.

References Cited (Backward Citations)

US4910521A Cited
US4494192A Cited
US4617656A Cited
US5687194A Cited
US4747130A Cited
US4736371A Cited
US4742357A Cited
US5034961A Cited
US5809518A Cited
US5555425A Cited
US5068916A Cited
EP0513841A2 Cited
US5627976A Cited
US5241542A Cited
FR2683326B1 Cited
US5231634A Cited
US5231634B1 Cited
US5392450A Cited
US5896561A Cited
US5424747A Cited
US5233604A Cited
US6192230B1 Cited
US5696903A Cited
EP0627827A2 Cited
US5317566A Cited
US5631897A Cited
US5787076A Cited
US5857084A Cited
US5412654A Cited
US5621732A Cited
US5502722A Cited
CA2132180C Cited
US5745483A Cited
US6029217A Cited
US5644576A Cited
US5748624A Cited
US5618045A Cited
US5555540A Cited
US5533026A Cited
US5796741A Cited
US5572528A Cited
US5886992A Cited
US5517491A Cited
US6263210B1 Cited
US5623495A Cited
US5822309A Cited
US5781540A Cited
US5794154A Cited
US5881372A Cited
US6132306A Cited
US6192053B1 Cited
US5615212A Cited
US5805593A Cited
US5805842A Cited
US5774461A Cited
US5701294A Cited
US5717689A Cited
US6246875B1 Cited
US5991279A Cited
US6178337B1 Cited
US6052752A Cited
US5680392A Cited
US5684794A Cited
US5706428A Cited
US5652751A Cited
US5796732A Cited
US5805977A Cited
US5943322A Cited
US5845097A Cited
US5787080A Cited
US6028853A Cited
US5774876A Cited
US6097704A Cited
US6067297A Cited
US5844905A Cited
US5909651A Cited
US5987011A Cited
US6434158B1 Cited
US6044062A Cited
US6249516B1 Cited
US5903559A Cited
US5877724A Cited
US6052594A Cited
US5881095A Cited
US6029074A Cited
US5870350A Cited
US6240294B1 Cited
US6122690A Cited
US6108738A Cited
US6108316A Cited
US6198784B1 Cited
US5987033A Cited
US6163699A Cited
US6590928B1 Cited
US6067291A Cited
US6034542A Cited
US6058106A Cited
US6088337A Cited
US6359872B1 Cited
US6016311A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2007-10-19 2008-04-19 2008-10-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2011-10-19 2012-04-19 2012-10-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2015-10-19 2016-04-19 2016-10-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag