CA2120520A1 - A radio frequency local area network - Google Patents
A radio frequency local area networkInfo
- Publication number
- CA2120520A1 CA2120520A1 CA002120520A CA2120520A CA2120520A1 CA 2120520 A1 CA2120520 A1 CA 2120520A1 CA 002120520 A CA002120520 A CA 002120520A CA 2120520 A CA2120520 A CA 2120520A CA 2120520 A1 CA2120520 A1 CA 2120520A1
- Authority
- CA
- Canada
- Prior art keywords
- communication
- nodes
- node
- link
- indication
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F1/00—Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
- G06F1/16—Constructional details or arrangements
- G06F1/1613—Constructional details or arrangements for portable computers
- G06F1/1626—Constructional details or arrangements for portable computers with a single-body enclosure integrating a flat display, e.g. Personal Digital Assistants [PDAs]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/02—Digital computers in general; Data processing equipment in general manually operated with input through keyboard and computation using a built-in program, e.g. pocket calculators
- G06F15/0225—User interface arrangements, e.g. keyboard, display; Interfaces to other computer systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10544—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation by scanning of the records by radiation in the optical part of the electromagnetic spectrum
- G06K7/10821—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation by scanning of the records by radiation in the optical part of the electromagnetic spectrum further details of bar or optical code scanning devices
- G06K7/1098—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation by scanning of the records by radiation in the optical part of the electromagnetic spectrum further details of bar or optical code scanning devices the scanning arrangement having a modular construction
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01Q—ANTENNAS, i.e. RADIO AERIALS
- H01Q1/00—Details of, or arrangements associated with, antennas
- H01Q1/007—Details of, or arrangements associated with, antennas specially adapted for indoor communication
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01Q—ANTENNAS, i.e. RADIO AERIALS
- H01Q1/00—Details of, or arrangements associated with, antennas
- H01Q1/12—Supports; Mounting means
- H01Q1/22—Supports; Mounting means by structural association with other equipment or articles
- H01Q1/24—Supports; Mounting means by structural association with other equipment or articles with receiving set
- H01Q1/241—Supports; Mounting means by structural association with other equipment or articles with receiving set used in mobile communications, e.g. GSM
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01Q—ANTENNAS, i.e. RADIO AERIALS
- H01Q21/00—Antenna arrays or systems
- H01Q21/24—Combinations of antenna units polarised in different directions for transmitting or receiving circularly and elliptically polarised waves or waves linearly polarised in any direction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/12—Arrangements for remote connection or disconnection of substations or of equipment thereof
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/44—Distributed routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/16—Gateway arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
- H04L45/488—Routing tree calculation using root node determination
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/14—Multichannel or multilink protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/324—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/325—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the network layer [OSI layer 3], e.g. X.25
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/326—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the transport layer [OSI layer 4]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/08—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on transmission power
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/34—Modification of an existing route
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/04—Large scale networks; Deep hierarchical networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/10—Small scale networks; Flat hierarchical networks
- H04W84/12—WLAN [Wireless Local Area Networks]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/02—Terminal devices
- H04W88/04—Terminal devices adapted for relaying to or from another terminal or user
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/08—Access point devices
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/14—Backbone network devices
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W92/00—Interfaces specially adapted for wireless communication networks
- H04W92/16—Interfaces between hierarchically similar devices
- H04W92/20—Interfaces between hierarchically similar devices between access points
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
An apparatus and a method for routing data in a radio data communication system having one or more host computers (10), one or more intermediate base statios (20-52), and one or more RF terminals (100) organizes the intermediate base stations into an optimal spanning-tree network to control the routing of data to and from the RF terminals and the host computer efficiently and dynamically. Communication between the host computer and the RF terminals is achieved by using the network of intermediate base stations to transmit the data.
Description
~WC9 93/07691 2 l 2 ~ ~ h a PCI'/US92/08610 TIq!l.15: ~ RADIO FREQ~J~ICY LOS:~AI. ARl :A ~:~ORR
~A~RGRO~D CSF ~B I~ ~ION
In a typical radio data communication system having on~ or more host computers ~nd multiLple RF
termin 15, communication between a host computer and an RF terminal is provided by one or more base stations. Depending upon ~he application and the operating conditions, a large number of thes~ b~se stations may be required to adequately serve the systeDl. For example, a radio data c:ommunication system in~;talled in a large factory may re~uire dozens , - :~; 10 of bc,se stations in order to co~er the entire factory î loor .
In earlier RF data commlmlca~ ion systems, the bas~ 6ta~ions were typically co~ulected dir2ctly to a : host computer through mlllti-dropped conne~tions to an ;5 Ethexnet: communic:ation line. To c:ommunicate between an ~ terminal and a host computer, in ~;uch z system, the RF terminal sends d~ta to a base station and the base ~station passes the data direc ly to the host computer. Communicating with a host c~mputer through 2 0 ~ a base station in this manner is commonly known as holpping. These earlier RF data c~mmunicatic~n systems ~; ~used a ~ingle-hop method of communication.
In ord~3r to c:over a larger area with an RF data comm~nic:atiorl ~3ystem and to take advantage of the deregulation of the spread-spectrum radio fre~encies, later-developed RF data ccDunication æy~tems are : organiæed into layers OI base sta*ions~ As in earlier :~ :
WO93/~7691PCT/US92/08610 2 ~ S 2 RF data communications systems, a typical system includes multiple base stations which communicate directly with the RF terminals and the host c~mputer.
In addition, the system al~o includes intermediate 5stations that communicate with the RF terminalsj the multiple base stations, and other inter~ediate stations. In such a system, communication from an RF
terminal to a host computer may be achieved, for example, by ha~ing the RF terminal send data to an ::~: 10intermediat~ station, the intermediate station send the data to a base station, and the base station send the data directly to the host computer. Communicating with a~host:computer through more than one station is commonly known as a multiple-hop communication system.
15Difficulties often arise in maintaining the integrity of such multiple-hop RF data communication : systems.: The system must be able to handle both wireless~ and :hard-wired station connections, ;;efficient :dynamic routing of data information, RF
20terminal mobility, and interference from many dif f erent sources .
~: : ; : ::
~093/07691 2 ~ 2 ~ PCT/US92/08610 _UNNARY OF_TH~ ~NVBN~O~
The present invention solves many of the problems inherent in a multiple-hop data communication system.
The present invention comprises an RF Local-Area Network capable of afficient and dynamic handling of : data by routing communications between the ~F
Terminals and the host computer through a network of ~ int~rmediate base~stations.
:~ ~: In one embodiment of the present invention, the RF data:communication system contains one or more host - computers~ and multipIe gateways, br~dges, and RF
terminals.: Gateways are used to pass messages to and from;a host computer and the RF Ne work. A host port is used~to provide a link between the gateway and the host computer. In addition, gateways ma~ include bridging~functions and may pass information from one RF terminal to another. Bridges are intermediate relay~nodes~which repeat data messages. Bridges can : repeat~data~; to :and: from bridges, gateways and RF
: ::terminals~and:are~ ùsed to extend the range of the gateways~
The~RF~ erminals are attached logically ~o the :host~computer~ and::use:a network formed by a gateway and~ hé~bridges:to communicate with the host computer.
2~5~ :To~ set~up~the network, an optimal configuration for conducting~;Detwork communication spa~ning~tree is : created:to:control the flow of data communication. To : aid:~ understanding by providing a more visual description, ~:this configuration is referred to hereafter~as:a "spanning tree" or "optimal spanning tree".~
Specifically, root of the ~p~nning tree are the : gateways;~ the branches are the~ bridges; and non : bridging stations, such :as RF terminals~, are the 35~ ~ leaves~of the tree. Data are~sent along the:branches :
:: :
WO93/07691 P~T/US92/0~610 h~5~v 4 of the newly cre~tsd opti~al spanning tree~ Nodes in the network use a backward learning technique to route packets along the correct branches~
~: One object of the present invPntion is to route:~ 5 data efficiently, dynamically, and without looping.
Another object of the present invention is to make the routing of the data transparent to the RF terminals.
The RF terminals, transmitting data intended for the ; ~ host computer, are unaffected by the means ultimately used by~the RF Network to deliver their data.
It~is a further object of the present invention : for the network to be capable of handling RF ~erminal mobility:and~lost nodes with minimal impact on the entire~RF~data communication system.
,~ :
: ~ :
: ~::
~: :::
W~g3/~7691 ~ 2~ 2~ P~r/US92/08610 ~R~F~DBg~RIPTTO~ OF T~ DRA!IrI~G
The FIG. 1 is a func ional bloc:k diagram of arl RF
data co~munication syst~m incorporating the RF local-area ne~work of the present invention.
.
. .
:~
~ ~ s :
:
WO 93~076g1 PCI`/USg2/08610 '~ i2 0 5 2 ~ - 6 -DBTAIL~D DE~CRIPTION OF T~ I~VgNTION
The FIG. 1 is a functional block diagram of an RF
data communication ~ystem. In one embodiment of ~he present invention, the RF data communication system S has a host computer 10, a network controller 14 and bridges 22 and 24 attached to a data communication link 16. A}so attached to the data communication li~k 16 is a gateway 20 which acts as the root node for the spanning tree of the ~F data network of the present invention. A bridge 42 is attached to the gateway 20 through a hard-wired communication link and bridges 40 : : and 4:4 are logically attached to gateway 20 by two inde`pendent:RF links. Additio~al bridges 46, 48, 50 and 52 are~also connected to the RF ~etwork and are ~:: 15 shown in the FIG. 1. Note that, al~hough shown separate :from the host computer 10, the gateway 20 the ;spsnning~ tree root node) may be part of host : : comput~r~;l0.~ ;
The~IG. 1 further shows RF terminals 100 and 102 2:0~ attached~to:bridge 22 via ~F links and RF terminal 104 attached:~to~ bridge 24 via an RF link. Also, RF
;terminals~106, 108, 110, 112, 114, 116, 118, and 120 can~ e~seen logically attached to th~ RF~ Metwork : : through~their respective RF links. The RF terminals 25~ in FIG.~ l are::representative of non-bridging stations.
In aIte~nate ~ odiments of the present invention, the Network;could contain any:type of device capable of supporting~the~functions needed to c~mmuni~ate in the ; ; RF~ Network such as hard-wired :terminals, re~ote printers,~stationary bar code scanners, or the liXe.
The RF:data:communication~system, as sh~wn in FIG. 1, représénts~the configuration~of the fiystem at a discrete moment in time after~;:the~ initialization of : the cystem.~The RF links,:as shown, are dynamic and subject to change. For example, changes in the :
-::
~;:: : :
- ~w~ 93/076912 ~ 2 ~ ~ ?~ a PCT/US92/08610 s~ruature of th~ RF data communication system can be caused by movement of the RF t~rminals and by interfer~nce that affects the RF ~ommunication links.
In the preferred embodiment, the host computer 10 5is an~IBM 3090, the network controller 14 is a model ; : RC3250 of the Norand Corporation, the data ; ~ ~com~unication link 16 is an Ethernet link, the :~ nodes 20, 22, 24, 40, 42, 44, 46, 48, 50 and 52 are ntel}igent base transceiver uni~s of the type RB4000 10of the Norand Corporation, and the RF terminals 100, 102, 104, 106, 108, 110, 112, 114, 116, 118 and 120 are of type:RT1100 of the Norand Corporation~
The~optimal spanning tree, which provides the data~pathways throughout the communication system, is 15stored and~maintained by the network as a whole. Each node~in the:~network stores and modifies information : which specif~ies how local communication tr~ffic should : flow~ Optimal spanning trees assure efficient, adaptive~;(dynamic)::routing o~ infoxmation without 20 ~ ooping.~
::To~initialize the RF data communication system, ; the:~gateway z0 and the other nodes are organized into an;optimal~spanning tree rooted at the gateway 20. To : form~ the~::optimal spanning tree, in the preferred 25~embodiment~ the gateway 20 is assigned a status of ATTAC~ED and all other bridges are assigned the status :: U~ATTACHED~ he gateway 20 is considered attached to the~:spanning tree because~ it is the root node.
Initially,~all other bridges are unattached and lack : 30a parent in ths ~panning tree. At ~his point, the : : ::attache~gateway nod~ 20 periodically broadcasts a speciic~type of pollinq:packet referred to hereafter as "HELLO packetsl'. m~: NELLO packets can be broadcast~:using known methods of communicating via ; 35radio frequency (RF) link:or ~ia a direct wire link.
::
:~
:
WOg3/076gl PCr/US92/08610 ,~;., In the preferred embodiment of the present invention, the RF li~k is comprised of spr~ad spectrum 2 ~ 2 transmissions using a polling protocol. Although a polling protocol is preferred, a carrier-sense S multiple-access (CSMA), busy-tone, or any other protocol might also manage the communication traffic on the RF link.
HELL0 packets contain 1) the address of the sender, 2) the hopping distance that the sender is from the root, 3) a source addreæs, 4) a count of nodes in the subtree which flow through that bridge, : and 5) a list of system parameters. Each node in the network is~assigned a unique network service address and a node-type identifier to distinguish between ~:: 15 different nodes and different node types. The : : distan~e of~ a node from the root node is measured in hops times the bandwidth of each hop. The gateway root is considered to be zero hops away from itself.
~:; : The unattach~d bridges are in a LISTEN state.
;~ 20 ~Durin~the~LISTEN state, a br~dge will listen to the HELLO~messages that are broadcast. By listening to ~. , , the HELLO;messages~, bridges can learn which nodes are attached~to the sp~nning treeO The unattached bridges analyze~ the contents of the HELL0 messages to 25~ ~determine~ whether to requ~t attachment to the broadcasting node. In the preferred embodiment, a bridgè atte~pts tG attach to the node that is logically~closest to the root node. In khe preferred emboaim~nt~, the logical distance i~ based upon the ; . 30 numbex o~ hops needed to reach the root node and the bandwidth:of those hops. The distance the attached node is~away from the root node is found in the second : field of the HELL0 message that is broadcast.
, In~another embodiment of the present invention, the bridges consider the nu~ber of nodes attached to ~ .5~ h ~ .~3 2`û
~r `~O 93/07691 PCT/US92/08610 _ g _ the attached node as well as the logical distanc~ of the at~ached node from the root node. If an attached node is ~verloaded with other attached nodes, the unattached bridge may request attachment to a less : 5 loaded node.
After attaching to an attached node, th- newly : attached bridge~ (the child) must determine it5 distance from the root node. ~o arrive at the distance of the child from the root node, the child adds the broadcast distance o~ its paxent from the root node to the distance of the child from its parent. :In the:preferred embodiment, the distance of a child from its:parent is based on the ~andwidth o~
the data~ communication link. For example, if the child:attache~s to its parent via a hard-wired link (data :rate~26,000 baud), then the distance of that communication li~ might e~ual, for example, one hop.
However,~if the child attaches to its parent via an RF
link ~data rate:960U baud~:, then the distance of that 20~ :co~munication li~k might correspondingly be equal 3 : hops~. The n a r of the hop corresponds directly to the co., unication speed of the link. This may not only~take~:into consideration baud rate, but also æuch factors;as~channel interference.
25~ Initia~lly, only the root gateway node 20 is broad~asting: HELLO: messages and only nodes 40, 42 and 44~:~are ~within range of the ~ELL0 messages broadcast :`by :the gateway. ~herefore, after the liste~ing~period has expired, nodes 40, 42 and 44 3~ request attachment to the gateway node 20. The unattached~;nodes 40, 42, and 44 send A ~ CH.request packets~and the:at ached gateway node 20 acknowledges the ATTACH~.request packets with l~cal ATTACHOconfirm packets.~ The newly attached~bridges are assiyned the ~:: 35 ~ sta~us ATTACHED and begin broadcasting th~ir own HELL0 , ~
:
: ~:
WO93/076gl PCT/US92~08610 ~
. ~ .
2 ~2 C ~ackets, looking for o~her unattached bridges. Again, ~ ~ ~the remaining unattached nodes attempt to attach to the attached nodes that are logically closest to th~
root node. For example, node 48 i~ within range of HELLO messages from both nodes 40 and 42. However, node 40 is three hops, via an RF link, away fr~m ~he : gateway root node 20 and node 42 is only one hop, via a hard-wired link, away from the gateway root node 20.
Therefore, node 48 attaches to node 42, the closest node:to the gateway root node 20.
:The ~ending o~ HELLO messages, ATTACH.request packets and AT~ACH.confirm packets aontinues until the entire sp~anning:tree is established. In addition, attached bridges may also respond to HELLO messages.
If a HELLO message indicates that a much closer route ; ~ to the root node is available, the attached bridge ; : sends :a DETACH packet to its old parent and an ATTACH~.request packet to the closer node. To avoid instabi-lity:in the system and to avoid overloading any given node, an~attached bridge would only respond to a HELLO message if the hop count in a HELLO packet is greater~ than a certain threshold value, ;CHANGE_~RES~OLD~. In the preferred e~bodiment, the value ;of the CHANGE_THRESHOLD equals 3. In this :25 ;~anner,~an~optimal spanning tree is formed that is capable of~ transmitting data without looping.
Nodes,~ other than the gateway root node, after acknowledging ~an ATTA~H.re~ est packet from a :;previously ~ unattarhad node, will send the ~TTACH.request packet up the branche of the spanning tree to the gateway root node. As the A~TACH.request packet is~being sent to the gateway root node, other nodes:~attached on the ~s~ame branch record the destinat:ion of the newly attached node in their routing:entry table.~ When the ATTACH.request packet ~ :
:
~W~93~07691 ~ 2 ~ PC~/US92/~8610 reaches the gateway root node, the gateway root node returns an end-to-end A~TACH. conf irm packet .
After the spanning tree is initialized, th~ RF
terminals listen for periodically broadcasted Hello packets to dstermine which attached nodes are in range. After recei~ring HELL0 messages from attached nodes t an RF terminal responding to an appropriate poll sends an ATTACH. request packet to a~ttach to the node logical~y closest to the rootO For example, RF
terminal 110 is physically closer to node 44.
~Iowever, node 44 is three hops, ~ria an RF link, away ~Erom the gateway root node 20 and node 42 is only one hop, ~ria a hard-wired link, away from the gateway root node 20. Therefore, RF terminal 110, after hearing HELL0 messages from both nod~s 42 and 44, attaches to node 42, the cIosest node tQ the gateway root node 20.
~: Similarly, ~ terminal 114 hears ~IELL0 messages fromnod~s ~8 and 50. Nodes 48 and 50 are both four hops away from~ ~e gateway roc~t node 20. ~lowever, nod~ 48 has ~wo RF terminals 110 and 112 already attached to it while node 50 has only one RF terminal 116 attached to it~ :m erefore, ~F terminal 114 will ~ttach to node 50, the least busy node of equal distance to the :: gateway root node 20.
: 25 The attached node acknowledges the ATTACH.request : and sends the ~TTACH.re~ue~t pack t to the gateway root node. Then, the gateway root node returns an :
: end-~o-end AT~ACH.confirm packet4 In ~his manner, the end-to-end ~TTACH.raquest Xunctions as a discovery packet enabling the gateway root node, and all other nodes ~long the same branch, to learn the addre~s of . ~ tha RF terminal quickly. This proc~ss is called backward learning. Nodes learn the addresses of terminals by monitoring the traf~ic from terminals to the root. If a packet ~rrives from a terminal that is WO93/07691 PCT/US92/08610 ~.
~Z~20 not con~ained in the routing table of the node, an entry is made in the routing table. The entry includes the terminal address and the address of the node that sent the packet. In addition, an entry timer is set for that terminal. The entry timer is used to determine when RF terminals are actively using the attached node. Nodes maintain entries only for terminals that are actively using the node for communication. If the entry timer expires due to lack of communication, the RF terminal entry is purged from the routing table.
;~ ~; The RF links among the RF terminals, the bridges, and the gateway are oft n lost. Therefore, a connection-oriented data-link service is used to maintain the logical node-to-node links. In the absence of network traffic, periodic messages are sent and received:~to ensure th~ stability of the RF link.
As a result, the loss of a link is quickly detected and the RF Network can attempt to establish a new RF
link before~data transmission ~rom the host computer to an RF termi~aI is advers~ly affected.
; Communication between terminals and the host : compu~er; is~accomplished by using the resulting RF
Network.~To;com~unicate with the host computer, an RF
~ terminal sends a data packet in response to a poll from :the ~bridge closest to the host computer.
Typically,~:the RF terminal is attached~.to the bridge : ¢loses: to;~the host computer. However, RF termina}s : :zre ~ constantly listening for HELL0 ~nd polling i: ~ 30 messages from other bridges and may attach to, and then co~municate with, a bridgP in the table of bridges t~at i~s~closer to the particular RF terminal.
, ~
nder certain operating conditions, duplicate data packets can bs transmitted in the RF Network.
-~WO93/07591 ~ PCT/US92/08610 For example, it is possi~le for an RF terminal to transmit a data packet to its attached node, for the node to transmit the acknowledgement frame, and ~or the RF terminal not to receive the acknowledgement.
Under such circumstances, the RF terminal will retransmit the data. If the duplicate data packet is updated into ~he database of the host computer, the database would become corrupt. Therefore, the RF
Network of the present invention detects duplicate data packets. ~o ensure data integrity, each set of data transmissions receives a sequence number. The sequence numbers are continuously increme~ted, and duplicate sequence numbers are not accepted.
When a~ bridge receives a data packet ~rom a terminal directed to the host computer, the bridge ~ forwards the data packet to the parent node on the :: branch~ The parent node then forwards the data packet :~ to it ! parent node. The forwarding of the data packet continues until ~he gateway root node rereives the data packet and sends it to the hGSt co~puter.
; Similarlyl when a packet arrives at a node ~rom the host compu~er directed to an RF terminal, the node checks lts routing entry table and forwards the data ~: packet to its child nodP which is along the branch destined:~for the RF terminal. It i~ not necessary for th~ nodes along the branch co~taining the RF terminal to ~now the ultimate location of the RF terminal. The ~orwarding of the data packet continues until the data pa~ket reaches the final node on the branc~, which then forwards the data packet directly to the terminal itsel~.
Communication is a~so po ~ible between RF
; termi~als. To communicate with ano~her RF terminal, the RF ~erminai sends a data packet to its attached bridge. When the bridge recei~es the data pack~t from W093/~769t PCT/USg~/0~610 2 a terminal direated to the host computer, the bridge checks to see if the destination address o~ the RF
terminal is located within its ruuting table. If it is, the bridge simply sends the message to ~he S intended RF terminal. If not, the bridge forwards the data packet to its parent node. The forwarding of the data packet up the branch continue~ until a common parent between the RF terminals is found. Then, the common parent (often the gateway node it~elf) sends the data packet to the intended RF terminal via the branches of the RF Network.
During the normal operation of the RF N~twork, RF
terminals can become los~ or unattached to their attached node.;;If an RF terminal becomes unattached, for whatever reason, its routing entry i5 purged and the RF terminal listens for HELL0 or polling messages from any attached nodes in range. After recei~ing HELLO~or~pol~ling message~ from attached nodes, the RF
terminal~sends an ATTACN.request packet to the attached node`closest to the root. That attached node acknowledges~ the~ A~TACH~re ~ est and sends the ; A~ ACH~.request ~packet onto the gateway root node.
Then, ~the gatewa~ root node returns an end-to-end ATTA~H.confirm packet~
25~ Bridges~an also become Iost or unattached during normal~ operations of the RF Ne~work. I~ a bridge becomes~ lost or unattached, all routing entries contalning the bridge are purged. The ~ridge~ then broadcasts~;a HELLO.request with a global bridge ;30 destina~ion address. Attached nodes will broadcast HELLO packets~ immediately if they receive an ~TTA~H.xequest packet with a global d~stination address.~ miS helps the lost node re-attach. Then, the bridge~ enters the LISTEN state to learn which attached nodes are within range. The unattached : ~:: : :: ::
: -: ~ : : :
::
:~
, 093/07691 ~ PCT/US92/08610 bridge analyzes the contents of broadcast HELI~
messages to determine whether to request attachment to the broadcasting node~ Again, khe bridge attempts to attach to the node that is logically closest to the root node. After attaching to the closest node, the bridge begins broadcasting HELLO messages-to solicit ~TTACH.requests from other nodes or RF terminals.
The spread-spectrum system provides a hierarchical radio frequency network of on-line 10 ~ terminals for data entry and message transfer in a mobile environment. The network is characterized by sporadic data traffic over multiple-hop data paths consi~s~ing ;of RS485 or e~hernet wired links and single-channel direct seguenced spread spectrum links.
The network architecture is complicated by moving, hidden, and sleeping nodes. The spread spectrum system consists of the following types of devices:
Terminal controller -- A gateway which passes messaqes from a host port to the RF n~.twork; and which 20~ ~passes messages from the network to the host port.
The host port~(directly or indirectly) provides a link between~the~controller and a "host" computer to which the~ erminàls are logically~attached.
Base~station -- An;intermediate relay node which 25~;~ is ùsed to;èxtend the range of the controller node.
8ase~ station-to-controller or ~ase station-to-base station l~inks can b~e wired or wireless RF.
Terminal -- Norand RF~ hand-held terminals, print~rs~ etc. In addition, a controller device has a terminal compohent.
The~de~ices are logically or~anized as nodes in an~optimal) spanning tree,~with the controller at the root,~internal nodes in base stations or controllers ` on branches of the tree, and terminal nodes as (possibly mobile) leaves~on the;~ree. Like a sink :
WO ~3/07691 PCl`/US92/08610 : : 2 ~ 2 ~ 5 ~ tree, nodes closer to the root of the spanning tree are said to be "downstream" from nodes which are further away.~ Conversely, all nodes are "upstream"
from the root. Packets are only sent along branches of the~spanning tree. Nodes in the network use a "BACKWARD LEARNING" technique to route packets along , the b~anches of the spanning tree.
Devices~ in the spanning tree are logically categorized~as~one of the following three node types:
l)~ Root~(or root bridge) - A controller device ;"',~ which ~functions as the root bridge of the network~spanning tree. In the preferred embodimènt, the spanning tree has a single root node.~ Initially~,~ all controllers are root candidates from which a root node is selected.
This~selection may be ~based on the hopping 'distancé~ to~the host, preset priority, r~ndom select~ion,~;etc.~ ~
2)'~,Bridge~ An~internal node in the æpanning , 2~0~ ,trée~which~ is used to "bridge" terminal nodes togethe~r into~an interconnected network. The s~also consider~ed a bridg and t e term~'~",bridge"~ may be used to refer to all non-terminal;~nodes or ali non-te ~ inal nodes except 25~ the~root, depending~on~the context herein. A
E~ node~;consists~ of~a network interface functiàn~and a routing,function.
A',~te inal~ node can~ibe~view,ed as the ~software 30~ ent ~ ~that~terminates a ~ranch in the spanning tree~
i~ A~controller devicé~contains~a terminal~ node(s) and~a-bridge~node. ~The~bri~ e~;node is the root node if;the~controller~is~functioning as the root ~bridge.
3~5, A~base~stàtion contains;~a~ bridge node. A terminal WO93~07691 2 ~ PCTlUS92/08610 devic~ contains a terminal node and must have a n2twork interface function. A "bridging entity"
:~ refers to a bridge node or to the network interface function in a terminal.
The basic requirements of the system are the following. :
a) Wired or wireless node connections.
b) Network layer transparency.
c) Dynamic/automatic network routing , ~ :
con~iguratio~.
d) Terminal mobility. Terminals should be able to move:about the RF network without losing an end-to-: end connection.
e)~:: Ability to accommodate sleeping terminals.
f) Ability to locate terminals quickly.
g)~ Built-in redundancy. Lost nodes should have ~inimal: impact on the network.
h) :P~ysical link independenae. The bridging algorithm;is consistent across heterogenèous physical 20~ ~ links.~
:The~software for the spread-spectrum system is f~unctionally~layered~as follows.
Medium Acc-ss_Controll MAC) 25~ The;~;MAC~ layer :is :responsible for providing reliablê~transmission between any two nodes in the network ~ii.e:. terminal-~o-bridge). The MAC has~ a ; :channel~acoess control component and a link control component.~ & e link control component facilitates and re ~;lates~point-to-point fr~me transfers in the absence~of~ collision: dete~ction.~ The M~C channel ; : access~ control component;~;regulates access to the :: network. :Note that herein~, the MAC layer is also ; referred to~as~ the Data Link~layer.
::
, ~ :
:~;~: :
WO93/07691 PCT~US92~08610 ~.~
~5 ~3rid~ina La~rer : The bridging layer, which is also referred to herein as the network layer, has several functions as follows.
~: S1~ The bridging Iayer uses a "HELLO protocol"
to organize nodes in the network into an optimal spanning tree rooted at the root bridge. The spanning tree is used to' prevent loops in the topology.
Int~rior branches of the spanning tree are relatively : lO ~stable (i.e.:controller and relay stations do not move often). Terminals, which are leaves on the spanning : three:,~ may become unattached, and must be reattached, : frequently.~
2.:~ The bridging layer routes packets from :15terminals to the host, from the host to terminals, and from terminals to terminals along branches of the spanning~tree.
: 3~: ~ The:bridging layer pro~ides a service for storing packets for SLEEPING t,erminals. Packets which : 2~0~ ~ cannot be~delivered immediately can be savea by the bridging;~e~tity in a parent node for one or more HELL0 ~"x~ The~bridging: layer propagates lost node information~throughout the spanning tree.
25~5~ The~ bridging layer maintains the spanning tree~links~
6~ ~:The~ bridging layer distri~utes network :i~terface::addresses. ~ ~
: ' 30~; : Loaioal_Link Cont~ol_Layer A logical link control layer, also known herein as the~ Transport layer: herein, is responsible for providing~reliable transmission between any two nodes in the~network (i.e., terminal-to-base station)~ The 35data-link :: layer pro~ides a connection-oriented ~, -~093/07691 ~ ~P~ PCT/US92/08610 reliable service and a connectionless unreliable service. The reliable service detects and di~cards duplicate packets and retransmits lost pacXets. Th~
unreliable services provides a datagram facility for upper layer protoGols which provide a reliable end to-end data path. The data-link layer provides ISO layer 2 services for terminal-to-host application ~essions which run on top of an end-to-end terminal-to-host transport protocol. However, the data-~ink layer : lO provides transport ~ISO layer 4) services for sessions- ~ contained wi hin the SST netwoxk.
Hi~her Lay~rs : For terminal~to-terminal sessi~ns contained within the SST network, th~ data-link layer provides transport layer services and no additional network or transport layer is required. In this case, the M~C, bridging, and data-link layers discussed abov~ ean be : viewed as a data link layer, a nGtwork layer, and a transport layer~ respectiYely. For terminal-to-host-application sessions, higher ISO lay~rs e~ist on ~op of:the~SST data-link layer and must be implemented in the terminal and host computer, as required. This : documen~ does not define ~or restrict) those layers.
:: 25 ~ ~is ~o~ument does discuss a ~ast-connect V~TP-like ; transport ::protocol which is used for transient internal~terminal-to-terminal sesæions.
Specifically, a n~two~k layex has several functions~, as follows.
3~ 13 The network layer uses a "hello protocol" to organize:nodes in the ne~work into an optimal spannin~
tree rooted:at the controller. (A spanning tree is ~ required to prevent loops in the topology~) Interior : : branches of the spanning tree are relati~ely stable ;~ 35 (iOe., the controller and base 8tation5 do not move , :
: :
WO93/07691 PCT/US92/08610 ~
often). Terminals, which are leaves on the spanning tree, become unattached, and must be reattached frequently.
2) The ne~work layer routes messages from terminals to t~e host, from the host to terminals, and from terminals to terminals along branches of the spanning tree.
3~ The network layer provides a service for storing messagés for SLEEPING terminals. Messages s 10 which cannot be delivered immediately can be saved by the network entity in a parent node for on~ or more hello times.
41 The network layer propagates lost node information throughout the spanning tree.
~- 15 5) The network layer main ains th~ spanningtree links in the absence of regular data traffic.
: A transport layer is responsible for establishing ;: and maintaining: a reliable end-t~-end data path between~transport access points in any two nodes in 20~ the network. ~The transport layer provides unreliable, reliable ~and~ a~transaction-oriented services~ The transport~ layer should ~e immune to implementation :changes~in~the~network layer.
The~ responsibilities of the transport layer 25~ include:~the~:following.
Establishing and maintaining TCP-like connections~ for reliab}e root-to-terminal data transmission. ;
: 2~ Maintaining VMTP-like transaction records :: :
~ :30 for reliable transient message passing between any two `
nodes.:
3):~ Detecting and discarding duplicate packets.
~A~RGRO~D CSF ~B I~ ~ION
In a typical radio data communication system having on~ or more host computers ~nd multiLple RF
termin 15, communication between a host computer and an RF terminal is provided by one or more base stations. Depending upon ~he application and the operating conditions, a large number of thes~ b~se stations may be required to adequately serve the systeDl. For example, a radio data c:ommunication system in~;talled in a large factory may re~uire dozens , - :~; 10 of bc,se stations in order to co~er the entire factory î loor .
In earlier RF data commlmlca~ ion systems, the bas~ 6ta~ions were typically co~ulected dir2ctly to a : host computer through mlllti-dropped conne~tions to an ;5 Ethexnet: communic:ation line. To c:ommunicate between an ~ terminal and a host computer, in ~;uch z system, the RF terminal sends d~ta to a base station and the base ~station passes the data direc ly to the host computer. Communicating with a host c~mputer through 2 0 ~ a base station in this manner is commonly known as holpping. These earlier RF data c~mmunicatic~n systems ~; ~used a ~ingle-hop method of communication.
In ord~3r to c:over a larger area with an RF data comm~nic:atiorl ~3ystem and to take advantage of the deregulation of the spread-spectrum radio fre~encies, later-developed RF data ccDunication æy~tems are : organiæed into layers OI base sta*ions~ As in earlier :~ :
WO93/~7691PCT/US92/08610 2 ~ S 2 RF data communications systems, a typical system includes multiple base stations which communicate directly with the RF terminals and the host c~mputer.
In addition, the system al~o includes intermediate 5stations that communicate with the RF terminalsj the multiple base stations, and other inter~ediate stations. In such a system, communication from an RF
terminal to a host computer may be achieved, for example, by ha~ing the RF terminal send data to an ::~: 10intermediat~ station, the intermediate station send the data to a base station, and the base station send the data directly to the host computer. Communicating with a~host:computer through more than one station is commonly known as a multiple-hop communication system.
15Difficulties often arise in maintaining the integrity of such multiple-hop RF data communication : systems.: The system must be able to handle both wireless~ and :hard-wired station connections, ;;efficient :dynamic routing of data information, RF
20terminal mobility, and interference from many dif f erent sources .
~: : ; : ::
~093/07691 2 ~ 2 ~ PCT/US92/08610 _UNNARY OF_TH~ ~NVBN~O~
The present invention solves many of the problems inherent in a multiple-hop data communication system.
The present invention comprises an RF Local-Area Network capable of afficient and dynamic handling of : data by routing communications between the ~F
Terminals and the host computer through a network of ~ int~rmediate base~stations.
:~ ~: In one embodiment of the present invention, the RF data:communication system contains one or more host - computers~ and multipIe gateways, br~dges, and RF
terminals.: Gateways are used to pass messages to and from;a host computer and the RF Ne work. A host port is used~to provide a link between the gateway and the host computer. In addition, gateways ma~ include bridging~functions and may pass information from one RF terminal to another. Bridges are intermediate relay~nodes~which repeat data messages. Bridges can : repeat~data~; to :and: from bridges, gateways and RF
: ::terminals~and:are~ ùsed to extend the range of the gateways~
The~RF~ erminals are attached logically ~o the :host~computer~ and::use:a network formed by a gateway and~ hé~bridges:to communicate with the host computer.
2~5~ :To~ set~up~the network, an optimal configuration for conducting~;Detwork communication spa~ning~tree is : created:to:control the flow of data communication. To : aid:~ understanding by providing a more visual description, ~:this configuration is referred to hereafter~as:a "spanning tree" or "optimal spanning tree".~
Specifically, root of the ~p~nning tree are the : gateways;~ the branches are the~ bridges; and non : bridging stations, such :as RF terminals~, are the 35~ ~ leaves~of the tree. Data are~sent along the:branches :
:: :
WO93/07691 P~T/US92/0~610 h~5~v 4 of the newly cre~tsd opti~al spanning tree~ Nodes in the network use a backward learning technique to route packets along the correct branches~
~: One object of the present invPntion is to route:~ 5 data efficiently, dynamically, and without looping.
Another object of the present invention is to make the routing of the data transparent to the RF terminals.
The RF terminals, transmitting data intended for the ; ~ host computer, are unaffected by the means ultimately used by~the RF Network to deliver their data.
It~is a further object of the present invention : for the network to be capable of handling RF ~erminal mobility:and~lost nodes with minimal impact on the entire~RF~data communication system.
,~ :
: ~ :
: ~::
~: :::
W~g3/~7691 ~ 2~ 2~ P~r/US92/08610 ~R~F~DBg~RIPTTO~ OF T~ DRA!IrI~G
The FIG. 1 is a func ional bloc:k diagram of arl RF
data co~munication syst~m incorporating the RF local-area ne~work of the present invention.
.
. .
:~
~ ~ s :
:
WO 93~076g1 PCI`/USg2/08610 '~ i2 0 5 2 ~ - 6 -DBTAIL~D DE~CRIPTION OF T~ I~VgNTION
The FIG. 1 is a functional block diagram of an RF
data communication ~ystem. In one embodiment of ~he present invention, the RF data communication system S has a host computer 10, a network controller 14 and bridges 22 and 24 attached to a data communication link 16. A}so attached to the data communication li~k 16 is a gateway 20 which acts as the root node for the spanning tree of the ~F data network of the present invention. A bridge 42 is attached to the gateway 20 through a hard-wired communication link and bridges 40 : : and 4:4 are logically attached to gateway 20 by two inde`pendent:RF links. Additio~al bridges 46, 48, 50 and 52 are~also connected to the RF ~etwork and are ~:: 15 shown in the FIG. 1. Note that, al~hough shown separate :from the host computer 10, the gateway 20 the ;spsnning~ tree root node) may be part of host : : comput~r~;l0.~ ;
The~IG. 1 further shows RF terminals 100 and 102 2:0~ attached~to:bridge 22 via ~F links and RF terminal 104 attached:~to~ bridge 24 via an RF link. Also, RF
;terminals~106, 108, 110, 112, 114, 116, 118, and 120 can~ e~seen logically attached to th~ RF~ Metwork : : through~their respective RF links. The RF terminals 25~ in FIG.~ l are::representative of non-bridging stations.
In aIte~nate ~ odiments of the present invention, the Network;could contain any:type of device capable of supporting~the~functions needed to c~mmuni~ate in the ; ; RF~ Network such as hard-wired :terminals, re~ote printers,~stationary bar code scanners, or the liXe.
The RF:data:communication~system, as sh~wn in FIG. 1, représénts~the configuration~of the fiystem at a discrete moment in time after~;:the~ initialization of : the cystem.~The RF links,:as shown, are dynamic and subject to change. For example, changes in the :
-::
~;:: : :
- ~w~ 93/076912 ~ 2 ~ ~ ?~ a PCT/US92/08610 s~ruature of th~ RF data communication system can be caused by movement of the RF t~rminals and by interfer~nce that affects the RF ~ommunication links.
In the preferred embodiment, the host computer 10 5is an~IBM 3090, the network controller 14 is a model ; : RC3250 of the Norand Corporation, the data ; ~ ~com~unication link 16 is an Ethernet link, the :~ nodes 20, 22, 24, 40, 42, 44, 46, 48, 50 and 52 are ntel}igent base transceiver uni~s of the type RB4000 10of the Norand Corporation, and the RF terminals 100, 102, 104, 106, 108, 110, 112, 114, 116, 118 and 120 are of type:RT1100 of the Norand Corporation~
The~optimal spanning tree, which provides the data~pathways throughout the communication system, is 15stored and~maintained by the network as a whole. Each node~in the:~network stores and modifies information : which specif~ies how local communication tr~ffic should : flow~ Optimal spanning trees assure efficient, adaptive~;(dynamic)::routing o~ infoxmation without 20 ~ ooping.~
::To~initialize the RF data communication system, ; the:~gateway z0 and the other nodes are organized into an;optimal~spanning tree rooted at the gateway 20. To : form~ the~::optimal spanning tree, in the preferred 25~embodiment~ the gateway 20 is assigned a status of ATTAC~ED and all other bridges are assigned the status :: U~ATTACHED~ he gateway 20 is considered attached to the~:spanning tree because~ it is the root node.
Initially,~all other bridges are unattached and lack : 30a parent in ths ~panning tree. At ~his point, the : : ::attache~gateway nod~ 20 periodically broadcasts a speciic~type of pollinq:packet referred to hereafter as "HELLO packetsl'. m~: NELLO packets can be broadcast~:using known methods of communicating via ; 35radio frequency (RF) link:or ~ia a direct wire link.
::
:~
:
WOg3/076gl PCr/US92/08610 ,~;., In the preferred embodiment of the present invention, the RF li~k is comprised of spr~ad spectrum 2 ~ 2 transmissions using a polling protocol. Although a polling protocol is preferred, a carrier-sense S multiple-access (CSMA), busy-tone, or any other protocol might also manage the communication traffic on the RF link.
HELL0 packets contain 1) the address of the sender, 2) the hopping distance that the sender is from the root, 3) a source addreæs, 4) a count of nodes in the subtree which flow through that bridge, : and 5) a list of system parameters. Each node in the network is~assigned a unique network service address and a node-type identifier to distinguish between ~:: 15 different nodes and different node types. The : : distan~e of~ a node from the root node is measured in hops times the bandwidth of each hop. The gateway root is considered to be zero hops away from itself.
~:; : The unattach~d bridges are in a LISTEN state.
;~ 20 ~Durin~the~LISTEN state, a br~dge will listen to the HELLO~messages that are broadcast. By listening to ~. , , the HELLO;messages~, bridges can learn which nodes are attached~to the sp~nning treeO The unattached bridges analyze~ the contents of the HELL0 messages to 25~ ~determine~ whether to requ~t attachment to the broadcasting node. In the preferred embodiment, a bridgè atte~pts tG attach to the node that is logically~closest to the root node. In khe preferred emboaim~nt~, the logical distance i~ based upon the ; . 30 numbex o~ hops needed to reach the root node and the bandwidth:of those hops. The distance the attached node is~away from the root node is found in the second : field of the HELL0 message that is broadcast.
, In~another embodiment of the present invention, the bridges consider the nu~ber of nodes attached to ~ .5~ h ~ .~3 2`û
~r `~O 93/07691 PCT/US92/08610 _ g _ the attached node as well as the logical distanc~ of the at~ached node from the root node. If an attached node is ~verloaded with other attached nodes, the unattached bridge may request attachment to a less : 5 loaded node.
After attaching to an attached node, th- newly : attached bridge~ (the child) must determine it5 distance from the root node. ~o arrive at the distance of the child from the root node, the child adds the broadcast distance o~ its paxent from the root node to the distance of the child from its parent. :In the:preferred embodiment, the distance of a child from its:parent is based on the ~andwidth o~
the data~ communication link. For example, if the child:attache~s to its parent via a hard-wired link (data :rate~26,000 baud), then the distance of that communication li~ might e~ual, for example, one hop.
However,~if the child attaches to its parent via an RF
link ~data rate:960U baud~:, then the distance of that 20~ :co~munication li~k might correspondingly be equal 3 : hops~. The n a r of the hop corresponds directly to the co., unication speed of the link. This may not only~take~:into consideration baud rate, but also æuch factors;as~channel interference.
25~ Initia~lly, only the root gateway node 20 is broad~asting: HELLO: messages and only nodes 40, 42 and 44~:~are ~within range of the ~ELL0 messages broadcast :`by :the gateway. ~herefore, after the liste~ing~period has expired, nodes 40, 42 and 44 3~ request attachment to the gateway node 20. The unattached~;nodes 40, 42, and 44 send A ~ CH.request packets~and the:at ached gateway node 20 acknowledges the ATTACH~.request packets with l~cal ATTACHOconfirm packets.~ The newly attached~bridges are assiyned the ~:: 35 ~ sta~us ATTACHED and begin broadcasting th~ir own HELL0 , ~
:
: ~:
WO93/076gl PCT/US92~08610 ~
. ~ .
2 ~2 C ~ackets, looking for o~her unattached bridges. Again, ~ ~ ~the remaining unattached nodes attempt to attach to the attached nodes that are logically closest to th~
root node. For example, node 48 i~ within range of HELLO messages from both nodes 40 and 42. However, node 40 is three hops, via an RF link, away fr~m ~he : gateway root node 20 and node 42 is only one hop, via a hard-wired link, away from the gateway root node 20.
Therefore, node 48 attaches to node 42, the closest node:to the gateway root node 20.
:The ~ending o~ HELLO messages, ATTACH.request packets and AT~ACH.confirm packets aontinues until the entire sp~anning:tree is established. In addition, attached bridges may also respond to HELLO messages.
If a HELLO message indicates that a much closer route ; ~ to the root node is available, the attached bridge ; : sends :a DETACH packet to its old parent and an ATTACH~.request packet to the closer node. To avoid instabi-lity:in the system and to avoid overloading any given node, an~attached bridge would only respond to a HELLO message if the hop count in a HELLO packet is greater~ than a certain threshold value, ;CHANGE_~RES~OLD~. In the preferred e~bodiment, the value ;of the CHANGE_THRESHOLD equals 3. In this :25 ;~anner,~an~optimal spanning tree is formed that is capable of~ transmitting data without looping.
Nodes,~ other than the gateway root node, after acknowledging ~an ATTA~H.re~ est packet from a :;previously ~ unattarhad node, will send the ~TTACH.request packet up the branche of the spanning tree to the gateway root node. As the A~TACH.request packet is~being sent to the gateway root node, other nodes:~attached on the ~s~ame branch record the destinat:ion of the newly attached node in their routing:entry table.~ When the ATTACH.request packet ~ :
:
~W~93~07691 ~ 2 ~ PC~/US92/~8610 reaches the gateway root node, the gateway root node returns an end-to-end A~TACH. conf irm packet .
After the spanning tree is initialized, th~ RF
terminals listen for periodically broadcasted Hello packets to dstermine which attached nodes are in range. After recei~ring HELL0 messages from attached nodes t an RF terminal responding to an appropriate poll sends an ATTACH. request packet to a~ttach to the node logical~y closest to the rootO For example, RF
terminal 110 is physically closer to node 44.
~Iowever, node 44 is three hops, ~ria an RF link, away ~Erom the gateway root node 20 and node 42 is only one hop, ~ria a hard-wired link, away from the gateway root node 20. Therefore, RF terminal 110, after hearing HELL0 messages from both nod~s 42 and 44, attaches to node 42, the cIosest node tQ the gateway root node 20.
~: Similarly, ~ terminal 114 hears ~IELL0 messages fromnod~s ~8 and 50. Nodes 48 and 50 are both four hops away from~ ~e gateway roc~t node 20. ~lowever, nod~ 48 has ~wo RF terminals 110 and 112 already attached to it while node 50 has only one RF terminal 116 attached to it~ :m erefore, ~F terminal 114 will ~ttach to node 50, the least busy node of equal distance to the :: gateway root node 20.
: 25 The attached node acknowledges the ATTACH.request : and sends the ~TTACH.re~ue~t pack t to the gateway root node. Then, the gateway root node returns an :
: end-~o-end AT~ACH.confirm packet4 In ~his manner, the end-to-end ~TTACH.raquest Xunctions as a discovery packet enabling the gateway root node, and all other nodes ~long the same branch, to learn the addre~s of . ~ tha RF terminal quickly. This proc~ss is called backward learning. Nodes learn the addresses of terminals by monitoring the traf~ic from terminals to the root. If a packet ~rrives from a terminal that is WO93/07691 PCT/US92/08610 ~.
~Z~20 not con~ained in the routing table of the node, an entry is made in the routing table. The entry includes the terminal address and the address of the node that sent the packet. In addition, an entry timer is set for that terminal. The entry timer is used to determine when RF terminals are actively using the attached node. Nodes maintain entries only for terminals that are actively using the node for communication. If the entry timer expires due to lack of communication, the RF terminal entry is purged from the routing table.
;~ ~; The RF links among the RF terminals, the bridges, and the gateway are oft n lost. Therefore, a connection-oriented data-link service is used to maintain the logical node-to-node links. In the absence of network traffic, periodic messages are sent and received:~to ensure th~ stability of the RF link.
As a result, the loss of a link is quickly detected and the RF Network can attempt to establish a new RF
link before~data transmission ~rom the host computer to an RF termi~aI is advers~ly affected.
; Communication between terminals and the host : compu~er; is~accomplished by using the resulting RF
Network.~To;com~unicate with the host computer, an RF
~ terminal sends a data packet in response to a poll from :the ~bridge closest to the host computer.
Typically,~:the RF terminal is attached~.to the bridge : ¢loses: to;~the host computer. However, RF termina}s : :zre ~ constantly listening for HELL0 ~nd polling i: ~ 30 messages from other bridges and may attach to, and then co~municate with, a bridgP in the table of bridges t~at i~s~closer to the particular RF terminal.
, ~
nder certain operating conditions, duplicate data packets can bs transmitted in the RF Network.
-~WO93/07591 ~ PCT/US92/08610 For example, it is possi~le for an RF terminal to transmit a data packet to its attached node, for the node to transmit the acknowledgement frame, and ~or the RF terminal not to receive the acknowledgement.
Under such circumstances, the RF terminal will retransmit the data. If the duplicate data packet is updated into ~he database of the host computer, the database would become corrupt. Therefore, the RF
Network of the present invention detects duplicate data packets. ~o ensure data integrity, each set of data transmissions receives a sequence number. The sequence numbers are continuously increme~ted, and duplicate sequence numbers are not accepted.
When a~ bridge receives a data packet ~rom a terminal directed to the host computer, the bridge ~ forwards the data packet to the parent node on the :: branch~ The parent node then forwards the data packet :~ to it ! parent node. The forwarding of the data packet continues until ~he gateway root node rereives the data packet and sends it to the hGSt co~puter.
; Similarlyl when a packet arrives at a node ~rom the host compu~er directed to an RF terminal, the node checks lts routing entry table and forwards the data ~: packet to its child nodP which is along the branch destined:~for the RF terminal. It i~ not necessary for th~ nodes along the branch co~taining the RF terminal to ~now the ultimate location of the RF terminal. The ~orwarding of the data packet continues until the data pa~ket reaches the final node on the branc~, which then forwards the data packet directly to the terminal itsel~.
Communication is a~so po ~ible between RF
; termi~als. To communicate with ano~her RF terminal, the RF ~erminai sends a data packet to its attached bridge. When the bridge recei~es the data pack~t from W093/~769t PCT/USg~/0~610 2 a terminal direated to the host computer, the bridge checks to see if the destination address o~ the RF
terminal is located within its ruuting table. If it is, the bridge simply sends the message to ~he S intended RF terminal. If not, the bridge forwards the data packet to its parent node. The forwarding of the data packet up the branch continue~ until a common parent between the RF terminals is found. Then, the common parent (often the gateway node it~elf) sends the data packet to the intended RF terminal via the branches of the RF Network.
During the normal operation of the RF N~twork, RF
terminals can become los~ or unattached to their attached node.;;If an RF terminal becomes unattached, for whatever reason, its routing entry i5 purged and the RF terminal listens for HELL0 or polling messages from any attached nodes in range. After recei~ing HELLO~or~pol~ling message~ from attached nodes, the RF
terminal~sends an ATTACN.request packet to the attached node`closest to the root. That attached node acknowledges~ the~ A~TACH~re ~ est and sends the ; A~ ACH~.request ~packet onto the gateway root node.
Then, ~the gatewa~ root node returns an end-to-end ATTA~H.confirm packet~
25~ Bridges~an also become Iost or unattached during normal~ operations of the RF Ne~work. I~ a bridge becomes~ lost or unattached, all routing entries contalning the bridge are purged. The ~ridge~ then broadcasts~;a HELLO.request with a global bridge ;30 destina~ion address. Attached nodes will broadcast HELLO packets~ immediately if they receive an ~TTA~H.xequest packet with a global d~stination address.~ miS helps the lost node re-attach. Then, the bridge~ enters the LISTEN state to learn which attached nodes are within range. The unattached : ~:: : :: ::
: -: ~ : : :
::
:~
, 093/07691 ~ PCT/US92/08610 bridge analyzes the contents of broadcast HELI~
messages to determine whether to request attachment to the broadcasting node~ Again, khe bridge attempts to attach to the node that is logically closest to the root node. After attaching to the closest node, the bridge begins broadcasting HELLO messages-to solicit ~TTACH.requests from other nodes or RF terminals.
The spread-spectrum system provides a hierarchical radio frequency network of on-line 10 ~ terminals for data entry and message transfer in a mobile environment. The network is characterized by sporadic data traffic over multiple-hop data paths consi~s~ing ;of RS485 or e~hernet wired links and single-channel direct seguenced spread spectrum links.
The network architecture is complicated by moving, hidden, and sleeping nodes. The spread spectrum system consists of the following types of devices:
Terminal controller -- A gateway which passes messaqes from a host port to the RF n~.twork; and which 20~ ~passes messages from the network to the host port.
The host port~(directly or indirectly) provides a link between~the~controller and a "host" computer to which the~ erminàls are logically~attached.
Base~station -- An;intermediate relay node which 25~;~ is ùsed to;èxtend the range of the controller node.
8ase~ station-to-controller or ~ase station-to-base station l~inks can b~e wired or wireless RF.
Terminal -- Norand RF~ hand-held terminals, print~rs~ etc. In addition, a controller device has a terminal compohent.
The~de~ices are logically or~anized as nodes in an~optimal) spanning tree,~with the controller at the root,~internal nodes in base stations or controllers ` on branches of the tree, and terminal nodes as (possibly mobile) leaves~on the;~ree. Like a sink :
WO ~3/07691 PCl`/US92/08610 : : 2 ~ 2 ~ 5 ~ tree, nodes closer to the root of the spanning tree are said to be "downstream" from nodes which are further away.~ Conversely, all nodes are "upstream"
from the root. Packets are only sent along branches of the~spanning tree. Nodes in the network use a "BACKWARD LEARNING" technique to route packets along , the b~anches of the spanning tree.
Devices~ in the spanning tree are logically categorized~as~one of the following three node types:
l)~ Root~(or root bridge) - A controller device ;"',~ which ~functions as the root bridge of the network~spanning tree. In the preferred embodimènt, the spanning tree has a single root node.~ Initially~,~ all controllers are root candidates from which a root node is selected.
This~selection may be ~based on the hopping 'distancé~ to~the host, preset priority, r~ndom select~ion,~;etc.~ ~
2)'~,Bridge~ An~internal node in the æpanning , 2~0~ ,trée~which~ is used to "bridge" terminal nodes togethe~r into~an interconnected network. The s~also consider~ed a bridg and t e term~'~",bridge"~ may be used to refer to all non-terminal;~nodes or ali non-te ~ inal nodes except 25~ the~root, depending~on~the context herein. A
E~ node~;consists~ of~a network interface functiàn~and a routing,function.
A',~te inal~ node can~ibe~view,ed as the ~software 30~ ent ~ ~that~terminates a ~ranch in the spanning tree~
i~ A~controller devicé~contains~a terminal~ node(s) and~a-bridge~node. ~The~bri~ e~;node is the root node if;the~controller~is~functioning as the root ~bridge.
3~5, A~base~stàtion contains;~a~ bridge node. A terminal WO93~07691 2 ~ PCTlUS92/08610 devic~ contains a terminal node and must have a n2twork interface function. A "bridging entity"
:~ refers to a bridge node or to the network interface function in a terminal.
The basic requirements of the system are the following. :
a) Wired or wireless node connections.
b) Network layer transparency.
c) Dynamic/automatic network routing , ~ :
con~iguratio~.
d) Terminal mobility. Terminals should be able to move:about the RF network without losing an end-to-: end connection.
e)~:: Ability to accommodate sleeping terminals.
f) Ability to locate terminals quickly.
g)~ Built-in redundancy. Lost nodes should have ~inimal: impact on the network.
h) :P~ysical link independenae. The bridging algorithm;is consistent across heterogenèous physical 20~ ~ links.~
:The~software for the spread-spectrum system is f~unctionally~layered~as follows.
Medium Acc-ss_Controll MAC) 25~ The;~;MAC~ layer :is :responsible for providing reliablê~transmission between any two nodes in the network ~ii.e:. terminal-~o-bridge). The MAC has~ a ; :channel~acoess control component and a link control component.~ & e link control component facilitates and re ~;lates~point-to-point fr~me transfers in the absence~of~ collision: dete~ction.~ The M~C channel ; : access~ control component;~;regulates access to the :: network. :Note that herein~, the MAC layer is also ; referred to~as~ the Data Link~layer.
::
, ~ :
:~;~: :
WO93/07691 PCT~US92~08610 ~.~
~5 ~3rid~ina La~rer : The bridging layer, which is also referred to herein as the network layer, has several functions as follows.
~: S1~ The bridging Iayer uses a "HELLO protocol"
to organize nodes in the network into an optimal spanning tree rooted at the root bridge. The spanning tree is used to' prevent loops in the topology.
Int~rior branches of the spanning tree are relatively : lO ~stable (i.e.:controller and relay stations do not move often). Terminals, which are leaves on the spanning : three:,~ may become unattached, and must be reattached, : frequently.~
2.:~ The bridging layer routes packets from :15terminals to the host, from the host to terminals, and from terminals to terminals along branches of the spanning~tree.
: 3~: ~ The:bridging layer pro~ides a service for storing packets for SLEEPING t,erminals. Packets which : 2~0~ ~ cannot be~delivered immediately can be savea by the bridging;~e~tity in a parent node for one or more HELL0 ~"x~ The~bridging: layer propagates lost node information~throughout the spanning tree.
25~5~ The~ bridging layer maintains the spanning tree~links~
6~ ~:The~ bridging layer distri~utes network :i~terface::addresses. ~ ~
: ' 30~; : Loaioal_Link Cont~ol_Layer A logical link control layer, also known herein as the~ Transport layer: herein, is responsible for providing~reliable transmission between any two nodes in the~network (i.e., terminal-to-base station)~ The 35data-link :: layer pro~ides a connection-oriented ~, -~093/07691 ~ ~P~ PCT/US92/08610 reliable service and a connectionless unreliable service. The reliable service detects and di~cards duplicate packets and retransmits lost pacXets. Th~
unreliable services provides a datagram facility for upper layer protoGols which provide a reliable end to-end data path. The data-link layer provides ISO layer 2 services for terminal-to-host application ~essions which run on top of an end-to-end terminal-to-host transport protocol. However, the data-~ink layer : lO provides transport ~ISO layer 4) services for sessions- ~ contained wi hin the SST netwoxk.
Hi~her Lay~rs : For terminal~to-terminal sessi~ns contained within the SST network, th~ data-link layer provides transport layer services and no additional network or transport layer is required. In this case, the M~C, bridging, and data-link layers discussed abov~ ean be : viewed as a data link layer, a nGtwork layer, and a transport layer~ respectiYely. For terminal-to-host-application sessions, higher ISO lay~rs e~ist on ~op of:the~SST data-link layer and must be implemented in the terminal and host computer, as required. This : documen~ does not define ~or restrict) those layers.
:: 25 ~ ~is ~o~ument does discuss a ~ast-connect V~TP-like ; transport ::protocol which is used for transient internal~terminal-to-terminal sesæions.
Specifically, a n~two~k layex has several functions~, as follows.
3~ 13 The network layer uses a "hello protocol" to organize:nodes in the ne~work into an optimal spannin~
tree rooted:at the controller. (A spanning tree is ~ required to prevent loops in the topology~) Interior : : branches of the spanning tree are relati~ely stable ;~ 35 (iOe., the controller and base 8tation5 do not move , :
: :
WO93/07691 PCT/US92/08610 ~
often). Terminals, which are leaves on the spanning tree, become unattached, and must be reattached frequently.
2) The ne~work layer routes messages from terminals to t~e host, from the host to terminals, and from terminals to terminals along branches of the spanning tree.
3~ The network layer provides a service for storing messagés for SLEEPING terminals. Messages s 10 which cannot be delivered immediately can be saved by the network entity in a parent node for on~ or more hello times.
41 The network layer propagates lost node information throughout the spanning tree.
~- 15 5) The network layer main ains th~ spanningtree links in the absence of regular data traffic.
: A transport layer is responsible for establishing ;: and maintaining: a reliable end-t~-end data path between~transport access points in any two nodes in 20~ the network. ~The transport layer provides unreliable, reliable ~and~ a~transaction-oriented services~ The transport~ layer should ~e immune to implementation :changes~in~the~network layer.
The~ responsibilities of the transport layer 25~ include:~the~:following.
Establishing and maintaining TCP-like connections~ for reliab}e root-to-terminal data transmission. ;
: 2~ Maintaining VMTP-like transaction records :: :
~ :30 for reliable transient message passing between any two `
nodes.:
3):~ Detecting and discarding duplicate packets.
4)~ Retransmitting lost packets.
Layers:l through 4 are self-contained within the Norand~ RF;-:network, and are independent of the host W093tO7691 ~ 2 0 PCT/US92/08610 computer and of texminal applications. The session layer ( and any higher layers) are dependent on speci~ic applications. Therefore, the session protocol (and higher protocols~ must be implemented as S required. Note that a single transport access point i~ sufficient to handle single sessions with multiple ~: nodes. Multiple aoncurrent sessions between any two nodes could be handled with a session identifier in a ~::: session header.
:: 10 Network address requirements are as follows. DLC
framed contain a hop destination and source address in :
the DLC header. network packets contaîn an end-to-end destination and~ a s~urce address in the network header. Transport messages do not contain an address ~: 15 field; instead, a transport connection is defined bynetwork layer~ source and destination address pairs.
~ultiple txansport conne~tions require multiple network address:pairs.
: me transport header contains a TRANSPORT ~CCESS
:~ POINT identifier. DLC and network addresses are : consistent~and have the same for~at. Each node has a : unique LONG~ ~ RESS which is programmed into the node at~ the~ factoxy. ~The long address is used only to vbtain~:~a~SHOR~ ADDRESS from~the root node.
25: ~ ~The~:network entity in each node obtains a S~O~T
ADDRESS~from the root node, whiah identi~ies the no~e uniquely.~The~network e~tity passes the short address to the~DLC~entity. Short addresses are used to minimize~packet~:sizes.
~ Short addresses consist of the following. There :: : is: an:address length bit (short or long).
a~spanning tree identified.
a node-type identifier. Node ~ypes are well know~
~: ~
~ 35 a unique multi cast or~broadcast node identifier.
:.
:~ ~
~093/076g1 PCT/US92/08610 The node-ident~fier parts of root addresses are a~ 3 well known and are constant. A default spanning tree identifier is well known ~y all nodes. A non-default spanning tree identifier can be entered into the root nodQ (i.e., by a network adminis~rator) and advertised to all other nodes in "hello" packets~ The list of non-default spanning trees to which other nodes can attach must be entered into each node.
A node-type identifier of all 1's is used to ~; 10 specify aIl node types. A node identifier of all l's is used to specify all nodes of the specified type.
A DLC~identifier of all 0's is used to specify a DLC
en~ity which~does not yet have an address. The all-O's address is used in~ DLC frames that are used to send and receive network ADDRESS packets. (The network~entity~ in each node filters ADDRESS packets based on the network address.) ` Short-address allocation is accomplished as follows.~ Short node identifiers o~ root nodes are 20~ ~ well kno ~ . ~All other nodes~ must obtain a short node identifier from the root. To obtain a short address, a~node~send an ADDRESS request packet to the root node. The~source~addresse~ (i.e., DLC and network) in the request packet are LONG ADDRESSES. The root 25~ ~ maintains~an~address queue of used and unused SHORT
; aDDRESSES. ~If possible, the root selects an available short~address, associates the short address with the long~address~of the requesting node, and returns the shor~ ~address~ to the~ requestin~ node in an ADDRESS
~, 30 acknowledge packet. SNote that the destination address in the acknowledge packet~is a long address.) A~ node must obtain~;a;; (new) short address initially~and whenever an ADDR~SS-TIMEOUT inactivity period expires without having the nQde receive- a ; 35 pacXet from the network entity in the root.
:
:
~WO93/076912 ~ 2 ~ PCT/USg2/08610 .
The network entity in the root maintains : addresses in the addre~s queue in least recently used order. Whenever a packet is received, the source address is moved to the end of the queue. The address Sat the head~ of the queue is available for use by a requesting node if it has never been used or if it has ~ been inactive for a MAX-ADDRESS-LIFE time period.
:: MAX-ADDRESS-LIFE must be larger than ADDRESS-TIMEOUT to ensure that an address is not in use by any lOnode when it~becomes available for another node. If the root:receives an ADDRESS request from a source for which an;entry exists in the address queue, the root simply~updates:~the:queue and returns the old address.
: The network layer organizes nodes into an optimal lSspanning tree with::the controllsr at the root of the .tree. ~(Note that the spanning three identifier allows two logiaal~trees to exist in theisam~ coverage area.~
;Spanning tree organization is facilitated with a HELL0 protocol~which all~ws nodes to:deitermine the shortest 20~path~to~the~ root be~ore attaching to the spanni~g tree.~: All messages~are routed along branches of the spanning ~ tree . ~
Nodes~in~;the network are generally categorized as ATTAC!~ED or~;:llN~lqACHED. Initially, only the root node 25~is attached~.~ A single controller may be designated as the ;root,~ or ~multiple:: root: candi~ates~ (i.e.
controllers)~ may~negotiate~to determine which node is : ;the~:root.: ~:~Attached bridge nodes and root candidates transmit ~nHELLO~ packets at calculated intervals. The 30HELLO:p~ckets include:
a)~ the~ source; address, which includes the spanning~:tree;ID)~
:b)~a broadcast destination address.
c)~: ~a~ Nseed" ~alue from which the time sche~ule : 35of future hello messages can be calculated.
: :
WO93/07691 PCT/US92/08610 ~
~ 5~ - 24 -d) a hello slot displacement time specifylng an actual variation that will occur in the scheduled arrival o~ the very next hello message (the scheduled arrival being calculated from ~e ~seed").
e~ the distancs (i.e., path cost) of the transmitter from the host. ~he incremental portion of the distance be~ween a node and its parent is primarily a function of the type of physical link (i.e., ethernet, RS485, RF, or the like). If a 0 signal-strength indicator is available, connections are biased toward the link with the best signal strength. The distance component is intended to bias path selection toward (i.P., wired) high-~peed connections. Setting a minimum signal str~ngth threshold helps prevent sporadic changes in the : networX. In addition, connections can be biased to bal~nce the load (iOe., the number of children) on a : parent node~
f~ a p~nding message list. Pending ~essage li~ts consist o~ 0 or more destination address/message-length pairs. Pendin~ messages for terminals are stored in the terminal'~ parent node.
: ~ g) a detached-node list. Detached-node list~
contain the addresses of nodes which have detached 25: f~om the:spanning tree. The root maintains two lists.
A private list consists of all detached node : addresses, and an advertised list con~ists of the ~:; addresses of all detached node~ which have p~nding : tra~sport messages. The ~ddresses in the hello packet ~, 30 are equivalent to the ~d~erti~ed list~
An internal node learns which entrie~ ~hould be : in its li~t from hello messages transmitted by its parent node. The root node bui}ds its detachednode lists from information received in DET~C~ packets.
WO93/07691~ PCT/US92/08610 Entries are included in hello message for DETACH-MSG-LIFE hello times.
Attached notes broadcast "SHORT ~.ELLO" messages immediately if they receive an "HELLO.request" packet 5with a global destination address; otherwise, attached nodes will only broadcast hello messages at calculated time intervals in "hello slots." Short hello messagPs do not contain a pending-messag~ or detached-node : list. Short hello messages are sent independently of :~ 10regular hello messages and do not affect regular hello : timing.
:Unattached nodes (nodes without a parent in the spanning:;tree) are, initially, in an "UNATTACHED
LISTEN" state.~During the listen s ate, a node learns ~: 15which attached base station/controller is closest to :the root;~node:by listening to hello messages. After the listening period expires an unattached node sends : an ATTACH.request packet to the attached node closest to :the~ root.~ The attached node immediately :~: acknowledges~ the ATTACH.req~est, and send the ATTACH.~request packet onto the root (controller) node.
The root~node~returns the re ~ est as an end-to-end : A~TACH.conf;irm~:packet. If the newly-attached node is a;~base~:station,~the node calculates its link distance 25and adds:the:distance to the distance of its parent : beforè:~beginning;to transmit hello messages~
; The`end-to-end ~TTA~H.request ~unctions as a disco~very pa~ket, and enables the root node to learn `the:address of the sou~ce node quickly. The end-to-30~end ATTACH. request, when sent from a node to the root, does not always tra~el the entire distance.
:: When a downstream node receives an ATT~CH.request pàcket ~nd;~already has a correct:routing entry for the :associated:~node, the downstrea~ node intercepts the 35request and~returns the ATTACH.confirm to the source : ~ :
~::: ~ :
WO 93/07691 P~/US92/08610 ,, ~, node. (Note that any data piggy-backed on the 'Z~ A~rTACH. request packet must still be forwarded ~o the host.) This situation occurs whenever a "new" path has more than one node in common with the "old" path.
The LISTEN state ends after MIN HELLO hello time slots if hello messages have been received from at le~st one node. If no hello messages have been received the listening node waits and retries later.
An attached node may respond to a hello message ~ ~ ~ 10 from a node other than its parent (i.e., with an : ~ ATTACH. request) if the difference in the hop count specified in the hello packet exceeds a CHANGE-THRES~OLD level.
:: ` : : `: : : : :
Unattached ~nodes may broadcast a GLOBAL
ATTACH.request ~with a multi-cast base station destination address to solicit short hello messages from attached base~stations. The net effect is that the LISTEN~state may (optionally) be shortened. (Note that only~attached base station or the controller may 2~0 respond~to~ATTACH. requests.) Normally, this facility is~ reserved~for base stations with children and terminals~with ~ransactions in progress.
ATTACH.~requests contain a (possibly empty) CHILD
LISTt;to~ènable~internal~nodes to update th~ir routing 25 ~ tables. ATTACH.requests~also contain a "count" field which indica~tes that a terminal may be SLEEPING. The network~entity in the parent of a SLEEPING terminal con temporarily store messages for later d~livery. If the count field is non-zero, the network entity in a parent node will store pending messages unt~l 1) the message~is ~elivered, or 2) "count" hello times have expired.
Transport layer data can ~e piggy-backed on an attached reguest packet~from a terminal. (i.e., an ~: :
~ :
~ ~ :
:
: : :
~WO g3/07691 2 ~ 2 Q PCT/VS~2/08610 attach request/confirm can be implemented with a bit flag in the network header of a data packet~) Network layer routing~
All messages are routed along branches of the spanning tree. Base stations "learn" the address of terminals by~monitoring tra~fic from terminals (i.e., to the root). When a base station receives (i.e., an ATTACH.reguest) packet, destined for the root, the base station creates or updates an entry in its routing table for the terminal. The entry includes ; the terminal~address, and the address of the base station which sent the packet (i.e., the hop address).
When a base~station receives an upstream packet (i.e., from the root, destined for a terminal) the packet is simply~forwarded to the base station which is in the routing entry for the destination. Upstream messages (i.e.,;~to a~te ~ inal~) are discarded whenever a routing entry do~s~not exist. Downstream mes ages (i.e., from 20 ~ a~terminal to the root) are simply forwarded to the next~downstrea~ node (i.e., the parent in the branch ,of the sp~nning tree.
TEKMINAL--TO-TERMINAL~ ~OMNUNICATIONS is accomplished,~by routing all terminal-to-terminal 25~ tra~ffic~through the nearest~com~on~ancestor. In the ; worst~case~ the~root is the nearest common ancestor.
A ~ADDRESS~SERVER" facilitates terminal-to-terminal com~unicatio,ns (see below~
DELETING INVALID ROUTING T~BLE EN~RIES is accomplished in several ways: connection oriented - tranæport layer ensures that packets will arrive from nodes~ atta~hed to the branch of th spanniny tree within~ the~timeout period, unless a node is disconnected.)~
:
::: : ~ : : :
:
W093f07691 PCT/US92/08610 ~,~
..
2 ¦ 2 3 ~ 2 ~ ~, Wh~never th~ DLC entity in ~ pare~t fails RETRY MAX times to send a message to a child node, the node is logically disconnected from the spanning tre~, with one exception. If the child is a SLEEPING
terminal, the message is retained by the network entity in the parent for "count" hello times. The parent immediately attempts to deliveir the message after it sends its next hello packet. If, after : "count" hello~times, the message cannot be delivered, then the child is logically detached from the spanning : tree. : Detached :node information is propagated downstream to the root nc~e, each nod~ in the path of the DETACH~::packet must adjust its routing tables appropriately according to the following rules: a) if the lost node~ is a child terminal node, the routing : entry for~the terminal is deleted and a DETACH pa~ket is~generàted, b) if the node sp~cified in DETACH
: packet is~a~terminal and the node which delivered the packet~is the:~next hop in the path to the t~rminal, ; 2~0~ then:the ~routing table entry for the terminal is deleted:~and~the DE~ACH packet is forwarded, c) if the lost;:~ node~is~ child base station node then all routing~entries~ which~specify that base s ation as the next hop~are~deleted and a DETAC~ packet is generated 25~ for~:each~lost terminal.
IN~;~;GENERAL,~:WHEMEVER A~NODE DISCO~ERS THAT A
TER~INAL I:S~DETACH D, IT PURGES;ITS ROUTING ~ TRY FOR
THE;~TERMINAL.~;:WHENEVER A NODE DISCOVERS THAT A BASE
STATIQN:IS~:DETACH D, IT PURGES ALL:RO~TING ENTRIES
;: 30 CONTAINING ~THE IBASE STATION~ ONLY ENTRIES FOR
: UPSTREAM NODES ARE DELETED.
When~DETACH~:packets:reach~the root node, they are :: : added to a:~"detached list." Nodes remain in the root node's detached list until a)~ the node reattaches to ; 35 the spanning~tree, or b) the list entry times out.
; ~
~093/076912 ~ 2 ~ S ~ ~ PCT/US92/08610 The detached list is included in hello messages and is propagated throuqhout the spanning tree.
For example, if a te~minal detaches and reattaches to a different branch in the ~panning tre~, all downstream nodes in the new branch (quickly) n learn" the new path to the terminal. Nodes which were a~so in the old path change their routing tables and no longer foxward packets along the old pathO At least one node, the root, must be in both the old and lOn~w path. A new path is established as soon as an en~-to-en~ attach request packet from the terminal reaches a node which was also in the old path.
~ 4) A node (quickly) learn~ that it is detached : whenever~it receives a hello message, from any node, lSwith it~ address in the associated detached list. The detached node can, optionally, send a global TTACH.request, and then ~nters the UNATTACHED LISTEN
state and reattaches as d~scribed above. After :~ :
reattaching,~the node must remain in a HO~D-DOWN state ~: : 20until:its:address is aged out of all detaGhed lists.
During the~HOLD-DOWN state the node ig~ores detached lists.
Layers:l through 4 are self-contained within the Norand~ RF;-:network, and are independent of the host W093tO7691 ~ 2 0 PCT/US92/08610 computer and of texminal applications. The session layer ( and any higher layers) are dependent on speci~ic applications. Therefore, the session protocol (and higher protocols~ must be implemented as S required. Note that a single transport access point i~ sufficient to handle single sessions with multiple ~: nodes. Multiple aoncurrent sessions between any two nodes could be handled with a session identifier in a ~::: session header.
:: 10 Network address requirements are as follows. DLC
framed contain a hop destination and source address in :
the DLC header. network packets contaîn an end-to-end destination and~ a s~urce address in the network header. Transport messages do not contain an address ~: 15 field; instead, a transport connection is defined bynetwork layer~ source and destination address pairs.
~ultiple txansport conne~tions require multiple network address:pairs.
: me transport header contains a TRANSPORT ~CCESS
:~ POINT identifier. DLC and network addresses are : consistent~and have the same for~at. Each node has a : unique LONG~ ~ RESS which is programmed into the node at~ the~ factoxy. ~The long address is used only to vbtain~:~a~SHOR~ ADDRESS from~the root node.
25: ~ ~The~:network entity in each node obtains a S~O~T
ADDRESS~from the root node, whiah identi~ies the no~e uniquely.~The~network e~tity passes the short address to the~DLC~entity. Short addresses are used to minimize~packet~:sizes.
~ Short addresses consist of the following. There :: : is: an:address length bit (short or long).
a~spanning tree identified.
a node-type identifier. Node ~ypes are well know~
~: ~
~ 35 a unique multi cast or~broadcast node identifier.
:.
:~ ~
~093/076g1 PCT/US92/08610 The node-ident~fier parts of root addresses are a~ 3 well known and are constant. A default spanning tree identifier is well known ~y all nodes. A non-default spanning tree identifier can be entered into the root nodQ (i.e., by a network adminis~rator) and advertised to all other nodes in "hello" packets~ The list of non-default spanning trees to which other nodes can attach must be entered into each node.
A node-type identifier of all 1's is used to ~; 10 specify aIl node types. A node identifier of all l's is used to specify all nodes of the specified type.
A DLC~identifier of all 0's is used to specify a DLC
en~ity which~does not yet have an address. The all-O's address is used in~ DLC frames that are used to send and receive network ADDRESS packets. (The network~entity~ in each node filters ADDRESS packets based on the network address.) ` Short-address allocation is accomplished as follows.~ Short node identifiers o~ root nodes are 20~ ~ well kno ~ . ~All other nodes~ must obtain a short node identifier from the root. To obtain a short address, a~node~send an ADDRESS request packet to the root node. The~source~addresse~ (i.e., DLC and network) in the request packet are LONG ADDRESSES. The root 25~ ~ maintains~an~address queue of used and unused SHORT
; aDDRESSES. ~If possible, the root selects an available short~address, associates the short address with the long~address~of the requesting node, and returns the shor~ ~address~ to the~ requestin~ node in an ADDRESS
~, 30 acknowledge packet. SNote that the destination address in the acknowledge packet~is a long address.) A~ node must obtain~;a;; (new) short address initially~and whenever an ADDR~SS-TIMEOUT inactivity period expires without having the nQde receive- a ; 35 pacXet from the network entity in the root.
:
:
~WO93/076912 ~ 2 ~ PCT/USg2/08610 .
The network entity in the root maintains : addresses in the addre~s queue in least recently used order. Whenever a packet is received, the source address is moved to the end of the queue. The address Sat the head~ of the queue is available for use by a requesting node if it has never been used or if it has ~ been inactive for a MAX-ADDRESS-LIFE time period.
:: MAX-ADDRESS-LIFE must be larger than ADDRESS-TIMEOUT to ensure that an address is not in use by any lOnode when it~becomes available for another node. If the root:receives an ADDRESS request from a source for which an;entry exists in the address queue, the root simply~updates:~the:queue and returns the old address.
: The network layer organizes nodes into an optimal lSspanning tree with::the controllsr at the root of the .tree. ~(Note that the spanning three identifier allows two logiaal~trees to exist in theisam~ coverage area.~
;Spanning tree organization is facilitated with a HELL0 protocol~which all~ws nodes to:deitermine the shortest 20~path~to~the~ root be~ore attaching to the spanni~g tree.~: All messages~are routed along branches of the spanning ~ tree . ~
Nodes~in~;the network are generally categorized as ATTAC!~ED or~;:llN~lqACHED. Initially, only the root node 25~is attached~.~ A single controller may be designated as the ;root,~ or ~multiple:: root: candi~ates~ (i.e.
controllers)~ may~negotiate~to determine which node is : ;the~:root.: ~:~Attached bridge nodes and root candidates transmit ~nHELLO~ packets at calculated intervals. The 30HELLO:p~ckets include:
a)~ the~ source; address, which includes the spanning~:tree;ID)~
:b)~a broadcast destination address.
c)~: ~a~ Nseed" ~alue from which the time sche~ule : 35of future hello messages can be calculated.
: :
WO93/07691 PCT/US92/08610 ~
~ 5~ - 24 -d) a hello slot displacement time specifylng an actual variation that will occur in the scheduled arrival o~ the very next hello message (the scheduled arrival being calculated from ~e ~seed").
e~ the distancs (i.e., path cost) of the transmitter from the host. ~he incremental portion of the distance be~ween a node and its parent is primarily a function of the type of physical link (i.e., ethernet, RS485, RF, or the like). If a 0 signal-strength indicator is available, connections are biased toward the link with the best signal strength. The distance component is intended to bias path selection toward (i.P., wired) high-~peed connections. Setting a minimum signal str~ngth threshold helps prevent sporadic changes in the : networX. In addition, connections can be biased to bal~nce the load (iOe., the number of children) on a : parent node~
f~ a p~nding message list. Pending ~essage li~ts consist o~ 0 or more destination address/message-length pairs. Pendin~ messages for terminals are stored in the terminal'~ parent node.
: ~ g) a detached-node list. Detached-node list~
contain the addresses of nodes which have detached 25: f~om the:spanning tree. The root maintains two lists.
A private list consists of all detached node : addresses, and an advertised list con~ists of the ~:; addresses of all detached node~ which have p~nding : tra~sport messages. The ~ddresses in the hello packet ~, 30 are equivalent to the ~d~erti~ed list~
An internal node learns which entrie~ ~hould be : in its li~t from hello messages transmitted by its parent node. The root node bui}ds its detachednode lists from information received in DET~C~ packets.
WO93/07691~ PCT/US92/08610 Entries are included in hello message for DETACH-MSG-LIFE hello times.
Attached notes broadcast "SHORT ~.ELLO" messages immediately if they receive an "HELLO.request" packet 5with a global destination address; otherwise, attached nodes will only broadcast hello messages at calculated time intervals in "hello slots." Short hello messagPs do not contain a pending-messag~ or detached-node : list. Short hello messages are sent independently of :~ 10regular hello messages and do not affect regular hello : timing.
:Unattached nodes (nodes without a parent in the spanning:;tree) are, initially, in an "UNATTACHED
LISTEN" state.~During the listen s ate, a node learns ~: 15which attached base station/controller is closest to :the root;~node:by listening to hello messages. After the listening period expires an unattached node sends : an ATTACH.request packet to the attached node closest to :the~ root.~ The attached node immediately :~: acknowledges~ the ATTACH.req~est, and send the ATTACH.~request packet onto the root (controller) node.
The root~node~returns the re ~ est as an end-to-end : A~TACH.conf;irm~:packet. If the newly-attached node is a;~base~:station,~the node calculates its link distance 25and adds:the:distance to the distance of its parent : beforè:~beginning;to transmit hello messages~
; The`end-to-end ~TTA~H.request ~unctions as a disco~very pa~ket, and enables the root node to learn `the:address of the sou~ce node quickly. The end-to-30~end ATTACH. request, when sent from a node to the root, does not always tra~el the entire distance.
:: When a downstream node receives an ATT~CH.request pàcket ~nd;~already has a correct:routing entry for the :associated:~node, the downstrea~ node intercepts the 35request and~returns the ATTACH.confirm to the source : ~ :
~::: ~ :
WO 93/07691 P~/US92/08610 ,, ~, node. (Note that any data piggy-backed on the 'Z~ A~rTACH. request packet must still be forwarded ~o the host.) This situation occurs whenever a "new" path has more than one node in common with the "old" path.
The LISTEN state ends after MIN HELLO hello time slots if hello messages have been received from at le~st one node. If no hello messages have been received the listening node waits and retries later.
An attached node may respond to a hello message ~ ~ ~ 10 from a node other than its parent (i.e., with an : ~ ATTACH. request) if the difference in the hop count specified in the hello packet exceeds a CHANGE-THRES~OLD level.
:: ` : : `: : : : :
Unattached ~nodes may broadcast a GLOBAL
ATTACH.request ~with a multi-cast base station destination address to solicit short hello messages from attached base~stations. The net effect is that the LISTEN~state may (optionally) be shortened. (Note that only~attached base station or the controller may 2~0 respond~to~ATTACH. requests.) Normally, this facility is~ reserved~for base stations with children and terminals~with ~ransactions in progress.
ATTACH.~requests contain a (possibly empty) CHILD
LISTt;to~ènable~internal~nodes to update th~ir routing 25 ~ tables. ATTACH.requests~also contain a "count" field which indica~tes that a terminal may be SLEEPING. The network~entity in the parent of a SLEEPING terminal con temporarily store messages for later d~livery. If the count field is non-zero, the network entity in a parent node will store pending messages unt~l 1) the message~is ~elivered, or 2) "count" hello times have expired.
Transport layer data can ~e piggy-backed on an attached reguest packet~from a terminal. (i.e., an ~: :
~ :
~ ~ :
:
: : :
~WO g3/07691 2 ~ 2 Q PCT/VS~2/08610 attach request/confirm can be implemented with a bit flag in the network header of a data packet~) Network layer routing~
All messages are routed along branches of the spanning tree. Base stations "learn" the address of terminals by~monitoring tra~fic from terminals (i.e., to the root). When a base station receives (i.e., an ATTACH.reguest) packet, destined for the root, the base station creates or updates an entry in its routing table for the terminal. The entry includes ; the terminal~address, and the address of the base station which sent the packet (i.e., the hop address).
When a base~station receives an upstream packet (i.e., from the root, destined for a terminal) the packet is simply~forwarded to the base station which is in the routing entry for the destination. Upstream messages (i.e.,;~to a~te ~ inal~) are discarded whenever a routing entry do~s~not exist. Downstream mes ages (i.e., from 20 ~ a~terminal to the root) are simply forwarded to the next~downstrea~ node (i.e., the parent in the branch ,of the sp~nning tree.
TEKMINAL--TO-TERMINAL~ ~OMNUNICATIONS is accomplished,~by routing all terminal-to-terminal 25~ tra~ffic~through the nearest~com~on~ancestor. In the ; worst~case~ the~root is the nearest common ancestor.
A ~ADDRESS~SERVER" facilitates terminal-to-terminal com~unicatio,ns (see below~
DELETING INVALID ROUTING T~BLE EN~RIES is accomplished in several ways: connection oriented - tranæport layer ensures that packets will arrive from nodes~ atta~hed to the branch of th spanniny tree within~ the~timeout period, unless a node is disconnected.)~
:
::: : ~ : : :
:
W093f07691 PCT/US92/08610 ~,~
..
2 ¦ 2 3 ~ 2 ~ ~, Wh~never th~ DLC entity in ~ pare~t fails RETRY MAX times to send a message to a child node, the node is logically disconnected from the spanning tre~, with one exception. If the child is a SLEEPING
terminal, the message is retained by the network entity in the parent for "count" hello times. The parent immediately attempts to deliveir the message after it sends its next hello packet. If, after : "count" hello~times, the message cannot be delivered, then the child is logically detached from the spanning : tree. : Detached :node information is propagated downstream to the root nc~e, each nod~ in the path of the DETACH~::packet must adjust its routing tables appropriately according to the following rules: a) if the lost node~ is a child terminal node, the routing : entry for~the terminal is deleted and a DETACH pa~ket is~generàted, b) if the node sp~cified in DETACH
: packet is~a~terminal and the node which delivered the packet~is the:~next hop in the path to the t~rminal, ; 2~0~ then:the ~routing table entry for the terminal is deleted:~and~the DE~ACH packet is forwarded, c) if the lost;:~ node~is~ child base station node then all routing~entries~ which~specify that base s ation as the next hop~are~deleted and a DETAC~ packet is generated 25~ for~:each~lost terminal.
IN~;~;GENERAL,~:WHEMEVER A~NODE DISCO~ERS THAT A
TER~INAL I:S~DETACH D, IT PURGES;ITS ROUTING ~ TRY FOR
THE;~TERMINAL.~;:WHENEVER A NODE DISCOVERS THAT A BASE
STATIQN:IS~:DETACH D, IT PURGES ALL:RO~TING ENTRIES
;: 30 CONTAINING ~THE IBASE STATION~ ONLY ENTRIES FOR
: UPSTREAM NODES ARE DELETED.
When~DETACH~:packets:reach~the root node, they are :: : added to a:~"detached list." Nodes remain in the root node's detached list until a)~ the node reattaches to ; 35 the spanning~tree, or b) the list entry times out.
; ~
~093/076912 ~ 2 ~ S ~ ~ PCT/US92/08610 The detached list is included in hello messages and is propagated throuqhout the spanning tree.
For example, if a te~minal detaches and reattaches to a different branch in the ~panning tre~, all downstream nodes in the new branch (quickly) n learn" the new path to the terminal. Nodes which were a~so in the old path change their routing tables and no longer foxward packets along the old pathO At least one node, the root, must be in both the old and lOn~w path. A new path is established as soon as an en~-to-en~ attach request packet from the terminal reaches a node which was also in the old path.
~ 4) A node (quickly) learn~ that it is detached : whenever~it receives a hello message, from any node, lSwith it~ address in the associated detached list. The detached node can, optionally, send a global TTACH.request, and then ~nters the UNATTACHED LISTEN
state and reattaches as d~scribed above. After :~ :
reattaching,~the node must remain in a HO~D-DOWN state ~: : 20until:its:address is aged out of all detaGhed lists.
During the~HOLD-DOWN state the node ig~ores detached lists.
5) : A node becomes disconnected and enters the UN~TT~CHED LIS~EN state whenever HELLO-RETRY-MAX hello ~ messages ;a~e~miss~ed from it~ parent node.
6) ~A ~node enters the ATTACHED LISTEN state : whene~er a ingle hello message, from its parent, i5 :," ~:
~ missed. SL~EPING terminals remain awake during the : : :
TACHED LISTEN state. The state ends when the ; 30terminal receives a data or hello m~ssage from its .
parent. The terminal becomes UNATT~CHE~ when a~ its address appears in the det~hed list of a hello ~ message from an ode o~her ~han its parent, or b) : ~HELLQ-RETRY-NAX h~llo messages are missed. The total ~093t07691 PCT/US92/08610 ~
-- ~0 --number of hello slots spend in the ~ISTEN state is co~stant.
If a node in the ATTACHED LISTEN ~tate discovers a path to the root which is CHANGE-T~RESHOLD shorter, it can a~tach to the shorter path~ Periodically, SLEEPING terminals must enter the ATTACHED L ~ state :~ to discovery any changes (i.eO, shorter paths) in the network topology.
~ Hello synchronization.
A11 attached non-terminal nodes broadcast periodic "hello" messages in discrete "hello slots" at ; calculated;intervals. Base station nodes learn which hell:o 8~10ts :are busy and refrain from transmitting lS during busy hello slots.
; A terminal refrains from transmitting during the .
hello slot :of its parent node and refrains from transmitting during message slots xeserved in a hello message.~
20~ The~;hello~message contains a "seed" field used in :a well-known~:randomization algorithm to determine the next he1:1O~:s1Ot for the transmitting node and the next geed~. The address o f the transmitting node is used as a~:factor~ in:~the algorithm to ~arantee randomization.
25 ~ Nodès can~execute~the a1gorithm i times to determine : the~ time~;~ (and~ seed) if the~ i-the hello message from the~transmitter. ~ :
After attached, a base station chooses a random initia1~seed~and a non-busy hello s~lot and broadcasts 3 0 a hello message in that slot . The base station : chooses~ ~succeeding hello lots by executing the randomization~:algorithm. If an execution of the algoritlun~ ~chooses a busy slot, the next free slot is used and~ a ~hello "displacement" f i~ld indicates the 3S offset fro~a calculated slot. Cumulative delays are :: . : ~ . :
~ W093/07~91 PCT/US92/08~10 ` ' 2~2~ ~2~
not allowed (i.P., contention delays during ~he i hello transmission do not effect th~ tim~ of ~he i+1 hello transmission).
HELLO-TI~E and HELLO-SLO~-TIME values are set by the root node and flooded throughout the network in hello messages. The HELL0-SLOT-TïME value must be large enough to minimize hello contention.
A node initially synchronizes on a hello message ~rom its parent. A SLEEPING node can power-down with an active timer interrupt to ~aks it just before the n xt expected hello message. The network entity in ba~e station nodes can tore mes~ages for SLEEPIN~
nod~s and transmit them immediately following the he lo messages. This implementation enables SLEEP~NG
terminals to receive unsolicited messages. (Note that : the network layer always tries to deliver mes~ages : immediately, before storing them.) Retries ~or pending messages are tran mitted in a round-robin order when messages are pending ~or more than one destination~
: Note that a child node that misses i h~llo messages, can calculate the time of the i+~ hello mes~age.
~ ~ .
;25~ : Transport~:~1ayer theory and implementation notss.
: The~ ; transport layer provides reliable, unrel~iable,~and transactionoriented services. Two types~:o~ transport:connection~ are de~ined: 1~ a TCP-e~transport connection ~ay be explîcitly requested ~,~ : 30 for long-lived connectionæ or 2) a ~MTP-like connee ion-reeord may ~e implieitly ~et up for transient;eonnections. In addition, a eonnectionless serviee is provided for nodes whieh s~ppDrt an endoto-end transpvre eonnection with the host eomputer.
WO93/076glPCT/US9~/08610 ~
~, r ~ aThe interfaces to the next upper (i.e., - 2;~ 3~application) layer include:
CONNECT (access Point, node name~
LISTEN (access_point) SUNITDATA (access point, node name, bu~fer, length) SEND (handle, buffer, length) RECEIVE (handle, buffer, length) : CLOSE (handle) 10The~"handle" designates the connection type, and is the connection identifier:for TCP-like connections.
SEND messages require a response from the network node:~(root:~or; terminal) to which the message is :: directed.~
lSUNITDATA messages do not re~uire a response.
UNIT~ATA is:;used to~send messages to a host which is capab1e~:of supporting end-to-end host-to-terminal transport connections.
Because~the~network layer provides an unreliable 2~0ser~iGe~ the~;transport layer is required to detect dupli ate~packets and retransmit lost packets.
Detecting~ ~ licates is fa ilitated by numbering transport packets with una~biguous sequence numbers.
5~ Transport connections.
TCP-like:~transport connections are used for message~transmission over long-lived connections~ The connections~may:be terminal-to-root or terminal-to-terminàl~(i.;e.,~:base 5tation5 are not involved in the transport connection).
TCP-1;ike transport Gonnections are established ;:using~a~3-way handshake. Each end selects its initial sequence~ nunber and ~acknowledges the other end's : initial :sequence number during the handshake. The 35 :node whiah~;initiates the connection must wait a MAX-: ~ :
:; : :
:, `
~~93/07691 ~ PCT/US92/08610 .
PACKET-LIFE time, before requesting a connection, to guarantee that initial sequence numbers are unambiguous. S~uence numbers are incremen~ed modulo MAX-SEQ, where NAX-SEQ is large enough to insure that duplicate sequence numbers do not exist in the network. Packet types for establishing and breaking connections are defined as in TCP.
A TC~-like connection is full-duplex and a sliding window is used to allow multiple outstanding transport packets. An ARQ bit in the transport header is used to require an immediate acknowledgment from the opposite end.
VMTP-like connections are u~ed for transient messages (i.e. terminal-to-terminal m~il messages).
VMTP-like connection records are built automatically.
A VMTP~ e :connection recsrd is built (or updated) whenever a ~ P-like transport mescage is received.
The advantage is~ ~hat an explicit connection re~uest is not reguired. The disadvantage is that longer and :20 more carefully se~ected se~uence number~ are required.
A V~P-like connection is half-duplex. (~ full-dup~ex connQction at a~ higher layer can be built with two independent half-duplex VMTP-like connections.) Acknowledgments mu t be handled by highe~ layers.
:
25:: Transport connections are defined by the network end-to-end~destination and sourc~ addresses.
A NAX rP LIFE timeout is assoaiated with transport connections. Transport connection records are purged after a MAX TP LIFE time ~xpires without activity on the connection. Th~ transport entity in ~~ a ter~inal can ensure that its transport connec~ion :~ will not be lost by transmitting an empty time-fill transport packet whenever TP_TIMEOUT time expires withou~ activity.
WO93/07691 PCr/US92/08610 ~à ~ U 3 4 The transport entity in a node stores ~essages for possible retransmission. Note that retransmissions may not always follow the same path (primarily) due to moving terminals and the resulting changes in ~the spanning tree. For examplej the network entity in a parent node may disconneGt a child after the DL~ entity reports a message deli~ery failure. The child will soon disco~er that it is detached~and will reattach to the spanning tree. Now when the transport entity (i.e. in the root) re-sends the message,~it will follow the new path.
Transpo~t message timing and sleeping terminals.
The transport entity in a terminal calculates a separate timeout for SEND and TRANSACTION operations.
Initially,~both timeouts are a $unction of the distance of ~he terminal from the root node.
A TCP-like algorithm is used to estimate the expected propagation delay for each message type.
2;0 Messages,~which require a response, are retransmitted if twice the expected propagation time expires be~ore a respQnss is received. SLEEPING terminals can power down for ~a~ large percentage of the expected propagation~delay before waking up to receive the 25~ response ~message. Note that missed messages may be stored~by~the~network layer for "count~' hello times.
;Medium Access;Control (N~C) ~heory and implementation notes.
~Access to the ne~work communications channel is ~egulated in~several ways: executing the full CSMA
algorit~ ~(see MAC layer~ above). The sender retransmits unacknowledged~messages until a R~TRY MAX
~ ~ , ~ count îs exhausted.
:
:
: :: `
,~WO93/07691 ~.. l ? ~ ` .; PCT/US92/08610 The retry time of the DLC must be relatively short so that lost nodes can be detected quickly.
When the DLC layer reports a failure to deliver a message to the network layer, the network layer can l) save messages for SLEEPING terminals for later attempts, or 2) DETACH the node from ~he spanning tree. Note that most lost nodes are due to moving : terminal The node identifier part of the DLC address is : ~ lO initially all O's for all nodes except the root node.
The all~O's address is used by a node to send and : received data-link frames until a unique node identifier~is`~passed to the DLC entity in the node.
~The unique:node identifier is obtained by the network entity.) Address resolution.
Well-known` names too are bound to network addresses in~several ways:
: ~ ~- The;n~twork address and TRANSPORT ACC~SS
' : ID of~a name~:server, contained in the root, is : well-known b~ all nodes.
A node can register a well-known name with`;the name server contained in the root node.
5~ A node can request the network access address~of another applîcation from the name server~by using the~ well-known name of the ; application.~
` : : : ` :
Possible extensions.
Base~station-to-base station traffic could also be routed~ through th~ controller if the backward : learning~algorithm included b~se station nodes. ~Each ~ : base station~: would simply have to rememb~r which : ~:
WO ~3tO7S91 PCT/US92/08~10 ~
. , ~ 20 - 36 -direction on its branch of the spanning tree to send data directed toward another base station.) The possibility of multiple controllers is kept open by including a spanning-tree identifier in address field~. Each controller d~fines a unique spanning tree. A node can be in more than one spanning tree, with separate network state variables defined for each.
~: 10 Thus, the preferred embodiment of the pre~ent invention describes an apparatus and a method of : ef~iciently routing data through a network of : intermediate base stations in a radio data ; communication system.
In alternate embodiments of the present ~: ~ invention,~the RF Networks contain multiple gateways.
By including a system identifier in the address field : of the nodes, it is possible to determine which nodes are~connected to which networks.
: 20 As :is ::evident from the description that is provided ~above, the implementation of the present invention ~ can vdry~ greatly depending upon the desired goal of the:~user~ However, the scope of the present invention:~is intended to cover a~l variations and ~ subst~itut~ions:which are and which may become apparent ; from~the ~ lustrative embodiment of the present invention that is provided above, and the scope of the ; invention should be extended to the claimed inve~tion and its equivalents.
:
: -:
~ missed. SL~EPING terminals remain awake during the : : :
TACHED LISTEN state. The state ends when the ; 30terminal receives a data or hello m~ssage from its .
parent. The terminal becomes UNATT~CHE~ when a~ its address appears in the det~hed list of a hello ~ message from an ode o~her ~han its parent, or b) : ~HELLQ-RETRY-NAX h~llo messages are missed. The total ~093t07691 PCT/US92/08610 ~
-- ~0 --number of hello slots spend in the ~ISTEN state is co~stant.
If a node in the ATTACHED LISTEN ~tate discovers a path to the root which is CHANGE-T~RESHOLD shorter, it can a~tach to the shorter path~ Periodically, SLEEPING terminals must enter the ATTACHED L ~ state :~ to discovery any changes (i.eO, shorter paths) in the network topology.
~ Hello synchronization.
A11 attached non-terminal nodes broadcast periodic "hello" messages in discrete "hello slots" at ; calculated;intervals. Base station nodes learn which hell:o 8~10ts :are busy and refrain from transmitting lS during busy hello slots.
; A terminal refrains from transmitting during the .
hello slot :of its parent node and refrains from transmitting during message slots xeserved in a hello message.~
20~ The~;hello~message contains a "seed" field used in :a well-known~:randomization algorithm to determine the next he1:1O~:s1Ot for the transmitting node and the next geed~. The address o f the transmitting node is used as a~:factor~ in:~the algorithm to ~arantee randomization.
25 ~ Nodès can~execute~the a1gorithm i times to determine : the~ time~;~ (and~ seed) if the~ i-the hello message from the~transmitter. ~ :
After attached, a base station chooses a random initia1~seed~and a non-busy hello s~lot and broadcasts 3 0 a hello message in that slot . The base station : chooses~ ~succeeding hello lots by executing the randomization~:algorithm. If an execution of the algoritlun~ ~chooses a busy slot, the next free slot is used and~ a ~hello "displacement" f i~ld indicates the 3S offset fro~a calculated slot. Cumulative delays are :: . : ~ . :
~ W093/07~91 PCT/US92/08~10 ` ' 2~2~ ~2~
not allowed (i.P., contention delays during ~he i hello transmission do not effect th~ tim~ of ~he i+1 hello transmission).
HELLO-TI~E and HELLO-SLO~-TIME values are set by the root node and flooded throughout the network in hello messages. The HELL0-SLOT-TïME value must be large enough to minimize hello contention.
A node initially synchronizes on a hello message ~rom its parent. A SLEEPING node can power-down with an active timer interrupt to ~aks it just before the n xt expected hello message. The network entity in ba~e station nodes can tore mes~ages for SLEEPIN~
nod~s and transmit them immediately following the he lo messages. This implementation enables SLEEP~NG
terminals to receive unsolicited messages. (Note that : the network layer always tries to deliver mes~ages : immediately, before storing them.) Retries ~or pending messages are tran mitted in a round-robin order when messages are pending ~or more than one destination~
: Note that a child node that misses i h~llo messages, can calculate the time of the i+~ hello mes~age.
~ ~ .
;25~ : Transport~:~1ayer theory and implementation notss.
: The~ ; transport layer provides reliable, unrel~iable,~and transactionoriented services. Two types~:o~ transport:connection~ are de~ined: 1~ a TCP-e~transport connection ~ay be explîcitly requested ~,~ : 30 for long-lived connectionæ or 2) a ~MTP-like connee ion-reeord may ~e implieitly ~et up for transient;eonnections. In addition, a eonnectionless serviee is provided for nodes whieh s~ppDrt an endoto-end transpvre eonnection with the host eomputer.
WO93/076glPCT/US9~/08610 ~
~, r ~ aThe interfaces to the next upper (i.e., - 2;~ 3~application) layer include:
CONNECT (access Point, node name~
LISTEN (access_point) SUNITDATA (access point, node name, bu~fer, length) SEND (handle, buffer, length) RECEIVE (handle, buffer, length) : CLOSE (handle) 10The~"handle" designates the connection type, and is the connection identifier:for TCP-like connections.
SEND messages require a response from the network node:~(root:~or; terminal) to which the message is :: directed.~
lSUNITDATA messages do not re~uire a response.
UNIT~ATA is:;used to~send messages to a host which is capab1e~:of supporting end-to-end host-to-terminal transport connections.
Because~the~network layer provides an unreliable 2~0ser~iGe~ the~;transport layer is required to detect dupli ate~packets and retransmit lost packets.
Detecting~ ~ licates is fa ilitated by numbering transport packets with una~biguous sequence numbers.
5~ Transport connections.
TCP-like:~transport connections are used for message~transmission over long-lived connections~ The connections~may:be terminal-to-root or terminal-to-terminàl~(i.;e.,~:base 5tation5 are not involved in the transport connection).
TCP-1;ike transport Gonnections are established ;:using~a~3-way handshake. Each end selects its initial sequence~ nunber and ~acknowledges the other end's : initial :sequence number during the handshake. The 35 :node whiah~;initiates the connection must wait a MAX-: ~ :
:; : :
:, `
~~93/07691 ~ PCT/US92/08610 .
PACKET-LIFE time, before requesting a connection, to guarantee that initial sequence numbers are unambiguous. S~uence numbers are incremen~ed modulo MAX-SEQ, where NAX-SEQ is large enough to insure that duplicate sequence numbers do not exist in the network. Packet types for establishing and breaking connections are defined as in TCP.
A TC~-like connection is full-duplex and a sliding window is used to allow multiple outstanding transport packets. An ARQ bit in the transport header is used to require an immediate acknowledgment from the opposite end.
VMTP-like connections are u~ed for transient messages (i.e. terminal-to-terminal m~il messages).
VMTP-like connection records are built automatically.
A VMTP~ e :connection recsrd is built (or updated) whenever a ~ P-like transport mescage is received.
The advantage is~ ~hat an explicit connection re~uest is not reguired. The disadvantage is that longer and :20 more carefully se~ected se~uence number~ are required.
A V~P-like connection is half-duplex. (~ full-dup~ex connQction at a~ higher layer can be built with two independent half-duplex VMTP-like connections.) Acknowledgments mu t be handled by highe~ layers.
:
25:: Transport connections are defined by the network end-to-end~destination and sourc~ addresses.
A NAX rP LIFE timeout is assoaiated with transport connections. Transport connection records are purged after a MAX TP LIFE time ~xpires without activity on the connection. Th~ transport entity in ~~ a ter~inal can ensure that its transport connec~ion :~ will not be lost by transmitting an empty time-fill transport packet whenever TP_TIMEOUT time expires withou~ activity.
WO93/07691 PCr/US92/08610 ~à ~ U 3 4 The transport entity in a node stores ~essages for possible retransmission. Note that retransmissions may not always follow the same path (primarily) due to moving terminals and the resulting changes in ~the spanning tree. For examplej the network entity in a parent node may disconneGt a child after the DL~ entity reports a message deli~ery failure. The child will soon disco~er that it is detached~and will reattach to the spanning tree. Now when the transport entity (i.e. in the root) re-sends the message,~it will follow the new path.
Transpo~t message timing and sleeping terminals.
The transport entity in a terminal calculates a separate timeout for SEND and TRANSACTION operations.
Initially,~both timeouts are a $unction of the distance of ~he terminal from the root node.
A TCP-like algorithm is used to estimate the expected propagation delay for each message type.
2;0 Messages,~which require a response, are retransmitted if twice the expected propagation time expires be~ore a respQnss is received. SLEEPING terminals can power down for ~a~ large percentage of the expected propagation~delay before waking up to receive the 25~ response ~message. Note that missed messages may be stored~by~the~network layer for "count~' hello times.
;Medium Access;Control (N~C) ~heory and implementation notes.
~Access to the ne~work communications channel is ~egulated in~several ways: executing the full CSMA
algorit~ ~(see MAC layer~ above). The sender retransmits unacknowledged~messages until a R~TRY MAX
~ ~ , ~ count îs exhausted.
:
:
: :: `
,~WO93/07691 ~.. l ? ~ ` .; PCT/US92/08610 The retry time of the DLC must be relatively short so that lost nodes can be detected quickly.
When the DLC layer reports a failure to deliver a message to the network layer, the network layer can l) save messages for SLEEPING terminals for later attempts, or 2) DETACH the node from ~he spanning tree. Note that most lost nodes are due to moving : terminal The node identifier part of the DLC address is : ~ lO initially all O's for all nodes except the root node.
The all~O's address is used by a node to send and : received data-link frames until a unique node identifier~is`~passed to the DLC entity in the node.
~The unique:node identifier is obtained by the network entity.) Address resolution.
Well-known` names too are bound to network addresses in~several ways:
: ~ ~- The;n~twork address and TRANSPORT ACC~SS
' : ID of~a name~:server, contained in the root, is : well-known b~ all nodes.
A node can register a well-known name with`;the name server contained in the root node.
5~ A node can request the network access address~of another applîcation from the name server~by using the~ well-known name of the ; application.~
` : : : ` :
Possible extensions.
Base~station-to-base station traffic could also be routed~ through th~ controller if the backward : learning~algorithm included b~se station nodes. ~Each ~ : base station~: would simply have to rememb~r which : ~:
WO ~3tO7S91 PCT/US92/08~10 ~
. , ~ 20 - 36 -direction on its branch of the spanning tree to send data directed toward another base station.) The possibility of multiple controllers is kept open by including a spanning-tree identifier in address field~. Each controller d~fines a unique spanning tree. A node can be in more than one spanning tree, with separate network state variables defined for each.
~: 10 Thus, the preferred embodiment of the pre~ent invention describes an apparatus and a method of : ef~iciently routing data through a network of : intermediate base stations in a radio data ; communication system.
In alternate embodiments of the present ~: ~ invention,~the RF Networks contain multiple gateways.
By including a system identifier in the address field : of the nodes, it is possible to determine which nodes are~connected to which networks.
: 20 As :is ::evident from the description that is provided ~above, the implementation of the present invention ~ can vdry~ greatly depending upon the desired goal of the:~user~ However, the scope of the present invention:~is intended to cover a~l variations and ~ subst~itut~ions:which are and which may become apparent ; from~the ~ lustrative embodiment of the present invention that is provided above, and the scope of the ; invention should be extended to the claimed inve~tion and its equivalents.
:
: -:
Claims (10)
1. A multi-hop data communication network having RF capability comprising:
a host computer node;
a plurality of terminal nodes; and a plurality of bridging nodes which dynamically create and revise communication pathways between any two nodes in the network, each of the bridging nodes independently storing and maintaining local information that specifies how communication traffic should flow through that bridging node, and the plurality of bridging nodes, together, providing a complete specification for the communication pathways in the multi-hop communication network.
a host computer node;
a plurality of terminal nodes; and a plurality of bridging nodes which dynamically create and revise communication pathways between any two nodes in the network, each of the bridging nodes independently storing and maintaining local information that specifies how communication traffic should flow through that bridging node, and the plurality of bridging nodes, together, providing a complete specification for the communication pathways in the multi-hop communication network.
2. A multi-hop data communication system comprising:
a root node;
a plurality of terminal nodes;
a plurality of bridging nodes which dynamically arrange communication pathways between the root node and the other nodes in the network; and said nodes using a backward learning technique to independently create and maintain locally stored information to specify how communication traffic should flow through that bridging node.
a root node;
a plurality of terminal nodes;
a plurality of bridging nodes which dynamically arrange communication pathways between the root node and the other nodes in the network; and said nodes using a backward learning technique to independently create and maintain locally stored information to specify how communication traffic should flow through that bridging node.
3. A data communication system providing communication pathways between comprising:
a plurality of terminal nodes; and a plurality of bridging nodes dynamically interconnecting the terminal nodes to provide communication pathways between the terminal nodes, each of the bridging nodes independently storing and updating local information that specifies the communication pathways through that bridging node.
a plurality of terminal nodes; and a plurality of bridging nodes dynamically interconnecting the terminal nodes to provide communication pathways between the terminal nodes, each of the bridging nodes independently storing and updating local information that specifies the communication pathways through that bridging node.
4. A multi-hop data communication system providing communication pathways comprising:
a first communication node;
a second communication node from which it is desired to initiate communication with the first communication node;
a plurality of intermediate communication nodes; and the communication nodes dynamically arranging communication pathways to provide minimum number of hops between the first and second nodes without overloading any one intermediate node.
a first communication node;
a second communication node from which it is desired to initiate communication with the first communication node;
a plurality of intermediate communication nodes; and the communication nodes dynamically arranging communication pathways to provide minimum number of hops between the first and second nodes without overloading any one intermediate node.
5. A multi-hop data communication system providing communication pathways comprising:
a first and a second communication node between which communication is desired;
a plurality of intermediate communication nodes;
said communication nodes using backward learning techniques dynamically interconnecting the first and second communication nodes to provide a communication pathway with the lowest number of hops possible without overloading any one intermediate communication node; and said communication nodes maintaining current information specifying how communication traffic should flow therethrough.
a first and a second communication node between which communication is desired;
a plurality of intermediate communication nodes;
said communication nodes using backward learning techniques dynamically interconnecting the first and second communication nodes to provide a communication pathway with the lowest number of hops possible without overloading any one intermediate communication node; and said communication nodes maintaining current information specifying how communication traffic should flow therethrough.
6. In a multi-hop data communication system having a computer node and a plurality of communication nodes, a method for providing communication among the nodes comprising the steps of:
(a) establishing a communication link between the computer node and one of the plurality of communication nodes;
(b) indicating from the communication node which has been linked to those of the remaining, unlinked communication nodes that a communication link has been established;
(c) establishing a communication link between the unlinked communication nodes which receive the indication and the linked communication node;
(d) repeating steps (b) and (c) for each communication node which has established a communication link until all of the plurality of communication nodes have been linked; and (e) requesting, by any of the communication nodes which become unlinked, a communication link and branching to step (b).
(a) establishing a communication link between the computer node and one of the plurality of communication nodes;
(b) indicating from the communication node which has been linked to those of the remaining, unlinked communication nodes that a communication link has been established;
(c) establishing a communication link between the unlinked communication nodes which receive the indication and the linked communication node;
(d) repeating steps (b) and (c) for each communication node which has established a communication link until all of the plurality of communication nodes have been linked; and (e) requesting, by any of the communication nodes which become unlinked, a communication link and branching to step (b).
7. In a multi-hop data communication system having a first and second communication node and a plurality of intermediate communication nodes, a method for providing communication pathways among the communication nodes comprising the steps of:
(a) establishing for the first communication node a communication link with at least one of the plurality of intermediate communication nodes;
(b) indicating by each of the linked intermediate communication nodes that a communication link has been established and providing the hopping distance of that link;
(c) analyzing, by the intermediate communication nodes which receive the indication and by the second communication node if it receives the indication, the indication to determine whether to establish a communication link with the intermediate communication node providing the indication, and, if the analysis so indicates, establishing the communication link;
(d) branching to step (b) if the second communication node has not been linked; and (e) requesting, by any of the communication nodes which become unlinked, a communication link and branching to step (b).
(a) establishing for the first communication node a communication link with at least one of the plurality of intermediate communication nodes;
(b) indicating by each of the linked intermediate communication nodes that a communication link has been established and providing the hopping distance of that link;
(c) analyzing, by the intermediate communication nodes which receive the indication and by the second communication node if it receives the indication, the indication to determine whether to establish a communication link with the intermediate communication node providing the indication, and, if the analysis so indicates, establishing the communication link;
(d) branching to step (b) if the second communication node has not been linked; and (e) requesting, by any of the communication nodes which become unlinked, a communication link and branching to step (b).
8. In a multi-hop data communication system having a root node and a plurality of communication nodes a method for providing and maintaining communication pathways among the nodes comprising the steps of:
(a) indicating by the root node that communication links may be established;
(b) analyzing, by the communication nodes which receive the indication, the indication to determine whether to establish a communication link with the root node providing the indication, and, if the analysis so indicates, establishing the communication link;
(c) indicating by each of the linked communication nodes the hopping distance of the line to the root node;
(d) analyzing, by the communication nodes which receive the indication, the indication to determine whether to establish a communication link with the linked communication node providing the indication, and, if the analysis so indicates, establishing the communication link;
(e) branching to step (c) until all intermediate communication nodes have been linked; and (f) requesting, by any of the intermediate nodes which become unlinked, a communication link and branching to step (c).
(a) indicating by the root node that communication links may be established;
(b) analyzing, by the communication nodes which receive the indication, the indication to determine whether to establish a communication link with the root node providing the indication, and, if the analysis so indicates, establishing the communication link;
(c) indicating by each of the linked communication nodes the hopping distance of the line to the root node;
(d) analyzing, by the communication nodes which receive the indication, the indication to determine whether to establish a communication link with the linked communication node providing the indication, and, if the analysis so indicates, establishing the communication link;
(e) branching to step (c) until all intermediate communication nodes have been linked; and (f) requesting, by any of the intermediate nodes which become unlinked, a communication link and branching to step (c).
9. In a multi-hop data communication system having a root node, a plurality of communication nodes, and a plurality of terminal nodes a method for providing communication pathways among the communication nodes comprising the steps of:
(a) indicating by the root node a readiness to establish communication links;
(b) establishing communication links between the root node and the communication nodes receiving the indication;
(c) indicating by each of the linked communication nodes the number of communication links which have been established and providing the hopping distance of the link to the root node;
(d) analyzing, by the communication nodes which receive the indication, the indication to determine whether to establish a communication link with the linked communication node providing the indication, and, if the analysis so indicates, establishing the communication link;
(e) branching to step (c) until all communication nodes have been linked;
(f) indicating by the linked communication nodes the hopping distance of the link to the root node;
(g) analyzing, by the plurality of terminal nodes, the indications which are received to determine which linked communication nodes to establish, and, each terminal node establishing at least one communication link;
(h) requesting, by any of the plurality of terminal nodes which become unlinked, a communication link and branching to step (f); and (i) requesting, by any communication node which becomes unlinked, a communication link and branching to step (c).
(a) indicating by the root node a readiness to establish communication links;
(b) establishing communication links between the root node and the communication nodes receiving the indication;
(c) indicating by each of the linked communication nodes the number of communication links which have been established and providing the hopping distance of the link to the root node;
(d) analyzing, by the communication nodes which receive the indication, the indication to determine whether to establish a communication link with the linked communication node providing the indication, and, if the analysis so indicates, establishing the communication link;
(e) branching to step (c) until all communication nodes have been linked;
(f) indicating by the linked communication nodes the hopping distance of the link to the root node;
(g) analyzing, by the plurality of terminal nodes, the indications which are received to determine which linked communication nodes to establish, and, each terminal node establishing at least one communication link;
(h) requesting, by any of the plurality of terminal nodes which become unlinked, a communication link and branching to step (f); and (i) requesting, by any communication node which becomes unlinked, a communication link and branching to step (c).
10. In a multi-hop data communication system having a plurality of communication nodes, a method for providing communication pathways among the communication nodes comprising the steps of:
(a) selecting one of the communication nodes to be a root node;
(b) indicating by the root node that communication links may be established;
(c) establishing communication links between the root node and the communication nodes receiving the indication;
(d) indicating by each of the linked communication nodes the hopping distance of the link to the first communication node;
(e) analyzing, by the linked communication nodes which receive each indication, the indications to determine whether to replace the current communication link with a link to the communication node providing the indication, and, if the analysis so indicates, replacing the communication link;
(f) analyzing, by the unlinked communication nodes which receive each indication, the indications to determine whether to establish a communication link with the communication node providing the indication, and, if the analysis so indicates, establishing the communication link;
(g) branching to step (c) until all communication nodes have been linked.
(a) selecting one of the communication nodes to be a root node;
(b) indicating by the root node that communication links may be established;
(c) establishing communication links between the root node and the communication nodes receiving the indication;
(d) indicating by each of the linked communication nodes the hopping distance of the link to the first communication node;
(e) analyzing, by the linked communication nodes which receive each indication, the indications to determine whether to replace the current communication link with a link to the communication node providing the indication, and, if the analysis so indicates, replacing the communication link;
(f) analyzing, by the unlinked communication nodes which receive each indication, the indications to determine whether to establish a communication link with the communication node providing the indication, and, if the analysis so indicates, establishing the communication link;
(g) branching to step (c) until all communication nodes have been linked.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US76942591A | 1991-10-01 | 1991-10-01 | |
US769,425 | 1991-10-01 |
Publications (1)
Publication Number | Publication Date |
---|---|
CA2120520A1 true CA2120520A1 (en) | 1993-04-15 |
Family
ID=25085407
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002120520A Abandoned CA2120520A1 (en) | 1991-10-01 | 1992-10-01 | A radio frequency local area network |
Country Status (7)
Country | Link |
---|---|
US (7) | US5295154A (en) |
EP (2) | EP0606396B1 (en) |
AT (2) | ATE321387T1 (en) |
AU (1) | AU664864B2 (en) |
CA (1) | CA2120520A1 (en) |
DE (2) | DE69233608T2 (en) |
WO (1) | WO1993007691A1 (en) |
Families Citing this family (446)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5726984A (en) * | 1989-01-31 | 1998-03-10 | Norand Corporation | Hierarchical data collection network supporting packetized voice communications among wireless terminals and telephones |
US5790536A (en) * | 1989-01-31 | 1998-08-04 | Norand Corporation | Hierarchical communication system providing intelligent data, program and processing migration |
US7537167B1 (en) | 1993-08-31 | 2009-05-26 | Broadcom Corporation | Modular, portable data processing terminal for use in a radio frequency communication network |
WO1994027382A1 (en) * | 1993-05-11 | 1994-11-24 | Norand Corporation | Premises, peripheral and vehicular local area networking |
US6614768B1 (en) | 1989-04-28 | 2003-09-02 | Broadcom Corporation | Enhanced mobility and address resolution in a wireless premises based network |
US5815811A (en) * | 1989-06-29 | 1998-09-29 | Symbol Technologies, Inc. | Preemptive roaming in a cellular local area wireless network |
US6389010B1 (en) * | 1995-10-05 | 2002-05-14 | Intermec Ip Corp. | Hierarchical data collection network supporting packetized voice communications among wireless terminals and telephones |
US7383038B2 (en) * | 1990-01-18 | 2008-06-03 | Broadcom Corporation | Modular, portable data processing terminal for use in a radio frequency communication network |
US6359872B1 (en) * | 1997-10-28 | 2002-03-19 | Intermec Ip Corp. | Wireless personal local area network |
US6749122B1 (en) * | 1990-05-25 | 2004-06-15 | Broadcom Corporation | Multi-level hierarchial radio-frequency system communication system |
US6654378B1 (en) * | 1992-03-18 | 2003-11-25 | Broadcom Corp. | Transaction control system including portable data terminal and mobile customer service station |
US5682379A (en) * | 1993-12-23 | 1997-10-28 | Norand Corporation | Wireless personal local area network |
US5341372A (en) * | 1991-04-10 | 1994-08-23 | California Institute Of Technology | Protocol for multiple node network |
US6374311B1 (en) | 1991-10-01 | 2002-04-16 | Intermec Ip Corp. | Communication network having a plurality of bridging nodes which transmit a beacon to terminal nodes in power saving state that it has messages awaiting delivery |
US7558557B1 (en) * | 1991-11-12 | 2009-07-07 | Broadcom Corporation | Low-power messaging in a network supporting roaming terminals |
US6714559B1 (en) * | 1991-12-04 | 2004-03-30 | Broadcom Corporation | Redundant radio frequency network having a roaming terminal communication protocol |
DE69233608T2 (en) * | 1991-10-01 | 2007-03-01 | Broadcom Corp., Irvine | Local radio frequency network |
US6407991B1 (en) * | 1993-05-06 | 2002-06-18 | Intermec Ip Corp. | Communication network providing wireless and hard-wired dynamic routing |
US6400702B1 (en) * | 1991-10-01 | 2002-06-04 | Intermec Ip Corp. | Radio frequency local area network |
US6084867A (en) * | 1991-10-01 | 2000-07-04 | Intermec Ip Corp. | Apparatus and method of routing data in a radio frequency local area network |
US10361802B1 (en) | 1999-02-01 | 2019-07-23 | Blanding Hovenweep, Llc | Adaptive pattern recognition based control system and method |
US8352400B2 (en) | 1991-12-23 | 2013-01-08 | Hoffberg Steven M | Adaptive pattern recognition based controller apparatus and method and human-factored interface therefore |
EP0614322B1 (en) * | 1993-01-21 | 2000-04-05 | AT&T Corp. | Directory structure for large scale telecommunications network allowing location of roaming mobile subscribers |
CH685897A5 (en) * | 1993-01-26 | 1995-10-31 | Royale Consultants Ltd | Method and apparatus for bidirectional Informationsuebertragung (protocol) |
US5734824A (en) * | 1993-02-10 | 1998-03-31 | Bay Networks, Inc. | Apparatus and method for discovering a topology for local area networks connected via transparent bridges |
US6330334B1 (en) | 1993-03-15 | 2001-12-11 | Command Audio Corporation | Method and system for information dissemination using television signals |
US5590195A (en) * | 1993-03-15 | 1996-12-31 | Command Audio Corporation | Information dissemination using various transmission modes |
JP3170095B2 (en) * | 1993-04-14 | 2001-05-28 | 富士通株式会社 | Information retrieval system |
US7119750B2 (en) * | 1993-04-27 | 2006-10-10 | Broadcom Corporation | Radio transceiver card communicating in a plurality of frequency bands |
US6970434B1 (en) * | 1995-06-07 | 2005-11-29 | Broadcom Corporation | Hierarchical communication system providing intelligent data, program and processing migration |
US7924783B1 (en) * | 1994-05-06 | 2011-04-12 | Broadcom Corporation | Hierarchical communications system |
US7853254B2 (en) | 1993-08-31 | 2010-12-14 | Broadcom Corp. | Modular, portable data processing terminal for use in a radio frequency communication network |
US5446736A (en) * | 1993-10-07 | 1995-08-29 | Ast Research, Inc. | Method and apparatus for connecting a node to a wireless network using a standard protocol |
AU679593B2 (en) * | 1993-11-04 | 1997-07-03 | Broadcom Corporation | A communication network providing wireless and hard-wired dynamic routing |
US5452291A (en) * | 1993-11-30 | 1995-09-19 | Panasonic Technologies, Inc. | Combination brouter and cluster controller |
US5960344A (en) * | 1993-12-20 | 1999-09-28 | Norand Corporation | Local area network having multiple channel wireless access |
US7885242B2 (en) | 1993-12-23 | 2011-02-08 | Broadcom Corp. | Enhanced mobility and address resolution in a wireless premises based network |
GB9401092D0 (en) * | 1994-01-21 | 1994-03-16 | Newbridge Networks Corp | A network management system |
US7327688B2 (en) * | 1994-01-21 | 2008-02-05 | Alcatel Canada Inc. | Digital communications system |
US5453977A (en) * | 1994-02-08 | 1995-09-26 | Metricom, Inc. | Method for network configuration via third party query |
US5473602A (en) * | 1994-03-04 | 1995-12-05 | Nova-Net Communications, Inc. | Wireless radio packet switching network |
US5481535A (en) * | 1994-06-29 | 1996-01-02 | General Electric Company | Datagram message communication service employing a hybrid network |
CA2129200C (en) * | 1994-07-29 | 1999-08-10 | Murray C. Baker | Access point switching for mobile wireless network node |
US5774877A (en) * | 1994-09-20 | 1998-06-30 | Papyrus Technology Corp. | Two-way wireless system for financial industry transactions |
US5797002A (en) * | 1994-09-20 | 1998-08-18 | Papyrus Technology Corp. | Two-way wireless system for financial industry transactions |
US7373322B1 (en) | 1994-09-20 | 2008-05-13 | Papyrus Technology Corporation | Two-way wireless communication system for financial industry transactions |
US6768981B2 (en) | 1994-09-20 | 2004-07-27 | Papyrus Corporation | Method for executing a cross-trade in a two-way wireless system |
EP0736484B1 (en) * | 1995-03-10 | 2004-05-19 | Michael C. Ryan | Fluid delivery control nozzle |
JPH08265248A (en) * | 1995-03-20 | 1996-10-11 | Casio Comput Co Ltd | Communication system |
US5768531A (en) * | 1995-03-27 | 1998-06-16 | Toshiba America Information Systems | Apparatus and method for using multiple communication paths in a wireless LAN |
US5608727A (en) * | 1995-05-02 | 1997-03-04 | Motorola, Inc. | Method and system for management of frequency spectrum among multiple applications on a shared medium |
US5873070A (en) * | 1995-06-07 | 1999-02-16 | Norand Corporation | Data collection system |
DE69635511T2 (en) * | 1995-06-30 | 2006-08-10 | Koninklijke Philips Electronics N.V. | METHOD AND DEVICE FOR MOVING NEWS IN A KNOT NETWORK |
US5926101A (en) * | 1995-11-16 | 1999-07-20 | Philips Electronics North America Corporation | Method and apparatus for routing messages in a network of nodes with minimal resources |
US5745837A (en) * | 1995-08-25 | 1998-04-28 | Terayon Corporation | Apparatus and method for digital data transmission over a CATV system using an ATM transport protocol and SCDMA |
US6192053B1 (en) * | 1995-09-07 | 2001-02-20 | Wireless Networks, Inc. | Enhanced adjacency detection protocol for wireless applications |
US5590126A (en) * | 1995-09-27 | 1996-12-31 | Lucent Technologies Inc. | Method for call establishment and rerouting in mobile computing networks |
US6122759A (en) * | 1995-10-10 | 2000-09-19 | Lucent Technologies Inc. | Method and apparatus for restoration of an ATM network |
US6005884A (en) * | 1995-11-06 | 1999-12-21 | Ems Technologies, Inc. | Distributed architecture for a wireless data communications system |
GB9603582D0 (en) | 1996-02-20 | 1996-04-17 | Hewlett Packard Co | Method of accessing service resource items that are for use in a telecommunications system |
US5737318A (en) * | 1995-12-27 | 1998-04-07 | Philips Electronics North America Corporation | Method for initializing a wireless, packet-hopping network |
US6005883A (en) * | 1996-01-26 | 1999-12-21 | Aironet Wireless Communications, Inc. | Direct sequence network and method using PN sequence selection to represent data |
US9094384B2 (en) * | 1996-02-16 | 2015-07-28 | Reference Ltd., Limited Liability Company | TCP/IP protocol network with satellite nodes |
US6173332B1 (en) * | 1996-03-06 | 2001-01-09 | Paul L. Hickman | Method and apparatus for computing over a wide area network |
US7100069B1 (en) * | 1996-02-16 | 2006-08-29 | G&H Nevada-Tek | Method and apparatus for controlling a computer over a wide area network |
US6069890A (en) | 1996-06-26 | 2000-05-30 | Bell Atlantic Network Services, Inc. | Internet telephone service |
US6154445A (en) | 1996-04-18 | 2000-11-28 | Bell Atlantic Network Services, Inc. | Telephony communication via varied redundant networks |
US5768527A (en) * | 1996-04-23 | 1998-06-16 | Motorola, Inc. | Device, system and method of real-time multimedia streaming |
US20050048963A1 (en) * | 1996-06-03 | 2005-03-03 | Kubler Joseph J. | Configurable premises based wireless network and operating protocol |
US5815671A (en) * | 1996-06-11 | 1998-09-29 | Command Audio Corporation | Method and apparatus for encoding and storing audio/video information for subsequent predetermined retrieval |
JP3745459B2 (en) * | 1996-07-18 | 2006-02-15 | 富士通株式会社 | Communication method and communication apparatus for wireless LAN system |
US5956629A (en) * | 1996-08-14 | 1999-09-21 | Command Audio Corporation | Method and apparatus for transmitter identification and selection for mobile information signal services |
US5907491A (en) * | 1996-08-23 | 1999-05-25 | Csi Technology, Inc. | Wireless machine monitoring and communication system |
US6301514B1 (en) | 1996-08-23 | 2001-10-09 | Csi Technology, Inc. | Method and apparatus for configuring and synchronizing a wireless machine monitoring and communication system |
US5854994A (en) * | 1996-08-23 | 1998-12-29 | Csi Technology, Inc. | Vibration monitor and transmission system |
US5960074A (en) * | 1996-09-23 | 1999-09-28 | Curtis Clark | Mobile tele-computer network for motion picture, television and tv advertising production |
US5946631A (en) * | 1996-10-17 | 1999-08-31 | Philips Electronics North America Corporation | Real-time CSMA method having the capability to adaptively vary cell sizes and a wireless network for implementing the same |
US6748446B2 (en) * | 1996-11-29 | 2004-06-08 | Canon Kabushiki Kaisha | Communication method and apparatus with modification of routing path by intermediate relay apparatus |
US7054271B2 (en) * | 1996-12-06 | 2006-05-30 | Ipco, Llc | Wireless network system and method for providing same |
US8982856B2 (en) | 1996-12-06 | 2015-03-17 | Ipco, Llc | Systems and methods for facilitating wireless network communication, satellite-based wireless network systems, and aircraft-based wireless network systems, and related methods |
GB9720152D0 (en) | 1996-12-18 | 1997-11-26 | Mayup Limited | Communications system and method |
US6078582A (en) | 1996-12-18 | 2000-06-20 | Bell Atlantic Network Services, Inc. | Internet long distance telephone service |
US6272120B1 (en) * | 1997-01-28 | 2001-08-07 | Cisco Technology, Inc. | Multi-radio bridge |
AR011440A1 (en) * | 1997-02-12 | 2000-08-16 | Abb Power T & D Co | ELECTRONIC MEASUREMENT PROVISION |
US6018526A (en) * | 1997-02-20 | 2000-01-25 | Macronix America, Inc. | Bridge device with self learning between network media and integrated circuit and method based on the same |
US6067567A (en) * | 1997-02-20 | 2000-05-23 | International Business Machines Corporation | Message distribution capability which uses distribution nodes to collect acknowledgements for a primary node |
US6137869A (en) | 1997-09-16 | 2000-10-24 | Bell Atlantic Network Services, Inc. | Network session management |
US6574216B1 (en) | 1997-03-11 | 2003-06-03 | Verizon Services Corp. | Packet data network voice call quality monitoring |
US6292479B1 (en) | 1997-03-19 | 2001-09-18 | Bell Atlantic Network Services, Inc. | Transport of caller identification information through diverse communication networks |
US6870827B1 (en) | 1997-03-19 | 2005-03-22 | Verizon Services Corp. | Voice call alternative routing through PSTN and internet networks |
US6058116A (en) * | 1998-04-15 | 2000-05-02 | 3Com Corporation | Interconnected trunk cluster arrangement |
WO1999057649A2 (en) | 1998-05-04 | 1999-11-11 | Intermec Ip Corporation | Automatic data collection device having a network communications capability |
US6442171B1 (en) * | 1998-05-26 | 2002-08-27 | Qualcomm Incorporated | Logical topology and address assignment for interconnected digital networks |
US6445690B2 (en) | 1998-06-08 | 2002-09-03 | Koninklijke Philips Electronics N.V. | Wireless coupling of incompatible nodes via a virtual network |
US6445691B2 (en) | 1998-06-08 | 2002-09-03 | Koninklijke Philips Electronics N. V. | Wireless coupling of standardized networks and non-standardized nodes |
US6437692B1 (en) | 1998-06-22 | 2002-08-20 | Statsignal Systems, Inc. | System and method for monitoring and controlling remote devices |
US6914893B2 (en) | 1998-06-22 | 2005-07-05 | Statsignal Ipc, Llc | System and method for monitoring and controlling remote devices |
US8410931B2 (en) | 1998-06-22 | 2013-04-02 | Sipco, Llc | Mobile inventory unit monitoring systems and methods |
US6891838B1 (en) * | 1998-06-22 | 2005-05-10 | Statsignal Ipc, Llc | System and method for monitoring and controlling residential devices |
US6208247B1 (en) | 1998-08-18 | 2001-03-27 | Rockwell Science Center, Llc | Wireless integrated sensor network using multiple relayed communications |
US6149063A (en) * | 1998-09-14 | 2000-11-21 | Intermec Ip Corp. | Method and apparatus for bar code association for wireless network |
US6161760A (en) * | 1998-09-14 | 2000-12-19 | Welch Allyn Data Collection, Inc. | Multiple application multiterminal data collection network |
US6633579B1 (en) * | 1998-10-21 | 2003-10-14 | Marconi Communications, Inc. | Efficient method for storing multicast trees |
SE514727C2 (en) | 1998-11-12 | 2001-04-09 | Ericsson Telefon Ab L M | Communication networks and procedure for routing messages within the network |
US6947398B1 (en) * | 1998-11-13 | 2005-09-20 | Lucent Technologies Inc. | Addressing scheme for a multimedia mobile network |
US6404408B1 (en) | 1999-01-07 | 2002-06-11 | Surfer Network.Com, Inc. | Enhanced radio graphic data system |
US6584080B1 (en) * | 1999-01-14 | 2003-06-24 | Aero-Vision Technologies, Inc. | Wireless burstable communications repeater |
US6356949B1 (en) | 1999-01-29 | 2002-03-12 | Intermec Ip Corp. | Automatic data collection device that receives data output instruction from data consumer |
US6488209B1 (en) | 1999-01-29 | 2002-12-03 | Intermec Ip Corp. | Automatic data collection device that dynamically wedges data transmitted to data consumers |
US6857013B2 (en) * | 1999-01-29 | 2005-02-15 | Intermec Ip.Corp. | Remote anomaly diagnosis and reconfiguration of an automatic data collection device platform over a telecommunications network |
US20050274801A1 (en) * | 1999-01-29 | 2005-12-15 | Intermec Ip Corp. | Method, apparatus and article for validating ADC devices, such as barcode, RFID and magnetic stripe readers |
US6398105B2 (en) | 1999-01-29 | 2002-06-04 | Intermec Ip Corporation | Automatic data collection device that intelligently switches data based on data type |
US7966078B2 (en) | 1999-02-01 | 2011-06-21 | Steven Hoffberg | Network media appliance system and method |
US7650425B2 (en) | 1999-03-18 | 2010-01-19 | Sipco, Llc | System and method for controlling communication between a host computer and communication devices associated with remote devices in an automated monitoring system |
US6414955B1 (en) | 1999-03-23 | 2002-07-02 | Innovative Technology Licensing, Llc | Distributed topology learning method and apparatus for wireless networks |
US6600727B1 (en) | 1999-05-27 | 2003-07-29 | Cisco Technology, Inc. | Distributed network repeater system |
US7099295B1 (en) * | 1999-08-27 | 2006-08-29 | Psion Teklogix, Inc. | Apparatus and method for bridging a wired network and wireless devices |
AU7346800A (en) | 1999-09-02 | 2001-03-26 | Automated Business Companies | Communication and proximity authorization systems |
US7058037B1 (en) | 1999-09-13 | 2006-06-06 | Utstarcom, Inc. | Radio frequency transmitting device of mobile radio communication base station system in code division multiple access system |
US6976062B1 (en) * | 1999-09-22 | 2005-12-13 | Intermec Ip Corp. | Automated software upgrade utility |
US6826607B1 (en) | 1999-10-06 | 2004-11-30 | Sensoria Corporation | Apparatus for internetworked hybrid wireless integrated network sensors (WINS) |
US6735630B1 (en) | 1999-10-06 | 2004-05-11 | Sensoria Corporation | Method for collecting data using compact internetworked wireless integrated network sensors (WINS) |
US7020701B1 (en) | 1999-10-06 | 2006-03-28 | Sensoria Corporation | Method for collecting and processing data using internetworked wireless integrated network sensors (WINS) |
US7484008B1 (en) * | 1999-10-06 | 2009-01-27 | Borgia/Cummins, Llc | Apparatus for vehicle internetworks |
US6832251B1 (en) | 1999-10-06 | 2004-12-14 | Sensoria Corporation | Method and apparatus for distributed signal processing among internetworked wireless integrated network sensors (WINS) |
US6859831B1 (en) | 1999-10-06 | 2005-02-22 | Sensoria Corporation | Method and apparatus for internetworked wireless integrated network sensor (WINS) nodes |
DE19950005A1 (en) * | 1999-10-18 | 2001-04-19 | Bernhard Walke | Range enhancement operating method for mobile radio communications base station uses mobile stations within normal range as relay stations for reaching mobile stations outside normal operating range |
NZ526198A (en) * | 1999-10-22 | 2004-11-26 | Nextnet Wireless Inc | Fixed OFDM wireless MAN utilizing CPE having internal antenna, with base stations communicating with general CPE |
US6917626B1 (en) * | 1999-11-30 | 2005-07-12 | Cisco Technology, Inc. | Apparatus and method for automatic cluster network device address assignment |
GB2357010B (en) * | 1999-12-02 | 2003-09-24 | Ericsson Telefon Ab L M | Error reporting in a mobile telecommunications network |
US6636499B1 (en) * | 1999-12-02 | 2003-10-21 | Cisco Technology, Inc. | Apparatus and method for cluster network device discovery |
US7492248B1 (en) * | 2000-01-14 | 2009-02-17 | Symbol Technologies, Inc. | Multi-tier wireless communications architecture, applications and methods |
US7117273B1 (en) * | 2000-01-25 | 2006-10-03 | Cisco Technology, Inc. | Methods and apparatus for maintaining a map of node relationships for a network |
US7545755B2 (en) * | 2000-03-03 | 2009-06-09 | Adtran Inc. | Routing switch detecting change in session identifier before reconfiguring routing table |
US7916723B2 (en) * | 2000-03-03 | 2011-03-29 | Adtran, Inc. | Automatic network topology identification by nodes in the network |
US8745682B1 (en) | 2000-03-13 | 2014-06-03 | Broadcom Corporation | Integrated cable modem and cable television management system |
US6754484B1 (en) * | 2000-07-10 | 2004-06-22 | Nokia Corporation | Short messaging using information beacons |
US6831896B1 (en) | 2000-07-11 | 2004-12-14 | Nokia Corporation | Short range RF network |
JP3479834B2 (en) * | 2000-09-04 | 2003-12-15 | 日本電気株式会社 | Wireless access network routing control system and method |
GB2367970B (en) * | 2000-10-09 | 2004-01-21 | Ericsson Telefon Ab L M | Network topologies |
WO2002033513A2 (en) * | 2000-10-17 | 2002-04-25 | Broadcloud Communications, Inc. | Global sequence numbers in wireless communications systems and methods |
US7539154B1 (en) * | 2000-10-17 | 2009-05-26 | Cisco Technology, Inc. | Method and apparatus to detect and break loop configuration |
US6760772B2 (en) * | 2000-12-15 | 2004-07-06 | Qualcomm, Inc. | Generating and implementing a communication protocol and interface for high data rate signal transfer |
FI20002822A (en) * | 2000-12-21 | 2002-06-22 | Nokia Corp | Address Sharing |
US7391321B2 (en) * | 2005-01-10 | 2008-06-24 | Terahop Networks, Inc. | Keyhole communication device for tracking and monitoring shipping container and contents thereof |
US7221668B2 (en) * | 2000-12-22 | 2007-05-22 | Terahop Networks, Inc. | Communications within population of wireless transceivers based on common designation |
US7209771B2 (en) * | 2000-12-22 | 2007-04-24 | Terahop Networks, Inc. | Battery powered wireless transceiver having LPRF component and second wake up receiver |
US7830850B2 (en) * | 2000-12-22 | 2010-11-09 | Terahop Networks, Inc. | Class-switching in class-based data communcations network |
US7542849B2 (en) * | 2005-06-03 | 2009-06-02 | Terahop Networks, Inc. | Network aided terrestrial triangulation using stars (NATTS) |
US8280345B2 (en) * | 2000-12-22 | 2012-10-02 | Google Inc. | LPRF device wake up using wireless tag |
US7574300B2 (en) * | 2005-06-16 | 2009-08-11 | Terahop Networks, Inc. | GPS denial device detection and location system |
US7783246B2 (en) * | 2005-06-16 | 2010-08-24 | Terahop Networks, Inc. | Tactical GPS denial and denial detection system |
US7155264B2 (en) * | 2000-12-22 | 2006-12-26 | Terahop Networks, Inc. | Systems and methods having LPRF device wake up using wireless tag |
US7563991B2 (en) * | 2005-06-08 | 2009-07-21 | Terahop Networks, Inc. | All weather housing assembly for electronic components |
US7526381B2 (en) * | 2005-06-03 | 2009-04-28 | Terahop Networks, Inc. | Network aided terrestrial triangulation using stars (NATTS) |
US7133704B2 (en) * | 2000-12-22 | 2006-11-07 | Terahop Networks, Inc. | Manufacture of LPRF device wake up using wireless tag |
US6934540B2 (en) * | 2000-12-22 | 2005-08-23 | Seekernet, Inc. | Network formation in asset-tracking system based on asset class |
US7394361B1 (en) * | 2005-01-10 | 2008-07-01 | Terahop Networks, Inc. | Keyhole communication device for tracking and monitoring shipping container and contents thereof |
US7200132B2 (en) * | 2000-12-22 | 2007-04-03 | Terahop Networks, Inc. | Forming ad hoc RSI networks among transceivers sharing common designation |
US7583769B2 (en) * | 2005-06-16 | 2009-09-01 | Terahop Netowrks, Inc. | Operating GPS receivers in GPS-adverse environment |
WO2003032501A2 (en) * | 2000-12-22 | 2003-04-17 | Seekernet Incorporated | Network formation in asset-tracking system based on asset class |
US7554442B2 (en) * | 2005-06-17 | 2009-06-30 | Terahop Networks, Inc. | Event-driven mobile hazmat monitoring |
US7209468B2 (en) * | 2000-12-22 | 2007-04-24 | Terahop Networks, Inc. | Forming communication cluster of wireless AD HOC network based on common designation |
US20100330930A1 (en) * | 2000-12-22 | 2010-12-30 | Twitchell Robert W | Lprf device wake up using wireless tag |
US7574168B2 (en) * | 2005-06-16 | 2009-08-11 | Terahop Networks, Inc. | Selective GPS denial system |
US7430437B2 (en) * | 2000-12-22 | 2008-09-30 | Terahop Networks, Inc. | Transmitting sensor-acquired data using step-power filtering |
US7733818B2 (en) * | 2000-12-22 | 2010-06-08 | Terahop Networks, Inc. | Intelligent node communication using network formation messages in a mobile Ad hoc network |
US7742773B2 (en) * | 2005-10-31 | 2010-06-22 | Terahop Networks, Inc. | Using GPS and ranging to determine relative elevation of an asset |
US8315563B2 (en) * | 2000-12-22 | 2012-11-20 | Google Inc. | Wireless reader tags (WRTs) with sensor components in asset monitoring and tracking systems |
US7522568B2 (en) * | 2000-12-22 | 2009-04-21 | Terahop Networks, Inc. | Propagating ad hoc wireless networks based on common designation and routine |
US7830273B2 (en) * | 2005-08-18 | 2010-11-09 | Terahop Networks, Inc. | Sensor networks for pipeline monitoring |
US6745027B2 (en) | 2000-12-22 | 2004-06-01 | Seekernet Incorporated | Class switched networks for tracking articles |
US7539520B2 (en) * | 2005-06-17 | 2009-05-26 | Terahop Networks, Inc. | Remote sensor interface (RSI) having power conservative transceiver for transmitting and receiving wakeup signals |
US20080303897A1 (en) * | 2000-12-22 | 2008-12-11 | Terahop Networks, Inc. | Visually capturing and monitoring contents and events of cargo container |
US7705747B2 (en) * | 2005-08-18 | 2010-04-27 | Terahop Networks, Inc. | Sensor networks for monitoring pipelines and power lines |
US6965575B2 (en) * | 2000-12-29 | 2005-11-15 | Tropos Networks | Selection of routing paths based upon path quality of a wireless mesh network |
US6704301B2 (en) * | 2000-12-29 | 2004-03-09 | Tropos Networks, Inc. | Method and apparatus to provide a routing protocol for wireless devices |
US7551562B2 (en) * | 2000-12-29 | 2009-06-23 | Tropos Networks | Determining bidirectional path quality within a wireless mesh network |
FR2819968B1 (en) * | 2001-01-22 | 2003-05-30 | Canon Europa Nv | CONNECTION PROCESS |
US7200130B2 (en) * | 2001-02-13 | 2007-04-03 | Nokia Corporation | Short range RF network configuration |
DE10107991A1 (en) * | 2001-02-19 | 2002-08-29 | Philips Corp Intellectual Pty | Network with an adaptation of the frame structure of sub-networks |
US6954443B2 (en) * | 2001-03-09 | 2005-10-11 | Nokia Corporation | Short range RF network with roaming terminals |
US7031293B1 (en) * | 2001-03-26 | 2006-04-18 | Tropos Networks, Inc. | Method and system to provide increased data throughput in a wireless multi-hop network |
US7417556B2 (en) * | 2001-04-24 | 2008-08-26 | Koninklijke Philips Electronics N.V. | Wireless addressable lighting method and apparatus |
GB0112017D0 (en) | 2001-05-17 | 2001-07-11 | Koninkl Philips Electronics Nv | Wireless master-slave distributed communications network |
US6990316B2 (en) * | 2001-06-26 | 2006-01-24 | Nokia Corporation | Short range RF network configuration |
US7207041B2 (en) * | 2001-06-28 | 2007-04-17 | Tranzeo Wireless Technologies, Inc. | Open platform architecture for shared resource access management |
US7161926B2 (en) * | 2001-07-03 | 2007-01-09 | Sensoria Corporation | Low-latency multi-hop ad hoc wireless network |
US7333486B2 (en) * | 2001-07-16 | 2008-02-19 | International Business Machines Corporation | Methods and arrangements for monitoring subsource addressing multicast distribution trees |
JP2003152752A (en) * | 2001-08-29 | 2003-05-23 | Matsushita Electric Ind Co Ltd | Data transmission/reception method |
US20040171386A1 (en) * | 2001-09-04 | 2004-09-02 | Enric Mitjana | Method for identifying a station with specific functions in a wireless-based ad-hoc network, and a substation for carrying out the method |
US8812706B1 (en) | 2001-09-06 | 2014-08-19 | Qualcomm Incorporated | Method and apparatus for compensating for mismatched delays in signals of a mobile display interface (MDDI) system |
DE10145596A1 (en) | 2001-09-15 | 2003-04-03 | Philips Corp Intellectual Pty | Network with several sub-networks |
US6996658B2 (en) | 2001-10-17 | 2006-02-07 | Stargen Technologies, Inc. | Multi-port system and method for routing a data element within an interconnection fabric |
US8532127B2 (en) | 2001-10-19 | 2013-09-10 | Juniper Networks, Inc. | Network routing using indirect next hop data |
US8489063B2 (en) | 2001-10-24 | 2013-07-16 | Sipco, Llc | Systems and methods for providing emergency messages to a mobile device |
US7480501B2 (en) | 2001-10-24 | 2009-01-20 | Statsignal Ipc, Llc | System and method for transmitting an emergency message over an integrated wireless network |
US7424527B2 (en) | 2001-10-30 | 2008-09-09 | Sipco, Llc | System and method for transmitting pollution information over an integrated wireless network |
JP3886795B2 (en) * | 2001-12-10 | 2007-02-28 | 株式会社エヌ・ティ・ティ・ドコモ | Mobile communication system, mobile communication method, mobile terminal, and communication base station |
US20030117281A1 (en) * | 2001-12-21 | 2003-06-26 | Timur Sriharto | Dynamic control containment unit |
US7305467B2 (en) * | 2002-01-02 | 2007-12-04 | Borgia/Cummins, Llc | Autonomous tracking wireless imaging sensor network including an articulating sensor and automatically organizing network nodes |
US7068610B2 (en) * | 2002-02-26 | 2006-06-27 | Unruh Lincoln J | System and method for reliable communications over multiple packet RF networks |
US7177608B2 (en) * | 2002-03-11 | 2007-02-13 | Catch A Wave Technologies | Personal spectrum recorder |
US8578015B2 (en) * | 2002-04-29 | 2013-11-05 | Harris Corporation | Tracking traffic in a mobile ad hoc network |
US7580370B2 (en) * | 2002-06-21 | 2009-08-25 | International Business Machines Corporation | Method and structure for autoconfiguration of network destinations |
US20030235157A1 (en) * | 2002-06-21 | 2003-12-25 | International Business Machines Corporation | Method and structure for an autoconfiguration topology calculation |
US7769839B2 (en) * | 2002-06-21 | 2010-08-03 | International Business Machines Corporation | Method and structure for autoconfiguration of overlay networks by automatic selection of a network designated router |
US7119713B2 (en) * | 2002-06-27 | 2006-10-10 | Elster Electricity, Llc | Dynamic self-configuring metering network |
US20040113810A1 (en) * | 2002-06-28 | 2004-06-17 | Mason Robert T. | Data collector for an automated meter reading system |
US7610050B2 (en) * | 2002-08-14 | 2009-10-27 | Tadaaki Chigusa | System for mobile broadband networking using dynamic quality of service provisioning |
US7899030B2 (en) * | 2002-09-11 | 2011-03-01 | Jinsalas Solutions, Llc | Advanced switching architecture |
EP1398919A1 (en) * | 2002-09-12 | 2004-03-17 | Thomson Licensing S.A. | Method for parent election of a wireless transparent bridge in a "parent-child" hierarchical network |
US20040070759A1 (en) * | 2002-10-14 | 2004-04-15 | Anderson Duwayne R. | Vector representation of polarization dependent loss |
US9730100B2 (en) * | 2002-10-28 | 2017-08-08 | MeshDynamics | Terse message networks |
US10785316B2 (en) | 2008-11-24 | 2020-09-22 | MeshDynamics | Evolutionary wireless networks |
US8520691B2 (en) * | 2003-05-08 | 2013-08-27 | Mesh Dynamics, Inc. | Persistent mesh for isolated mobile and temporal networking |
US11368537B2 (en) | 2002-10-28 | 2022-06-21 | Dynamic Mesh Networks, Inc. | High performance wireless network |
US7420952B2 (en) * | 2002-10-28 | 2008-09-02 | Mesh Dynamics, Inc. | High performance wireless networks using distributed control |
US7350077B2 (en) * | 2002-11-26 | 2008-03-25 | Cisco Technology, Inc. | 802.11 using a compressed reassociation exchange to facilitate fast handoff |
US7330905B2 (en) * | 2002-12-13 | 2008-02-12 | Spyder Navigations L.L.C. | Method to improve the information distribution in a communication network |
US7366113B1 (en) * | 2002-12-27 | 2008-04-29 | At & T Corp. | Adaptive topology discovery in communication networks |
US7304587B2 (en) * | 2003-02-14 | 2007-12-04 | Energy Technology Group, Inc. | Automated meter reading system, communication and control network for automated meter reading, meter data collector program product, and associated methods |
US20070013547A1 (en) * | 2003-02-14 | 2007-01-18 | Boaz Jon A | Automated meter reading system, communication and control network from automated meter reading, meter data collector, and associated methods |
US7400264B2 (en) * | 2003-02-14 | 2008-07-15 | Energy Technology Group, Inc. | Automated meter reading system, communication and control network for automated meter reading, meter data collector, and associated methods |
WO2004086783A1 (en) | 2003-03-24 | 2004-10-07 | Strix Systems, Inc. | Node placement method within a wireless network, such as a wireless local area network |
US7733833B2 (en) | 2003-03-24 | 2010-06-08 | Strix Systems, Inc. | Self-configuring, self-optimizing wireless local area network system |
EP1623521B1 (en) | 2003-05-12 | 2015-03-11 | Broadcom Corporation | System and method for telecommunication diagnostic information management |
KR101168839B1 (en) * | 2003-06-02 | 2012-07-26 | 퀄컴 인코포레이티드 | Generating and implementing a signal protocol and interface for higher data rates |
US20050068902A1 (en) * | 2003-07-09 | 2005-03-31 | Kamlesh Rath | Scalable broadband wireless mesh access network |
KR101178080B1 (en) * | 2003-08-13 | 2012-08-30 | 퀄컴 인코포레이티드 | A signal interface for higher data rates |
KR100951158B1 (en) * | 2003-09-10 | 2010-04-06 | 콸콤 인코포레이티드 | High data rate interface |
GB2406740A (en) * | 2003-09-30 | 2005-04-06 | Siemens Ag | Enabling the determination of the location of a terminal in a communications system. |
US8694652B2 (en) * | 2003-10-15 | 2014-04-08 | Qualcomm Incorporated | Method, system and computer program for adding a field to a client capability packet sent from a client to a host |
CN1902880A (en) * | 2003-10-29 | 2007-01-24 | 高通股份有限公司 | High data rate interface |
CN101729205A (en) * | 2003-11-12 | 2010-06-09 | 高通股份有限公司 | High data rate interface with improved link control |
BRPI0416895A (en) * | 2003-11-25 | 2007-03-06 | Qualcomm Inc | High data rate interface with enhanced link synchronization |
EP2247072B1 (en) * | 2003-12-08 | 2013-09-25 | QUALCOMM Incorporated | High data rate interface with improved link synchronization |
US7646752B1 (en) * | 2003-12-31 | 2010-01-12 | Nortel Networks Limited | Multi-hop wireless backhaul network and method |
NO20040110L (en) * | 2004-01-09 | 2005-07-11 | Geir Monsen Vavik | Signal repeater system |
KR100555749B1 (en) * | 2004-01-27 | 2006-03-03 | 삼성전자주식회사 | Apparatus and method for data transmission path setting in ad-hoc network |
US7756086B2 (en) | 2004-03-03 | 2010-07-13 | Sipco, Llc | Method for communicating in dual-modes |
US8031650B2 (en) | 2004-03-03 | 2011-10-04 | Sipco, Llc | System and method for monitoring remote devices with a dual-mode wireless communication protocol |
KR101100996B1 (en) | 2004-03-09 | 2011-12-29 | 파나소닉 주식회사 | Random access method and radio communication terminal device |
WO2005088939A1 (en) * | 2004-03-10 | 2005-09-22 | Qualcomm Incorporated | High data rate interface apparatus and method |
JP4519903B2 (en) * | 2004-03-17 | 2010-08-04 | クゥアルコム・インコーポレイテッド | High speed data rate interface apparatus and method |
US7483392B1 (en) * | 2004-03-19 | 2009-01-27 | Bbn Technologies Corp. | Multinode arrangement |
KR101019935B1 (en) * | 2004-03-24 | 2011-03-09 | 퀄컴 인코포레이티드 | High data rate interface apparatus and method |
US20050220106A1 (en) * | 2004-03-31 | 2005-10-06 | Pierre Guillaume Raverdy | Inter-wireless interactions using user discovery for ad-hoc environments |
US7239250B2 (en) * | 2004-04-26 | 2007-07-03 | Elster Electricity, Llc | System and method for improved transmission of meter data |
US7187906B2 (en) * | 2004-04-26 | 2007-03-06 | Elster Electricity, Llc | Method and system for configurable qualification and registration in a fixed network automated meter reading system |
US7262709B2 (en) * | 2004-04-26 | 2007-08-28 | Elster Electricity, Llc | System and method for efficient configuration in a fixed network automated meter reading system |
US20050251403A1 (en) * | 2004-05-10 | 2005-11-10 | Elster Electricity, Llc. | Mesh AMR network interconnecting to TCP/IP wireless mesh network |
US20050251401A1 (en) * | 2004-05-10 | 2005-11-10 | Elster Electricity, Llc. | Mesh AMR network interconnecting to mesh Wi-Fi network |
US7142107B2 (en) | 2004-05-27 | 2006-11-28 | Lawrence Kates | Wireless sensor unit |
EP1978692B1 (en) * | 2004-06-04 | 2011-07-27 | QUALCOMM Incorporated | High data rate interface apparatus and method |
US8650304B2 (en) * | 2004-06-04 | 2014-02-11 | Qualcomm Incorporated | Determining a pre skew and post skew calibration data rate in a mobile display digital interface (MDDI) communication system |
US7142106B2 (en) * | 2004-06-15 | 2006-11-28 | Elster Electricity, Llc | System and method of visualizing network layout and performance characteristics in a wireless network |
US7613171B2 (en) * | 2004-08-31 | 2009-11-03 | Ephraim Zehavi | Cellular network service over WLAN |
WO2006029288A2 (en) * | 2004-09-09 | 2006-03-16 | Inteligistics, Inc. | Modular shipping unit and system |
US7702594B2 (en) * | 2004-09-24 | 2010-04-20 | Elster Electricity, Llc | System and method for automated configuration of meters |
US7170425B2 (en) * | 2004-09-24 | 2007-01-30 | Elster Electricity, Llc | System and method for creating multiple operating territories within a meter reading system |
KR100637071B1 (en) * | 2004-09-24 | 2006-10-23 | 삼성전자주식회사 | Mobile network system for controlling communication path dynamically, method thereof |
US7742430B2 (en) * | 2004-09-24 | 2010-06-22 | Elster Electricity, Llc | System for automated management of spontaneous node migration in a distributed fixed wireless network |
US7176807B2 (en) * | 2004-09-24 | 2007-02-13 | Elster Electricity, Llc | System for automatically enforcing a demand reset in a fixed network of electricity meters |
US8068467B2 (en) * | 2004-10-22 | 2011-11-29 | Motorola Soulutions, Inc. | Multi-tier WLAN and method for propagating beacons in a multi-tier WLAN thereof |
US8692838B2 (en) | 2004-11-24 | 2014-04-08 | Qualcomm Incorporated | Methods and systems for updating a buffer |
US8667363B2 (en) * | 2004-11-24 | 2014-03-04 | Qualcomm Incorporated | Systems and methods for implementing cyclic redundancy checks |
US8539119B2 (en) * | 2004-11-24 | 2013-09-17 | Qualcomm Incorporated | Methods and apparatus for exchanging messages having a digital data interface device message format |
US8723705B2 (en) * | 2004-11-24 | 2014-05-13 | Qualcomm Incorporated | Low output skew double data rate serial encoder |
US8873584B2 (en) * | 2004-11-24 | 2014-10-28 | Qualcomm Incorporated | Digital data interface device |
US8699330B2 (en) | 2004-11-24 | 2014-04-15 | Qualcomm Incorporated | Systems and methods for digital data transmission rate control |
US20060133394A1 (en) * | 2004-12-21 | 2006-06-22 | Ware Christopher G | Methods of wireless backhaul in a multi-tier WLAN |
US7327998B2 (en) * | 2004-12-22 | 2008-02-05 | Elster Electricity, Llc | System and method of providing a geographic view of nodes in a wireless network |
US9439126B2 (en) | 2005-01-25 | 2016-09-06 | Sipco, Llc | Wireless network protocol system and methods |
US7978060B2 (en) | 2005-02-14 | 2011-07-12 | Inteligistics, Inc. | Identification system |
US8935405B2 (en) * | 2005-03-07 | 2015-01-13 | Nokia Corporation | Expanding universal plug and play capabilities in power constrained environment |
US7738859B2 (en) * | 2005-03-10 | 2010-06-15 | Interdigital Technology Corporation | Multi-node communication system and method of requesting, reporting and collecting destination-node-based measurements and route-based measurements |
US20060206433A1 (en) * | 2005-03-11 | 2006-09-14 | Elster Electricity, Llc. | Secure and authenticated delivery of data from an automated meter reading system |
US20060224335A1 (en) * | 2005-03-29 | 2006-10-05 | Elster Electricity, Llc | Collecting interval data from a relative time battery powered automated meter reading devices |
KR100644691B1 (en) * | 2005-04-15 | 2006-11-10 | 삼성전자주식회사 | Method and apparatus for forwarding frames in the extended LAN |
US7606178B2 (en) * | 2005-05-31 | 2009-10-20 | Cisco Technology, Inc. | Multiple wireless spanning tree protocol for use in a wireless mesh network |
US7653011B2 (en) * | 2005-05-31 | 2010-01-26 | Cisco Technology, Inc. | Spanning tree protocol for wireless networks |
WO2007100343A1 (en) * | 2005-06-03 | 2007-09-07 | Terahop Networks Inc. | Remote sensor interface (rsi) stepped wake-up sequence |
CN100479415C (en) * | 2005-06-06 | 2009-04-15 | 腾讯科技(深圳)有限公司 | System for realizing data communication and its method |
US20060289650A1 (en) * | 2005-06-27 | 2006-12-28 | Mobile Aspects, Inc. | Networked monitoring system |
WO2007005947A1 (en) | 2005-07-01 | 2007-01-11 | Terahop Networks, Inc. | Nondeterministic and deterministic network routing |
US7828342B2 (en) * | 2005-07-29 | 2010-11-09 | Terahop Networks, Inc. | Reusable locking body, of bolt-type seal lock, having open-ended passageway and U-shaped bolt |
US7761864B2 (en) | 2005-08-09 | 2010-07-20 | Intermec Ip Corp. | Method, apparatus and article to load new instructions on processor based devices, for example, automatic data collection devices |
US7495578B2 (en) * | 2005-09-02 | 2009-02-24 | Elster Electricity, Llc | Multipurpose interface for an automated meter reading device |
US7546168B2 (en) | 2005-09-12 | 2009-06-09 | Abl Ip Holding Llc | Owner/operator control of a light management system using networked intelligent luminaire managers |
US7660318B2 (en) * | 2005-09-20 | 2010-02-09 | Cisco Technology, Inc. | Internetworking support between a LAN and a wireless mesh network |
US7308369B2 (en) * | 2005-09-28 | 2007-12-11 | Elster Electricity Llc | Ensuring automatic season change demand resets in a mesh type network of telemetry devices |
EP1946282A4 (en) | 2005-10-05 | 2011-12-28 | Abl Ip Holding Llc | A method and system for remotely monitoring and controlling field devices with a street lamp elevated mesh network |
CN1953406B (en) * | 2005-10-19 | 2011-06-01 | 株式会社Ntt都科摩 | A method to access hybrid network and gateway equipment, wireless terminal and communication system |
US20070110024A1 (en) * | 2005-11-14 | 2007-05-17 | Cisco Technology, Inc. | System and method for spanning tree cross routes |
US8730069B2 (en) * | 2005-11-23 | 2014-05-20 | Qualcomm Incorporated | Double data rate serial encoder |
US8692839B2 (en) * | 2005-11-23 | 2014-04-08 | Qualcomm Incorporated | Methods and systems for updating a buffer |
US20070147268A1 (en) * | 2005-12-23 | 2007-06-28 | Elster Electricity, Llc | Distributing overall control of mesh AMR LAN networks to WAN interconnected collectors |
WO2008036425A1 (en) * | 2006-01-01 | 2008-03-27 | Terahop Networks, Inc. | Determining presence of radio frequency communication device |
US20090129306A1 (en) | 2007-02-21 | 2009-05-21 | Terahop Networks, Inc. | Wake-up broadcast including network information in common designation ad hoc wireless networking |
US7602281B2 (en) * | 2006-01-26 | 2009-10-13 | The United States Of America As Represented By The Secretary Of The Army | System and method for tactical distributed event warning notification for individual entities, and computer program product therefor |
US7598850B2 (en) * | 2006-01-26 | 2009-10-06 | The United States Of America As Represented By The Secretary Of The Army | System and method for centralized event warning notification for individual entities, and computer program product therefor |
US7764185B1 (en) | 2006-01-26 | 2010-07-27 | The United States Of America As Represented By The Secretary Of The Army | System, user warning and positioning device for use therein, and computer program product therefor, for tactical distributed event warning notification for individual entities |
US8165059B2 (en) * | 2006-01-30 | 2012-04-24 | The University Of Electro-Communications | Multi-hop communication method, a multi-hop communication terminal and communication program |
US7427927B2 (en) * | 2006-02-16 | 2008-09-23 | Elster Electricity, Llc | In-home display communicates with a fixed network meter reading system |
US7545285B2 (en) * | 2006-02-16 | 2009-06-09 | Elster Electricity, Llc | Load control unit in communication with a fixed network meter reading system |
USRE48984E1 (en) | 2006-03-07 | 2022-03-22 | Electronics And Telecommunications Research Institute | Method for reducing power consumption of a terminal in cellular system |
KR101208271B1 (en) * | 2006-03-07 | 2012-12-05 | 한국전자통신연구원 | method for power saving operation of user equipment in cellular system |
ATE505922T1 (en) * | 2006-03-16 | 2011-04-15 | British Telecomm | METHOD FOR WIRELESS TRANSMISSION USING RELAY |
WO2007143679A2 (en) | 2006-06-07 | 2007-12-13 | Qualcomm Incorporated | Efficient address methods, computer readable medium and apparatus for wireless communication |
WO2008011717A1 (en) * | 2006-07-28 | 2008-01-31 | Nortel Networks Limited | Multi-hop network topology system and method |
US8944332B2 (en) | 2006-08-04 | 2015-02-03 | Intermec Ip Corp. | Testing automatic data collection devices, such as barcode, RFID and/or magnetic stripe readers |
EP2076974B1 (en) * | 2006-10-16 | 2014-04-23 | Assa Abloy Hospitality, Inc. | Centralized wireless network for multi-room large properties |
EP2092693A1 (en) * | 2006-10-17 | 2009-08-26 | Panasonic Corporation | System and method for mobility in multihop networks |
US9060325B2 (en) * | 2006-12-04 | 2015-06-16 | Intel Corporation | Method and apparatus for creating and connecting to an ad hoc wireless cell |
US8073384B2 (en) * | 2006-12-14 | 2011-12-06 | Elster Electricity, Llc | Optimization of redundancy and throughput in an automated meter data collection system using a wireless network |
KR100872348B1 (en) * | 2007-01-11 | 2008-12-05 | 삼성전자주식회사 | System and method for energy management for sensor network using the spanning tree |
US7729278B2 (en) * | 2007-02-14 | 2010-06-01 | Tropos Networks, Inc. | Wireless routing based on data packet classifications |
US8223680B2 (en) * | 2007-02-21 | 2012-07-17 | Google Inc. | Mesh network control using common designation wake-up |
US20080240096A1 (en) | 2007-03-29 | 2008-10-02 | Twisted Pair Solutions, Inc. | Method, apparatus, system, and article of manufacture for providing distributed convergence nodes in a communication network environment |
US8320302B2 (en) * | 2007-04-20 | 2012-11-27 | Elster Electricity, Llc | Over the air microcontroller flash memory updates |
EP2151100A1 (en) * | 2007-06-04 | 2010-02-10 | New Jersey Institute Of Technology | Multi-criteria optimization for relaying in multi-hop wireless ad hoc and sensor networks |
US8189577B2 (en) | 2007-06-15 | 2012-05-29 | Silver Spring Networks, Inc. | Network utilities in wireless mesh communications networks |
US8130700B2 (en) | 2007-06-15 | 2012-03-06 | Silver Spring Networks, Inc. | Method and system for providing network and routing protocols for utility services |
US8072951B2 (en) | 2007-06-15 | 2011-12-06 | Silver Spring Networks, Inc. | Method and system for providing routing protocols in a frequency hopping spread spectrum network |
US8233905B2 (en) | 2007-06-15 | 2012-07-31 | Silver Spring Networks, Inc. | Load management in wireless mesh communications networks |
US7940669B2 (en) | 2007-06-15 | 2011-05-10 | Silver Spring Networks, Inc. | Route and link evaluation in wireless mesh communications networks |
KR100899809B1 (en) * | 2007-12-11 | 2009-05-27 | 한국전자통신연구원 | Coordinator, gateway and transmission method for ipv6 in wireless sensor network |
US8855036B2 (en) * | 2007-12-21 | 2014-10-07 | Powerwave Technologies S.A.R.L. | Digital distributed antenna system |
WO2009082761A1 (en) | 2007-12-26 | 2009-07-02 | Elster Electricity, Llc. | Optimized data collection in a wireless fixed network metering system |
US20090201840A1 (en) * | 2008-02-08 | 2009-08-13 | Pfeiffer Jr Loren K | Wireless networks using a rooted, directed topology |
US8140276B2 (en) | 2008-02-27 | 2012-03-20 | Abl Ip Holding Llc | System and method for streetlight monitoring diagnostics |
CN104270189A (en) | 2008-03-07 | 2015-01-07 | 诺基亚通信公司 | Protocols For Multi-hop Relay System With Centralized Scheduling |
US8462662B2 (en) * | 2008-05-16 | 2013-06-11 | Google Inc. | Updating node presence based on communication pathway |
WO2009140669A2 (en) | 2008-05-16 | 2009-11-19 | Terahop Networks, Inc. | Securing, monitoring and tracking shipping containers |
US20090310544A1 (en) * | 2008-06-12 | 2009-12-17 | Praval Jain | Method and system for increasing throughput in a hierarchical wireless network |
US8787266B2 (en) * | 2008-06-13 | 2014-07-22 | Infineon Technologies Ag | Medium access control in industrial and automotive wireless with combined wired and wireless sensor networks |
US8525692B2 (en) * | 2008-06-13 | 2013-09-03 | Elster Solutions, Llc | Techniques for limiting demand from an electricity meter with an installed relay |
CA2726887C (en) * | 2008-07-01 | 2017-03-07 | Twisted Pair Solutions, Inc. | Method, apparatus, system, and article of manufacture for reliable low-bandwidth information delivery across mixed-mode unicast and multicast networks |
US8414471B2 (en) | 2008-10-28 | 2013-04-09 | Mobile Aspects, Inc. | Endoscope storage cabinet, tracking system, and signal emitting member |
US8391435B2 (en) | 2008-12-25 | 2013-03-05 | Google Inc. | Receiver state estimation in a duty cycled radio |
US8300551B2 (en) * | 2009-01-28 | 2012-10-30 | Google Inc. | Ascertaining presence in wireless networks |
US8705523B2 (en) | 2009-02-05 | 2014-04-22 | Google Inc. | Conjoined class-based networking |
US8203463B2 (en) | 2009-02-13 | 2012-06-19 | Elster Electricity Llc | Wakeup and interrogation of meter-reading devices using licensed narrowband and unlicensed wideband radio communication |
US8472868B2 (en) * | 2009-05-06 | 2013-06-25 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for MIMO repeater chains in a wireless communication network |
US8238538B2 (en) | 2009-05-28 | 2012-08-07 | Comcast Cable Communications, Llc | Stateful home phone service |
US8836601B2 (en) | 2013-02-04 | 2014-09-16 | Ubiquiti Networks, Inc. | Dual receiver/transmitter radio devices with choke |
US9496620B2 (en) | 2013-02-04 | 2016-11-15 | Ubiquiti Networks, Inc. | Radio system for long-range high-speed wireless communication |
US9634373B2 (en) | 2009-06-04 | 2017-04-25 | Ubiquiti Networks, Inc. | Antenna isolation shrouds and reflectors |
US8762518B2 (en) * | 2009-07-10 | 2014-06-24 | Telcordia Technologies, Inc. | Program and method for adaptively maintaining a local peer group in a dynamic environment |
WO2011045859A1 (en) * | 2009-10-15 | 2011-04-21 | 富士通株式会社 | Wireless communication apparatus and wireless communication program |
US9110860B2 (en) * | 2009-11-11 | 2015-08-18 | Mellanox Technologies Tlv Ltd. | Topology-aware fabric-based offloading of collective functions |
US8811417B2 (en) * | 2009-11-15 | 2014-08-19 | Mellanox Technologies Ltd. | Cross-channel network operation offloading for collective operations |
US20110209091A1 (en) * | 2010-02-24 | 2011-08-25 | Visteon Global Technologies, Inc. | System and method to measure bandwidth in human to machine interfaces |
US20110268446A1 (en) | 2010-05-02 | 2011-11-03 | Cune William P | Providing digital data services in optical fiber-based distributed radio frequency (rf) communications systems, and related components and methods |
US9525488B2 (en) | 2010-05-02 | 2016-12-20 | Corning Optical Communications LLC | Digital data services and/or power distribution in optical fiber-based distributed communications systems providing digital data and radio frequency (RF) communications services, and related components and methods |
US8422401B1 (en) * | 2010-05-11 | 2013-04-16 | Daintree Networks, Pty. Ltd. | Automated commissioning of wireless devices |
US8897134B2 (en) * | 2010-06-25 | 2014-11-25 | Telefonaktiebolaget L M Ericsson (Publ) | Notifying a controller of a change to a packet forwarding configuration of a network element over a communication channel |
US8648699B2 (en) | 2010-07-19 | 2014-02-11 | Mobile Aspects, Inc. | Item tracking system and arrangement |
EP2606707A1 (en) | 2010-08-16 | 2013-06-26 | Corning Cable Systems LLC | Remote antenna clusters and related systems, components, and methods supporting digital data signal propagation between remote antenna units |
US9252874B2 (en) | 2010-10-13 | 2016-02-02 | Ccs Technology, Inc | Power management for remote antenna units in distributed antenna systems |
WO2012115843A1 (en) | 2011-02-21 | 2012-08-30 | Corning Cable Systems Llc | Providing digital data services as electrical signals and radio-frequency (rf) communications over optical fiber in distributed communications systems, and related components and methods |
US8774145B2 (en) | 2011-04-01 | 2014-07-08 | Intel Corporation | Techniques to determine user presence |
CN102571433B (en) | 2012-01-11 | 2014-07-30 | 华为技术有限公司 | Method and device for showing network paths |
US8731030B1 (en) | 2012-03-20 | 2014-05-20 | Remec Broadband Wireless Llc | Transmission system of digital radio information using repeaters while minimizing data transfer latency |
CN102625416B (en) * | 2012-03-28 | 2015-03-18 | 华为技术有限公司 | Working method of multimode terminal and multimode terminal |
FI125092B (en) * | 2012-07-18 | 2015-05-29 | Arm Finland Oy | A method, apparatus and system for transmitting and receiving data packets |
WO2014016705A2 (en) | 2012-07-27 | 2014-01-30 | Assa Abloy Ab | Setback controls based on out-of-room presence information |
WO2014016695A2 (en) | 2012-07-27 | 2014-01-30 | Assa Abloy Ab | Presence-based credential updating |
US8761142B2 (en) | 2012-10-19 | 2014-06-24 | Ubiquiti Networks, Inc. | Distributed seamless roaming in wireless networks |
US9386551B2 (en) | 2012-11-30 | 2016-07-05 | Qualcomm Incorporated | Systems and methods for synchronization of wireless devices in an ad-hoc network |
US9179409B2 (en) * | 2012-12-03 | 2015-11-03 | Qualcomm Incorporated | Multiple access scheme for narrowband channels |
US9397820B2 (en) | 2013-02-04 | 2016-07-19 | Ubiquiti Networks, Inc. | Agile duplexing wireless radio devices |
US20160218406A1 (en) | 2013-02-04 | 2016-07-28 | John R. Sanford | Coaxial rf dual-polarized waveguide filter and method |
US9543635B2 (en) | 2013-02-04 | 2017-01-10 | Ubiquiti Networks, Inc. | Operation of radio devices for long-range high-speed wireless communication |
US9531067B2 (en) | 2013-02-08 | 2016-12-27 | Ubiquiti Networks, Inc. | Adjustable-tilt housing with flattened dome shape, array antenna, and bracket mount |
US9112790B2 (en) | 2013-06-25 | 2015-08-18 | Google Inc. | Fabric network |
US9356875B2 (en) * | 2013-07-22 | 2016-05-31 | Cisco Technology, Inc. | Using statistical and historical information of topology metrics in constrained networks |
US9892618B2 (en) | 2013-08-09 | 2018-02-13 | Mobile Aspects, Inc. | Signal emitting member attachment system and arrangement |
US9348013B2 (en) | 2013-09-18 | 2016-05-24 | Mobile Aspects, Inc. | Item hanger arrangement, system, and method |
US9191037B2 (en) | 2013-10-11 | 2015-11-17 | Ubiquiti Networks, Inc. | Wireless radio system optimization by persistent spectrum analysis |
US9224124B2 (en) | 2013-10-29 | 2015-12-29 | Mobile Aspects, Inc. | Item storage and tracking cabinet and arrangement |
US9197314B1 (en) | 2013-11-08 | 2015-11-24 | Gogo Llc | Data delivery to devices on vehicles using multiple forward links |
US9577857B2 (en) | 2013-11-08 | 2017-02-21 | Gogo Llc | Adaptive modulation in a hybrid vehicle communication system |
US9467828B2 (en) | 2013-11-08 | 2016-10-11 | Gogo Llc | Systems and methods for configuring an electronic device for cellular-based communications |
US9369991B2 (en) | 2013-11-08 | 2016-06-14 | Gogo Llc | Hybrid communications for devices on vehicles |
US9326217B2 (en) | 2013-11-08 | 2016-04-26 | Gogo Llc | Optimizing usage of modems for data delivery to devices on vehicles |
US9967020B2 (en) | 2013-11-08 | 2018-05-08 | Gogo Llc | Facilitating communications between on-board electronic devices and terrestrial devices |
US9232546B2 (en) | 2013-11-08 | 2016-01-05 | Gogo Llc | Systems and methods for two-part electronic device registration |
TWI510910B (en) * | 2013-11-11 | 2015-12-01 | Wistron Corp | Computer system and remote control method thereof |
US10034400B2 (en) | 2013-12-04 | 2018-07-24 | Mobile Aspects, Inc. | Item storage arrangement system and method |
US10574474B2 (en) | 2014-03-07 | 2020-02-25 | Ubiquiti Inc. | Integrated power receptacle wireless access point (AP) adapter devices |
EP3114884B1 (en) | 2014-03-07 | 2019-10-23 | Ubiquiti Inc. | Cloud device identification and authentication |
WO2015134755A2 (en) | 2014-03-07 | 2015-09-11 | Ubiquiti Networks, Inc. | Devices and methods for networked living and work spaces |
EP3120642B1 (en) | 2014-03-17 | 2023-06-07 | Ubiquiti Inc. | Array antennas having a plurality of directional beams |
EP3780261B1 (en) | 2014-04-01 | 2022-11-23 | Ubiquiti Inc. | Antenna assembly |
US9648468B2 (en) | 2014-05-01 | 2017-05-09 | Gogo Llc | Systems and methods for facilitating voice-based communications |
US9712668B2 (en) | 2014-05-01 | 2017-07-18 | Gogo Llc | Systems and methods for notifying electronic devices of voice-based communication requests |
US10425536B2 (en) | 2014-05-08 | 2019-09-24 | Ubiquiti Networks, Inc. | Phone systems and methods of communication |
JP2015220560A (en) * | 2014-05-16 | 2015-12-07 | 株式会社日立製作所 | Routing control method and routing control program |
US9503956B2 (en) | 2014-05-30 | 2016-11-22 | Gogo Llc | Systems and methods for facilitating communications originating from a non-terrestrial network |
US9655073B2 (en) | 2014-05-30 | 2017-05-16 | Gogo Llc | Systems and methods for communicating with non-terrestrial electronic devices |
US9716542B2 (en) | 2014-05-30 | 2017-07-25 | Gogo Llc | Systems and methods for facilitating communications destined for a non-terrestrial network |
CN106233797B (en) | 2014-06-30 | 2019-12-13 | 优倍快网络公司 | radio equipment alignment tool and method |
CN109905842B (en) | 2014-06-30 | 2020-11-17 | 优倍快公司 | Method for determining radio transmission characteristics |
US10182438B2 (en) | 2014-08-31 | 2019-01-15 | Ubiquiti Networks, Inc. | Methods and apparatuses for graphically indicating station efficiency and pseudo-dynamic error vector magnitude information for a network of wireless stations |
US10659163B2 (en) | 2014-09-25 | 2020-05-19 | Corning Optical Communications LLC | Supporting analog remote antenna units (RAUs) in digital distributed antenna systems (DASs) using analog RAU digital adaptors |
US10164332B2 (en) | 2014-10-14 | 2018-12-25 | Ubiquiti Networks, Inc. | Multi-sector antennas |
US9781814B2 (en) | 2014-10-15 | 2017-10-03 | Abl Ip Holding Llc | Lighting control with integral dimming |
CA2908835C (en) | 2014-10-15 | 2017-04-04 | Abl Ip Holding Llc | Lighting control with automated activation process |
WO2016071902A1 (en) | 2014-11-03 | 2016-05-12 | Corning Optical Communications Wireless Ltd. | Multi-band monopole planar antennas configured to facilitate improved radio frequency (rf) isolation in multiple-input multiple-output (mimo) antenna arrangement |
WO2016075696A1 (en) | 2014-11-13 | 2016-05-19 | Corning Optical Communications Wireless Ltd. | Analog distributed antenna systems (dass) supporting distribution of digital communications signals interfaced from a digital signal source and analog radio frequency (rf) communications signals |
WO2016098109A1 (en) | 2014-12-18 | 2016-06-23 | Corning Optical Communications Wireless Ltd. | Digital interface modules (dims) for flexibly distributing digital and/or analog communications signals in wide-area analog distributed antenna systems (dass) |
WO2016098111A1 (en) | 2014-12-18 | 2016-06-23 | Corning Optical Communications Wireless Ltd. | Digital- analog interface modules (da!ms) for flexibly.distributing digital and/or analog communications signals in wide-area analog distributed antenna systems (dass) |
US9596642B2 (en) | 2014-12-22 | 2017-03-14 | Life Safety Distribution Ag | Wireless network with multiple paths between nodes |
US10284268B2 (en) | 2015-02-23 | 2019-05-07 | Ubiquiti Networks, Inc. | Radio apparatuses for long-range communication of radio-frequency information |
EP3920650B1 (en) | 2015-05-13 | 2022-08-31 | LG Electronics Inc. | Method and device for performing random access process in unlicensed band |
JP6646247B2 (en) * | 2015-08-19 | 2020-02-14 | ヤマハ株式会社 | Audio system, audio equipment, and audio system management method |
US10284383B2 (en) | 2015-08-31 | 2019-05-07 | Mellanox Technologies, Ltd. | Aggregation protocol |
CN108353232B (en) | 2015-09-11 | 2020-09-29 | 优倍快公司 | Compact broadcast access point device |
CN107079035B (en) | 2015-09-25 | 2020-05-19 | 优倍快公司 | Compact and integrated key controller device for monitoring a network |
US9761954B2 (en) | 2015-10-09 | 2017-09-12 | Ubiquiti Networks, Inc. | Synchronized multiple-radio antenna systems and methods |
US10521283B2 (en) | 2016-03-07 | 2019-12-31 | Mellanox Technologies, Ltd. | In-node aggregation and disaggregation of MPI alltoall and alltoallv collectives |
US10206176B2 (en) * | 2016-09-06 | 2019-02-12 | Mediatek Inc. | Efficient coding switching and modem resource utilization in wireless communication systems |
WO2018064818A1 (en) * | 2016-10-08 | 2018-04-12 | 浙江国自机器人技术有限公司 | Route configuration based ap switching method for mobile robot |
US10924641B2 (en) | 2017-07-10 | 2021-02-16 | Ubiquiti Inc. | Wearable video camera medallion with circular display |
JP7157146B2 (en) | 2017-09-27 | 2022-10-19 | ユービキティ インコーポレイテッド | System for automatically secured remote access to local networks |
KR101936296B1 (en) * | 2017-12-14 | 2019-04-03 | 오학서 | Method for RF Communicating between Automated Guided Vehicle and Manufacturing Equipment of Automated Material Handling System |
US11482352B2 (en) | 2018-01-09 | 2022-10-25 | Ubiquiti Inc. | Quick connecting twisted pair cables |
JP7042677B2 (en) * | 2018-04-04 | 2022-03-28 | 任天堂株式会社 | Information processing equipment, control method, information processing system, and control program |
US11277455B2 (en) | 2018-06-07 | 2022-03-15 | Mellanox Technologies, Ltd. | Streaming system |
US11493621B2 (en) * | 2018-11-09 | 2022-11-08 | Apple Inc. | Secure multicast/broadcast ranging |
CN109361446A (en) * | 2018-11-15 | 2019-02-19 | 盐田国际集装箱码头有限公司 | A kind of maritime affairs trunk desk |
CN111314272B (en) * | 2018-12-12 | 2021-10-29 | 大唐移动通信设备有限公司 | Task processing method and device |
US11625393B2 (en) | 2019-02-19 | 2023-04-11 | Mellanox Technologies, Ltd. | High performance computing system |
EP3699770A1 (en) | 2019-02-25 | 2020-08-26 | Mellanox Technologies TLV Ltd. | Collective communication system and methods |
JP2022547955A (en) | 2019-09-13 | 2022-11-16 | ユービキティ インコーポレイテッド | Augmented reality for internet connection settings |
CN111063212B (en) * | 2019-11-26 | 2021-04-06 | 浙江工业大学 | Fuzzy Skyline real-time parking recommendation method with privacy protection |
US11593124B2 (en) | 2020-01-14 | 2023-02-28 | The Toronto-Dominion Bank | System and method for automated configuration of a computing device |
US11750699B2 (en) | 2020-01-15 | 2023-09-05 | Mellanox Technologies, Ltd. | Small message aggregation |
US11252027B2 (en) | 2020-01-23 | 2022-02-15 | Mellanox Technologies, Ltd. | Network element supporting flexible data reduction operations |
US11876885B2 (en) | 2020-07-02 | 2024-01-16 | Mellanox Technologies, Ltd. | Clock queue with arming and/or self-arming features |
US11864231B2 (en) * | 2020-08-20 | 2024-01-02 | Qualcomm Incorporated | Listen-before-talk (LBT) aware autonomous sensing for sidelink |
US11652585B1 (en) * | 2020-09-01 | 2023-05-16 | Kamal Dalmia | Implementing and operating an ethernet network using dynamic physical layer node ID assignments |
US11556378B2 (en) | 2020-12-14 | 2023-01-17 | Mellanox Technologies, Ltd. | Offloading execution of a multi-task parameter-dependent operation to a network device |
US11922237B1 (en) | 2022-09-12 | 2024-03-05 | Mellanox Technologies, Ltd. | Single-step collective operations |
Family Cites Families (172)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US475408A (en) * | 1892-05-24 | mills | ||
US3781815A (en) | 1972-02-15 | 1973-12-25 | Ibm | Terminal interface for a serial loop communications system having store and forward capability |
US4164628A (en) | 1977-06-06 | 1979-08-14 | International Telephone And Telegraph Corporation | Processor for multiple, continuous, spread spectrum signals |
US4685149A (en) * | 1977-07-29 | 1987-08-04 | Rockwell International Corporation | Meteor scatter burst communication system |
US4414661A (en) | 1981-07-02 | 1983-11-08 | Trancom Ab | Apparatus for communicating with a fleet of vehicles |
US4332027A (en) | 1981-10-01 | 1982-05-25 | Burroughs Corporation | Local area contention network data communication system |
US4449248A (en) | 1982-02-01 | 1984-05-15 | General Electric Company | Battery saving radio circuit and system |
US4630314A (en) | 1982-09-27 | 1986-12-16 | Meteor Communications Corporation, Inc. | Meteor burst communication system |
US4663706A (en) | 1982-10-28 | 1987-05-05 | Tandem Computers Incorporated | Multiprocessor multisystem communications network |
US4726014A (en) * | 1983-01-11 | 1988-02-16 | U.S. Holding Company, Inc. | Cellular mobile radio service telephone system |
US4745408A (en) | 1983-04-09 | 1988-05-17 | Nec Corporation | Radio paging system and receiver therefor |
US5303286A (en) * | 1991-03-29 | 1994-04-12 | Space Systems/Loral, Inc. | Wireless telephone/satellite roaming system |
JPS60182825A (en) | 1984-02-29 | 1985-09-18 | Nec Corp | Radiotelephony system |
JPS6152038A (en) | 1984-08-22 | 1986-03-14 | Nec Corp | Radio selective calling receiver |
US4747126A (en) | 1985-02-20 | 1988-05-24 | A T & E Corporation | Voice mail system on magnetic tape |
DE3572430D1 (en) | 1985-04-02 | 1989-09-21 | Ibm | Infrared communication system |
US4644532A (en) | 1985-06-10 | 1987-02-17 | International Business Machines Corporation | Automatic update of topology in a hybrid network |
US5168271A (en) * | 1985-11-27 | 1992-12-01 | Seiko Corp. | Paging and time keeping system with transmission of time slot identification used for synchronization |
US4725992A (en) | 1985-12-03 | 1988-02-16 | Amoco Corporation | Adaptive seismometer group recorder having enhanced operating capabilities |
US4804956A (en) * | 1986-03-31 | 1989-02-14 | General Signal Corporation | Rearrangeable digital signal space division switching system |
JPH06105884B2 (en) | 1986-05-06 | 1994-12-21 | 日本電気株式会社 | Wireless telephone system |
NL8601712A (en) * | 1986-07-01 | 1988-02-01 | Koninkl Philips Electronics Nv | COMMUNICATION NETWORK, IN PARTICULAR A TELEPHONE NETWORK AND DATA COMMUNICATION NETWORK COMPOSED OF A COLLECTION OF BUTTON UNITS, WHICH FOLLOWS SPECIFIC FACILITIES UNDER DUTIES. |
US4748658A (en) * | 1986-07-16 | 1988-05-31 | Bell Communications Research, Inc. | Architecture for allocating resources in a telecommunications network |
JPS6333021A (en) | 1986-07-26 | 1988-02-12 | Nec Corp | Portable wireless telephone set |
US4942552A (en) | 1986-11-20 | 1990-07-17 | Allen-Bradley Company, Inc. | Method and apparatus for saving and performing industrial control commands |
CA1290020C (en) * | 1987-02-09 | 1991-10-01 | Steven Messenger | Wireless local area network |
KR910008738B1 (en) | 1987-02-20 | 1991-10-19 | 닛본 덴기 가부시기가이샤 | Portable radio apparatus having battery saved channel scanning function |
US4789983A (en) * | 1987-03-05 | 1988-12-06 | American Telephone And Telegraph Company, At&T Bell Laboratories | Wireless network for wideband indoor communications |
US5099509A (en) | 1987-04-17 | 1992-03-24 | Dytel Corporation | Integration of voice store and forward facility |
US4804954A (en) | 1987-04-30 | 1989-02-14 | Motorola, Inc. | Battery saving method for portable communications receivers |
US4837858A (en) | 1987-04-30 | 1989-06-06 | Motorola, Inc. | Subscriber unit for a trunked voice/data communication system |
US4799253A (en) | 1987-07-20 | 1989-01-17 | Motorola, Inc. | Colocated cellular radiotelephone systems |
US5008882A (en) | 1987-08-17 | 1991-04-16 | California Institute Of Technology | Method and apparatus for eliminating unsuccessful tries in a search tree |
US4857915A (en) | 1987-10-20 | 1989-08-15 | Telefind Corp. | Paging receiver with paging receiver identification code digits transmitted in order of increasing significance |
DE3838945A1 (en) * | 1987-11-18 | 1989-06-08 | Hitachi Ltd | NETWORK SYSTEM WITH LOCAL NETWORKS AND WITH A HIERARCHICAL CHOICE OF PATH |
JPH0642691B2 (en) | 1988-05-21 | 1994-06-01 | 富士通株式会社 | Mobile phone terminal |
CA1306501C (en) | 1988-05-28 | 1992-08-18 | Toshimitsu Shimizu | Monitoring system for radio communication apparatus |
US5203020A (en) | 1988-06-14 | 1993-04-13 | Kabushiki Kaisha Toshiba | Method and apparatus for reducing power consumption in a radio telecommunication apparatus |
US4885780A (en) * | 1988-07-15 | 1989-12-05 | Bell Communications Research, Inc. | Method for call routing in a network |
US4926064A (en) | 1988-07-22 | 1990-05-15 | Syntonic Systems Inc. | Sleep refreshed memory for neural network |
US5425051A (en) | 1992-11-09 | 1995-06-13 | Norand Corporation | Radio frequency communication network having adaptive parameters |
US4884266A (en) * | 1988-08-09 | 1989-11-28 | Sun Microsystems, Inc. | Variable speed local area network |
US5087099A (en) | 1988-09-02 | 1992-02-11 | Stolar, Inc. | Long range multiple point wireless control and monitoring system |
JPH0616601B2 (en) | 1988-09-07 | 1994-03-02 | 三洋電機株式会社 | Power save circuit of received radio wave processing circuit and power save method thereof |
US4989230A (en) | 1988-09-23 | 1991-01-29 | Motorola, Inc. | Cellular cordless telephone |
JP2805767B2 (en) | 1988-09-26 | 1998-09-30 | 日本電気株式会社 | Wireless transceiver |
US4864559A (en) | 1988-09-27 | 1989-09-05 | Digital Equipment Corporation | Method of multicast message distribution |
CH676179A5 (en) | 1988-09-29 | 1990-12-14 | Ascom Zelcom Ag | |
US4916726A (en) | 1988-09-29 | 1990-04-10 | American Tel-A-System, Inc. | Telephone answering service with integrated voice and textual message storage |
US4995099A (en) | 1988-12-01 | 1991-02-19 | Motorola, Inc. | Power conservation method and apparatus for a portion of a predetermined signal |
US4991204A (en) * | 1988-12-05 | 1991-02-05 | Nippon Telegraph And Telephone Corporation | Adaptive routing control method |
US5025486A (en) | 1988-12-09 | 1991-06-18 | Dallas Semiconductor Corporation | Wireless communication system with parallel polling |
GB2226475A (en) | 1988-12-23 | 1990-06-27 | Philips Electronic Associated | Power economising in multiple user radio systems |
US5150361A (en) | 1989-01-23 | 1992-09-22 | Motorola, Inc. | Energy saving protocol for a TDM radio |
US5163080A (en) | 1989-02-22 | 1992-11-10 | Amvox, Inc. | Voice messaging |
US5128938A (en) | 1989-03-03 | 1992-07-07 | Motorola, Inc. | Energy saving protocol for a communication system |
US6714983B1 (en) * | 1989-04-14 | 2004-03-30 | Broadcom Corporation | Modular, portable data processing terminal for use in a communication network |
US5590346A (en) | 1993-07-26 | 1996-12-31 | Norand Corporation | Antenna cap for computer device utilizing a radio card |
US5031098A (en) * | 1989-04-28 | 1991-07-09 | Norand Corporation | Transaction control system including portable data terminal and mobile customer service station |
GB8910085D0 (en) | 1989-05-03 | 1989-06-21 | British Telecomm | Mobile communications system |
GB8911395D0 (en) | 1989-05-18 | 1989-07-05 | British Telecomm | Data communications network |
US5142279A (en) | 1989-06-05 | 1992-08-25 | Motorola, Inc. | Acknowledge back paging system having the capability of matching variable length data messages to pager addresses |
US5095480A (en) * | 1989-06-16 | 1992-03-10 | Fenner Peter R | Message routing system for shared communication media networks |
US5157687A (en) * | 1989-06-29 | 1992-10-20 | Symbol Technologies, Inc. | Packet data communication network |
US5103461A (en) * | 1989-06-29 | 1992-04-07 | Symbol Technologies, Inc. | Signal quality measure in packet data communication |
US5142550A (en) * | 1989-06-29 | 1992-08-25 | Symbol Technologies, Inc. | Packet data communication system |
US5029183A (en) * | 1989-06-29 | 1991-07-02 | Symbol Technologies, Inc. | Packet data communication network |
US5089813A (en) | 1989-07-19 | 1992-02-18 | Motorola, Inc. | Method of super battery saving in a selective call receiver |
US5237321A (en) * | 1989-07-24 | 1993-08-17 | Motorola, Inc. | Method and apparatus for automatically transmitting a paging message in an alternate paging system |
US5056085A (en) | 1989-08-09 | 1991-10-08 | Harris Corporation | Flood-and-forward routing for broadcast packets in packet switching networks |
US4964121A (en) | 1989-08-30 | 1990-10-16 | Motorola, Inc. | Battery saver for a TDM system |
US5285208A (en) | 1989-09-05 | 1994-02-08 | Motorola, Inc. | Power management system for a worldwide multiple satellite communications system |
US5093926A (en) | 1989-09-29 | 1992-03-03 | Motorola, Inc. | Trunked communication system scanning method and apparatus |
US5121408A (en) | 1989-10-16 | 1992-06-09 | Hughes Aircraft Company | Synchronization for entry to a network in a frequency hopping communication system |
US5117449A (en) | 1989-11-03 | 1992-05-26 | Motorola, Inc. | Dual receiver apparatus for integrated paging and radiotelephone functions |
US5257019A (en) | 1989-11-03 | 1993-10-26 | Motorola, Inc. | Satellite selective call signalling system |
JPH03154437A (en) | 1989-11-13 | 1991-07-02 | Nippon Telegr & Teleph Corp <Ntt> | Incoming call control system |
US5239670A (en) * | 1989-11-30 | 1993-08-24 | Motorola, Inc. | Satellite based global paging system |
US5252963A (en) | 1990-01-04 | 1993-10-12 | Motorola, Inc. | "Selective call receiver" |
US5055659A (en) | 1990-02-06 | 1991-10-08 | Amtech Technology Corp. | High speed system for reading and writing data from and into remote tags |
CA2077458C (en) | 1990-03-03 | 2001-10-30 | Robert Edmund Todd | Communications system |
US5327572A (en) * | 1990-03-06 | 1994-07-05 | Motorola, Inc. | Networked satellite and terrestrial cellular radiotelephone systems |
US5150360A (en) | 1990-03-07 | 1992-09-22 | Digital Equipment Corporation | Utilization of redundant links in bridged networks |
GB2241851A (en) | 1990-03-09 | 1991-09-11 | Philips Electronic Associated | Optimising transmitter power in a communications system |
US5119397A (en) | 1990-04-26 | 1992-06-02 | Telefonaktiebolaget L M Ericsson | Combined analog and digital cellular telephone system having a secondary set of control channels |
US6359872B1 (en) | 1997-10-28 | 2002-03-19 | Intermec Ip Corp. | Wireless personal local area network |
US5103459B1 (en) | 1990-06-25 | 1999-07-06 | Qualcomm Inc | System and method for generating signal waveforms in a cdma cellular telephone system |
US5224150A (en) | 1990-07-06 | 1993-06-29 | Simon Neustein | Paging system |
US5117422A (en) * | 1990-07-09 | 1992-05-26 | Itt Corporation | Method for providing an efficient and adaptive management of message routing in a multi-platform and apparatus communication system |
AU641541B2 (en) * | 1990-07-25 | 1993-09-23 | Norand Corporation | Multi-level radio-frequency communication system |
US5058023A (en) | 1990-07-30 | 1991-10-15 | Motorola, Inc. | Vehicle position determining apparatus |
US5584048A (en) | 1990-08-17 | 1996-12-10 | Motorola, Inc. | Beacon based packet radio standby energy saver |
US5128932A (en) * | 1990-08-27 | 1992-07-07 | Bell Communications Research, Inc. | Traffic flow control and call set-up in multi-hop broadband networks |
US5224152A (en) | 1990-08-27 | 1993-06-29 | Audiovox Corporation | Power saving arrangement and method in portable cellular telephone system |
US5119502A (en) | 1990-08-30 | 1992-06-02 | Telefonaktiebolaget L M Ericsson | Periodic system ordered rescan in a cellular communication system |
US5239466A (en) | 1990-10-04 | 1993-08-24 | Motorola, Inc. | System for selectively routing and merging independent annotations to a document at remote locations |
US5142534A (en) | 1990-10-17 | 1992-08-25 | O'neill Communications, Inc. | Wireless integrated voice-data communication system |
JP2646831B2 (en) | 1990-10-25 | 1997-08-27 | 日本電気株式会社 | Selective call receiver |
US5159592A (en) * | 1990-10-29 | 1992-10-27 | International Business Machines Corporation | Network address management for a wired network supporting wireless communication to a plurality of mobile users |
US5265270A (en) | 1990-10-31 | 1993-11-23 | Motorola, Inc. | Method and apparatus for providing power conservation in a communication system |
US5243645A (en) * | 1990-11-01 | 1993-09-07 | At&T Bell Laboratories | Automatic system for forwarding of calls |
US5179721A (en) | 1990-11-05 | 1993-01-12 | Motorola Inc. | Method for inter operation of a cellular communication system and a trunking communication system |
GB9024684D0 (en) | 1990-11-13 | 1991-01-02 | Cognito Group Ltd | A method of communicating data |
WO1992010042A1 (en) | 1990-11-26 | 1992-06-11 | Motorola, Inc. | Method and apparatus for paging in a communication system |
US5230084A (en) | 1990-12-06 | 1993-07-20 | Motorola, Inc. | Selective call receiver having extended battery saving capability |
GB2250892A (en) | 1990-12-14 | 1992-06-17 | Philips Electronic Associated | A method of operating a radio communications system |
US5581173A (en) | 1991-01-03 | 1996-12-03 | Beckwith Electric Co., Inc. | Microcontroller-based tap changer controller employing half-wave digitization of A.C. signals |
US5297144A (en) | 1991-01-22 | 1994-03-22 | Spectrix Corporation | Reservation-based polling protocol for a wireless data communications network |
US5280480A (en) | 1991-02-21 | 1994-01-18 | International Business Machines Corporation | Source routing transparent bridge |
US5081402A (en) | 1991-02-22 | 1992-01-14 | Comfortex Corporation | Low power consumption wireless data transmission and control system |
US5134347A (en) | 1991-02-22 | 1992-07-28 | Comfortex Corporation | Low power consumption wireless data transmission and control system |
US5152006A (en) | 1991-02-25 | 1992-09-29 | Motorola, Inc. | Receiver controller method and apparatus |
US5432946A (en) * | 1991-04-11 | 1995-07-11 | International Business Machines Corp. | LAN server personal computer with unattended activation capability |
CA2040234C (en) | 1991-04-11 | 2000-01-04 | Steven Messenger | Wireless coupling of devices to wired network |
US5260990A (en) | 1991-04-30 | 1993-11-09 | Boston Technology, Inc. | Multiple integrations unit for coupling different switching systems to a message storage system |
US6374311B1 (en) | 1991-10-01 | 2002-04-16 | Intermec Ip Corp. | Communication network having a plurality of bridging nodes which transmit a beacon to terminal nodes in power saving state that it has messages awaiting delivery |
US5940771A (en) | 1991-05-13 | 1999-08-17 | Norand Corporation | Network supporting roaming, sleeping terminals |
US5394436A (en) | 1991-10-01 | 1995-02-28 | Norand Corporation | Radio frequency local area network |
US5708680A (en) | 1991-05-14 | 1998-01-13 | Norand Corporation | Network utilizing a controller and base transceivers to route voice packets |
CA2043127C (en) | 1991-05-23 | 1996-05-07 | Martin Handforth | Wireless communication zone management system |
US5828695A (en) | 1991-06-03 | 1998-10-27 | British Telecommunications Public Limited Company | QAM system in which the constellation is modified in accordance with channel quality |
US5123029A (en) | 1991-06-21 | 1992-06-16 | International Business Machines Corporation | Broadcast-initiated bipartite frame multi-access protocol |
JPH054530A (en) | 1991-06-27 | 1993-01-14 | Mazda Motor Corp | Differential limit device for vehicle |
GB9114808D0 (en) | 1991-07-09 | 1991-08-28 | Philips Electronic Associated | Information transmission system |
US5291479A (en) | 1991-07-16 | 1994-03-01 | Digital Technics, Inc. | Modular user programmable telecommunications system with distributed processing |
US5293639A (en) | 1991-08-09 | 1994-03-08 | Motorola, Inc. | Reduction of power consumption in a portable communication unit |
US5241542A (en) | 1991-08-23 | 1993-08-31 | International Business Machines Corporation | Battery efficient operation of scheduled access protocol |
US5361397A (en) | 1991-08-26 | 1994-11-01 | Motorola, Inc. | Communication device and system capable of automatic programmable energizing |
SE519357C2 (en) | 1991-08-29 | 2003-02-18 | Ericsson Telefon Ab L M | Cellular radio telephone communication system for multimode type mobile radio telephone stations |
US5392023A (en) | 1991-09-06 | 1995-02-21 | Motorola, Inc. | Data communication system with automatic power control |
US5390206A (en) | 1991-10-01 | 1995-02-14 | American Standard Inc. | Wireless communication system for air distribution system |
US5504746A (en) * | 1991-10-01 | 1996-04-02 | Norand Corporation | Radio frequency local area network |
DE69233608T2 (en) * | 1991-10-01 | 2007-03-01 | Broadcom Corp., Irvine | Local radio frequency network |
US5274666A (en) | 1991-10-16 | 1993-12-28 | Telephonics Corporation | Wireless communication system |
GB9127404D0 (en) * | 1991-12-24 | 1992-02-19 | Ncr Co | Local area network system |
US5461627A (en) | 1991-12-24 | 1995-10-24 | Rypinski; Chandos A. | Access protocol for a common channel wireless network |
US5440560A (en) | 1991-12-24 | 1995-08-08 | Rypinski; Chandos A. | Sleep mode and contention resolution within a common channel medium access method |
JP2796464B2 (en) | 1991-12-27 | 1998-09-10 | 株式会社日立製作所 | Wireless communication system and wireless communication method |
US5255268A (en) * | 1992-02-04 | 1993-10-19 | International Business | Data distribution network with improved broadcast feature |
US5260988A (en) | 1992-02-06 | 1993-11-09 | Motorola, Inc. | Apparatus and method for alternative radiotelephone system selection |
US5533097A (en) | 1992-02-26 | 1996-07-02 | Motorola, Inc. | Portable communication system comprising a local and wide area communication units which can store a communication when the wide area communication system is not available |
US5392287A (en) | 1992-03-05 | 1995-02-21 | Qualcomm Incorporated | Apparatus and method for reducing power consumption in a mobile communications receiver |
US5343512A (en) | 1992-03-27 | 1994-08-30 | Motorola, Inc. | Call setup method for use with a network having mobile end users |
US5712868A (en) | 1992-06-30 | 1998-01-27 | Motorola, Inc. | Dual mode communication network |
US5745523A (en) | 1992-10-27 | 1998-04-28 | Ericsson Inc. | Multi-mode signal processing |
US5371734A (en) | 1993-01-29 | 1994-12-06 | Digital Ocean, Inc. | Medium access control protocol for wireless network |
US5331634A (en) | 1993-01-29 | 1994-07-19 | Digital Ocean, Inc. | Technique for bridging local area networks having non-unique node addresses |
GB9304636D0 (en) | 1993-03-06 | 1993-04-21 | Ncr Int Inc | A method of accessing a communication system |
US5649308A (en) | 1993-04-12 | 1997-07-15 | Trw Inc. | Multiformat auto-handoff communications handset |
US5509035A (en) | 1993-04-14 | 1996-04-16 | Qualcomm Incorporated | Mobile station operating in an analog mode and for subsequent handoff to another system |
US5550895A (en) | 1993-12-02 | 1996-08-27 | Lucent Technologies Inc. | Bimodal portable telephone |
US5504476A (en) | 1994-07-28 | 1996-04-02 | Motorola, Inc. | Method and apparatus for generating alerts based upon content of messages received by a radio receiver |
DK0815648T3 (en) | 1995-03-16 | 2002-07-15 | Qualcomm Inc | Direct digital synthesizer powered PLL frequency synthesizer with purification PLL |
US5680311A (en) | 1995-12-29 | 1997-10-21 | Snap-On Tools Company | Long term firing and spark display |
US5696468A (en) | 1996-02-29 | 1997-12-09 | Qualcomm Incorporated | Method and apparatus for autocalibrating the center frequency of a voltage controlled oscillator of a phase locked loop |
US6069880A (en) | 1997-05-19 | 2000-05-30 | Qualcomm Incorporated | Method and apparatus for scanning other frequency pilot signals in a code division multiple access communication system |
US5825253A (en) | 1997-07-15 | 1998-10-20 | Qualcomm Incorporated | Phase-locked-loop with noise shaper |
US5910752A (en) | 1997-12-09 | 1999-06-08 | Qualcomm Incorporated | Frequency demodulator with resampled output |
US6348841B1 (en) | 1998-09-01 | 2002-02-19 | Qualcomm Incorporated | Wideband voltage controlled oscillator with good noise immunity |
CN1399814A (en) * | 1999-08-02 | 2003-02-26 | 高通股份有限公司 | Method and apparatus for multiple band voltage controlled oscillator with noise immunity |
US6928275B1 (en) * | 2000-05-08 | 2005-08-09 | Qualcomm Incorporated | Method and apparatus for compensating local oscillator frequency error |
US6731146B1 (en) * | 2000-05-09 | 2004-05-04 | Qualcomm Incorporated | Method and apparatus for reducing PLL lock time |
US6522871B1 (en) | 2000-05-09 | 2003-02-18 | Qualcomm, Incorporated | Method and apparatus for compensating local oscillator frequency error through environmental control |
US6694129B2 (en) * | 2001-01-12 | 2004-02-17 | Qualcomm, Incorporated | Direct conversion digital domain control |
US6583675B2 (en) | 2001-03-20 | 2003-06-24 | Broadcom Corporation | Apparatus and method for phase lock loop gain control using unit current sources |
US6764988B2 (en) * | 2001-04-18 | 2004-07-20 | Kimberly-Clark Worldwide, Inc. | Skin cleansing composition incorporating anionic particles |
US6764983B1 (en) * | 2001-06-29 | 2004-07-20 | Iowa State University Research Foundation | Antioxidant compositions and industrial fluids containing same |
US6819197B2 (en) * | 2002-01-29 | 2004-11-16 | Qualcomm Incorporated | Multiple bandwidth phase lock filters for multimode radios |
US6823033B2 (en) * | 2002-03-12 | 2004-11-23 | Qualcomm Inc. | ΣΔdelta modulator controlled phase locked loop with a noise shaped dither |
US6937872B2 (en) * | 2002-04-15 | 2005-08-30 | Qualcomm Incorporated | Methods and apparatuses for measuring frequencies of basestations in cellular networks using mobile GPS receivers |
US6888913B2 (en) * | 2002-07-02 | 2005-05-03 | Qualcomm Incorporated | Wireless communication device with phase-locked loop oscillator |
US6911856B2 (en) * | 2003-07-31 | 2005-06-28 | Qualcomm Inc. | Delay matching for clock distribution in a logic circuit |
-
1992
- 1992-10-01 DE DE69233608T patent/DE69233608T2/en not_active Expired - Lifetime
- 1992-10-01 CA CA002120520A patent/CA2120520A1/en not_active Abandoned
- 1992-10-01 AT AT02012917T patent/ATE321387T1/en not_active IP Right Cessation
- 1992-10-01 WO PCT/US1992/008610 patent/WO1993007691A1/en active IP Right Grant
- 1992-10-01 EP EP92922425A patent/EP0606396B1/en not_active Expired - Lifetime
- 1992-10-01 AU AU28009/92A patent/AU664864B2/en not_active Ceased
- 1992-10-01 EP EP02012917A patent/EP1246404B1/en not_active Expired - Lifetime
- 1992-10-01 AT AT92922425T patent/ATE219310T1/en not_active IP Right Cessation
- 1992-10-01 DE DE69232639T patent/DE69232639T2/en not_active Expired - Lifetime
-
1993
- 1993-05-03 US US08/056,827 patent/US5295154A/en not_active Expired - Lifetime
-
1998
- 1998-04-24 US US09/066,125 patent/US6046992A/en not_active Expired - Fee Related
-
2000
- 2000-04-04 US US09/542,424 patent/US6826165B1/en not_active Expired - Fee Related
-
2004
- 2004-10-15 US US10/965,991 patent/US7483397B2/en not_active Expired - Fee Related
-
2006
- 2006-06-26 US US11/474,907 patent/US20060268806A1/en not_active Abandoned
-
2009
- 2009-01-27 US US12/360,383 patent/US20090172189A1/en not_active Abandoned
- 2009-05-19 US US12/468,698 patent/US7873343B2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
WO1993007691A1 (en) | 1993-04-15 |
EP0606396A1 (en) | 1994-07-20 |
EP0606396A4 (en) | 1995-05-17 |
US5295154A (en) | 1994-03-15 |
US7483397B2 (en) | 2009-01-27 |
US20090172189A1 (en) | 2009-07-02 |
DE69232639T2 (en) | 2003-02-20 |
EP1246404A3 (en) | 2002-10-16 |
EP1246404B1 (en) | 2006-03-22 |
AU664864B2 (en) | 1995-12-07 |
DE69233608T2 (en) | 2007-03-01 |
EP1246404A2 (en) | 2002-10-02 |
US20090247241A1 (en) | 2009-10-01 |
US6046992A (en) | 2000-04-04 |
EP0606396B1 (en) | 2002-06-12 |
US6826165B1 (en) | 2004-11-30 |
US7873343B2 (en) | 2011-01-18 |
DE69232639D1 (en) | 2002-07-18 |
US20060268806A1 (en) | 2006-11-30 |
US20050078647A1 (en) | 2005-04-14 |
AU2800992A (en) | 1993-05-03 |
ATE321387T1 (en) | 2006-04-15 |
ATE219310T1 (en) | 2002-06-15 |
DE69233608D1 (en) | 2006-05-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2120520A1 (en) | A radio frequency local area network | |
US5504746A (en) | Radio frequency local area network | |
US7917145B2 (en) | Radio frequency local area network | |
US5428636A (en) | Radio frequency local area network | |
US5740366A (en) | Communication network having a plurality of bridging nodes which transmit a beacon to terminal nodes in power saving state that it has messages awaiting delivery | |
US7552246B2 (en) | Communication network having a plurality of bridging nodes which transmit a beacon to terminal nodes in power saving state that it has messages awaiting delivery | |
US6400702B1 (en) | Radio frequency local area network | |
US7899951B2 (en) | Communication network having a plurality of bridging nodes which transmits a polling message with backward learning technique to determine communication pathway | |
US6084867A (en) | Apparatus and method of routing data in a radio frequency local area network | |
US7940669B2 (en) | Route and link evaluation in wireless mesh communications networks | |
US7797009B2 (en) | Method and system for providing a network protocol for utility services | |
US8233905B2 (en) | Load management in wireless mesh communications networks | |
AU701114B2 (en) | A radio frequency local area network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
FZDE | Discontinued |