(12) United States Patent
`McMillin
`
`US007027773B1
`(10) Patent No.:
`US 7,027,773 B1
`(45) Date of Patent:
`Apr. 11, 2006
`
`(54) ON/OFF KEYING NODE-TO-NODE
`MESSAGING TRANSCEIVER NETWORK
`WITH DYNAMIC ROUTING AND
`CONFIGURING
`
`O
`O
`(75) Inventor: Brian K. McMillin, Dallas, TX (US)
`(73) Assignee: AFX Technology Group International,
`Inc., Dallas, TX (US)
`Subject to any disclaimer, the term of this
`patent is extended or adjusted under 35
`U.S.C. 154(b) by 0 days.
`
`(*) Notice:
`
`(21) Appl. No.: 09/578,237
`(22) Filed:
`May 24, 2000
`
`Related U.S. Application Data
`(60) Provisional application No. 60/136,539, filed on May 28,
`1999.
`(51) Int. Cl.
`H04B 5/00
`
`(2006.01)
`
`(52) U.S. Cl. ...................... 455/412:455/445; 455/518;
`370/390; 375/200.57
`
`(58) Field of Classification Search ................ 455/4.1.2,
`455/445, 518, 432.1, 432.2, 433, 40, 41.1,
`455/47.2, 503, 500,517; 370/390, 315,349,
`370/397; 375/200.57; 395/200.51, 200.73
`See application file for complete search history.
`References Cited
`U.S. PATENT DOCUMENTS
`
`(56)
`
`3,705,523 A 12/1972 Alouisa .................. 179.18 EA
`4,284.848 A
`8, 1981 Frost
`4,494,119 A
`1, 1985 Wimbush ................... 343/457
`4,651,156 A
`3/1987 Martinez .................... 342/457
`4,799,062 A
`1/1989 Sanderford, Jr. et al. ... 342/450
`4,818,998 A
`4/1989 Apsell et al. ...
`... 342/44
`5,021,794. A
`6, 1991 Lawrence ................... 342/457
`5,086,389 A
`2, 1992 Hassett et al. .............. 364/401
`5,202,829 A
`4, 1993 Geier ......................... 364/449
`5,223,844 A
`6, 1993 Mansell et al. ............. 342.357
`
`2, 1994 Hassett et al. .............. 340,905
`5,289,183 A
`9, 1994 Hassett .............
`... 364/401
`5,351,187 A
`SS E. St. et al. ................ 364/449
`5.448,569 A
`9/1995 Huang et al. .............. 370.951
`5,473,602 A 12/1995 McKenna et al.
`5.485,163 A
`1/1996 Singer et al. ............... 342/457
`IS
`son et al. ................3
`i
`5.490,079 A
`2/1996 Sharpe et al. ............... 364/467
`5,493,692 A
`2f1996 Goldstein et al.
`5,525,992 A
`6/1996 Froschermeier .............. 342/42
`5,550,551 A
`8/1996 Alesio ........................ 342/457
`(Continued)
`FOREIGN PATENT DOCUMENTS
`O687O75 A2 12/1995
`0913965 A1
`5, 1999
`WO 98.42096
`9, 1998
`
`EP
`EP
`WO
`
`OTHER PUBLICATIONS
`Jubin, J., et al., “The DARPA Packet Radio Network Pro
`tocols.” Proceedings of the IEEE, Jan. 1987, pp. 21–32, vol.
`75, No. 1.
`Basagni, S., et al., “Geographic Messaging in Wireless Ad
`Hoc Networks, IEEE, May 16, 1999, pp. 1957–1961.
`ASH Transceiver Designer's Guide, published by RFM,
`Mar. 10, 1999, pp. 1–53.
`Primary Examiner Tilahun Gesesse
`(74) Attorney, Agent, or Firm-Senniger Powers
`(57)
`ABSTRACT
`The invention is a system operating on a reference fre
`quency. The system comprises a plurality of at least three
`nodes. Each node hands off a message received from another
`node to a Subsequent node. Each of the nodes comprises a
`transceiver receiving a message on the reference frequency
`from another node and transmitting the received message on
`the reference frequency to a Subsequent node, and a con
`troller controlling operation of the transceiver to receive
`the... message transmitted by another node and to transmit
`the received message to a Subsequent node.
`
`33 Claims, 25 Drawing Sheets
`
`
`
`Sonos Ex. 1018, p. 1
` Sonos v. Google
` IPR2021-00964
`
`

