All of the material in this patent document is subject to copyright protection under the copyright laws of the United States and other countries. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in official governmental records but, otherwise, all other copyright rights whatsoever are reserved.
Some conventional systems for tracking and/or monitoring assets (herein generally referred to as “asset tracking systems”) utilize wireless tags that generally respond to any broadcast that is made. The wireless tags usually are passive, and the responses that the passive wireless tags make are often referred to as “chirps.”
More sophisticated conventional asset tracking systems utilize semi-passive wireless tags and/or active wireless tags. A semi-passive wireless tag includes an internal power source for transmitting, and an active wireless tag includes an internal power source for both receiving and transmitting. Semi-passive and active wireless tags generally have greater capabilities than passive wireless tags due to the internal power sources. Of course, power consumption is always a concern when a wireless tag includes an internal power source, since the internal power supply limits the useful life of the wireless tag, after which time maintenance is required (e.g., replacement of the internal power source).
In improved asset tracking systems, such as disclosed in U.S. Pat. No. 6,934,540 and other of the above-incorporated patent applications and patents, a wireless tag responds to a broadcast if the broadcast includes a common designation matching a common designation of the wireless tag. Such a common designation may comprise, for example, an “asset class” associated with the wireless tag. Ad hoc networks further may be created based on such classes, which ad hoc networks are referred to as “class based” networks.
Class based networks (and common designation networks in general) are beneficial because, in such networks, a communication device, such as a wireless tag, generally only transmits a response to a broadcast if the broadcast includes a class (or common designation) that matches a class (or common designation) of that communication device. Indeed, in a communication device employing a wakeup sequence of one or more of the patent references incorporated herein by reference, such communication device does not even process a broadcast once it is determined that the broadcast fails to include a matching class of the communication device. Consequently, the internal power supply of a semi-passive or active communication device is not drained by needless processing and/or responses to broadcasts.
The present invention generally relates to wireless ad-hoc networks. A need exists for improvement in wireless network apparatus, systems, and methods. These, and other needs, are addressed by one or more aspects of the present invention.
The invention of the present application generally relates to networks, apparatus, methods and systems for determining the presence of a radio frequency communication device within a wireless data communications network, and especially for determining such presence in an ad hoc wireless data communications network in which at least some wireless data communication devices forming nodes of the network are at least periodically mobile. In this context, the present invention includes many aspects and features. Moreover, while many aspects and features relate to, and are described in, the context of asset tracking systems, the present invention is not limited to use only in asset tracking systems, as will become apparent from the following summaries and detailed descriptions of aspects, features, and one or more embodiments of the present invention. Indeed, the present invention is equally useful in remote sensor networks and the like for remote monitoring, whether such monitoring is the monitoring of assets or otherwise.
In a principal aspect of the invention of the present application, a wireless two-way RF data communication device includes: a memory having stored therein common designations of the wireless two-way RF data communication device; a receiver configured to receive radio frequency transmissions; a transmitter configured to make radio frequency transmissions; and electronic components. The electronic components are arranged and configured such that the wireless two-way RF data communication device receives and processes communications as a function of at least one of the common designations of the wireless two-way RF data communication device being in the communication. The electronic components further are arranged and configured such that each message that is received in a communication associated with a particular common designation of the RF data communication device, and for which the wireless two-way RF data communication device is not the destination recipient but, instead, is an intermediate recipient, is communicated: to another wireless two-way RF data communication device that has the same particular common designation, if such a wireless two-way RF data communication device is available; and if such a wireless two-way RF data communication device is unavailable, to another wireless two-way RF data communication device that has a common designation that is the same as a common designation stored in the memory, if such a wireless two-way RF data communication device is available.
In a feature, the two-way RF data communication device is a wireless transceiver that includes microprocessor capabilities.
In a feature, the two-way RF data communication device is a remote sensor node (RSN).
In a feature, the two-way RF data communication device is a wireless reader tag (WRT).
In a feature, the two-way RF data communication device serves as a wireless tag (WT).
In a feature, the common designations stored in the memory are class designations for use in class-based networks.
In a feature, the electronic components are arranged and configured such that the wireless two-way RF data communication device receives and processes only communications that include at least one of the common designations of the wireless two-way RF data communication device.
In a feature, the electronic components are arranged and configured such that the communications provided, if such a wireless two-way RF data communication device is unavailable, to another wireless two-way RF data communication device that has a common designation that is the same as a common designation stored in the memory (if such a wireless two-way RF data communication device is available) are performed only for predetermined common designations and not for all common designations.
In a feature, the electronic components are arranged and configured such that the wireless two-way RF data communication device selectively operates between at least a first state, in which the communications provided if such a wireless two-way RF data communication device is unavailable, to another wireless two-way RF data communication device that has a common designation that is the same as a common designation stored in the memory (if such a wireless two-way RF data communication device is available) are enabled, and in a second state, in which the communications are disabled.
In another principal aspect of the invention of the present application, a data communications network includes a plurality of wireless two-way radio frequency (RF) data communication devices, each wireless two-way RF data communication device forming a node of the data communications network and each wireless two-way RF data communication device including a memory having stored therein a common designation. Furthermore, at least one of the wireless two-way RF data communication devices further includes a second common designation stored in the memory thereof. The at least one of the wireless two-way RF data communication devices further comprises a receiver configured to receive radio frequency transmissions; a transmitter configured to make radio frequency transmissions, and electronic components. The electronic components are arranged and configured such that the wireless two-way RF data communication device receives and processes communications as a function of at least one of the common designations of the wireless two-way RF data communication device being in the communication. The electronic components are further arranged and configured such that each message that is received in a communication associated with a particular common designation of the RF data communication device, and for which the wireless two-way RF data communication device is not the destination recipient but, instead, is an intermediate recipient, is communicated: to another wireless two-way RF data communication device that has the same particular common designation, if such a wireless two-way RF data communication device is available; and if such a wireless two-way RF data communication device is unavailable, to another wireless two-way RF data communication device that has a common designation that is the same as a common designation stored in the memory, if such a wireless two-way RF data communication device is available.
In a feature, the first and second common designations stored in the memory of the at least one of the wireless two-way RF data communication devices are class designations for use in class-based networking.
In a feature, the electronic components of the at least one of the wireless two-way RF data communication devices are arranged and configured such that the communications provided, if such a wireless two-way RF data communication device is unavailable, to another wireless two-way RF data communication device that has a common designation that is the same as a common designation stored in the memory (if such a wireless two-way RF data communication device is available) are performed only for predetermined common designations and not for all common designations. Moreover, the electronic components of the at least one of the wireless two-way RF data communication devices may be arranged and configured such that the wireless two-way RF data communication device selectively operates between at least a first state, in which the aforementioned provided communications are enabled, and in a second state, in which the aforementioned provided communications are disabled.
In a feature, each node of the data communications network comprises a wireless radio-frequency data communication device having a transmitter and a receiver that collectively receive and transmit information wirelessly.
In a feature, each wireless two-way RF data communication device comprises a standards-based data packet radio component that includes both said receiver and said transmitter of the respective wireless two-way RF data communication device.
In a feature, the information is wirelessly communicated in data packets in the data communications network.
In a feature, a plurality of the wireless two-way RF data communication devices are respectively attached to assets for monitoring and tracking of the asset.
In a feature, a plurality of the wireless two-way RF data communication devices are permanently affixed to a structure for monitoring and/or tracking assets that come within a proximity thereto.
In a feature, a plurality of the wireless two-way RF data communication devices each comprises a wireless transceiver that includes microprocessor capabilities.
In another principal aspect of the invention of the present application, and with respect to the context of a data network comprising a plurality of wireless two-way radio frequency (RF) data communication devices, each wireless two-way RF data communication device forming a node of the data communications network, a method of communicating a message from an originating node to a destination node by way of intermediate nodes includes the steps of: maintaining multiple class designations in memory of a particular one of the wireless two-way radio frequency (RF) data communication devices forming a node of the network; and for each message that is received by the particular wireless two-way radio frequency (RF) data communication device in a communication associated with a common designation of the particular wireless two-way radio frequency (RF) data communication device, and for which the particular wireless two-way RF data communication device is an intermediate node with respect to the message, forwarding the message: (a) to another node of the network that has the same particular common designation associated with the message, if such another node is available; and (b) if such another node is unavailable, to another node that has a common designation that is the same as a common designation stored in the memory of the particular wireless two-way radio frequency (RF) data communication device, if such a node is available.
In a feature, the particular wireless two-way radio frequency (RF) data communication device receives and processes communications as a function of at least one of the common designations of the particular wireless two-way RF data communication device being in the communication.
In a feature, the first and second common designations stored in the memory of the particular wireless two-way RF data communication device are class designations for use in class-based networking, the particular wireless two-way RF data communication device conjoining at least two logically distinct class-based networks.
In a feature, communicating the message to another node that has a common designation that is the same as a common designation stored in the memory of the particular wireless two-way radio frequency (RF) data communication device, but that is not the same as the common designation associated with the communication of the message that is received, is performed only for predetermined common designations and not for all common designations.
In a feature, the method further includes switching between at least two states of operation by the particular wireless two-way RF data communication device, wherein said step (b)(ii) is not performed in the second state. The switching may be in response to a command that is received by the particular wireless two-way RF data communication device in a wireless communication; in response to a sensed condition; may be performed at predetermined times; or any combination of the foregoing
Another principal aspect of the invention of the present application comprises a conjoined common designation network and may be a class-based network.
Another principal aspect of the invention of the present application comprises a method for conjoined common designation networks, such as class-based networks.
Another principal aspect of the invention of the present application comprises a data communication network comprising at least two logically distinct class-based networks conjoined by at least one common node that has membership in each of the respective classes of the two logically distinct class-based networks.
Additional features of the foregoing principle aspects also are set forth elsewhere herein. In addition to the aforementioned aspects and features of the present invention, it should be noted that the present invention further encompasses the various possible combinations and subcombinations of such aspects and features.
One or more preferred embodiments of the present invention now will be described in detail with reference to the accompanying drawings, wherein the same elements are referred to with the same reference numerals, and wherein,
As a preliminary matter, it will readily be understood by one having ordinary skill in the relevant art (“Ordinary Artisan”) that the present invention has broad utility and application. Furthermore, any embodiment discussed and identified as being “preferred” is considered to be part of a best mode contemplated for carrying out the present invention. Other embodiments also may be discussed for additional illustrative purposes in providing a full and enabling disclosure of the present invention. Moreover, many embodiments, such as adaptations, variations, modifications, and equivalent arrangements, will be implicitly disclosed by the embodiments described herein and fall within the scope of the present invention.
Accordingly, while the present invention is described herein in detail in relation to one or more embodiments, it is to be understood that this disclosure is illustrative and exemplary of the present invention, and is made merely for the purposes of providing a full and enabling disclosure of the present invention. The detailed disclosure herein of one or more embodiments is not intended, nor is to be construed, to limit the scope of patent protection afforded the present invention, which scope is to be defined by the claims and the equivalents thereof. It is not intended that the scope of patent protection afforded the present invention be defined by reading into any claim a limitation found herein that does not explicitly appear in the claim itself.
Thus, for example, any sequence(s) and/or temporal order of steps of various processes or methods that are described herein are illustrative and not restrictive. Accordingly, it should be understood that, although steps of various processes or methods may be shown and described as being in a sequence or temporal order, the steps of any such processes or methods are not limited to being carried out in any particular sequence or order, absent an indication otherwise. Indeed, the steps in such processes or methods generally may be carried out in various different sequences and orders while still falling within the scope of the present invention. Accordingly, it is intended that the scope of patent protection afforded the present invention is to be defined by the appended claims rather than the description set forth herein.
Additionally, it is important to note that each term used herein refers to that which the Ordinary Artisan would understand such term to mean based on the contextual use of such term herein. To the extent that the meaning of a term used herein—as understood by the Ordinary Artisan based on the contextual use of such term—differs in any way from any particular dictionary definition of such term, it is intended that the meaning of the term as understood by the Ordinary Artisan should prevail.
Furthermore, it is important to note that, as used herein, “a” and “an” each generally denotes “at least one,” but does not exclude a plurality unless the contextual use dictates otherwise. Thus, reference to “a picnic basket having an apple” describes “a picnic basket having at least one apple” as well as “a picnic basket having apples.” In contrast, reference to “a picnic basket having a single apple” describes “a picnic basket having only one apple.”
When used herein to join a list of items, “or” denotes “at least one of the items,” but does not exclude a plurality of items of the list. Thus, reference to “a picnic basket having cheese or crackers” describes “a picnic basket having cheese without crackers”, “a picnic basket having crackers without cheese”, and “a picnic basket having both cheese and crackers.” Finally, when used herein to join a list of items, “and” denotes “all of the items of the list.” Thus, reference to “a picnic basket having cheese and crackers” describes “a picnic basket having cheese, wherein the picnic basket further has crackers,” as well as describes “a picnic basket having crackers, wherein the picnic basket further has cheese.”
Referring now to the drawings, one or more preferred embodiments of the present invention are next described. The following description of one or more preferred embodiments is merely exemplary in nature and is in no way intended to limit the invention, its implementations, or uses.
RSNs 111,113,115,117 are shown in
In accordance with a first class-based networking protocol, as more fully described for example in incorporated U.S. Pat. Nos. 6,745,027; 6,934,540; 7,200,132; 7,209,468; and 7,221,668, the RSNs 111,113,115,117 are configured to form class-based networks based on class memberships. As will be appreciated, because all of the RSNs 111,113,115,117 are members of the same class “A”, these RSNs form a class “A” communications network by which RSN 111 communicates with the gateway 119 by hopping a message along RSNs 113,115,117, as shown in
In contrast to the class-based networking illustrated in
In accordance with a the networking protocol illustrated in
Specifically, RSN 211 communicates a message by making a class “B” transmission 212, which is received and processed by RSN 213, which also is a member of class “B”. RSN 213, however, is unable to further communicate the message within a class “B” network, as no other intermediate RSN of class “B” is within transmission range for communicating with the gateway 219. Nevertheless, RSN 213 is a member of class “A” and therefore communicates the message by making a class “A” transmission 214, which is received and processed by RSN 215, which also is a member of class “A”. RSN 215 is unable to further communicate the message within a class “A” network, as no other intermediate RSN of class “A” is within transmission range for communicating with the gateway 219. Nevertheless, RSN 215 is a member of class “C” and therefore communicates the message by making a class “C” transmission 216, which is received and processed by RSN 217, which also is a member of class “C”. RSN 215, which is within transmission range with gateway 219, then communicates the message to gateway 219 by making a class “C” transmission 218 as shown in
As will be appreciated, by utilizing a network comprised of distinct and separate class-based networks joined by common RSNs having membership in two or more of the classes, RSN 111 is able to send a message to the gateway 119 (and on to an external network if applicable via the gateway 119) when class “B” networking to the gateway 119 is unavailable.
The message may be any message, such as a check-in message, a message communicating an alert, or a message responding to an inquiry. Additionally, the networking may include deterministic or nondeterministic networking, as set forth in incorporated USPA Publ. No. 2007/0002792.
In variations, each RSN may be configured in a first state in which such conjoined class-based networking is enabled; in a second state in which such conjoined class-based networking is disabled; and may be configurable between the two states based on detection of a condition, based on receipt of a command, based on predetermined times, or any of the foregoing. Moreover, an RSN may be configured for conjoined class-based networking for certain classes, but not for all classes, whereby excluded class-based networks do not participate in the conjoined class-based networks.
Also, as will be appreciated, in conjoined class-based networking, class commonality or class continuity is required only for each hop between RSNs, and not for every RSN along the pathway from the originating RSN to the gateway (or similarly to a destination RSN if the message is not intended for communication to or through a gateway).
Based on the foregoing description, it will be readily understood by those persons skilled in the art that the present invention is susceptible of broad utility and application. Many embodiments and adaptations of the present invention other than those specifically described herein, as well as many variations, modifications, and equivalent arrangements, will be apparent from or reasonably suggested by the present invention and the foregoing descriptions thereof, without departing from the substance or scope of the present invention.
Accordingly, while the present invention has been described herein in detail in relation to one or more preferred embodiments, it is to be understood that this disclosure is only illustrative and exemplary of the present invention and is made merely for the purpose of providing a full and enabling disclosure of the invention. The foregoing disclosure is not intended to be construed to limit the present invention or otherwise exclude any such other embodiments, adaptations, variations, modifications or equivalent arrangements, the present invention being limited only by the claims appended hereto and the equivalents thereof.
In such a wireless network, another aspect of the invention includes a method of maintaining, by a first node, information regarding communications links between nodes in the wireless network. The method includes the steps of: (a) for each communications link that is established with another node, recording an identification of the other node; and (b) for each message received by the first node from the other node through the communications link with the other node, recording a network pathway by which the message has been sent in the wireless network, the network pathway identifying the nodes and the communications links therebetween in the wireless network by which the message has been sent.
In a feature of this aspect, the method further includes recording, in association with the identification of the other node, data indicative of a link quality between the first node and the other node.
In a feature of this aspect, the method further includes recording, for each message received by the first node from the other node through the communications link with the other node, data indicative of a link quality between each communications link in the network pathway by which the message has been sent.
In a feature of this aspect, the method further includes recording, in association with the identification of the other node, data indicative of class designations of the other node.
In a feature of this aspect, the method further includes recording, for each message received by the first node from the other node through the communications link with the other node, data indicative of class designations of each node in the communications links in the network pathway by which the message has been sent.
In a feature of this aspect, the method further includes recording, for each message received by the first node from the other node through the communications link with the other node, data generally indicative of the time at which the message has been sent via the network pathway.
In a feature of this aspect, the method further includes recording, for each message received by the first node from the other node through the communications link with the other node, a network pathway to a destination node by which the message is being sent if such network pathway to the destination node is identified with the message.
In a feature of this aspect, the method further includes communicating, by the first node, the message to a subsequent node in the wireless network if the message is intended for receipt by a node other than the first node, including the steps of: determining whether one or more network pathways are known by the first node from the first node to the destination node of the message; communicating with just a single node within the communications range of the first node if a single network pathway to the destination node is known by the first node, the single node being the node identified next in the single network pathway after the first node, including sending, to the single node, the message, the single network pathway, and the link quality between the first node and the other node from which the message was received by the first node; and (c) if more than one network pathway to the destination node is known by the first node, then determining a preferred network pathway from the known network pathways in accordance with an algorithm, and communicating with just a single node within the communications range of the first node, the single node being the node identified next in the preferred network pathway after the first node, including sending, to the single node, the message, the preferred network pathway and the link quality between the first node and the other node from which the message was received by the first node; and (d) if no network pathway to the destination node is known by the first node, then communicating with one or more nodes within the communications range of the first node, including sending, the message and the link quality between the first node and the other node from which the message was received by the first node. Determining whether one or more network pathways are known by the first node from the first node to the destination node of the message may include searching the maintained information for a network pathway from the first node to the destination node, and the maintained information that is searched may include any network pathway to the destination node that is identified with the message.
In features of this aspect, determining a preferred network pathway from the known network pathways in accordance with an algorithm includes comparing the general times at which messages were sent via the network pathways; comparing the number of hops between nodes in the known network pathways; and/or comparing the overall link quality of the known network pathways.
In such a wireless network, another aspect of the invention includes a method of maintaining information regarding communications links between nodes in the wireless network includes recording, by a server, for each message that is received by the server from the wireless network, a network pathway by which the message has been sent in the wireless network, the network pathway identifying the nodes and the communications links therebetween in the wireless network by which the message has been sent.
In a feature of this aspect, the method further includes recording, in association with the identification of the nodes and the communications links therebetween in the wireless network by which the message has been sent, data indicative of a link quality for each communications link.
In a feature of this aspect, the method further includes recording, in association with each network pathway by which the message has been sent, data indicative of overall link quality for the network pathway.
In a feature of this aspect, the method further includes recording, in association with each network pathway by which the message has been sent, data generally indicative of the time at which the message was sent via the network pathway.
In a feature of this aspect, the method further includes: (a) determining, based on the maintained information, a network pathway for communicating a message to a destination node of the wireless network, and (b) communicating the message to a gateway node of the wireless network together with the determined network pathway to the destination node.
In a feature of this aspect, the method further includes distributing, to one or more nodes of the wireless network, information regarding communications links based on the information maintained by said server.
In a feature of this aspect, the method further includes distributing, to one or more nodes of the wireless network, information regarding network pathways based on the information maintained by said server.
In additional feature of the foregoing aspects, a message may be communicated between nodes utilizing transmission control protocol (TCP), and messages may be communicated between nodes of the wireless network via data packets.
In addition to the foregoing methods in accordance with aspects the invention, other aspects of the invention relate to wireless networks that utilize such methods and, in particular, such wireless networks that are ad hoc wireless networks. The wireless networks furthermore may comprise class-based wireless network that may be utilized for monitoring and/or tracking assets.
In features of these aspects, a node of the wireless network may be a data communications device and include, for example, a standards based radio such as a Bluetooth radio. The node may further includes a wireless receiver for powering up the standards based radio upon receipt of a broadcast that is intended for the standards based radio. The second wireless receiver further may perform a stepped wake-up sequence of the standards based radio. The standards based radio further may include a sensor interface whereby data is acquired by the data communications device from an associated sensor, and the wireless network may comprise a remote sensor interface (RSI) network.
The present application is a U.S. continuation patent application of, and claims priority under 35 U.S.C. § 120 to, U.S. nonprovisional patent application Ser. No. 12/767,561, filed Apr. 26, 2010, which nonprovisional patent application published as U.S. patent application publication no. 2010/0265042, which patent application and any patent application publications thereof are incorporated by reference herein, and which '561 application is a continuation patent application of, and claims priority under 35 U.S.C. § 120 to, U.S. nonprovisional patent application Ser. No. 12/701,451, filed Feb. 5, 2010, which nonprovisional patent application and any patent application publications thereof are hereby incorporated herein by reference, and which '451 application is: (a) a U.S. continuation-in-part patent application of, and claims priority under 35 U.S.C. § 120 to each of (i) U.S. nonprovisional patent application Ser. No. 12/608,837 filed on 10-29-2009, pending, which patent application and any patent application publication thereof are incorporated by reference herein,(ii) U.S. nonprovisional patent application Ser. No. 12/609,009 filed on 10-29-2009, pending, which patent application and any patent application publication thereof are incorporated by reference herein, and(iii) U.S. nonprovisional patent application Ser. No. 12/607,040 filed on 10-27-2009; and(b) a U.S. nonprovisional patent application of, and claims priority under 35 U.S.C. §119(e) to, U.S. provisional patent application Ser. No. 61/150,298, filed Feb. 5, 2009, which provisional patent application is incorporated by reference herein. Additionally, the present application herein incorporates by reference each of: U.S. provisional patent application No. 61/109,494; U.S. provisional patent application No. 61/109,496; U.S. provisional patent application No. 61/109,500; U.S. provisional patent application No. 61/109,502; and U.S. provisional patent application No. 61/109,505; and each of the following U.S. patent application publications and U.S. patents: Application No.Pat. No.Earliest Publication No.12/140,253—US 2008-0303897 A111/930,782—US 2008-0212544 A111/930,788—US 2008-0165749 A111/930,797—US 2008-0151850 A111/930,740—US 2008-0150723 A111/930,770—US 2008-0144554 A111/930,785—US 2008-0143484 A111/930,736—US 2008-0143483 A111/930,753—US 2008-0142592 A111/306,7657,394,361US 2008-0136624 A111/930,749—US 2008-0130536 A111/930,779—US 2008-0129458 A111/930,793—US 2008-0112378 A111/930,761—US 2008-0112377 A111/930,777—US 2008-0111692 A111/847,309—US 2007-0291724 A111/847,295—US 2007-0291690 A111/832,9987,378,959US 2007-0273503 A111/832,9917,378,958US 2007-0268134 A111/832,9797,378,957US 2007-0268126 A111/610,427—US 2007-0159999 A111/618,931—US 2007-0155327 A111/555,173—US 2007-0099629 A111/555,164—US 2007-0099628 A111/425,047—US 2007-0069885 A111/465,466—US 2007-0043807 A111/465,796—US 2007-0041333 A111/193,3007,438,334US 2007-0024066 A111/161,5407,200,132US 2007-0004431 A111/424,850—US 2007-0004331 A111/424,849—US 2007-0004330 A111/161,5507,430,437US 2007-0002808 A111/428,536—US 2007-0002793 A111/428,535—US 2007-0002792 A111/424,847—US 2007-0001898 A111/423,127—US 2006-0289204 A111/424,845—US 2006-0287822 A111/425,040—US 2006-0287008 A111/422,306—US 2006-0282217 A111/422,304—US 2006-0276963 A111/422,321—US 2006-0276161 A111/422,329—US 2006-0274698 A111/306,7647,391,321US 2006-0237490 A111/161,542—US 2006-0023679 A111/161,5397,209,468US 2006-0023678 A111/161,5457,221,668US 2006-0018274 A110/514,3367,209,771US 2005-0215280 A110/987,9647,155,264US 2005-0093703 A110/987,8847,133,704US 2005-0093702 A110/604,0326,934,540US 2004-0082296 A109/681,2826,745,027US 2002-0119770 A1 Each of the foregoing patent application publications and patents is hereby incorporated herein by reference for purposes of disclosure of class-based network (CBN) technology, wake-up (WU) technology, and class-based networks that utilize such technologies (such as those of TeraHop Networks, Inc. of Alpharetta, Ga.), and systems employing such technologies including, inter alia: (1) implementations in the first responder context; (2) implementations in container tracking and monitoring context; and (3) implementations in equipment tracking and monitoring, especially rental construction equipment. It is intended that the CBN and WU technologies, and related features, improvements, and enhancements, as disclosed in these incorporated references may be utilized in combination with various embodiments and implementations of the present invention. Additionally, patent application Ser. No. 11/460,976, and any publications thereof, including U.S. patent application publication no. US 2008-0315596 published on Dec. 25, 2008, are hereby incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
3693155 | Crafton et al. | Sep 1972 | A |
3805265 | Lester | Apr 1974 | A |
4165024 | Oswalt et al. | Aug 1979 | A |
4275385 | White | Jun 1981 | A |
4446454 | Pyle | May 1984 | A |
4613990 | Halpem | Sep 1986 | A |
4680583 | Grover | Jul 1987 | A |
4688244 | Hannon et al. | Aug 1987 | A |
4750197 | Denekamp et al. | Jun 1988 | A |
4775999 | Wllliams | Oct 1988 | A |
4794368 | Grossheim et al. | Dec 1988 | A |
4817537 | Cripe et al. | Apr 1989 | A |
5025254 | Hess | Jun 1991 | A |
5040238 | Comroe et al. | Aug 1991 | A |
5054052 | Nonami | Oct 1991 | A |
5117501 | Childress et al. | May 1992 | A |
5129096 | Burns | Jul 1992 | A |
5206903 | Kohler et al. | Apr 1993 | A |
5210540 | Masumoto | May 1993 | A |
5265025 | Hirata | Nov 1993 | A |
5295154 | Meier et al. | Mar 1994 | A |
5331637 | Francis et al. | Jul 1994 | A |
5369784 | Nelson | Nov 1994 | A |
5400254 | Fujita | Mar 1995 | A |
5425051 | Mahany | Jun 1995 | A |
5442758 | Slingwine et al. | Aug 1995 | A |
5461390 | Hoshen | Oct 1995 | A |
5511232 | O'Dea et al. | Apr 1996 | A |
5515270 | Weinblatt | May 1996 | A |
5525992 | Froshermeier | Jun 1996 | A |
5530702 | Palmer et al. | Jun 1996 | A |
5543778 | Stouffer | Aug 1996 | A |
5550547 | Chan et al. | Aug 1996 | A |
5552641 | Fischer et al. | Sep 1996 | A |
5555376 | Theimer et al. | Sep 1996 | A |
5558013 | Blackstone | Sep 1996 | A |
5565858 | Guthrie | Oct 1996 | A |
5579306 | Dent | Nov 1996 | A |
5590409 | Sawahashi et al. | Dec 1996 | A |
5592533 | Sawahashi et al. | Jan 1997 | A |
5596625 | LeBlanc | Jan 1997 | A |
5596652 | Piatek et al. | Jan 1997 | A |
5604892 | Nuttall et al. | Feb 1997 | A |
5606313 | Allen et al. | Feb 1997 | A |
5640151 | Reis et al. | Jun 1997 | A |
5649286 | Frerking | Jul 1997 | A |
5652751 | Sharony | Jul 1997 | A |
5682379 | Mahany et al. | Oct 1997 | A |
5686902 | Reis et al. | Nov 1997 | A |
5732007 | Grushin et al. | Mar 1998 | A |
5761195 | Lu et al. | Jun 1998 | A |
5771459 | Demery et al. | Jun 1998 | A |
5790946 | Rotzoll | Aug 1998 | A |
5793882 | Piatek et al. | Aug 1998 | A |
5812049 | Uzi | Sep 1998 | A |
5833910 | Teixido | Nov 1998 | A |
5850187 | Carrender et al. | Dec 1998 | A |
5862803 | Besson | Jan 1999 | A |
5873040 | Dunn et al. | Feb 1999 | A |
5887176 | Griffith et al. | Mar 1999 | A |
5890054 | Lodgson et al. | Mar 1999 | A |
5892441 | Woolley et al. | Apr 1999 | A |
5907491 | Canada et al. | May 1999 | A |
5917423 | Duvall | Jun 1999 | A |
5917433 | Keillor et al. | Jun 1999 | A |
5939982 | Gagnon et al. | Aug 1999 | A |
5943610 | Endo | Aug 1999 | A |
5950124 | Trompower et al. | Sep 1999 | A |
5950133 | Bledsoe | Sep 1999 | A |
5959568 | Woolley | Sep 1999 | A |
5974236 | Sherman | Oct 1999 | A |
5977913 | Christ | Nov 1999 | A |
5999091 | Wortham | Dec 1999 | A |
6005884 | Cook et al. | Dec 1999 | A |
6006100 | Koenck et al. | Dec 1999 | A |
6058374 | Guthrie et al. | May 2000 | A |
6072784 | Agrawal et al. | Jun 2000 | A |
6078789 | Bodenmann et al. | Jun 2000 | A |
6084512 | Elberty et al. | Jul 2000 | A |
6091724 | Chandra et al. | Jul 2000 | A |
6097707 | Hodzic et al. | Aug 2000 | A |
6104512 | Batey et al. | Aug 2000 | A |
6118988 | Choi | Sep 2000 | A |
6125306 | Shimada et al. | Sep 2000 | A |
6127928 | Issacman | Oct 2000 | A |
6127976 | Boyd et al. | Oct 2000 | A |
6130602 | O'Toole et al. | Oct 2000 | A |
6134587 | Okanoue | Oct 2000 | A |
6154658 | Caci | Nov 2000 | A |
6192232 | Iseyama | Feb 2001 | B1 |
6192400 | Hanson et al. | Feb 2001 | B1 |
6198913 | Sung et al. | Mar 2001 | B1 |
6201974 | Lietsalmi et al. | Mar 2001 | B1 |
6246882 | Lachance | Jun 2001 | B1 |
6256303 | Drakoulis et al. | Jul 2001 | B1 |
6262662 | Back et al. | Jul 2001 | B1 |
6282407 | Vega et al. | Aug 2001 | B1 |
6285295 | Casden | Sep 2001 | B1 |
6313745 | Suzuki | Nov 2001 | B1 |
6343073 | Mashinsky | Jan 2002 | B1 |
6354493 | Mon | Mar 2002 | B1 |
6360169 | Dudaney | Mar 2002 | B1 |
6381467 | Hill et al. | Apr 2002 | B1 |
6404082 | Rasinski et al. | Jun 2002 | B1 |
6405102 | Swartz et al. | Jun 2002 | B1 |
6409082 | Davis et al. | Jun 2002 | B1 |
6418299 | Ramanathan | Jul 2002 | B1 |
6424260 | Maloney | Jul 2002 | B2 |
6424264 | Giraldin et al. | Jul 2002 | B1 |
6427913 | Maloney | Aug 2002 | B1 |
6437692 | Petite et al. | Aug 2002 | B1 |
6473607 | Shohara et al. | Oct 2002 | B1 |
6476708 | Johnson | Nov 2002 | B1 |
6493649 | Jones et al. | Dec 2002 | B1 |
6512455 | Finn et al. | Jan 2003 | B2 |
6512478 | Chien | Jan 2003 | B1 |
6529142 | Yeh et al. | Mar 2003 | B2 |
6542114 | Eagleson et al. | Apr 2003 | B1 |
6547137 | Begelfer et al. | Apr 2003 | B1 |
6559620 | Zhou et al. | May 2003 | B2 |
6587755 | Smith et al. | Jul 2003 | B1 |
6593845 | Friedman et al. | Jul 2003 | B1 |
6594468 | Ramanathan | Jul 2003 | B1 |
6600418 | Francis et al. | Jul 2003 | B2 |
6611556 | Koener et al. | Aug 2003 | B1 |
6614349 | Proctor et al. | Sep 2003 | B1 |
6617962 | Horwitz et al. | Sep 2003 | B1 |
6630885 | Hardman et al. | Oct 2003 | B2 |
6665585 | Kawase | Dec 2003 | B2 |
6674364 | Holbrook et al. | Jan 2004 | B1 |
6677852 | Landt | Jan 2004 | B1 |
6680920 | Wan | Jan 2004 | B1 |
6700493 | Robinson | Mar 2004 | B1 |
6700533 | Werb et al. | Mar 2004 | B1 |
6701215 | Stademan | Mar 2004 | B1 |
6800533 | Werb | Mar 2004 | B1 |
6720888 | Eagleson et al. | Apr 2004 | B2 |
6735630 | Gelvin et al. | May 2004 | B1 |
6737974 | Dickinson | May 2004 | B2 |
6745027 | Twitchell et al. | Jun 2004 | B2 |
6747562 | Giraldin et al. | Jun 2004 | B2 |
6751200 | Larsson et al. | Jun 2004 | B1 |
6753775 | Auerbach et al. | Jun 2004 | B2 |
6760578 | Rotzoll | Jul 2004 | B2 |
6761312 | Piatek et al. | Jul 2004 | B2 |
6765484 | Eagleson et al. | Jul 2004 | B2 |
6816063 | Kubler et al. | Nov 2004 | B2 |
6826625 | Kubler et al. | Nov 2004 | B1 |
6847892 | Zhou | Jan 2005 | B2 |
6914896 | Tomalewicz | Jul 2005 | B1 |
6919803 | Breed | Jul 2005 | B2 |
6927688 | Tice | Aug 2005 | B2 |
6934540 | Twitchell et al. | Aug 2005 | B2 |
6940392 | Chan et al. | Sep 2005 | B2 |
6972682 | Lareau et al. | Dec 2005 | B2 |
6975614 | Kennedy | Dec 2005 | B2 |
6975941 | Lau et al. | Dec 2005 | B1 |
6988667 | Stewart et al. | Jan 2006 | B2 |
7137003 | Krishnan et al. | Jan 2006 | B2 |
7005968 | Bridgelall | Feb 2006 | B1 |
7012529 | Sajkowsky | Mar 2006 | B2 |
7027773 | McMillin | Apr 2006 | B1 |
7072668 | Chou | Jul 2006 | B2 |
7084740 | Bridgelall | Aug 2006 | B2 |
7088229 | Johnson | Aug 2006 | B2 |
7098784 | Easley et al. | Aug 2006 | B2 |
7103344 | Menard | Sep 2006 | B2 |
7126470 | Clift et al. | Oct 2006 | B2 |
7130638 | Chen et al. | Oct 2006 | B2 |
7133704 | Twitchell | Nov 2006 | B2 |
7142121 | Chan et al. | Nov 2006 | B2 |
7155264 | Twitchell et al. | Dec 2006 | B2 |
7158803 | Elliot | Jan 2007 | B1 |
7171476 | Maeda et al. | Jan 2007 | B2 |
7191934 | Miller et al. | Mar 2007 | B2 |
7196622 | Lambright | Mar 2007 | B2 |
7200132 | Twitchell et al. | Apr 2007 | B2 |
7209468 | Twitchell et al. | Apr 2007 | B2 |
7209771 | Twitchell et al. | Apr 2007 | B2 |
7212122 | Gloekler | May 2007 | B2 |
7218619 | Koo | May 2007 | B2 |
7221668 | Twitchell et al. | May 2007 | B2 |
7230933 | Bahl et al. | Jun 2007 | B2 |
7233958 | Weng | Jun 2007 | B2 |
7251233 | Wood | Jul 2007 | B2 |
7253731 | Joao | Aug 2007 | B2 |
7274295 | Koch | Sep 2007 | B2 |
7282944 | Gunn et al. | Oct 2007 | B2 |
7317382 | Pratt | Jan 2008 | B2 |
7319397 | Chung | Jan 2008 | B2 |
7323981 | Peel | Jan 2008 | B2 |
7327280 | Bachelder et al. | Feb 2008 | B2 |
7330736 | Redi | Feb 2008 | B2 |
7340260 | McAlexander | Mar 2008 | B2 |
7348875 | Hughes et al. | Mar 2008 | B2 |
7349803 | Belenkii et al. | Mar 2008 | B2 |
7349804 | Belenkii | Mar 2008 | B2 |
7369047 | Broad | May 2008 | B2 |
7369074 | Miyata et al. | May 2008 | B2 |
7376507 | Daily et al. | May 2008 | B1 |
7394372 | Gloekler | Jul 2008 | B2 |
7397363 | Joao | Jul 2008 | B2 |
7419101 | Kawai | Sep 2008 | B2 |
7430437 | Twitchell et al. | Sep 2008 | B2 |
7440781 | Beach et al. | Oct 2008 | B2 |
7482920 | Joao | Jan 2009 | B2 |
7489244 | August et al. | Feb 2009 | B2 |
7489245 | August et al. | Feb 2009 | B2 |
7518803 | Sawai et al. | Apr 2009 | B2 |
7522568 | Twitchell et al. | Apr 2009 | B2 |
7536188 | Fegan et al. | May 2009 | B1 |
7538656 | Twitchell et al. | May 2009 | B2 |
7538657 | Twitchell et al. | May 2009 | B2 |
7552169 | Huang et al. | Jun 2009 | B2 |
7561533 | Aklepi et al. | Jul 2009 | B2 |
7589616 | Klatsmanyi et al. | Sep 2009 | B2 |
7613484 | Lappetelainen et al. | Nov 2009 | B2 |
7626488 | Armstrong et al. | Dec 2009 | B2 |
7733818 | Fegan et al. | Jun 2010 | B2 |
7742744 | Twitchell | Jun 2010 | B2 |
7742745 | Twitchell | Jun 2010 | B2 |
7746838 | Twitchell | Jun 2010 | B2 |
7830850 | Twitchell | Nov 2010 | B2 |
7830852 | Twitchell et al. | Nov 2010 | B2 |
7904071 | Twitchell | Mar 2011 | B2 |
7907941 | Twitchell | Mar 2011 | B2 |
7937068 | Hogberg et al. | May 2011 | B2 |
7940717 | Twitchell | May 2011 | B2 |
7940719 | Twitchell | May 2011 | B2 |
7940736 | Cantwell | May 2011 | B2 |
7941095 | Twitchell | May 2011 | B2 |
8045929 | Twitchell | Nov 2011 | B2 |
8050625 | Twitchell | Nov 2011 | B2 |
8050668 | Twitchell | Nov 2011 | B2 |
8055286 | Reeves | Nov 2011 | B1 |
8078139 | Twitchell | Dec 2011 | B2 |
8275404 | Berger et al. | Sep 2012 | B2 |
8315237 | Berger et al. | Nov 2012 | B2 |
8462662 | Robins et al. | Jun 2013 | B2 |
8699381 | Koop et al. | Apr 2014 | B2 |
20010000019 | Bowers et al. | Mar 2001 | A1 |
20010050550 | Yoshida et al. | Dec 2001 | A1 |
20020002627 | Stead et al. | Jan 2002 | A1 |
20020026284 | Brown | Feb 2002 | A1 |
20020030596 | Finn et al. | Mar 2002 | A1 |
20020039896 | Brown | Apr 2002 | A1 |
20020050932 | Rhoades et al. | May 2002 | A1 |
20020073646 | Von Gutfeld et al. | Jun 2002 | A1 |
20020073648 | Sevcik et al. | Jun 2002 | A1 |
20020089421 | Farrington et al. | Jul 2002 | A1 |
20020089434 | Ghazarian | Jul 2002 | A1 |
20020098861 | Doney et al. | Jul 2002 | A1 |
20020099567 | Joao | Jul 2002 | A1 |
20020119770 | Twitchell | Aug 2002 | A1 |
20020146985 | Naden | Oct 2002 | A1 |
20020149483 | Shanks et al. | Oct 2002 | A1 |
20020170961 | Dickson et al. | Nov 2002 | A1 |
20030001743 | Menard | Jan 2003 | A1 |
20030008692 | Phelan | Jan 2003 | A1 |
20030012168 | Elson et al. | Jan 2003 | A1 |
20030019929 | Stewart et al. | Jan 2003 | A1 |
20030083064 | Cooper | May 2003 | A1 |
20030137968 | Lareau et al. | Jul 2003 | A1 |
20030141973 | Yeh et al. | Jul 2003 | A1 |
20030144020 | Challa et al. | Jul 2003 | A1 |
20030179073 | Ghazarian | Sep 2003 | A1 |
20030182077 | Emord | Sep 2003 | A1 |
20030209601 | Chung | Nov 2003 | A1 |
20030236077 | Sivard | Dec 2003 | A1 |
20040021572 | Schoen et al. | Feb 2004 | A1 |
20040041706 | Stratmoen et al. | Mar 2004 | A1 |
20040041731 | Hisano | Mar 2004 | A1 |
20040100394 | Hitt | May 2004 | A1 |
20040100415 | Veitch et al. | May 2004 | A1 |
20040109429 | Carter et al. | Jun 2004 | A1 |
20040119588 | Marks | Jun 2004 | A1 |
20040121793 | Weigele et al. | Jun 2004 | A1 |
20040135691 | Duron et al. | Jul 2004 | A1 |
20040183673 | Nageli | Sep 2004 | A1 |
20040232924 | Hilleary et al. | Nov 2004 | A1 |
20040233041 | Bohman et al. | Nov 2004 | A1 |
20040233054 | Neff et al. | Nov 2004 | A1 |
20040246463 | Milinusic | Dec 2004 | A1 |
20050003797 | Baldwin | Jan 2005 | A1 |
20050043068 | Shohara et al. | Feb 2005 | A1 |
20050068169 | Copley et al. | Mar 2005 | A1 |
20050073406 | Easley et al. | Apr 2005 | A1 |
20050087235 | Skorpik | Apr 2005 | A1 |
20050088299 | Bandy et al. | Apr 2005 | A1 |
20050090211 | Lilja et al. | Apr 2005 | A1 |
20050114326 | Smith et al. | May 2005 | A1 |
20050128080 | Hall et al. | Jun 2005 | A1 |
20050145018 | Sabata et al. | Jul 2005 | A1 |
20050146445 | Sieboda et al. | Jul 2005 | A1 |
20050159187 | Mendolia et al. | Jul 2005 | A1 |
20050190759 | Lee et al. | Sep 2005 | A1 |
20050199716 | Shafer et al. | Sep 2005 | A1 |
20050226201 | McMillin | Oct 2005 | A1 |
20050261037 | Raghunath et al. | Nov 2005 | A1 |
20050270160 | Chan et al. | Dec 2005 | A1 |
20060104301 | Beyer et al. | May 2006 | A1 |
20060109106 | Braun | May 2006 | A1 |
20060114102 | Chang et al. | Jun 2006 | A1 |
20060135145 | Redi | Jun 2006 | A1 |
20060163422 | Krikorian et al. | Jul 2006 | A1 |
20060164232 | Waterhouse et al. | Jul 2006 | A1 |
20060164239 | Loda | Jul 2006 | A1 |
20060202817 | Mackenzie et al. | Sep 2006 | A1 |
20060231611 | Chakiris et al. | Oct 2006 | A1 |
20060244568 | Tong et al. | Nov 2006 | A1 |
20060247986 | Joao | Nov 2006 | A1 |
20060270382 | Lappetelainen et al. | Nov 2006 | A1 |
20070002792 | Twitchell et al. | Jan 2007 | A1 |
20070008408 | Zehavi | Jan 2007 | A1 |
20070032951 | Tanenhaus et al. | Feb 2007 | A1 |
20070043807 | Twitchell et al. | Feb 2007 | A1 |
20070127429 | Bryan et al. | Jun 2007 | A1 |
20070135179 | Hardman et al. | Jun 2007 | A1 |
20070152826 | August et al. | Jul 2007 | A1 |
20070155327 | Twitchell et al. | Jul 2007 | A1 |
20070258508 | Werb et al. | Nov 2007 | A1 |
20080234878 | Joao | Sep 2008 | A1 |
20080253327 | Kohvakka et al. | Oct 2008 | A1 |
20080255947 | Friedman | Oct 2008 | A1 |
20080264888 | Zakula et al. | Oct 2008 | A1 |
20090008450 | Ebert et al. | Jan 2009 | A1 |
20090083390 | Abu-Ghazaleh et al. | Mar 2009 | A1 |
20090100167 | Huang et al. | Apr 2009 | A1 |
20090103462 | Twitchell et al. | Apr 2009 | A1 |
20090104902 | Twitchell et al. | Apr 2009 | A1 |
20090111484 | Koch et al. | Apr 2009 | A1 |
20090117950 | Twitchell | May 2009 | A1 |
20090124302 | Twitchell | May 2009 | A1 |
20090135000 | Twitchell et al. | May 2009 | A1 |
20090146805 | Joao | Jun 2009 | A1 |
20090161642 | Twitchell et al. | Jun 2009 | A1 |
20090181623 | Twitchell et al. | Jul 2009 | A1 |
20090215407 | Twitchell | Aug 2009 | A1 |
20090237216 | Twitchell | Sep 2009 | A1 |
20090252060 | Twitchell | Oct 2009 | A1 |
20090264079 | Twitchell | Oct 2009 | A1 |
20090267770 | Twitchell | Oct 2009 | A1 |
20090290512 | Twitchell | Nov 2009 | A1 |
20100007470 | Twitchell | Jan 2010 | A1 |
20100061264 | Campbell | Mar 2010 | A1 |
20100067420 | Twitchell | Mar 2010 | A1 |
20100121862 | Twitchell | May 2010 | A1 |
20100141401 | Twitchell | Jun 2010 | A1 |
20100141449 | Twitchell | Jun 2010 | A1 |
20100144383 | Berger et al. | Jun 2010 | A1 |
20100150026 | Robins | Jun 2010 | A1 |
20100150122 | Berger et al. | Jun 2010 | A1 |
20100214074 | Twitchell | Aug 2010 | A1 |
20100219939 | Twitchell | Sep 2010 | A1 |
20100231381 | Twitchell | Sep 2010 | A1 |
20100232320 | Twitchell | Sep 2010 | A1 |
20100238940 | Koop | Sep 2010 | A1 |
20100250460 | Twitchell | Sep 2010 | A1 |
20100265042 | Koop et al. | Oct 2010 | A1 |
20100330930 | Twitchell | Dec 2010 | A1 |
20110006882 | Twitchell | Jan 2011 | A1 |
20110289320 | Twitchell et al. | Nov 2011 | A1 |
20130072144 | Berger et al. | Mar 2013 | A1 |
Number | Date | Country |
---|---|---|
0467036 | Jan 1992 | EP |
0748083 | Dec 1996 | EP |
0748085 | Dec 1996 | EP |
0829995 | Mar 1998 | EP |
0944014 | Sep 1999 | EP |
1692668 | Aug 2006 | EP |
1317733 | Apr 2010 | EP |
1692599 | Jul 2013 | EP |
2308947 | Jul 1997 | GB |
20050102419 | Oct 2005 | KR |
20070005515 | Jan 2007 | KR |
WO-0068907 | Nov 2000 | WO |
WO-0069186 | Nov 2000 | WO |
WO-2003098175 | Nov 2003 | WO |
WO-2010096127 | Aug 2010 | WO |
Entry |
---|
“International Search Report and Written Opinion”, Application No. PCT/US2009/062655, dated Jun. 14, 2010, 9 pages. |
“Network Topology—Wikipedia”, http://en.wikipedia.org/wiki/Network—topology—Jun. 26, 2010, 8 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/608,837, dated Jul. 30, 2012, 21 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/609,009, dated Dec. 28, 2011, 7 pages. |
“Non-Final Office Action”, U.S. Appl. No. 12/767,561, dated May 30, 2013, 9 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/607,040, dated Jul. 13, 2012, 7 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/608,837, dated Feb. 14, 2013, 8 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/609,009, dated May 4, 2012, 7 pages. |
“Notice of Allowance”, U.S. Appl. No. 12/767,561, dated Dec. 2, 2013, 13 pages. |
“Personal are network—Wikipedia”, https://web.archive.org/web/20110410181452/http://en.wikipedia.org/wiki/Personal—area—network, Apr. 10, 2011, 2 pages. |
“Response to the Department of Homeland Security and Border Protection Conveyance Security Device Requirements, Version 1.2”, TeraHop Networks, Inc, Dec. 10, 2007, 62 pages. |
“Restriction Requirement”, U.S. Appl. No. 12/607,040, dated Apr. 19, 2012, 6 pages. |
“TeraHop Networks—Tradeshow Handouts”, MERIT-2030-2040 Gateway Controllers; MERIT-300 Incedent Node; MERIT-TL TeraLink System Software, 2006, 6 pages. |
“TeraHop Networks Atlanta Airport Fire-Recuse Project Description of Project Components”, TeraHop Networks, Feb. 7, 2008, 11 pages. |
“TeraHop Networks—Documents A Through I, Including Brief Description”, 121 pages. |
“Ultra-wideband—Wikipedia”, http://web.archive.org/web/20110110032109/http://en.wikipedia.org/wiki/Ultra-wideband, Mar. 3, 2011, 4 pages. |
“Wireless Mesh Network—Tree Topology”, Retrieved at: http://www.afar.net/technology/wireless-mesh/, 2 pages. |
“Written Opinion”, Application No. PCT/US2006/026158, dated Nov. 21, 2006, 7 pages. |
Easley,“Global Container Security System”, U.S. Appl. No. 60/499,338,—filed Sep. 3, 2003, 27 pages. |
Garcia-Luna-Aceves,“Source-Tree Routing in Wireless Networks”, Proceedings of Seventh International Conference on Network Protocols, Oct. 1999, 10 pages. |
Gu,“C-ICAMA, A Centralized Intelligent Channel Assigned Multiple Access for Multi-Layer Ad-Hoc Wireless Networks with UAVs”, Conference: Wireless Communications and Networking Confernce, 2000, Feb. 2000, pp. 879-884. |
Gu,“Hierarchical Routing for Multi-Layer Ad-Hoc Wireless Networks with UAVs”, 21st Century Military Communications Conference Proceedings, Oct. 2000, 5 pages. |
Haartsen,“Bluetooth—The Universal Radio Interface for Ad Hoc, Wireless Connectivity”, Ericsson Review No. 3, Jan. 1998, 8 pages. |
Haartsen,“Bluetooth: Vision, Goals, and Architecture”, Mobile Computing & Communications Review, vol. 1, No. 2, Oct. 1998, 8 pages. |
Hubaux,“Toward Self-Organized Mobile Ad Hoc Networks: The Terminodes Project”, IEEE Communications Magazine ( vol. 39, Issue: 1, Jan. 2001 ), Jan. 2001, 7 pages. |
Iwata,“Scalable Routing Strategies for Ad hoc Wireless Networks”, IEEE Journal on Selected Areas in Communications, Aug. 1999, 26 pages. |
Keshavarzian,“Energy-Efficient Link Assessment in Wireless Sensor Networks”, Conference on the IEEE computer and Communications Societies, vol. 3, Nov. 2004, 14 pages. |
Lee,“On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks”, Retrieved at: https://tools.ietf.org/html/draft-ietf-manet-odmrp-02, Jan. 2000, 29 pages. |
Melodia,“On the Interdependence of Distributed Topology Control and Geographical Routing in Ad Hoc and Sensor Networks”, IEEE Journal on Selected Areas in Communications, vol. 23, No. 3, Mar. 2008, pp. 520-532. |
Mingliang,“Cluster Based Routing Protocol (CBRP)”, Internet-Draft, National University of Singapore, Aug. 1999, 27 pages. |
Morgan,“Miniature Tags Provide Visibility & Cohesion for an LIA Battalion Level ‘Proof of Principle’”, Pacific NW National Laboratory, Apr. 2001, 11 pages. |
Nageli,“Portable Detachable Self-Contained Tracking Unit for Two-Way Satellite Communication with a Central Server”, U.S. Appl. No. 60/444,029, filed Jan. 31, 2003, 38 pages. |
Pei,“A Wireless Hierarchical Routing Protocol with Group Mobility”, Wireless Communications and Networking Conference, Jan. 21, 1999, 18 pages. |
Pei,“Mobility Management in Hierarchical Multi-Hop Mobile Wireless Networks”, Eight International Conference on Computer Communications and Networks Proceedings., Oct. 1999, 6 pages. |
Perkins,“AD HOC Networks”, Table of Contens, Chapters 1, 4, and 11, Jan. 2001, 112 pages. |
Perkins,“Mobile Ad Hoc Networking Terminology”, draft-ietf-manet-term-01.txt—Internet Draft, Nov. 17, 1998, 10 pages. |
Ramanathan,“Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support”, Mobile Networks and Applications, Jun. 1998, 36 pages. |
Sharp,“Physical Reality: A Second Look, Supply Chain Systems”, http://www.idsystems.com/reader/1999—03/phys0399—pt2/index.htm, Mar. 1999, 5 pages. |
Sommer,“Group 4, Passive RF Tags”, 4 pages |
Stojmenovic,“Design Guidelines for Routing Protocols in Ad Hoc and Sensor Networks with a Realistic Physical Layer”, IEEE Communications Magazine ( vol. 43, Issue: 3, Mar. 2005), Mar. 2005, 6 pages. |
Valdevit,“Cascading in Fibre Channel: how to build a multi-switch fabric”, Brocade Communications Systems, available at http://www.brocade.com/SAN/white—papers/pdf/Cascading.pdf, 1999, 13 pages. |
Wen,“Decentralized anchor-free localization for wireless ad-hoc sensor networks”, 2008 IEEE International Conference of Systems, Man and Cybernetics (SMC 2008), pp. 2777-2784. |
Woo, et al., “Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks”, Proceedings of the 1st international conference on Embedded networked sensor systems, SenSys 2003, Nov. 5, 2003, 14 pages. |
Number | Date | Country | |
---|---|---|---|
20130012122 A1 | Jan 2013 | US |
Number | Date | Country | |
---|---|---|---|
61150298 | Feb 2009 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12767561 | Apr 2010 | US |
Child | 13620344 | US | |
Parent | 12701451 | Feb 2010 | US |
Child | 12767561 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12608837 | Oct 2009 | US |
Child | 12701451 | US | |
Parent | 12609009 | Oct 2009 | US |
Child | 12608837 | US | |
Parent | 12607040 | Oct 2009 | US |
Child | 12609009 | US |