1. Field
This application relates generally to systems and methods for monitoring and messaging of wireless communication devices in a specific geographical location.
2. General Background
Previous systems have been developed to attempt and locate a wireless communication device utilizing wireless access points and routers. For example, the wireless communication device could be in a location having several buildings in range of the wireless communication device. However, these systems do not necessarily provide a precise location. In another situation, the wireless communication device may be in a building with several floors, each floor having it own location tag. In this situation, the wireless communication device may be closer to a location tag on a different floor.
The present disclosure provides a solution for providing wireless communication devices with precise location awareness, system monitoring and area specific messaging capabilities in environments where an accurate GPS position may not be able to be acquired, such as within a multi-story building. The system monitoring component performs health checks and validity tests on location tags within an enabled environment, while the area messaging component provides area-specific messaging to enabled wireless communication devices. As used in this specification, “location tag” is a stationary programmable device with a wireless transceiver, “Bluetooth” capable for example, and a micro-controller. The location tag is preferably programmed with one or more of its own device or “friendly” name selection parameters, geographical position, max power settings, installation identifier, floor number and payload type.
A wireless communication device operable to detect a plurality of location tags is disclosed. A wireless communication device periodically interrogates its environment and determines which location tag is most practically near. The wireless communication device then connects to that location tag and requests that any additional data information relevant to the specific location associated with that location tag be sent back to the wireless communication device. The most practically near is one which is the closest accessible location, for example, a wireless communication device on the second floor of a multi-story building may be closest to a location tag located on the ceiling of the first floor, but is not easily accessible from the first floor.
The foregoing aspects and advantages of present disclosure will become more readily apparent and understood with reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:
The present disclosure relates to a system and method for the monitoring of and messaging to wireless communication devices within a predefined space, wherein the wireless communication device can be any wireless communication device with receiving and transmitting capabilities such as a cell phone, PDA, lap top computer, desktop computer and pager. The system and method utilizes, in its simplest form, at least two elements: a wireless communication device and at least one location tag. When the system is activated, the wireless communication device will determine all of the location tags within range. The wireless communication device will then determine the location of the most practically near location tag. The wireless communication device can then request information specific to its location from this most practically near location tag.
It should be appreciated that for simplicity and clarity of illustration, elements shown in the Figures and discussed below have not necessarily been drawn to scale. For example, the dimensions of some of the elements are exaggerated relative to each other for clarity.
An exemplary embodiment of the location system 10 in
Each location tag 14, 16, 18 is a programmable transceiver communication device incorporating a radio transceiver module 20 and a micro-controller 22. In exemplary embodiments, the micro-controller 22 controls the radio module 20, responds to over the air queries from the wireless communication device 12, and stores and retrieves detailed location information in the form of data in the micro controller's non-volatile memory.
Each location tag radio module 20 will have its own location tag name, or friendly name. Selection parameters and the geographic position may be encoded and stored in the location tag name. In exemplary embodiments, the location tag name will include information including maximum power setting, installation identifier, floor number, payload type, tag latitude and longitude, and an integral checksum.
In another embodiment, the location tag name is limited to 16 characters and is encoded utilizing ASCII characters to efficiently and simply name the location tag.
Detailed location tag location information is found in the memory of each micro-controller of each location tag. In one example, the detailed location tag location information is formatted into a database according to Table 1.
In exemplary embodiments, the detailed location information includes at least the address of the including the street number, street name, local community, state and zip code. The detailed location information may also include data including the name of the building, the floor number, the unit or room number, or type of room. In other embodiment, the detailed local information may include any relevant other information to provide specific or complementary information for quicker identification of the location.
In exemplary embodiments, the wireless communication device of the present disclosure is a Bluetooth enabled device. In other embodiments, the device may be a cell phone, a laptop computer, a pager, a personal digital assistant (PDA), or any other wireless communication device with the ability to receive the detailed wireless communication device location information from the location tag.
The wireless communication device 12 includes software components to interact with each of the radio modules 20 in the location tags 14, 16, 18. The wireless communication device 12 will periodically interrogate its environment and when it is in range of a location tag 14, 16, 18, the wireless communication device will connect to and query the location tag 14, 16, 18.
In the disclosed system and method, the wireless communication device 12 will receive selection parameter data from each location tag 14, 16, 18. Utilizing these selection parameters, the location tag will narrow the plurality of location tags 14, 16, 18 to the most practically near location tag 14, 16, 18. This is necessary because the closest location tag to a wireless communication device 12 on the second floor of a building could be on the ceiling of the first floor and thus be inaccessible from the second floor. In an exemplary embodiment an algorithm 50 located within the wireless communication device 12 is utilized to determine the location tag that is most practically near.
For example, if a building only has a single location tag, and no other surrounding buildings maintain a location tag, this single location tag could be set using a force flag. This would allow for a quicker, more efficient selection and determination of the location of the location tag. Another example would be where several location tags are located within a small area within a building. These location tags could also be set using a force flag. This again would allow for a quick, efficient selection and determination of tag location.
After the wireless communication device discovery process 52 completes, if only one valid location tag has been discovered 56, this location tag is selected. If more than one valid location tag has been discovered then a series of steps begins to reduce this list down to one location tag that is the most practically near to the wireless communication device. If after any step, only one valid transmitter remains in the list the selection process ends with that location tag being selected.
As each location tag is discovered by the wireless communication device, the name is parsed to confirm if it is a valid location tag. At this time, if a location tag has a valid “force use” flag, this location tag is selected as the location tag that is most practically near. Use of the “force use” flag can reduce the selection process time down to one or two seconds but should only be used when it is certain that any wireless communication device within radio range must select that location tag with its force use flag set as true.
In another embodiment, the algorithm 50 may then utilize a step 60 to distinguish between different buildings or installations. When location tags are installed, all the location tags installed that are part of the same installation are assigned the same identifier.
For example, if two commercial buildings are in close proximity, and both have location tags installed, the installation identifiers will be different for each building. Therefore, if a wireless communication device in one building is within radio range of a location tag in the other building it can more easily select a location tag within its own building and installation area.
In exemplary embodiments, the installation identifier is not intended to provide a universally unique identification number but should provide a unique identifier for every installation within radio range of any other installation having location tags.
First, the wireless communication device determines how many installation identifiers are in range of the wireless communication device 60. The wireless communication device will detect more location tags in the building where it is located. If there are unequal numbers of location tags within the different installations 74, then the location tags in the building with fewer location tags are removed 76 from the list of possible location tags.
In another embodiment, the algorithm may utilize a step 62 distinguish between different floors of a building or installation. When location tags are installed, all the location tags installed that are on different floors of the same installation are assigned different floor identifiers in the location tag name.
In this step 62, the wireless communication device determines if more than one floor number is represented within one installation identifier. If there are unequal numbers of location tags on multiple floors 64, the wireless communication device eliminates those locations transmitters on the minority floors, i.e., on those floors which have the smaller number of location tags 68 sensed. If at this point, only one location tag is available, the wireless communication device chooses this location tag as the location tag that is most practically near.
In another embodiment where equal numbers of location tags exist on more than two different floors within one installation identifier, those location tags on the upper most and lower most floors are removed from the list 70. This step may be repeated until there are no more than two different floors within one installation identifier.
At this point, if more than one location tag remains in the list after the above steps then a serial port profile connection is attempted between the wireless communication device and each location tag remaining in the list 72. If the connection is successful then the location tag is queried for its received signal strength (RSS) for that connection 74.
RSS is queried from the location tag because the interface on the wireless communication devices does not generally support a query for an RSS value. If at least one connection and query for RSS is successful and the RSS value associated with that location tag is higher than the RSS value for all others 76, then that location tag is selected by the wireless communication device as the location tag that is most practically near to provide the detailed local information 80.
In the next step, if more than one location tag has an identically highest RSS value retrieved then the “maximum transmit power” settings are compared 82. If one location tag with highest RSS value has a maximum transmit power lower than the other(s) then this location tag is selected 84.
In another step, if all attempts at serial port profile connections and retrieval of RSS values have failed then the “maximum transmit power” settings encoded in the location tag names of the remaining location tags are compared by the wireless communication device 80. In exemplary embodiments, the first character of the wireless communication device name includes maximum power transit setting. If one maximum transmit power setting is lower than all others then this location tag is selected 90 since, all other factors being equal, a location tag with lower maximum transmit power will probably be most practically near to the wireless communication device.
In the next step of the algorithm 50, if, after all elimination steps are complete and more than one location tag remain in the list, then one of the remaining location tags is arbitrarily selected by the wireless communication device 92.
After the algorithm 50 has been run, when queried, the precise detailed local information from the selected location tag is returned to the wireless communication device.
Another exemplary embodiment is shown in
Management base stations 100 are modules equipped with power circuitry, a micro-controller, and preferably a radio transceiver such as a Bluetooth radio and a Wi-Fi radio. The base stations 100 are self-contained in packaging and can either be connected directly into a constant power source or battery-powered.
The management system 200 interacts with an enabled location tag environment via management base stations 100 preferably over a wide-area network. The management system 200, for example, may communicate with the base stations 100 through their Wi-Fi radios, while the base stations 100 communicate with the location tags 14, 16, 18 though their Bluetooth radios. Only one base station 100 is required per enabled environment, but multiple base stations 100 can be used in sprawling areas or for load balancing.
In
Consoles 400 are used to configure area-specific messaging, utilizing a map displaying the placement and range of every location tag 14, 16, 18 within a messaging enabled environment. A message, its severity and its delivery path are then defined (or selected from a list of existing paths), beginning with a management base station 100, and linking a series of location tags 14, 16, 18. The message and its delivery path are then stored in the database 300, along with its delivery schedule.
A message may be sent via a console 400 to a base station 100. From base station 100, as shown in
As illustrated in
Location tag 14 will begin execution of algorithm 700 at operation 702 by coupling with a base station 100 if a message is to be sent to base station 100 for forwarding to communication devices that are within range of the location tags. Base station 100 sends the message signal to the first location tag 14. Control is then passed to operation 704 where the incoming message signal is received by location tag 14. Control is then passed to operation 706. Location tag 14 replies to the base station 100 with a receipt message acknowledging that the message was successfully received. Had location tag 14 been in the middle of the chain instead of the current example where it is the first location tag of the chain, location tag 14 would have sent a receipt message to the previous location tag in the chain.
Control is then passed to query operation 708. Query operation 708 asks whether the message is for that location tag. If it is, then a message flag is set so that the message is to be available in response to a query by wireless communication devices within its vicinity. If the message signal is not carrying the address for location tag 14, the answer is no and control is passed to operation 714. If the message signal is carrying the address of location tag 14, the answer is yes and operation is passed to operation 710.
At operation 710 a message flag is made available to wireless communication devices in the vicinity when they perform their periodic inquiry or discovery of the location tags. When the message flag is made available, the wireless communication device can then retrieve the message from location tag 14.
Control is then passed to query operation 712. Query operation 712 determines if the message signal is carrying the addresses of other location tags farther down the chain and if it is, control is passed to operation 714. If the message signal is not carrying any other addresses, control is passed to the return operation 716.
At operation 714 the message is forwarded to the next location tag. In the current example that tag is location tag 16.
Control is now passed to 716 where the location tag 14 effectively “goes to sleep” and awaits further instructions from the base station 100 or to be queried again by a wireless communication device.
Area-specific messages may be initialized on a pre-defined schedule, or can be initialized immediately via a console 400. The initialization of an area-specific message begins at a management base station 100, and will leap from one location tag 14, 16, 18 to the next as defined in the daisy chain sequence. Location tags 14, 16, 18 will store the message in their flash memory if it is intended for them before passing that message on to the next location tag 14, 16, 18 in the sequence. The message initialization results are returned to the initiating management base station 100 in the reverse sequence of the daisy chain when the end of the daisy chain is reached. The management base station 100 transmits the results to the management system 200, which are then recorded in the database 300.
An exception report is returned to the initiating management base station 100 in the event an exception is encountered during the initialization of a message. The exception report is returned in the reverse sequence of the daisy chain beginning with the location tag 14, 16, 18 generating the exception. The management base station 100 transmits the exception to the management system 200, which generates the appropriate notifications and records the exception in the Database 300. The management system 200 will attempt to continue the initialization of the message utilizing alternate daisy chain path(s).
A message-pending flag is passed to enabled wireless communication devices as they interrogate, connect to and eventually select location tags 14, 16, 18 during the execution of the selection algorithm. If the selected location tag 14, 16, 18 is determined to have a message pending, and the severity level of that message falls within the criteria set on that wireless communication device, the message may be automatically downloaded and displayed on the wireless communication device. For example, “canned” messages may be transmitted and displayed automatically which could arise in emergency situations.
In another exemplary embodiment of operation of the system 200, which is shown in
Consoles 400 are used to configure system monitoring, utilizing a map displaying the placement and range of every location tag 14, 16, 18 within an enabled environment. A health check daisy chain is then defined, beginning with a management base station 100, and linking a series of location tags 14, 16, 18. The specific series is then stored in the management system 200, along with its execution schedule. The management system 200 will ensure that all location tags 14, 16, 18 within an enabled environment are included in at least one health check series.
System monitoring will execute on a pre-defined schedule, or can be launched manually via a Console 400. The monitoring begins at a management base station 100, and will then leap from one location tag 14, 16, 18 to the next as defined in the daisy chain sequence. Each location tag 14, 16, 18 in the sequence verifies that the next location tag 14, 16, 18 in the sequence is running, has not been moved and its data has not been compromised. The monitoring results are returned to the initiating management base station 100 in the reverse sequence of the daisy chain when the end of the daisy chain is reached. The management base station 100 transmits the results to the database 300.
Referring specifically to
As a still further exemplary implementation of the disclosed system, a mobile client can send its location through the network shown in
While the above description contains many particulars, these should not be considered limitations on the scope of the disclosure, but rather a demonstration of embodiments thereof. The system and methods disclosed herein include any combination of the different species or embodiments disclosed. Accordingly, it is not intended that the scope of the disclosure in any way be limited by the above description. The various elements of the claims and claims themselves may be combined in any combination, in accordance with the teachings of the present disclosure, which includes the claims.
This application relates to U.S. utility patent application Ser. No. 11/848,178, filed Aug. 30, 2007 and claims the benefit of the prior filing date of U.S. provisional patent application No. 60/625,467, filed Nov. 5, 2004. This application also relates to U.S. utility patent application Ser. No. 11/105,931, filed Apr. 13, 2005. This application is also related to U.S. utility patent application Ser. No. 11/105,621, filed on Apr. 13, 2005, and U.S. utility patent application Ser. No. 11/105,932, filed on Apr. 13, 2005. This application also claims the benefit of priority of U.S. Provisional Patent Application No. 60/893,604, filed Mar. 7, 2007 and entitled “Method and System To Track Persons Utilizing Wireless Media,” and U.S. Provisional Patent Application No. 60/955,855, filed Aug. 14, 2007, entitled “Method and System For Providing Area Specific Messaging.” The contents of all these applications are hereby incorporated by reference in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3518674 | Moorhead et al. | Jun 1970 | A |
| 3772668 | Smith | Nov 1973 | A |
| 4152693 | Ashworth, Jr. | May 1979 | A |
| 4217588 | Freeny, Jr. | Aug 1980 | A |
| 4217668 | Sargent et al. | Aug 1980 | A |
| 4224596 | Knickel | Sep 1980 | A |
| 4688026 | Scribner et al. | Aug 1987 | A |
| 4819860 | Hargrove et al. | Apr 1989 | A |
| 4847773 | van Helsdingen et al. | Jul 1989 | A |
| 4884208 | Marinelli et al. | Nov 1989 | A |
| 4958645 | Cadell et al. | Sep 1990 | A |
| 5142281 | Park | Aug 1992 | A |
| 5235633 | Dennison et al. | Aug 1993 | A |
| 5365516 | Jandrell | Nov 1994 | A |
| 5388147 | Grimes | Feb 1995 | A |
| 5389934 | Kass | Feb 1995 | A |
| 5479482 | Grimes | Dec 1995 | A |
| 5528248 | Steiner et al. | Jun 1996 | A |
| 5546445 | Dennison et al. | Aug 1996 | A |
| 5617944 | McTaggart | Apr 1997 | A |
| 5621785 | Norimatsu | Apr 1997 | A |
| 5627517 | Theimer et al. | May 1997 | A |
| 5642303 | Small et al. | Jun 1997 | A |
| 5670944 | Myllymaki | Sep 1997 | A |
| 5699244 | Clark, Jr. et al. | Dec 1997 | A |
| 5793310 | Watanabe et al. | Aug 1998 | A |
| 5796634 | Craport et al. | Aug 1998 | A |
| 5835907 | Newman | Nov 1998 | A |
| 5917405 | Joao | Jun 1999 | A |
| 5917414 | Oppelt et al. | Jun 1999 | A |
| 5917415 | Atlas | Jun 1999 | A |
| 5918180 | Dimino | Jun 1999 | A |
| 5938721 | Dussell et al. | Aug 1999 | A |
| 5946611 | Dennison et al. | Aug 1999 | A |
| 5986508 | Nevin et al. | Nov 1999 | A |
| 6002994 | Lane et al. | Dec 1999 | A |
| 6009330 | Kennedy, III et al. | Dec 1999 | A |
| 6014089 | Tracy et al. | Jan 2000 | A |
| 6043748 | Touchton et al. | Mar 2000 | A |
| 6055426 | Beasley | Apr 2000 | A |
| 6073013 | Agre et al. | Jun 2000 | A |
| 6102856 | Groff et al. | Aug 2000 | A |
| 6177905 | Welch | Jan 2001 | B1 |
| 6198394 | Jacobsen et al. | Mar 2001 | B1 |
| 6198431 | Gibson | Mar 2001 | B1 |
| 6198914 | Saegusa | Mar 2001 | B1 |
| 6236358 | Durst et al. | May 2001 | B1 |
| 6243039 | Elliot | Jun 2001 | B1 |
| 6265978 | Atlas | Jul 2001 | B1 |
| 6300875 | Schafer | Oct 2001 | B1 |
| 6317605 | Sakuma | Nov 2001 | B1 |
| 6324404 | Dennison et al. | Nov 2001 | B1 |
| 6330446 | Mori | Dec 2001 | B1 |
| 6360164 | Murayama | Mar 2002 | B1 |
| 6421001 | Durst et al. | Jul 2002 | B1 |
| 6438382 | Boesch et al. | Aug 2002 | B1 |
| 6446004 | Cao et al. | Sep 2002 | B1 |
| 6469116 | Maccone et al. | Oct 2002 | B2 |
| 6477363 | Ayoub et al. | Nov 2002 | B1 |
| 6496116 | Farringdon et al. | Dec 2002 | B2 |
| 6496575 | Vasell et al. | Dec 2002 | B1 |
| 6509830 | Elliot et al. | Jan 2003 | B1 |
| 6516198 | Tendler | Feb 2003 | B1 |
| 6531924 | Aparin | Mar 2003 | B2 |
| 6531963 | Nyfelt | Mar 2003 | B1 |
| 6574484 | Carley | Jun 2003 | B1 |
| 6577897 | Shurubura et al. | Jun 2003 | B1 |
| 6579231 | Phipps | Jun 2003 | B1 |
| 6597365 | Baecke et al. | Jul 2003 | B1 |
| 6599243 | Wolterman et al. | Jul 2003 | B2 |
| 6611206 | Milanski et al. | Aug 2003 | B2 |
| 6617969 | Mi et al. | Sep 2003 | B2 |
| 6625457 | Raith | Sep 2003 | B1 |
| 6646873 | Chu-Chia et al. | Nov 2003 | B2 |
| 6665613 | Duvall | Dec 2003 | B2 |
| 6674368 | Hawkins et al. | Jan 2004 | B2 |
| 6714133 | Hum et al. | Mar 2004 | B2 |
| 6717513 | Shprecher et al. | Apr 2004 | B1 |
| 6774795 | Eshelman et al. | Aug 2004 | B2 |
| 6801974 | Watts, Jr. et al. | Oct 2004 | B1 |
| 6812824 | Goldinger et al. | Nov 2004 | B1 |
| 6826473 | Burch et al. | Nov 2004 | B1 |
| 6839027 | Krumm et al. | Jan 2005 | B2 |
| 6847822 | Dennison et al. | Jan 2005 | B1 |
| 6853911 | Sakarya | Feb 2005 | B1 |
| 6856898 | Tompkins et al. | Feb 2005 | B1 |
| 6859653 | Ayoub et al. | Feb 2005 | B1 |
| 6867733 | Sandhu et al. | Mar 2005 | B2 |
| 6868074 | Hanson | Mar 2005 | B1 |
| 6868410 | Fortin et al. | Mar 2005 | B2 |
| 6904363 | Inbar et al. | Jun 2005 | B2 |
| 6909891 | Yamashita et al. | Jun 2005 | B2 |
| 6922565 | Rhodes et al. | Jul 2005 | B2 |
| 6944464 | Muranaga | Sep 2005 | B2 |
| 6970922 | Spector | Nov 2005 | B1 |
| 6983154 | Niwa | Jan 2006 | B2 |
| 7013151 | Hirokawa | Mar 2006 | B2 |
| 7016478 | Potorny et al. | Mar 2006 | B2 |
| 7064614 | Feng et al. | Jun 2006 | B2 |
| 7138916 | Schwartz | Nov 2006 | B2 |
| 7174301 | Florence et al. | Feb 2007 | B2 |
| 7286929 | Staton | Oct 2007 | B2 |
| 7317927 | Staton et al. | Jan 2008 | B2 |
| 7323982 | Staton | Jan 2008 | B2 |
| 7426197 | Schotten et al. | Sep 2008 | B2 |
| 7539742 | Spector | May 2009 | B2 |
| 7848765 | Phillips et al. | Dec 2010 | B2 |
| 7870229 | Spector | Jan 2011 | B2 |
| 8285245 | Ashley, Jr. et al. | Oct 2012 | B2 |
| 8290515 | Staton et al. | Oct 2012 | B2 |
| 8315203 | Ashley, Jr. et al. | Nov 2012 | B2 |
| 20010027378 | Tennison et al. | Oct 2001 | A1 |
| 20010032236 | Lin | Oct 2001 | A1 |
| 20010034659 | Kobayashi | Oct 2001 | A1 |
| 20010040513 | McDonald | Nov 2001 | A1 |
| 20010046884 | Yoshioka | Nov 2001 | A1 |
| 20010048755 | Wiens et al. | Dec 2001 | A1 |
| 20020028702 | Kim | Mar 2002 | A1 |
| 20020039903 | Niwa | Apr 2002 | A1 |
| 20020059434 | Karaoguz et al. | May 2002 | A1 |
| 20020068544 | Barzilay et al. | Jun 2002 | A1 |
| 20020072348 | Wheeler et al. | Jun 2002 | A1 |
| 20020072356 | Yamashita et al. | Jun 2002 | A1 |
| 20020111171 | Boesch et al. | Aug 2002 | A1 |
| 20020147006 | Coon et al. | Oct 2002 | A1 |
| 20020196151 | Troxler et al. | Dec 2002 | A1 |
| 20030013462 | Adachi | Jan 2003 | A1 |
| 20030137435 | Haddad et al. | Jul 2003 | A1 |
| 20030141962 | Barink | Jul 2003 | A1 |
| 20030149526 | Zhou et al. | Aug 2003 | A1 |
| 20030158635 | Pillar et al. | Aug 2003 | A1 |
| 20030163287 | Vock et al. | Aug 2003 | A1 |
| 20030186709 | Rhodes et al. | Oct 2003 | A1 |
| 20040024522 | Walker et al. | Feb 2004 | A1 |
| 20040036599 | Martin et al. | Feb 2004 | A1 |
| 20040043774 | Lee | Mar 2004 | A1 |
| 20040075553 | Ono | Apr 2004 | A1 |
| 20040082840 | Chen | Apr 2004 | A1 |
| 20040152460 | La et al. | Aug 2004 | A1 |
| 20040176106 | Tendler | Sep 2004 | A1 |
| 20040180668 | Owens et al. | Sep 2004 | A1 |
| 20040192271 | Eisner et al. | Sep 2004 | A1 |
| 20040196182 | Unnold | Oct 2004 | A1 |
| 20040201454 | Waterhouse et al. | Oct 2004 | A1 |
| 20040203944 | Huomo et al. | Oct 2004 | A1 |
| 20040207541 | Choi | Oct 2004 | A1 |
| 20040208344 | Liu et al. | Oct 2004 | A1 |
| 20040215750 | Stilp | Oct 2004 | A1 |
| 20040220731 | Tucker et al. | Nov 2004 | A1 |
| 20040225436 | Yoshihashi | Nov 2004 | A1 |
| 20040248586 | Patel et al. | Dec 2004 | A1 |
| 20040249497 | Saigh et al. | Dec 2004 | A1 |
| 20040249560 | Kim et al. | Dec 2004 | A1 |
| 20050026627 | Boling et al. | Feb 2005 | A1 |
| 20050048987 | Glass | Mar 2005 | A1 |
| 20050068227 | Caspi et al. | Mar 2005 | A1 |
| 20050070315 | Rai et al. | Mar 2005 | A1 |
| 20050085257 | Laird et al. | Apr 2005 | A1 |
| 20050090978 | Bathory et al. | Apr 2005 | A1 |
| 20050151654 | Curwen | Jul 2005 | A1 |
| 20050159883 | Humphries et al. | Jul 2005 | A1 |
| 20050246094 | Moscatiello | Nov 2005 | A1 |
| 20050275549 | Barclay et al. | Dec 2005 | A1 |
| 20060003809 | Boling et al. | Jan 2006 | A1 |
| 20060009240 | Katz | Jan 2006 | A1 |
| 20060015223 | LeBlanc et al. | Jan 2006 | A1 |
| 20060015233 | Olsen et al. | Jan 2006 | A1 |
| 20060109107 | Staton et al. | May 2006 | A1 |
| 20060234727 | Ashley, Jr. | Oct 2006 | A1 |
| 20070004378 | Muhonen et al. | Jan 2007 | A1 |
| 20070244633 | Phillips et al. | Oct 2007 | A1 |
| 20070276270 | Tran | Nov 2007 | A1 |
| 20080040384 | Kuznetsov | Feb 2008 | A1 |
| 20080147442 | Warner et al. | Jun 2008 | A1 |
| 20080157972 | Duron et al. | Jul 2008 | A1 |
| 20090138353 | Mendelson | May 2009 | A1 |
| 20100109842 | Patel et al. | May 2010 | A1 |
| 20100293106 | Rhoads et al. | Nov 2010 | A1 |
| Number | Date | Country |
|---|---|---|
| 1190183 | Aug 1997 | CN |
| 4028214 | Mar 1992 | DE |
| 19960219 | Jun 2001 | DE |
| 0915398 | May 1999 | EP |
| 1050853 | Nov 2000 | EP |
| 1345148 | Aug 2003 | EP |
| 1345148 | Sep 2003 | EP |
| 2322248 | Aug 1998 | GB |
| 2369966 | Jun 2002 | GB |
| 2000299891 | Oct 2000 | JP |
| 2003304184 | Oct 2003 | JP |
| 299005 | May 2012 | MX |
| WO00-01065 | Jan 2000 | WO |
| WO00-41428 | Jun 2000 | WO |
| WO0041428 | Jul 2000 | WO |
| WO02-063768 | Aug 2000 | WO |
| WO01-46926 | Jan 2001 | WO |
| WO01-35190 | May 2001 | WO |
| WO01-63318 | Aug 2001 | WO |
| WO03-042926 | May 2003 | WO |
| WO03-049060 | Jun 2003 | WO |
| WO03-079587 | Sep 2003 | WO |
| WO 2006058112 | Jun 2006 | WO |
| Entry |
|---|
| Carlos Colon, Jennifer Szaro and Jeff Curry, “Lakeland's Solar Hot Water Program”, Relay Magazine, May-Jun. 2002, pp. 37-43, www.publicpower.com. |
| International Search Report from PCT/US08/56314. |
| Wirelesswerx TrakWERK II SMS/Satellite Dual Mode Tracking Unit, Manual, Nov. 17, 2003, pp. 1-20. |
| Wirelesswerx Training Outline, Manual, Oct. 29, 2004, pp. 1-44. |
| Wirelesswerx System Description Tucson01, Manual, Feb. 8, 2006, pp. 1-10. |
| Wirelesswerx Requirements Specification Tucson01, Manual, Feb. 27, 2006, pp. 1-35. |
| Wirelesswerx Technical Overview, Manual, Sep. 10, 2003, pp. 1-19. |
| Number | Date | Country | |
|---|---|---|---|
| 20080220720 A1 | Sep 2008 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60893604 | Mar 2007 | US | |
| 60955855 | Aug 2007 | US | |
| 60625467 | Nov 2004 | US |