`

`US 7,027,773 B1
`Page 2
`
`U.S. PATENT DOCUMENTS
`
`5,572,221 A 1 1/1996 Marlevi et al. ............. 342/.452
`5,631,642 A
`5/1997 Brockelsby et al. ........ 340/993
`5,640,384 A
`6/1997 Du ......................
`... 370,221
`5,640,390 A
`6, 1997 Sakamoto et al. .......... 370,346
`5,675,344 A 10/1997 Tong et al. ................. 342/457
`5,682,139 A 10/1997 Pradeep et al. ............. 340,539
`5,686,902 A 1 1/1997 Reis et al. ............. 340,825.54
`5,706,014 A
`1/1998 Abbasi ....................... 342.357
`5,731,757 A
`3/1998 Layson, Jr. ....
`... 340,573
`5,731,785 A
`3, 1998 Lemelson et al. .......... 342.357
`5,734,963 A
`3/1998 Fitzgerald et al. ......... 455,312
`5,742.233 A
`4, 1998 Hoffman et al. ..... ... 340,573
`5,748,147 A
`5/1998 Bickley et al. ............. 342/457
`5,758,285 A
`5/1998 Chavez, Jr. et al.
`5,767,804 A
`6/1998 Murphy ...................... 342.357
`5,787,117 A
`7, 1998 Ash ........................... 375,223
`5,787,174 A
`7/1998 Tuttle .......................... 380.23
`5,787,344 A
`7, 1998 Scheinert .................... 455,422
`
`9/1998 Hassett ....................... 340,928
`5,805,082 A
`5,818,619 A 10/1998 Medved et al. ............. 359,172
`5,822.309 A * 10/1998 Ayanoglu et al. ........... 370,315
`5,835,061 A 11/1998 Stewart ...
`342/457
`5,835,857 A 1 1/1998 Otten ......................... 455,410
`5,838,237 A 11/1998 Revell et al.
`340,573
`5,841,352 A 11/1998 Prakash ......
`340,573
`5,844,522 A 12/1998 Sheffer et al.
`342/457
`5,852,401 A 12, 1998 Kita ........................... 340,539
`5,875,179 A
`2/1999 Tikalsky .....
`370,315
`5,875, 186 A
`2/1999 Belanger et al. ............ 370,331
`5,974,236 A * 10/1999 Sherman ..................... TO9,221
`5,987,011 A * 11/1999
`370,331
`6,028,857 A
`2, 2000
`370,351
`6,046,978 A
`4/2000 Melnik ....................... 370,221
`6,104,712 A
`8, 2000 Robert et al.
`370,389
`6,338,087 B1
`1/2002 Okanoue .................... 709,222
`6,414.955 B1 * 7/2002 Clare et al. ................. 370,390
`
`
`
`* cited by examiner
`
`Sonos Ex. 1018, p. 2
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 1 of 25
`
`US 7,027,773 B1
`
`
`
`S
`
`O
`(D
`
`Sonos Ex. 1018, p. 3
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 2 of 25
`
`US 7,027,773 B1
`
`
`
`
`
`
`
`
`
`2 E.---
`
`Sonos Ex. 1018, p. 4
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 3 of 25
`
`US 7,027,773 B1
`
`FIG.3
`
`
`
`POWER
`SUPPLY
`OPTIONS
`
`
`
`
`
`
`
`
`
`
`
`
`
`FIG.4
`
`
`
`
`
`
`
`POWER
`SUPPLY
`OPTIONS
`
`OPTIONAL
`GPS
`AUGMENTATION
`RECEIVER
`
`
`
`
`
`GPS
`My MiliiON-INTERFACE
`
`GPS
`RECEIVER
`
`POWER
`CONTROL
`
`DATA
`My MINION-INTERFACE
`
`
`
`WIDE AREA
`NETWORK
`INTERFACE
`
`POWER
`CONTROL
`
`Sonos Ex. 1018, p. 5
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 4 of 25
`
`US 7,027,773 B1
`
`FIG.5
`
`POWER
`SUPPLYS
`OPTIONS
`
`OPTIONAL
`EXPANSION
`MEMORY
`
`
`
`
`
`DATA
`MEMORY
`
`
`
`
`
`
`
`
`
`10
`
`530
`
`REAL-TIME
`CLOCK
`
`550
`
`540
`
`FLASH
`PROGRAM
`MEMORY
`
`50
`
`MCROCONTROLLER
`
`
`
`
`
`
`
`AVD
`CONVERTER
`
`LEVEL
`560
`
`PERIPHERAL
`OPTIONAL
`INTERFACE - INTERACEs
`570
`
`SIGNAL
`STRENGTH
`
`DATA CONTROL
`
`ANTENNA
`
`
`
`
`
`MINIONNETTM
`RADEO
`TRANSCEIVER
`
`Sonos Ex. 1018, p. 6
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 5 of 25
`
`US 7,027,773 B1
`
`
`
`Sonos Ex. 1018, p. 7
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 6 of 25
`
`US 7,027,773 B1
`
`
`
`Sonos Ex. 1018, p. 8
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 7 Of 25
`
`US 7,027,773 B1
`
`
`
`Sonos Ex. 1018, p. 9
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 8 of 25
`
`US 7,027,773 B1
`
`FIG.7
`
`- - - - - - - -
`OPTIONAL POWER
`SOURCES
`SOLAR POWER
`PRIMARY BATTERY
`RECHARGEABLE BATERY
`EXTERNAL SOURCE
`
`|
`
`THERMO-ELECTRIC
`TELEPHONE LINE
`HOUSEHOLD CURRENT
`
`-
`l-
`- - - - - -
`
`
`
`..mu MINION
`
`|
`
`- - - - - - - --
`OPTIONAL COMMUNICATION
`INTERFACE
`CABLE TV
`GPS RECEIVER
`GPSDIFFERENTIAL
`AUGMENTATION
`WIDE-AREA
`WRELESS NETWORK
`LOCAL-AREA
`
`CELLULAR MODEM
`LAND LINE MODEM
`SATELLITE DATA MODEM
`PERSONAMPUTER
`INTERFACE
`J
`PDAINTERFACE
`-------
`
`- - - - - - - - - - - - ------ - -
`OPTIONAL APPLICATION-SPECIFICINTERFACES
`VEHICLE INTERFACE
`DOOR LOCK NTERFACE
`uTun METERINTERACE
`APPLIANCE INTERFACE
`BUILDING CONTROL
`INTERFACE
`
`MAGNETIC FLUX
`TEMPERATURE
`METEOROLOGY
`ACCELEROMETER/
`A TITUDE
`
`USERDISPLAY
`USER KEYBOARD
`
`L
`
`PRESSURE/
`ATTITUDE
`
`-
`
`Sonos Ex. 1018, p. 10
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 9 Of 25
`
`US 7,027,773 B1
`
`
`
`
`
`
`
`GND 3
`
`WCC 1
`
`
`
`WCC 2
`TR1003
`
`VN
`
`LP2980
`ONOFF
`
`Sonos Ex. 1018, p. 11
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 10 of 25
`
`US 7,027,773 B1
`
`FIG. 9
`
`TIMING AND
`POWER
`MANAGEMENT
`(FIGURE 9A)
`
`RECEIVE
`MESSAGE
`(FIGURE 9B)
`
`PROCESS
`MESSAGE
`(FIGURE 9C)
`
`TRANSMT
`MESSAGE
`(FIGURE 9D)
`
`
`
`
`
`ADD MESSAGES
`TOXMIT
`QUEUE
`(FIGURE 9E)
`
`Sonos Ex. 1018, p. 12
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 11 of 25
`
`US 7,027,773 B1
`
`FIG. 9A
`
`
`
`POWER W
`RECEIVE
`SWAKE UNES
`SLEEP
`FIG.9B
`MODE
`
`MESSAGE
`RECEIVED
`2
`
`MESSAGE
`TO $END
`
`CHECK
`TIMERS FOR
`ETs
`
`PROCESS
`MESSAGE
`F.G. 9C
`
`TRANSMT
`MESSAGE
`FIG. 9D
`
`ADD
`MESSAGES
`TO
`XMIT
`QUEUE
`
`Sonos Ex. 1018, p. 13
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 12 of 25
`
`US 7,027,773 B1
`
`FIG. 9B
`WAIT FOR FALLING
`EDGE OF RECDSG.
`
`920
`
`924
`
`
`
`
`
`
`
`y
`
`=5 HALFB
`INTERVALS
`
`932
`WA FOR FANG
`NO
`928 EDGE OF RECO S.G.
`930
`
`MESSAGE -a-
`BEGINS
`
`SFRON YES, PUT "O"
`N BUFFER
`
`
`
`
`
`
`
`
`
`
`
`
`
`PUT "O"
`N BUFFER
`
`
`
`PUT 1
`N BUFFER
`EX-942
`
`N BUFFER
`950
`
`
`
`PUT "O"
`N BUFFER
`
`PUT "1"
`IN BUFFER
`
`956
`
`
`
`PFR
`
`954
`
`PU 0.
`NBUFFER
`
`958
`
`Sonos Ex. 1018, p. 14
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 13 of 25
`
`US 7,027,773 B1
`
`GET MSG FROM
`XMITQUEUE
`
`INSERT OUR ID
`ASSENDER
`
`RECORD XMIT
`TIME + OFFSET
`
`960
`
`962
`
`964
`
`966
`
`YES
`
`
`
`
`
`MSG
`CONTAINS
`TIME FIELD
`2
`
`968
`
`
`
`INSERT
`CURRENT
`TME FIELD
`
`970
`
`COMPUTE CRC
`
`SEND TRAINING
`BITS
`
`SEND ENCODED
`ZERO
`
`SEND DATA
`BITS
`
`974
`
`976
`
`978
`
`980
`
`Sonos Ex. 1018, p. 15
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 14 of 25
`
`US 7,027,773 B1
`
`901
`
`FIG. 9D
`
`
`
`RECORD TIME OF
`MESSAGE RECEPT
`
`903
`
`SET INTERNAL CLOCK
`TO TIME OF RECEPT
`
`ADD ALL MINION D'S
`FROM HEADER TO LIST
`OF KNOWN IDS
`
`RECIPIENT D
`MATCHES OWN
`MINION ID
`
`DUPLICATE
`MSG
`
`oUEUE ÉXPLICT
`ACK FOR XMTR
`
`DESTINATIONN YES HANDLE MSG
`D MATCHES OUR
`BY
`OWN
`TYPE CODE
`
`DESTINATION
`NTABLE OF
`KNOWN ID'S
`
`NO OUEUEMSG BACK
`TO SENDER
`
`HOP LIMIT
`OR TIMEOUT
`--
`
`OUEUE EXPLCT ACK
`
`OUEUE MSG FOR XMIT
`TO NEXT RECIPIENT
`
`Sonos Ex. 1018, p. 16
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 15 Of 25
`
`US 7,027,773 B1
`
`FIG. 9E
`
`
`
`TRAINING PATTERN
`
`Sonos Ex. 1018, p. 17
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 16 of 25
`
`US 7,027,773 B1
`
`
`
`CINTOELSENA
`
`
`
`NOI LOETTOO
`
`NOI?OERH
`
`??T TIN?????dNr.081Sv=
`
`
`
`ENYT ONTMOELLSVE
`
`JIŽ £
`
`
`
`E??? CINQO81Sv=
`
`CINTOELSEWA
`
`NO|JLO3TTOO
`
`NO|50ER-J
`
`Sonos Ex. 1018, p. 18
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 17 of 25
`
`US 7,027,773 B1
`
`FIG. 1 OB
`
`
`
`
`
`
`
`
`
`EASTBOUND LANE
`EASTBOUND LAN
`EASTBOUND LA
`EASTBOUND LA
`
`
`
`
`
`WESTBOUND
`COLLECTION
`REGION
`
`3OUND LANE 1
`BOUND LANE 2
`BOUND LANE 3
`ASTBOUND LANE 4
`
`SURVEY REGION
`
`WESTBOUND
`COLLECTION
`REGION
`
`Sonos Ex. 1018, p. 19
` Sonos v. Google
` IPR2021-00964
`
`

`

`lualud *S11
`
`900Z `H *AdV
`
`SZ 30 81 JamiS
`
`
`
` u la c'Lzo'L S11
`
`COLLECTION BOUNDARY
`
`EASTBOUND DATA
`
`TBOUND LANE 4
`
`E
`
`MIN4
`
`•I•••
`
`S BOUND LANE 3
`
`EAST: UND LANE 2
`EASTBO D LANE 1
`
`.1.1•111,
`
`EASTBO D LANE 4
`
`EASTBOUN LAN
`
`2
`
`EASTBOUND
`
`E 1
`
`EASTBOUND
`
`SU VEY MI ION
`
`MEDIAN
`
`COLLECTION BOUNDARY
`
`WESTBOUND DATA
`FIG. 11A
`
`Sonos Ex. 1018, p. 20
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 19 of 25
`
`US 7,027,773 B1
`
`FIG. 11B
`
`SURVEY MINION
`
`a
`
`W
`a QZs WSTBOUND LANE 3
`(S S-P2SN ZS ESTOUND LANE 2
`SxSz. XESENANE
`MEANX ).5d3 XX
`EASTBOUND A2S-sex YV
`EASTBOUN2 ADE2/G sexya
`
`imp a
`EASTBOUND LANE sys) wner um is
`EASTBOUND ANE 40
`are u
`v
`u
`is is are
`
`SURVEY MINION
`
`FIG. 14
`-
`Y
`BUDDYS
`
`*
`V
`\
`
`as amo m me -- a- - -
`
`f
`/
`
`
`
`-1N
`NGATE)
`f -1
`
`-
`
`Sonos Ex. 1018, p. 21
` Sonos v. Google
` IPR2021-00964
`
`

`

`lualud °S11
`
`900Z `H *AdV
`
`SZ Jo OZ WIN
`
`la cu'Lzo'L S11
`
`GARAGE ACCOUNT
`
`ACCOUNT
`CUSTOMER
`
`ACCOUNT
`SYSTEM
`
`o
`
`HOUSE
`
`CLEARING
`AUTOMATIC
`RESERVE
`FEDERAL
`
`X
`0
`
`CUSTOMER
`
`BANK
`
`SYSTEM
`
`BANK
`
`DATABASE
`SYSTEM
`
`J
`
`L
`
`WAN
`
`;J
`
`o
`
`GATEWAY
`
`no
`
`o
`
`1
`
`GARAGE
`PARKING
`
`Li
`
`o
`
`F
`
`FIG. 12
`
`Sonos Ex. 1018, p. 22
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 21 of 25
`
`US 7,027,773 B1
`
`
`
`
`
`-HO HL\/d
`
`ETIEJOW
`
`|NOINIWN
`
`<!-- - - -*-- ~~
`
`EGJISOV/O}}
`
`EGJISORY/O}}
`
`Sonos Ex. 1018, p. 23
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 22 of 25
`
`US 7,027,773 B1
`
`A72. A
`
`
`
`Sonos Ex. 1018, p. 24
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 23 Of 25
`
`US 7,027,773 B1
`
`
`
`
`
`
`
`Sonos Ex. 1018, p. 25
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 24 of 25
`
`US 7,027,773 B1
`
`
`
`(S)&BAHES NOILVOITddº
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`ARJO ISIH
`
`
`
`ESVE VIVO
`
`
`
`LEIN NOINHW
`
`Sonos Ex. 1018, p. 26
` Sonos v. Google
` IPR2021-00964
`
`

`

`U.S. Patent
`
`Apr. 11, 2006
`
`Sheet 25 Of 25
`
`US 7,027,773 B1
`
`s
`SWELSÅS
`
`(JEST)
`
`>|EST)
`
`SW3] SÅS
`
`
`
`(S) MEANJES
`
`
`
`X?? JONA LBN
`
`
`
`
`
`Sonos Ex. 1018, p. 27
` Sonos v. Google
` IPR2021-00964
`
`

`

`US 7,027,773 B1
`
`1.
`ONAOFF KEYING NODE-TO-NODE
`MESSAGING TRANSCEIVER NETWORK
`WITH DYNAMIC ROUTING AND
`CONFIGURING
`
`This application claims benefit of U.S. Provisional
`60/136,539 filed May 28, 1999.
`BACKGROUND OF THE INVENTION
`
`5
`
`2
`receiver using table updates computed on a message
`by-message basis;
`wirelessly synchronizes clocks using edge detection in
`Manchester encoded data messages;
`reduces wireless traffic by randomly increasing delays
`between individual message transmissions as the net
`work traffic load increases, by automatically reducing
`the output power of the transmission to a level just
`sufficient to ensure a high probability of reception by
`the receiver, by eliminating extraneous traffic by deriv
`ing routing information by Snooping on network data
`messages to reduce the number or routing table update
`messages, by implementing a method of limiting the
`number of hops a message will take over the network
`that is specified by the message originator, and/or by
`implementing a flexible method of causing the message
`to time-out if it is not delivered by a time set by the
`originator,
`shares network resources among low-cost intelligent data
`radios wherein the resources may include time
`synchronization, virtual geolocation services, sensor or
`actuator interfaces, shared memory and wide-area net
`work access; and
`uses wireless data messages to modify and upgrade firm
`ware in intelligent wireless data radios.
`In one form, the invention is a system operating on a
`reference frequency. The system comprises a plurality of at
`least three nodes. Each node hands off a message received
`from another node to a Subsequent node. Each of the nodes
`comprises a transceiver receiving a message on the reference
`frequency from another node and transmitting the received
`message on the reference frequency to a Subsequent node,
`and a controller controlling operation of the transceiver to
`receive the message transmitted by another node and to
`transmit the received message to a Subsequent node.
`In another form, the invention is a system operating on a
`reference frequency comprising a plurality of nodes, each
`node comprising a transceiver and a corresponding control
`ler for controlling the operation of the transceiver. Each
`controller operates its corresponding transceiver as one or
`more of the following types of nodes. An originating type of
`node provides a message in a mode in which the transceiver
`transmits on the reference frequency a message to another
`node of the system. An intermediate type of node hands off
`a message in a mode in which the transceiver receives on the
`reference frequency the message transmitted by another
`node and transmits on the reference frequency the received
`message to a Subsequent node other than the node from
`which the message was received. A destination type of node
`receives the message in a mode in which the transceiver
`receives on the reference frequency the message transmitted
`by another node.
`In another form, the invention is a message having a
`protocol which permits the message to be successively
`transmitted by a wireless network of transceiver nodes
`employing node-to-node messaging. A message including
`data is sent from a first node originating via one or more
`intermediate nodes to a last node designated by the first node
`as the destination of the message. The message comprises:
`data bits corresponding to the data; originating bits identi
`fying the first node from which the message originates;
`destination bits identifying the last node to which the
`message is destined; transmitting bits identifying the current
`node transmitting the message; and receiving bits identify
`ing the next node intended to receive the message currently
`being transmitted.
`In yet another form, the invention is a system operating on
`a reference frequency comprising an originating node, a
`
`10
`
`15
`
`25
`
`30
`
`35
`
`1. Field of the Invention
`The invention generally relates to multilevel networks
`and, in particular, to a wireless network of intelligent trans
`ceiver nodes which employ local processing and node-to
`node data messaging to hand off messages from an origi
`nation point to a destination point.
`2. Description of the Prior Art
`Wireless networks such as the cellular phone system are
`well known in the prior art. Such networks are complex and
`are based on the apparent need for real time connectivity.
`Consumer applications of networks such as cellular phones
`have promoted a perception that robust real-time connec
`tions are a requirement of wireless communications. Real
`time connections are very expensive in terms of equipment
`and air-time. Many wireless data applications have been
`designed around real-time communications because it has
`been available, but many more potential applications have
`been unable to be cost justified using this technology.
`For many applications the requirement for a real-time
`connection is an artificial constraint, and has limited the
`development of short-range messaging between devices.
`There is a need for an inexpensive, flexible, expandable
`network to replace traditional network concepts which
`require the installation of an expensive fixed infrastructure
`prior to the operation of the network. Cellular phones, for
`example, require that every Subscriber phone communicates
`only with the cellular base station. Even though there may
`be thousands of actual phones in the area, they are not
`capable of direct communication with each other.
`SUMMARY OF THE INVENTION
`It is an object of this invention to provide a low cost,
`multi-node system which hands off messages from node-to
`node; a system of nodes which hands off messages and
`provides implicit and/or explicit acknowledgment of the
`hand off; a flexible, adaptable multi-node system which is
`applicable in a plurality of environments and for a plurality
`of uses; a multi-node system having stationary nodes and
`mobile nodes (known as “MinionTM devices”) the position
`of which can be determined by the stationary nodes; a
`multi-node system which permits nodes to communicate
`with a wide area network or a global positioning system via
`a selected number of nodes; a multi-node system which
`operates multiple applications at each node; and a multi
`55
`node system which interfaces with a plurality of "gateways'.
`e.g., wide area network (WAN) connections to other com
`munications networks, whether wired or not, such as tele
`phone or CATV or wireless, or satellite or terrestrial.
`Additional objects includes providing a system and
`method which:
`encodes Manchester data using a micro-controller and
`firmware;
`compensates for processor clock variations using periodic
`updates of entries in a table-driven Manchester coding
`algorithm and adaptively compensating for differences
`in processor clock speed between a sender and a
`
`40
`
`45
`
`50
`
`60
`
`65
`
`Sonos Ex. 1018, p. 28
` Sonos v. Google
` IPR2021-00964
`
`

`

`3
`plurality of intermediate nodes and a destination node. The
`originating node provides data to the intermediate node. The
`originating node comprises a first transceiver transmitting on
`the reference frequency a message including the data and
`receiving on the reference frequency an implicit and/or
`explicit acknowledgment that the message has been received
`by one of the intermediate nodes, and a first controller
`controlling operation of the first transceiver to transmit the
`message to the intermediate node and to receive the implicit
`and/or explicit acknowledgment that the message has been
`received by one of the intermediate nodes. Each of the
`intermediate nodes hands off the message from one node of
`the system to another node of the system. Each of the
`intermediate nodes comprises a second transceiver receiving
`the message transmitted on the reference frequency by the
`one node and transmitting on the reference frequency an
`implicit and/or explicit acknowledgment to the one node that
`the message has been received by the intermediate node. The
`second transceiver also transmits on the reference frequency
`the received message and receives on the reference fre
`quency an implicit and/or explicit acknowledgment that the
`message has been received by the another node. A second
`controller controls operation of the second transceiver to
`receive the message transmitted by the one node and to
`transmit an implicit and/or explicit acknowledgment that the
`message has been received by the intermediate node and to
`thereafter transmit the received message and receive the
`implicit and/or explicit acknowledgment that the message
`has been received by the another node. A destination node
`receives the message from one of the intermediate nodes.
`The destination node comprises: a third transceiver receiv
`ing on the reference frequency the message transmitted by
`the one intermediate node and transmitting on the reference
`frequency an implicit and/or explicit acknowledgment to the
`one intermediate node that the message has been received by
`the destination node, and a third controller controlling the
`operation of the third transceiver to receive the message
`transmitted by the one intermediate node and to transmit an
`implicit and/or explicit acknowledgment that the message
`has been received by the destination node.
`BRIEF DESCRIPTION OF THE DRAWINGS
`FIG. 1 is a diagram illustrating the communications path
`of a MinionNetTM network according to the invention.
`FIG. 2 is a diagram illustrating the data flow of a
`MinionNetTM network according to the invention.
`FIG. 3 is a block diagram of a geoMinionTM device
`according to the invention.
`FIG. 4 is a block diagram of a gateway MinionTM device
`according to the invention.
`FIG. 5 is a block diagram of a uMinionTM device (also
`referred to as a “microMinionTM device' and which may be
`pronounced “mu-MinionTM device') according to the inven
`tion.
`FIG. 6A is a sample network of MinionTM devices (e.g., a
`MinionNetTM network).
`FIG. 6B is a diagram of MinionNetTM network according
`to the invention configured as a virtual geolocation system.
`FIG. 6C is a simplified sample network of MinionTM
`devices (e.g., a MinionNetTM network).
`FIG. 7 is a block diagram of the various power supply
`options, communications interfaces and application specific
`interfaces, including various gateways, which may be asso
`ciated with a uMinionTM device according to the invention.
`FIG. 8 is a schematic of the MinionTM device. illustrating
`the inputs/outputs to the micro-controller and the inputs/
`outputs to the transceiver.
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`US 7,027,773 B1
`
`10
`
`15
`
`25
`
`30
`
`35
`
`4
`FIG. 9 is a block diagram illustrating the operation of the
`invention.
`FIGS. 9A 9D are flow charts of the operation of the
`micro-controller.
`FIG. 9E is a timing diagram of four data waveforms
`according to the invention.
`FIGS. 10A and 10B are diagrams of a survey region of a
`vehicle travel lane determination system according to the
`invention.
`FIGS. 11A and 11B are diagrams of survey region of
`MinionTM devices of a vehicle travel lane determination
`system according to the invention.
`FIG. 12 is a diagram of a parking garage system according
`to the invention.
`FIG. 13 is a diagram of a toll road system according to the
`invention.
`FIG. 14 is a diagram of a buddy system according to the
`invention.
`FIG. 15 is a perspective view of one preferred embodi
`ment of a MinionTM device and printed antenna on a printed
`circuit board.
`FIG. 16 is a perspective view of one preferred embodi
`ment of a MinionTM device on a printed circuit board with
`an external antenna connection.
`FIG. 17 is a perspective view with parts broken away
`illustrating a roadside survey MinionTM device or a geoMin
`ionTM device anchored to a post such as a sign post.
`FIGS. 18A and 18B are a block diagram of a system of the
`invention including MinionNetTM central services which
`include the system History and Current Databases, Network
`Servers which communicate with each available Gateway
`and Application Servers which communicate with the vari
`ous user applications. Internet connections with both the
`MinionNet and with the application users are protected with
`web server firewalls.
`The Appendix provides a MinionTM firmware operational
`overview of one preferred embodiment of the invention.
`
`DETAILED DESCRIPTION OF PREFERRED
`EMBODIMENTS
`
`The MinionNetTM Network 100 as illustrated in FIGS. 1
`and 2 is a wireless data network characterized by short-range
`device-to-device messaging. (MinionTM, MinionNetTM,
`uMinion TM, muMinionTM, micro MinionTM,
`gateway MinionTM, geoMinionTM and capTM are trademarks
`of the assignee. As used hereinafter, Minion device means
`MinionTM, MinionNetTM, uMinionTM, muMinionTM,
`microMinionTM, gateway MinionTM, and/or geoMinionTM,
`unless otherwise specified. The trademark designation “TM'
`will not be used hereafter for convenience.) Messages are
`automatically routed through multiple device-to-device
`hops to provide robust area coverage, redundancy, noise
`immunity and dynamic routing and reconfiguration. These
`device-to-device messages do not have a time-critical
`requirement such as would be found in a real-time voice
`connection Such as a cellular telephone net.
`The devices used by the MinionNet network 100 are
`generally referred to as Minion devices and are actually
`extremely inexpensive two-way data radios, Such as a trans
`ceiver as will be described below. In particular, the Minion
`devices may be a uMinion (microMinion) device 110, a
`gateway Minion device 120 or a geoMinion device 130, each
`of which is a trademark of the assignee and will be described
`below. One key feature of these Minion devices is that they
`
`Sonos Ex. 1018, p. 29
` Sonos v. Google
` IPR2021-00964
`
`

`

`5
`are able to exchange short data messages with each other as
`indicated by the arrows in FIG. 1. Each Minion device
`becomes a part of a community and can share the burden of
`conveying messages throughout an area. Any Minion device
`can directly communicate with any other Minion device
`within range. This facilitates message hand off and acknowl
`edgment as will be described below.
`DISCUSSION ILLUSTRATIONS
`Cocktail Party Illustration
`The network 100 according to the invention communi
`cates in a manner that can be illustrated by a discussion at
`a cocktail party. Individuals form Small groups and commu
`nicate among themselves. These groups are not static. From
`time to time new members join in or old members wander
`off to join another group. Some of the people just listen in
`without saying anything important. The members of the
`group are aware of the other members and may solicit
`information from anyone nearby. Occasionally a person
`(Jack) will decide that he needs to locate another individual
`(Jane). If he looks around and discovers they are in the same
`group there is no problem. Otherwise, he is likely to ask the
`people nearby “Have you seen Jane lately?' He will prob
`ably receive a variety of responses. Most people will ignore
`him, either because they didn't hear him or because they
`have no relevant information. One might say "I saw Jane an
`hour ago.” Another might say 'Jane was over near the punch
`bowl a few minutes ago.” This gives Jack the hint that he
`needs to move through the crowd. He may need to ask again,
`but eventually he will locate Jane.
`A similar situation arises it there is a phone call for Jane
`at the group . A messenger may take the call, then ask the
`people nearby for Jane. Eventually the message will be
`conveyed and Jane will be able to take the call. Sometimes
`the search process will take too long and the caller will hang
`up. This is not a problem since Jane will eventually get the
`message and be able to return the call. If Jane had left the
`group there is a high probability that the helpful messenger
`will be able to discover this and convey the additional
`information to the caller.
`In keeping with the loosely structured nature of the group
`there is no central governing authority, no broadcast
`announcements or global paging system. Individuals move
`around freely, arrive and depart independently, and converse
`with one another as they see fit. As will be pointed out below,
`Minion devices function in a similar manner.
`Moderated Conference Illustration
`More particularly, the network 100 according to the
`invention communicates in a manner that is in contrast to the
`controlled environment of a moderated conference. Here
`there is a rigidly structured environment in which only one
`person at a time speaks. There is only one public address
`system and it is controlled by a moderator. The moderator
`will make a series of general announcements which establish
`the topics that will be allowed in this conference. This
`general information is assumed to be required by all of the
`participants. During the question and answer period partici
`pants make requests to be recognized. They will ask a
`question which may need to be repeated by the moderator
`for the benefit of the other participants. The moderator will
`answer the question or Solicit responses from the partici
`pants. Each response will be handled in the same way:
`participant requests recognition, moderator recognizes him,
`participant makes a statement, moderator repeats statement,
`etc. There is no direct discussion between participants. In
`contrast, the MinionNet network as will be described below
`in detail does not constitute such a rigidly constructed
`network.
`
`25
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`US 7,027,773 B1
`
`10
`
`15
`
`6
`
`The Minioninet Network
`The MinionNet network operates along the same lines as
`the group. Each of the individuals communicates only with
`their neighbors that are in close proximity including those
`that move in. A large amount of information can be
`exchanged in a short period of time because the Small groups
`all operate in parallel. Roving messengers can pass impor
`tant data from one group to another while Suppressing less
`important items. Shared resources Such as telephones are
`efficiently used and inexpensive. There is a high level of
`cooperation among individuals of the group or, in the case
`of the nodes MinionNet ne