Patent Grant
10425877
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.
The present invention broadly relates to wireless communications utilizing nondeterministic and deterministic networking and, in particular, to wireless communications utilizing nondeterministic and deterministic networking within ad hoc networking environments. Commercial implementations of the present invention are particularly suited for use in asset tracking networks, sensor data acquisition networks, and combinations thereof, including class-based networks. Such class-based networks are disclosed, for example, in U.S. Pat. Nos. 6,934,540 and 6,745,027, which have been incorporated herein by reference above. Commercial implementations of the present invention also may be particularly suited for use in voice and video conferencing communications between persons.
The present invention includes many aspects and features, and certain aspects and features of the present invention relate to a wireless network that includes a plurality of nodes.
In such a wireless network, a first aspect of the invention includes a method of communicating a message from an originating node, intended for receipt by a destination node, via one or more intermediate nodes, includes the step of communicating with all nodes within the communications range of the originating node—including sending the message—if a network pathway to the destination node is unknown by the originating node.
In a feature of this aspect, the method further includes communicating the message from the originating node by a first intermediate node by communicating with all nodes within the communications range of the first intermediate node if a network pathway to the destination node is unknown by the first intermediate node. The step of communicating by the first intermediate node includes sending the message and the link quality between the originating node and the first intermediate node.
In such a wireless network, another aspect of the invention includes a method of communicating a message from an originating node, intended for receipt by a destination node, via one or more intermediate nodes, includes the steps of: (a) communicating with just a single node within the communications range of the originating node if a network pathway to the destination node is known by the originating node, the single node being the first intermediate node identified in the known network pathway, said step of communicating including sending the message and the known network pathway to the first intermediate node; and (b) communicating with one or more first intermediate nodes within the communications range of the originating node if a network pathway to the destination node is unknown by the originating node, said step of communicating including sending the message.
In a feature of this aspect, the method further includes communicating the message by a first intermediate node by: (a) communicating with just a single node within the communications range of the first intermediate node if a network pathway to the destination node is known by the first intermediate node, the single node being the node identified next after the first intermediate node in the known network pathway, including sending, to the next identified node the message, the known network pathway, and the link quality between the originating node and the first intermediate node; and (b) communicating with one or more nodes within the communications range of the first intermediate node if a network pathway to the destination node is unknown by the first intermediate node, including sending the message, and the link quality between the originating node and the first intermediate node.
In another feature of this aspect, the method further includes communicating the message by the first intermediate node by: (a) communicating with just a single node within the communications range of the first intermediate node if a single network pathway to the destination node is known by the first intermediate node, the single node being the node identified next after the first intermediate node in the single network pathway, said step of communicating including sending, to the single node, the message, the known network pathway, and the link quality between the originating node and the first intermediate node; (b) if a plurality of network pathways to the destination node are known by the first intermediate node, then, determining a preferred network pathway from the plurality of known network pathways in accordance with an algorithm, and communicating with just a single node within the communications range of the first intermediate node, the single node being the node identified next after the first intermediate node in the preferred network pathway, including sending, to the next identified node, the message, the preferred network pathway, and the link quality between the originating node and the first intermediate node; and (c) if no network pathway is known by the first intermediate node, then communicating with one or more nodes within the communications range of the first intermediate node, including sending the message and the link quality between the originating node and the first intermediate node. Determining a preferred network pathway from the known network pathways in accordance with an algorithm may include comparing, for each known network pathway, the number of hops, between nodes, that are required to reach the destination node; and/or comparing the overall link quality of the respective known network pathways.
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.
In addition to the aforementioned aspects and features of the invention, it should be noted that the invention further includes the various possible combinations of such aspects and features, including the combinations of such aspects and features with those aspects and features of the incorporated references from which priority is claimed.
Particular embodiments of the invention are to be understood according to the detailed descriptions that follow in conjunction with the attached figures, 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. Various embodiments are discussed for 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 descriptions of embodiments 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. 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 lease 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.”
In addition to the foregoing, the following terminology also is used herein.
As used herein with reference to a wireless network, a “node” of the wireless network refers to a wireless radio-frequency data communication device comprising a transceiver that receives and transmits information wirelessly with one or more other nodes of the wireless network. Moreover, in preferred embodiments and implementations of the invention, the transceiver comprises a standards-based radio, such as a Bluetooth radio, and information is communicated in data packets using transmission control protocol (“TCP”). A data communication device of a node of the wireless network may be mobile or fixed at a particular location, and the data communication device may include an internal power supply source or utilize an external power supply source. The data communication device also preferably includes an interface for communicating with an associated sensor or other data acquisition device, which sensor may or may not form part of the node. The data communication device constituting the node may be attached to an asset that is to be monitored and/or tracked, alternatively, the data communication device constituting the node may be permanently affixed to a structure for monitoring and/or tracking assets that come within proximity thereto.
Generally, in receiving or transmitting information wirelessly between two nodes of a wireless network, a communications link is established between the two data communication devices of the two nodes. An electronic message then is transmitted via the communications link between the two data communication devices. Following transmission of the electronic message, the communications link is disconnected.
Alternatively, the communications link established between the data communication devices of the two nodes may be maintained, if desired, in order to provide continuous communications between the two nodes without having to reestablish a communications link therebetween. Establishing a continuous communications link between two nodes without having to reestablish the communications link therebetween is particularly desirable, for instance, in transmitting real time audiovisual content, or in providing real time audiovisual communications between persons. Such person-to-person communications further may be “two-way” when each data communication device at each node includes dual radios. This is particularly true when Bluetooth radios are utilized, which do not include duplex capabilities. Thus, for example, maintaining continuous communications between two nodes each employing dual radios is particularly desirable if data packets for Voice-over-IP (“VoIP”) services are to be wirelessly transmitted between the two nodes.
A node of a wireless network from which an electronic message first is sent is referred to herein as an “originating node.” Similarly, a node of a wireless network to which an electronic message is ultimately destined is referred to herein as a “destination node.” Any node that relays the electronic message from the originating node to the destination node is referred to herein as an “intermediate node.” Each route by which an electronic message is communicated from an originating node to a destination node is referred to herein as a “pathway,” and each pathway is identified by the identification of the originating node, each intermediate node that relays the electronic message, and the destination node.
In accordance with the invention, one or more nodes of a wireless network preferably are disposed in direct electronic communication with a network that is external to the wireless network. Such a node is referred to herein as a “gateway.” Communications between the gateway and the external network may be wireless or hard wired and comprise, for example, a network interface card that accepts a CAT 5 cable for Ethernet communications; a cellular transceiver for communications via a cellular telephone network; a satellite transceiver for communications via a satellite network; or any combination thereof. The wired network itself may be a wide area network (“WAN”) and include the Internet.
A computer system preferably is disposed in electronic communication with the same wired network, whereby the computer system and each node of the wireless network may communicate with each other through the external network, such as the WAN, and the one or more gateways. Generally, the computer system preferably includes application software and a database (or access to a database), and the computer system records and maintains information regarding the wireless network, nodes thereof, and/or data received therefrom. Such a computer system is referred to herein as a “server.”
A node of the wireless network at which a data communication device establishes a communications link with a gateway is referred to herein as a “top level node.”
As further used herein with reference to a wireless network, an “ad hoc network” refers to a wireless network in which node-to-node communications occur without central control or wired infrastructure. Such a network typically will have dynamic pathways and is advantageous because it is inexpensive, fault-tolerant, and flexible. Wireless networks used in accordance with the present invention preferably comprise ad hoc networks.
Each communication of an electronic message between nodes may include several components, including a header and a body. The body of the communication preferably carries the original message from the originating node and would include any data acquired at the node or by a sensor associated with the node that is to be communicated to the server. The header of the communication preferably includes information pertaining to the message itself, such as a unique “message ID” that comprises information representative of the originating node of the message and may include a count representing the number of messages originated by the originating node. In class-based networks, the message ID further may include the class or classes of the originating node.
The header of the communication also preferably includes the pathway by which the message is to be communicated when the message is being sent in accordance with a deterministic routing method of the present invention, which is described in detail below.
Other header information of the communication preferably includes the pathway history by which the message has been communicated, including the original communication from the originating node, and the link quality of each communications link between nodes in the pathway history. A possible checksum and priority optionally may be included in the message header. In class-based networks, the header of the communication also may include one or more class designations.
Turning now to the figures,
In
The exemplary grid arrangement also aids in illustrating an exemplary range of communication for each node. In this respect, each node is deemed to have a communications range equal to the length of a side of one of the nine basic squares of the grid. Consequently, communications may occur between a node either to the immediate side or top or bottom of another node within the grid; however, a node disposed diagonally to another node is out of direct communications range and, therefore, direct communications between such nodes do not occur. Again, each node is shown having the same communications range only for simplicity and clarity in illustrating the present invention, and it is to be understood that the actual communications ranges of the nodes likely will vary in any actual implementation.
In accordance with the present invention, communications between the server 10 and each node of the wireless network 14 occur in which information is acquired by the server 10 from each of the nodes. The information may include data that is stored within a computer-readable medium of the node and/or data that is acquired from a sensor that is associated with the node. In communicating with each node other than a gateway 16, the server 10 communicates via one or more intermediate nodes including a gateway 16. In communicating with a node that is a gateway 16, the server 10 communicates with the gateway 16 preferably without communicating via one or more other nodes of the wireless network 14. In communicating between nodes and between the gateway 16 and the server 10, TCP preferably is utilized as the protocol, which well known protocol is robust and accounts for error detection and correction.
Origination and communication of a message from a node to the server 10 preferably is triggered upon occurrence of a predefined event (“Trigger Event”). The Trigger Event may be based on data that is acquired by a sensor. Thus, for example, if a sensor monitors the opening of a maritime shipping container door, a Trigger Event may include the detection that the container door has been opened. In another example, if a sensor monitors for motion of an asset being tracked, a Trigger Event may include the movement of the asset.
Alternatively, or in addition thereto, Trigger Events may be predefined to occur at regular defined intervals at which times messages are originated and communicated from a node to the server 10. Such messages may include all or a portion of data that has been acquired from a sensor associated with the node. Such intervals may be determined utilizing a timer.
In addition to origination and communication of a message from a node to the server 10 upon occurrence of a Trigger Event, a message also may be originated and communicated from a node to the server 10 in response to an inquiry that is received by and directed to the node, a response to which is included in the message.
Upon occurrence of a Trigger Event, and assuming that the originating node is other than a gateway 16, a message is originated and communicated from the originating node to a neighboring node. Two scenarios exist in this situation. First, a particular pathway for reaching a gateway 16 may be known to the originating node. In this first scenario, the wireless network 14 is deemed a “Deterministic Network,” at least to the extent that the originating node can provide determined routing information in the communication of the message, whereby the message will be sent to the gateway 16 via the identified pathway. In the second scenario, a pathway for reaching a gateway 16 is not known by the originating node, and the wireless network 14 is deemed a “Nondeterministic Network,” at least to the extent that the originating node does not know and, therefore, cannot provide determined routing information identifying a pathway for communication of the message to a gateway 16. Each of these scenarios will be discussed in greater detail below. The nondeterministic network scenario is described in detail first.
With particular regard to certain steps in the sequence of communicating the message from node X7 to the gateway 16,
Furthermore, it will be appreciated from the foregoing description that in communicating the message from node X7 to node X6, a communications link first was established between these two nodes. In establishing the communications link, preferably each node is identified to the other node in the communications link, whereby the originating node will come to learn the neighboring node that falls within its communications range (at least at that time). Furthermore, node X6—an intermediate node—will come to learn the node from which the message is received for forwarding to a gateway 16. In establishing the communications link and in communicating the message, information regarding the quality of the link also may be monitored and recorded.
At time t=t2, the message is shown in
At time t=t3, the message is shown in
Furthermore, it should be noted that although node X7 received the communication from node X6, node X7 does not communicate the message a second time. Preferably, a message that has been communicated from a node is stored or cached within memory of the data communication device of the node, and before a message received from another node is forwarded, the message is screened against those messages stored or cached within memory. Alternatively, a message ID of a message that has been communicated from a node preferably is stored or cached within memory of the data communication device of the node, and before a message received from another node is forwarded, the message ID of that message is screened against the message IDs stored or cached within memory. In either case, if it is determined that a message previously has been communicated from the node, then the same message will not be communicated again from the node. Consequently, node X7 is not illustrated in
At time t=t4, the message is shown in
At time t=t5, the message is shown in
At time t=t6, the message now has been communicated to the gateway 16 by way of three different pathways, the message has been propagated generally to all nodes of the wireless network 14, and no further communication of the message within the wireless network 14 occurs, as illustrated in
In accordance with preferred implementations, when node G (the gateway 16) receives the message intended for the server 10, the message is communicated to the server 10. Together with the message, the following information also preferably is communicated from the gateway 16 to the server 10: the pathway, including the identification of the originating node and each intermediate node by which the message was communicated; and the link quality of each communications link of the pathway. Other information also may be communicated, as desired.
Based on the illustration set forth in
For purposes of illustration and understanding of the present invention, a table setting forth exemplary link qualities of each possible communications link in the wireless network topology of
Notably, in the foregoing illustration of
Additionally, for purposes of illustration and understanding of the present invention, a table setting forth exemplary overall link qualities of each possible pathway is shown in
It is revealing to note that the tables of
Furthermore, several observations of characteristics of the wireless network 14 and manner of communicating as set forth in
For example, it should be apparent that no node of the wireless network 14 will appear twice in any pathway.
Second, it should be apparent that a node must either be an originating node or an intermediate node in a pathway by which a message is successfully communicated to the server 10 in order for the server 10 to gain information regarding that node.
Third, a message sent in nondeterministic manner from an originating node that arrives via the same gateway 16 from two top level nodes evidences the fact that the two top level nodes each represents an ad hoc network in which the nodes of the particular network are disposed in communication with each other. Conversely, a message sent in nondeterministic manner from an originating node that arrives via a gateway 16 from only one of two or more known top level nodes evidences the fact that the top level node represents an ad hoc network in which nodes of that network are disposed in radio isolation from all other nodes of the other ad hoc networks represented by the other top level nodes. In the exemplary wireless network 14 of
A deterministic routing illustration is readily described based on the information obtained from the nondeterministic routing illustration of
An exemplary algorithm that may be used includes selecting the pathway having the shortest number of intermediate nodes, thereby reducing the number of “hops” that must occur in successfully communicating the message to the destination node. In other words, the “shortest” known pathway is selected. Referring to the Table 4 of
In selecting the “best” of these two “shortest” pathways, additional factors may be considered, such as the overall link quality of the pathway, with the pathway having the best overall link quality being selected. In this case, the first pathway has an overall link quality of 24.3% which exceeds, in this case substantially, the overall link quality of 8.1% of the second pathway and, thus, the first pathway preferably would be selected as the determined route for sending the message from the server 10 to the data communication device of node X7.
Another algorithm for selecting a pathway may comprise selecting the pathway having the best overall link quality without regard to the number of intermediate nodes or hops. For example, with reference to Table 4 of
Due to the nature of the ad hoc network and the mobility of one or more of the data communication devices of the nodes thereof, the wireless network topology likely will change over time. Consequently, pathways and link qualities will change, and pathways and link qualities recorded in any table that may be maintained by the server 10 likely will become outdated. To address this, the server 10 preferably updates any such table as each message and associated information is received from the wireless network 14. Due to the significant amount of information that may be received from the wireless network 14 with any given message, information maintained by the server 10 nevertheless may prove valuable during its useful life. Moreover, information that is outdated may be identified based on more recent information that is received by the server 10 with another message, as well as by the failure to receive an acknowledgement (“ACK”) in response to a communication by the server 10 to a particular node of the wireless network 14 via a previously known pathway. An entry for a pathway by which a message is not successfully sent from the server 10 to a node may be removed, together with all sub-pathways including the destination node of the message.
Upon the successful receipt of a message by the server 10, the server 10 preferably sends an ACK to the originating node of the message to acknowledge the successful receipt of the message. Preferably, only one ACK is sent for each particular message, regardless of the number of times that the particular message is received by the server 10 via different pathways. In sending the ACK, the server 10 preferably selects a known pathway based on information that is received with the message or that has been received in conjunction with previous messages or other intelligence that is known about the network topology. Selection of the particular pathway is made in accordance with one of the disclosed algorithms or in accordance with some other algorithm, as desired. If an ACK is not received from the server 10 by the originating node, then the originating node will save the message in memory for communication at a later time when communication with the server 10 is available, whether via the wireless network 14 of
Similarly, the receipt of a message representing a command or inquiry that is sent by a server 10 to a destination node preferably is acknowledged by an ACK being sent to the server 10 from the destination node. The message may be sent via a known pathway, or, if the pathway is outdated or otherwise unknown, then the message is sent in accordance with the nondeterministic routing method of the present invention. In particular, the message is communicated to the wireless network in which the destination node is likely to be found. The message then propagates through the nodes of that wireless network and, when the destination node receives the message, the ACK is communicated by the destination node to the server 10. Moreover, like the server 10 in the implementation illustrated in
In accordance with preferred implementations, the successful receipt of an ACK is not acknowledged in order to avoid a recurring chain of communications.
In order to lessen power consumption, especially in mobile settings in which each data communication device constituting a node is self-powered by a mobile power supply, each mobile data communication device preferably includes the capability of powering down to a standby or sleep state, in which power is consumed at a substantially lower rate than when the data communication device is in a fully active state. In particular, the radio of the data communication device of the node preferably includes this capability to go into a standby or sleep mode. In such a mode, a standards based radio even may be turned completely off to be later awakened by a passive or semi-passive receiver of the data communications device designed for such purpose.
If mobile data communication devices and, in particular, radios thereof, include a standby or sleep capability, then each such radio further preferably includes the capability of being awakened in response to a communication from another data communication device of another node of the wireless network 14. Moreover, such a radio of a node preferably includes the ability to be selectively awakened—or powered up—out of a population of similar radios of data communication devices of nearby nodes. In this respect, implementations of the present invention preferably include the ability to power down and be selectively powered up in accordance with the technologies set forth in Twitchell U.S. Patent Application Publication No. 2005/0093703 A1, and/or Twitchell U.S. patent application Ser. No. 11/422,321, each of which has been incorporated herein by reference above.
The present invention has utility in various implementations. For example, the present invention may be utilized in first responder scenarios in order to maintain and gather real time intelligence that will aid first responders on the scene of an emergency.
For example, firemen responding to a building fire preferably can temporarily place data communication devices at points along their entry into a building or other structure in combating a fire. Basically, the firemen, upon entering into the building, can leave a “trail of breadcrumbs” comprising nodes of an ad hoc wireless network, and communications between the nodes thereof may be carried out in accordance with the present invention. A data communication device of a node further may be carried on a fireman's person. Such data communication devices further can be shot, thrown, or otherwise inserted into the building in placing one or more nodes of the ad hoc networks.
In further accordance with this exemplary implementation, each data communication device preferably includes a heat and/or smoke sensor for communicating data indicative of the level or heat and/or smoke at the sensor. The data then may be communicated back to a computer (e.g., the server 10 of
More importantly perhaps, each data communication device further preferably includes the capability of establishing two-way communications between the firemen inside the building and firemen outside of the building so that the fire fighting efforts inside the building may be coordinated from outside of the building. In this respect, each node preferably includes a data communication device having the capability for establishing a duplex communications link with other data communication devices of other nodes. Indeed, by including multiple nodes along different pathways from the exterior of the building to the firemen in the interior of the building, communications can be established that otherwise could not be established directly between an exterior radio and a radio of a fireman in a remote location in the interior of the building.
Another architecture associated with an exemplary embodiment of the invention is illustrated in
Furthermore, while the twelve nodes X1, X2, X3, X4, X5, X6, X7, Y1, Y2, Y3, Y4, Y5 generally have been described as forming the wireless network 24 of
In accordance with class-based networks, nodes X1, X2, X3, X4, X5, X6, X7 form a network of the class “X” and nodes Y1, Y2, Y3, Y4, Y5 form a network of the class “Y”; communications directed to the “X” class network are not received and further processed or transmitted by the “Y” class nodes; and communications directed to the “Y” class network are not received and further processed or transmitted by the “X” class nodes. Additionally, each node preferably includes an overriding class designation such as “A” that is representative of all nodes of the overall wireless network 24 of
The exemplary grid arrangement also aids in illustrating an exemplary range of communication for each node. In this respect, and with particular regard to
Consequently, communications may occur between a node that is within two spaces to the immediate side or top or bottom of another node within the grid, or between a node that is immediately diagonal to another node; however, a node disposed diagonally at two spaces or more to another node is out of direct communication range and, therefore, direct communications between such nodes do not occur. Again, each node is shown having the same communications range only for simplicity and clarity in illustrating the present invention, and it is to be understood that the actual communications ranges of the nodes likely will vary in any actual implementation.
As described above with reference to
Origination and communication of a message from a node to the server 10 preferably is triggered upon occurrence of a predefined event (“Trigger Event”). The Trigger Event may be based on data that is acquired by a sensor. Thus, for example, if a sensor monitors the opening of a maritime shipping container door, a Trigger Event may include the detection that the container door has been opened. In another example, if a sensor monitors for motion of an asset being tracked, a Trigger Event may include the movement of the asset.
Alternatively, or in addition thereto. Trigger Events may be predefined at regular defined intervals upon which messages are originated and communicated from a node to the server 10. Such messages may include all or a portion of data that has been acquired from a sensor associated with the node.
In addition to origination and communication of a message from a node to the server 10 upon occurrence of a Trigger Event, a message also may be originated and communicated from a node to the server 10 in response to an inquiry that is received by and directed to the node, a response to which is included in the message.
Upon occurrence of a Trigger Event, and assuming that the originating node is other than a gateway 16, a message is originated and communicated from the originating node to a neighboring node within a class-based network. Two scenarios exist in this situation. First, a particular pathway for reaching a gateway 16 may be known to the originating node. In this first scenario, the class-based wireless network is deemed a deterministic network, at least to the extent that the originating node can provide determined routing information in the communication of the message, whereby the message will be sent to the gateway 16 via the identified pathway. In the second scenario, a pathway for reaching a gateway 16 is not known by the originating node, and the class-based wireless network is deemed a nondeterministic network, at least to the extent that the originating node does not know and, therefore, cannot provide determined routing information identifying a pathway for communication of the message to a gateway 16. Each of these scenarios will be discussed in greater detail below. The nondeterministic network scenario is described in detail first with reference to
With particular regard to certain steps in the sequence of communicating the message from node X7 to the gateway 16,
Furthermore, it will be appreciated from the foregoing description that in communicating the message from node X7 to node X6, a communications link first was established between these two nodes. In establishing the communications link, preferably each node is identified to the other node, whereby the originating node will come to learn the neighboring node that falls within its communications range (at least at that time). Furthermore, node X6—an intermediate node—will come to learn from which node the message is received for forwarding to a gateway 16. In establishing the communications link and in communicating the message, information regarding the quality of the link also is monitored and recorded.
At time t=t2, the message is shown in
At time t=t3, the message is shown in
Furthermore, it should be noted that node X7 that receives the communication from node X6 does not again communicate the message. Preferably, a message that has been communicated from a node is stored or cached within memory of the data communication device of the node, and before a message received from another node is forwarded, the message is screened against those messages stored or cached within memory. Alternatively, a message ID of a message that has been communicated from a node preferably is stored or cached within memory of the data communication device of the node, and before a message received from another node is forwarded, the message ID of that message is screened against the message IDs stored or cached within memory. In either case, if it is determined that a message previously has been communicated from the node, then the same message will not be communicated again from the node. Consequently, node X7 is not illustrated in
At time t=t4, the message is shown in
At time t=t5, the message is shown in
At time t=t6, the message now has been communicated to the gateway 16 by way of three different pathways, the message has been propagated to all nodes of the “X” class-based wireless network, and no further communication of the message within the “X” class-based wireless network occurs, as illustrated in
In accordance with preferred implementations, when node G (the gateway 16) receives the message intended for the server 10, the message is communicated to the server 10. Together with the message, the following information also preferably is communicated from the gateway 16 to the server 10: the pathway, including the identification of the originating node and each intermediate node by which the message was communicated; and the link quality of each communications link of the pathway. Other information also may be communicated, as desired.
Based on the illustration set forth in
A subset of
In particular, because of the occurrence of the Trigger Event at node Y5, a message is originated and communicated from node Y5 for further communication to the server 10. The sequence of node-to-node communications illustrated here is in accordance with nondeterministic routing and may occur, for example, when nodes Y1 through Y5 have not previously communicated with the server 10 through the wireless network, i.e., when each node may be “new” to the “Y” class-based wireless network and/or “new” to the wireless network topology thereof shown in
With particular regard to certain steps in the sequence of communicating the message from node Y5 to the gateway 16,
Furthermore, it will be appreciated from the foregoing description that in communicating the message from node Y5 to node Y4, a communications link first was established between these two nodes. In establishing the communications link, preferably each node is identified to the other node, whereby the originating node will come to learn the neighboring node that falls within its communications range (at least at that time). Furthermore, node Y4—an intermediate node—will come to learn from which node the message is received for forwarding to a gateway 16. In establishing the communications link and in communicating the message, information regarding the quality of the link also is monitored and recorded.
At time t=t5, the message is shown in
At time t=t6, the message is shown in
As further shown in
Moreover, because node G was the only node of the “Y” class-based network within the communication range of node Y3, no further communication of the message within the “Y” class-based wireless network occurs.
In accordance with preferred implementations, when node G (the gateway 16) receives the message intended for the server 10, the message is communicated to the server 10. Together with the message, the following information also preferably is communicated from the gateway 16 to the server 10: the pathway, including the identification of the originating node and each intermediate node by which the message was communicated; and the link quality of each communications link of the pathway. Other information also may be communicated, as desired.
Based on the illustration set forth in
Upon the successful receipt of a message by the server 10, the server 10 preferably sends to the originating node of the message an ACK to acknowledge the successful receipt of the message. Preferably, only one ACK is sent for each particular message, regardless of the number of times that the particular message is received by the server 10 via different pathways.
In sending the ACK, the server 10 preferably selects a known pathway based on information that is received with the message or that has been received in conjunction with previous messages or other intelligence that is known about the network topology. Selection of the particular pathway is made in accordance with one of the disclosed algorithms or in accordance with some other algorithm, as desired. If an ACK is not received from the server 10 by the originating node, then the originating node will save the message in memory for communication at a later time when communication with the server 10 is available.
Similarly, the receipt of a message representing a command or inquiry that is sent by a server 10 to a destination node preferably is acknowledged by an ACK being sent to the server 10 from the destination node. The message may be sent via a known pathway or, if the pathway is outdated or otherwise unknown, then the message is sent in accordance with the nondeterministic routing method of the present invention. In particular, the message is communicated to the wireless network in which the destination node is likely to be found. The message then propagates through the nodes of that wireless network and, when the destination node receives the message, the ACK is communicated by the destination node to the server 10. Moreover, like the server 10, the node in this case will have sufficient information upon receipt of the message to select the “best” pathway for communicating the ACK back to the server 10. Additionally, if an ACK is not received by the server 10, then the server 10 can store or cache the message for later communication, or the server 10 can communicate the message to one or more other suspected wireless networks in which the data communication device of the destination node (the actual recipient of the message) may be found.
One of many advantages of the present invention utilized in class-based wireless networks is the ability to send communications via data communication devices of a particular class-based network without consuming power resources of data communication devices of one or more other class-based networks. This is particularly beneficial if two different class-based networks having nodes within communication range of each other are owned or operated by or on the behalf of separate legal entities.
Nevertheless, it also is beneficial to be able to utilize all nodes within communications range of another node regardless of particular classes of the nodes. For example, an urgent need may arise to communicate with a particular mobile data communications device that may be out of range of a node of a class with which that data communications device is associated, but nevertheless within range of a node of a different class-based wireless network.
An example of this scenario is illustrated in
The server 10 thus sends a communication destined for receipt by node Y2 via node G to the “A” class-based network. Transmission of this message by node G at time t=t2, is illustrated in
Assuming that none of the nodes X1, X4, X5, Y3 have information identifying a deterministic pathway to node Y2, each preferably will transmit the message generally to all nodes of class “A” within its respective communications range for propagation of the message. This retransmission of the message by nodes X1, X4, X5, Y3 is illustrated in
As shown in
Moreover, as will be appreciated, the message has been received three times and, hence, several pathways to the server 10 and information regarding those pathways are known to the data communications device of node Y2
Accordingly, a deterministic route is chosen based on an appropriate algorithm for sending the ACK to the server 10. The appropriate algorithm may take into account factors such as, for example, the number of intermediate nodes of the pathway, the link quality of the various communications links of the pathway, the overall link quality of the pathway, the number of “Y” class-based network nodes of the pathway, and the number of non “Y” class-based network nodes of the pathway.
In this example, node Y2 transmits a message representing the ACK to the server 10 by transmitting the message to node X4 as shown in
In accordance with class-based networks, each data communications device of a node of a class-based wireless network preferably maintains membership information in the form of a membership table of the classes of which that device is a member. Furthermore, membership in a class need not be exclusive relative to membership in another class. For example, a particular communications device may include membership in both the “X” class and the “Y” class of the exemplary network 24 of
Class tables also are helpful to reference when attempting to send a message. In this respect, a class table may include not only identification of the classes of which a data communications device is a member, but also the identification of other classes with which the data communications device may need to communicate under certain scenarios. Such a class table similarly is useful for a server 10 when sending class-based communications.
Additionally, in preferred embodiments, a server 10 maintains and updates class tables for various data communications devices of one or more class-based wireless networks, whereby centralized assignment of classes may be performed and distributed from the server 10 down to the different devices. Communications of updates and/or assignments of new classes for each data communications device thereby can be efficiently performed in accordance with such an architecture.
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. 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.
In alternative embodiments of the exemplary network architectures shown in
In yet further alternative embodiments, it is contemplated that, instead of “hopping” between nodes (which generally keeps power consumption low), continuous communications links can be established between nodes along a pathway between an originating node and a destination node. Maintaining the connection with continuous communications links facilitates large file transfers as well as real time communications, such as voice over IP and video conferencing communications between persons. Indeed, two communications links between each pair of nodes in the pathway may be established for enabling two-way communications using half-duplex standards based radios, such as Bluetooth radios.
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. 14/573,625, filed Dec. 17, 2014, incorporated herein by reference, which published as U.S. patent application publication no. 2015/0103747, incorporated herein by reference, which '625 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. 13/367,341, filed Feb. 6, 2012, incorporated herein by reference, which published as U.S. patent application publication no. 2012/0250619, incorporated herein by reference, and issued Dec. 10, 2013 as U.S. Pat. No. 8,605,660, incorporated herein by reference, which '341 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/271,850, filed Nov. 15, 2008, incorporated herein by reference, which published as U.S. patent application publication no. 2009/0092082, incorporated herein by reference, and issued Feb. 7, 2012 as U.S. Pat. No. 8,111,651, incorporated herein by reference, which '850 application is a continuation patent application of, and claims priority under 35 U.S.C. § 120 to, U.S. nonprovisional patent application Ser. No. 11/428,536, filed Jul. 3, 2006, incorporated herein by reference, which published as U.S. patent application publication no. 2007/0002793, incorporated herein by reference, and issued May 10, 2011 as U.S. Pat. No. 7,940,716, incorporated by reference herein, and which '536 application is a nonprovisional of, and claims priority under 35 U.S.C. § 119(e) to, U.S. provisional patent application No. 60/696,159, filed Jul. 1, 2005, incorporated herein by reference, the disclosure of which is contained in the Appendix to the present specification. The present application hereby incorporates by reference: Twitchell U.S. Pat. No. 6,934,540 B2 (titled “Network Formation in Asset-Tracking System Based on Asset Class”); Twitchell U.S. Pat. No. 6,745,027 B2 (titled “Class Switched Networks for Tracking Articles”); Twitchell U.S. patent application publication no. 2005/0093703 A1 (titled “Systems and Methods Having LPRF Device Wake Up Using Wireless Tag”); Twitchell U.S. patent application Ser. No. 11/422,321 (titled “Remote Sensor Interface (RSI) Stepped Wake-Up Sequence”), which published as U.S. patent application publication no. 2006/0276161, also incorporated herein by reference; and Twitchell U.S. patent application Ser. No. 11/423,127 (titled “All Weather Housing Assembly For Electronic Components”), which published as U.S. patent application publication no. 2006/0289204, also incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 2101637 | Davis | Dec 1937 | A |
| 2233297 | Polin et al. | Feb 1941 | A |
| 3805265 | Lester | Apr 1974 | A |
| 4056780 | Faulkner | Nov 1977 | A |
| 4061442 | Clark et al. | Dec 1977 | A |
| 4099168 | Kedjierski et al. | Jul 1978 | A |
| 4136823 | Kullberg | Jan 1979 | A |
| 4165024 | Oswalt et al. | Aug 1979 | A |
| 4226533 | Snowman | Oct 1980 | A |
| 4266220 | Malinsowski | May 1981 | A |
| 4400694 | Wong et al. | Aug 1983 | A |
| 4420746 | Malinowski | Dec 1983 | A |
| 4437336 | Abe | Mar 1984 | A |
| 4455553 | Johnson | Jun 1984 | A |
| 4514720 | Oberstein et al. | Apr 1985 | A |
| 4535450 | Tan | Aug 1985 | A |
| 4543570 | Bressett et al. | Sep 1985 | A |
| 4556873 | Yamada et al. | Dec 1985 | A |
| 4613990 | Halpem | Sep 1986 | A |
| 4652859 | Van Wienen | Mar 1987 | A |
| 4661804 | Abel | Apr 1987 | A |
| 4670739 | Kelly | Jun 1987 | A |
| 4675661 | Ishii | Jun 1987 | A |
| 4679742 | Ellis | Jul 1987 | A |
| 4680583 | Grover | Jul 1987 | A |
| 4688244 | Hannon et al. | Aug 1987 | A |
| 4692742 | Raizen et al. | Sep 1987 | A |
| 4692750 | Murakami et al. | Sep 1987 | A |
| 4727359 | Yuchi et al. | Feb 1988 | A |
| 4750197 | Denekamp et al. | Jun 1988 | A |
| 4772876 | Laud | Sep 1988 | A |
| 4801856 | Wajima | Jan 1989 | A |
| 4801865 | Miller et al. | Jan 1989 | A |
| 4802240 | Yamaguchi et al. | Jan 1989 | A |
| 4811011 | Sollinger | Mar 1989 | A |
| 4817131 | Thornborough et al. | Mar 1989 | A |
| 4817537 | Cripe et al. | Apr 1989 | A |
| 4827244 | Bellavia et al. | May 1989 | A |
| 4857895 | Kaprelian | Aug 1989 | A |
| 4862514 | Kedjierski | Aug 1989 | A |
| 4871999 | Ishii et al. | Oct 1989 | A |
| 4901316 | Igarashi et al. | Feb 1990 | A |
| 4916432 | Tice et al. | Apr 1990 | A |
| 4918690 | Markkula, Jr. et al. | Apr 1990 | A |
| 4939504 | Miller | Jul 1990 | A |
| 4951029 | Severson | Aug 1990 | A |
| 4964121 | Moore | Oct 1990 | A |
| 4977527 | Shaw et al. | Dec 1990 | A |
| 4996518 | Takahashi et al. | Feb 1991 | A |
| 5040238 | Comroe et al. | Aug 1991 | A |
| 5054052 | Nonami | Oct 1991 | A |
| 5107446 | Shaw et al. | Apr 1992 | A |
| 5117501 | Childress et al. | May 1992 | A |
| 5129096 | Burns | Jul 1992 | A |
| 5134644 | Garton et al. | Jul 1992 | A |
| 5138562 | Shaw et al. | Aug 1992 | A |
| 5151683 | Takahashi et al. | Sep 1992 | A |
| 5159315 | Takahashi et al. | Oct 1992 | A |
| 5168262 | Okayama | Dec 1992 | A |
| 5188143 | Krebs | Feb 1993 | A |
| 5201061 | Goldberg et al. | Apr 1993 | A |
| 5210540 | Masumoto | May 1993 | A |
| 5224648 | Simon et al. | Jul 1993 | A |
| 5229750 | Welch et al. | Jul 1993 | A |
| 5240022 | Franklin | Aug 1993 | A |
| 5260687 | Yamauchi et al. | Nov 1993 | A |
| 5265025 | Hirata | Nov 1993 | A |
| 5267180 | Okayama | Nov 1993 | A |
| 5281951 | Okayama | Jan 1994 | A |
| 5295154 | Meier et al. | Mar 1994 | A |
| 5315291 | Furr | May 1994 | A |
| 5319698 | Glidewell et al. | Jun 1994 | A |
| 5331637 | Francis et al. | Jul 1994 | A |
| 5335186 | Tarrant | Aug 1994 | A |
| 5345224 | Brown | Sep 1994 | A |
| 5355518 | Kindinger et al. | Oct 1994 | A |
| 5357241 | Welch | Oct 1994 | A |
| 5369784 | Nelson | Nov 1994 | A |
| 5400246 | Wilson et al. | Mar 1995 | A |
| 5400254 | Fujita | Mar 1995 | A |
| 5408223 | Guillemot | Apr 1995 | A |
| 5424720 | Kirkpatrick | Jun 1995 | A |
| 5425051 | Mahany | Jun 1995 | A |
| 5428964 | Lobdell | Jul 1995 | A |
| 5430433 | Shima | Jul 1995 | A |
| 5432500 | Scripps | Jul 1995 | A |
| 5442758 | Slingwine et al. | Aug 1995 | A |
| 5478092 | Ishikawa et al. | Dec 1995 | A |
| 5511232 | O'Dea et al. | Apr 1996 | A |
| 5530433 | Morita | Jun 1996 | A |
| 5540092 | Handfield et al. | Jul 1996 | A |
| 5564626 | Kettler et al. | Oct 1996 | A |
| 5565852 | Petlier et al. | Oct 1996 | A |
| 5565858 | Guthrie | Oct 1996 | A |
| 5568121 | Lamensdorf | Oct 1996 | A |
| 5574435 | Mochizuki | Nov 1996 | A |
| 5579306 | Dent | Nov 1996 | A |
| 5590409 | Sawahashi et al. | Dec 1996 | A |
| 5596652 | Piatek et al. | Jan 1997 | A |
| 5604892 | Nuttall et al. | Feb 1997 | A |
| 5606313 | Allen et al. | Feb 1997 | A |
| 5627515 | Anderson | May 1997 | A |
| 5640151 | Reis et al. | Jun 1997 | A |
| 5652751 | Sharony | Jul 1997 | A |
| 5655561 | Wendel et al. | Aug 1997 | A |
| 5682379 | Mahany et al. | Oct 1997 | A |
| 5686902 | Reis et al. | Nov 1997 | A |
| 5719556 | Albin et al. | Feb 1998 | A |
| 5723848 | Bilenko et al. | Mar 1998 | A |
| 5732007 | Grushin et al. | Mar 1998 | A |
| 5732077 | Whitehead | Mar 1998 | A |
| 5736928 | Tice et al. | Apr 1998 | A |
| 5748092 | Arsenault et al. | May 1998 | A |
| 5761195 | Lu et al. | Jun 1998 | A |
| 5790946 | Rotzoll | Aug 1998 | A |
| 5793882 | Piatek et al. | Aug 1998 | A |
| 5802274 | Dorak et al. | Sep 1998 | A |
| 5833910 | Teixido | Nov 1998 | A |
| 5854994 | Canada et al. | Dec 1998 | A |
| 5859536 | Stockton | Jan 1999 | A |
| 5862803 | Besson | Jan 1999 | A |
| 5881951 | Carpenter | Mar 1999 | A |
| 5889468 | Banga | Mar 1999 | A |
| 5890054 | Lodgson et al. | Mar 1999 | A |
| 5892441 | Woolley et al. | Apr 1999 | A |
| 5892758 | Argyroudis | Apr 1999 | A |
| 5898374 | Schepka | Apr 1999 | A |
| 5907491 | Canada et al. | May 1999 | A |
| 5913180 | Ryan | Jun 1999 | A |
| 5914656 | Ojala et al. | Jun 1999 | A |
| 5917423 | Duvall | Jun 1999 | A |
| 5917433 | Keillor et al. | Jun 1999 | A |
| 5923102 | Koenig et al. | Jul 1999 | A |
| 5939982 | Gagnon et al. | Aug 1999 | A |
| 5943610 | Endo | Aug 1999 | A |
| 5949332 | Kim | Sep 1999 | A |
| 5950124 | Trompower et al. | Sep 1999 | A |
| 5959529 | Kail, IV | Sep 1999 | A |
| 5959568 | Woolley | Sep 1999 | A |
| 5966079 | Tanguay | Oct 1999 | A |
| 5973603 | Judy | Oct 1999 | A |
| 5974236 | Sherman | Oct 1999 | A |
| 5977913 | Christ | Nov 1999 | A |
| 6005884 | Cook et al. | Dec 1999 | A |
| 6006100 | Koenck et al. | Dec 1999 | A |
| 6023476 | Lo | Feb 2000 | A |
| 6025788 | Diduck | Feb 2000 | A |
| 6031455 | Grube et al. | Feb 2000 | A |
| 6046675 | Hanna | Apr 2000 | A |
| 6049273 | Hess | Apr 2000 | A |
| 6060994 | Chen | May 2000 | A |
| 6072784 | Agrawal et al. | Jun 2000 | A |
| 6075451 | Lebowitz et al. | Jun 2000 | A |
| 6078050 | Castleman | Jun 2000 | A |
| 6078269 | Markwell et al. | Jun 2000 | A |
| 6078785 | Bush | Jun 2000 | A |
| 6078789 | Bodenmann et al. | Jun 2000 | A |
| 6084522 | Addy | Jul 2000 | A |
| 6091724 | Chandra et al. | Jul 2000 | A |
| 6097288 | Koeppe, Jr. | Aug 2000 | A |
| 6097707 | Hodzic et al. | Aug 2000 | A |
| 6104512 | Batey et al. | Aug 2000 | A |
| 6108544 | Dorenbosch et al. | Aug 2000 | A |
| 6108614 | Lincoln et al. | Aug 2000 | A |
| 6111511 | Sivathanu et al. | Aug 2000 | A |
| 6118988 | Choi | Sep 2000 | A |
| 6124806 | Cunningham et al. | Sep 2000 | A |
| 6125306 | Shimada et al. | Sep 2000 | A |
| 6127928 | Issacman | Oct 2000 | A |
| 6127976 | Boyd et al. | Oct 2000 | A |
| 6134587 | Okanoue | Oct 2000 | A |
| 6134589 | Hultgren | Oct 2000 | A |
| 6154658 | Caci | Nov 2000 | A |
| 6157307 | Hardin | Dec 2000 | A |
| 6175310 | Gott | Jan 2001 | B1 |
| 6192400 | Hanson et al. | Feb 2001 | B1 |
| 6198913 | Sung et al. | Mar 2001 | B1 |
| 6201974 | Lietsalmi et al. | Mar 2001 | B1 |
| 6208247 | Agre et al. | Mar 2001 | B1 |
| 6215404 | Morales | Apr 2001 | B1 |
| 6225894 | Kyrtsos | May 2001 | B1 |
| 6239690 | Burbidge et al. | May 2001 | B1 |
| 6246882 | Lachance | Jun 2001 | B1 |
| 6256303 | Drakoulis et al. | Jul 2001 | B1 |
| 6281840 | Miyoshi et al. | Aug 2001 | B1 |
| 6313646 | Davis et al. | Nov 2001 | B1 |
| 6313745 | Suzuki | Nov 2001 | B1 |
| 6320501 | Tice et al. | Nov 2001 | B1 |
| 6354493 | Mon | Mar 2002 | B1 |
| 6360169 | Dudaney | Mar 2002 | B1 |
| 6366217 | Cunningham et al. | Apr 2002 | B1 |
| 6369714 | Walter | Apr 2002 | B2 |
| 6377181 | Kroll et al. | Apr 2002 | B1 |
| 6380860 | Goetz | Apr 2002 | B1 |
| 6381467 | Hill et al. | Apr 2002 | B1 |
| 6388399 | Eckel et al. | May 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 |
| 6420973 | Acevedo | Jul 2002 | B2 |
| 6421539 | Jeong | Jul 2002 | B1 |
| 6421731 | Ciotti et al. | 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 |
| 6441731 | Hess | Aug 2002 | B1 |
| 6445292 | Jen et al. | Sep 2002 | B1 |
| 6452493 | Ma et al. | Sep 2002 | B1 |
| 6453687 | Sharood et al. | Sep 2002 | B2 |
| 6473607 | Shohara et al. | Oct 2002 | B1 |
| 6476708 | Johnson | Nov 2002 | B1 |
| 6480149 | Twitchell | Nov 2002 | B1 |
| 6481222 | Denniston | Nov 2002 | B1 |
| 6489895 | Apelman | Dec 2002 | B1 |
| 6512478 | Chien | Jan 2003 | B1 |
| 6515283 | Castleman et al. | Feb 2003 | B1 |
| 6519509 | Nierlich et al. | Feb 2003 | B1 |
| 6526807 | Doumit et al. | Mar 2003 | B1 |
| 6529142 | Yeh et al. | Mar 2003 | B2 |
| 6535110 | Arora et al. | Mar 2003 | B1 |
| 6542114 | Eagleson et al. | Apr 2003 | B1 |
| 6547137 | Begelfer et al. | Apr 2003 | B1 |
| 6552647 | Thiesen et al. | Apr 2003 | B1 |
| 6553336 | Johnson et al. | Apr 2003 | B1 |
| 6559620 | Zhou et al. | May 2003 | B2 |
| 6583720 | Quigley | Jun 2003 | B1 |
| 6587755 | Smith et al. | Jul 2003 | B1 |
| 6600418 | Francis et al. | Jul 2003 | B2 |
| 6601016 | Brown | Jul 2003 | B1 |
| 6611556 | Koener et al. | Aug 2003 | B1 |
| 6614349 | Proctor et al. | Sep 2003 | B1 |
| 6615658 | Snelling | Sep 2003 | B2 |
| 6617962 | Horwitz et al. | Sep 2003 | B1 |
| 6619055 | Addy | Sep 2003 | B1 |
| 6624750 | Marman et al. | Sep 2003 | B1 |
| 6628835 | Brill et al. | Sep 2003 | B1 |
| 6639517 | Chapman et al. | Oct 2003 | B1 |
| 6665585 | Kawase | Dec 2003 | B2 |
| 6666086 | Colman et al. | Dec 2003 | B2 |
| 6679400 | Goodman | Jan 2004 | B1 |
| 6690657 | Lau et al. | Feb 2004 | B1 |
| 6693907 | Wesley et al. | Feb 2004 | B1 |
| 6700533 | Werb et al. | Mar 2004 | B1 |
| 6704681 | Nassof et al. | Mar 2004 | B1 |
| 6714977 | Fowler et al. | Mar 2004 | B1 |
| 6800533 | Werb | Mar 2004 | B1 |
| 6717507 | Bayley et al. | Apr 2004 | B1 |
| 6720888 | Eagleson et al. | Apr 2004 | B2 |
| 6731215 | Harms et al. | May 2004 | B2 |
| 6735630 | Gelvin et al. | May 2004 | B1 |
| 6737974 | Dickinson | May 2004 | B2 |
| 6744740 | Chen | Jun 2004 | B2 |
| 6745027 | Twitchell et al. | Jun 2004 | B2 |
| 6747558 | Thorne et al. | Jun 2004 | B1 |
| 6747562 | Giraldin et al. | Jun 2004 | B2 |
| 6748804 | Lisec et al. | Jun 2004 | B1 |
| 6753775 | Auerbach et al. | Jun 2004 | B2 |
| 6759956 | Menard et al. | Jul 2004 | B2 |
| 6760578 | Rotzoll | Jul 2004 | B2 |
| 6761312 | Piatek et al. | Jul 2004 | B2 |
| 6765484 | Eagleson et al. | Jul 2004 | B2 |
| 6789220 | Lovejoy | Sep 2004 | B1 |
| 6789739 | Rosen | Sep 2004 | B2 |
| 6796187 | Srinivasan et al. | Sep 2004 | B2 |
| 6798220 | Flanigan et al. | Sep 2004 | B1 |
| 6798341 | Eckel et al. | Sep 2004 | B1 |
| 6799210 | Gentry et al. | Sep 2004 | B1 |
| 6803728 | Balasubramaniam et al. | Oct 2004 | B2 |
| 6816063 | Kubler et al. | Nov 2004 | B2 |
| 6825758 | Laitsaari | Nov 2004 | B1 |
| 6825777 | Vock et al. | Nov 2004 | B2 |
| 6826948 | Bhatti et al. | Dec 2004 | B1 |
| 6847892 | Zhou | Jan 2005 | B2 |
| 6851621 | Wacker et al. | Feb 2005 | B1 |
| 6870476 | Cockburn et al. | Mar 2005 | B2 |
| 6874037 | Abram et al. | Mar 2005 | B1 |
| 6882274 | Richardson et al. | Apr 2005 | B2 |
| 6891470 | Bohinc | May 2005 | B2 |
| 6891838 | Petite et al. | May 2005 | B1 |
| 6892751 | Sanders | May 2005 | B2 |
| 6900731 | Kriener | May 2005 | B2 |
| 6909921 | Bilger | Jun 2005 | B1 |
| 6919803 | Breed | Jul 2005 | B2 |
| 6927688 | Tice | Aug 2005 | B2 |
| 6930596 | Kulesz et al. | Aug 2005 | B2 |
| 6934540 | Twitchell et al. | Aug 2005 | B2 |
| 6935570 | Acker | Aug 2005 | B2 |
| 6940392 | Chan et al. | Sep 2005 | B2 |
| 6940403 | Kail | Sep 2005 | B2 |
| 6965314 | Bohinc | Nov 2005 | B2 |
| 6972682 | Lareau et al. | Dec 2005 | B2 |
| 6975614 | Kennedy | Dec 2005 | B2 |
| 6988079 | Or-Bach et al. | Jan 2006 | B1 |
| 6995676 | Amacher | Feb 2006 | B2 |
| 7012529 | Sajkowsky | Mar 2006 | B2 |
| 7022773 | Albano et al. | Apr 2006 | B2 |
| 7027773 | McMillin | Apr 2006 | B1 |
| 7034683 | Ghazarian | Apr 2006 | B2 |
| 7038585 | Hall | May 2006 | B2 |
| 7042352 | Kates | May 2006 | B2 |
| 7055759 | Wacker et al. | Jun 2006 | B2 |
| 7063667 | Ben-Oren et al. | Jun 2006 | B1 |
| 7072668 | Chou | Jul 2006 | B2 |
| 7088229 | Johnson | Aug 2006 | B2 |
| 7098784 | Easley et al. | Aug 2006 | B2 |
| 7102504 | Kates | Sep 2006 | B2 |
| 7102505 | Kates | Sep 2006 | B2 |
| 7103344 | Menard | Sep 2006 | B2 |
| 7109879 | Stults et al. | Sep 2006 | B2 |
| 7126470 | Clift et al. | Oct 2006 | B2 |
| 7133704 | Twitchell | Nov 2006 | B2 |
| 7135965 | Chapman et al. | Nov 2006 | B2 |
| 7142107 | Kates | Nov 2006 | B2 |
| 7142121 | Chan et al. | Nov 2006 | B2 |
| 7142123 | Kates | Nov 2006 | B1 |
| 7148800 | Cunningham | Dec 2006 | B2 |
| 7148803 | Bandy | Dec 2006 | B2 |
| 7155238 | Katz | Dec 2006 | B2 |
| 7155264 | Twitchell et al. | Dec 2006 | B2 |
| 7191934 | Miller et al. | Mar 2007 | B2 |
| 7196622 | Lambright | Mar 2007 | B2 |
| 7200132 | Twitchell et al. | Apr 2007 | B2 |
| 7209037 | Webb | Apr 2007 | B2 |
| 7209468 | Twitchell et al. | Apr 2007 | B2 |
| 7209771 | Twitchell et al. | Apr 2007 | B2 |
| 7212122 | Gloekler | May 2007 | B2 |
| 7218237 | Kates | May 2007 | B2 |
| 7221260 | Berezowski | May 2007 | B2 |
| 7221668 | Twitchell et al. | May 2007 | B2 |
| 7228726 | Kates | Jun 2007 | B2 |
| 7230528 | Kates | Jun 2007 | B2 |
| 7230933 | Bahl et al. | Jun 2007 | B2 |
| 7233958 | Weng | Jun 2007 | B2 |
| 7239238 | Tester et al. | Jul 2007 | B2 |
| 7248160 | Mangan et al. | Jul 2007 | B2 |
| 7253731 | Joao | Aug 2007 | B2 |
| 7256505 | Arms et al. | Aug 2007 | B2 |
| 7270353 | Sironi et al. | Sep 2007 | B2 |
| 7273172 | Olsen | Sep 2007 | B2 |
| 7274295 | Koch | Sep 2007 | B2 |
| 7277009 | Hall | Oct 2007 | B2 |
| 7282944 | Gunn et al. | Oct 2007 | B2 |
| 7283052 | Bohman | Oct 2007 | B2 |
| 7289761 | Mazar | Oct 2007 | B2 |
| 7299068 | Halla | Nov 2007 | B1 |
| 7313421 | Dejanovic | Dec 2007 | B2 |
| 7315281 | Dejanovic | Jan 2008 | B2 |
| 7317382 | Pratt | Jan 2008 | B2 |
| 7319397 | Chung | Jan 2008 | B2 |
| 7323981 | Peel | Jan 2008 | B2 |
| 7333015 | Ekstrom | Feb 2008 | B2 |
| 7336168 | Kates | Feb 2008 | B2 |
| 7339469 | Braun | Mar 2008 | B2 |
| 7340260 | McAlexander | Mar 2008 | B2 |
| 7342496 | Muirhead | Mar 2008 | B2 |
| 7342497 | Chung | Mar 2008 | B2 |
| 7348875 | Hughes et al. | Mar 2008 | B2 |
| 7349803 | Belenkii et al. | Mar 2008 | B2 |
| 7349804 | Belenkii | Mar 2008 | B2 |
| 7376507 | Daily et al. | May 2008 | B1 |
| 7378957 | Twitchell et al. | May 2008 | B2 |
| 7378958 | Twitchell et al. | May 2008 | B2 |
| 7378959 | Twitchell et al. | May 2008 | B2 |
| 7378960 | Binding | May 2008 | B1 |
| 7382251 | Bohman | Jun 2008 | B2 |
| 7391321 | Twitchell et al. | Jun 2008 | B2 |
| 7394358 | Cherry | Jul 2008 | B2 |
| 7394361 | Twitchell et al. | Jul 2008 | B1 |
| 7394372 | Gloekler | Jul 2008 | B2 |
| 7397363 | Joao | Jul 2008 | B2 |
| 7411494 | Kates | Aug 2008 | B2 |
| 7412876 | Kates | Aug 2008 | B2 |
| 7417543 | Bergman | Aug 2008 | B2 |
| 7419101 | Kawai | Sep 2008 | B2 |
| 7423534 | Dhanjal | Sep 2008 | B2 |
| 7423535 | Chung | Sep 2008 | B2 |
| 7430437 | Twitchell et al. | Sep 2008 | B2 |
| 7434742 | Mueller et al. | Oct 2008 | B2 |
| 7438334 | Terry et al. | Oct 2008 | B2 |
| 7440781 | Beach et al. | Oct 2008 | B2 |
| 7460690 | Cohen et al. | Dec 2008 | B2 |
| 7469550 | Chapman et al. | Dec 2008 | B2 |
| 7482920 | Joao | Jan 2009 | B2 |
| 7489244 | August et al. | Feb 2009 | B2 |
| 7522568 | Twitchell et al. | Apr 2009 | B2 |
| 7526381 | Twitchell | Apr 2009 | B2 |
| 7528711 | Kates | May 2009 | B2 |
| 7528719 | Hopman et al. | May 2009 | B2 |
| 7529547 | Twitchell | May 2009 | B2 |
| 7538656 | Twitchell et al. | May 2009 | B2 |
| 7538657 | Twitchell et al. | May 2009 | B2 |
| 7538658 | Twitchell et al. | May 2009 | B2 |
| 7538672 | Lockyer et al. | May 2009 | B2 |
| 7539520 | Twitchell et al. | May 2009 | B2 |
| 7542849 | Twitchell et al. | Jun 2009 | B2 |
| 7561057 | Kates | Jul 2009 | B2 |
| 7563991 | Clark et al. | Jul 2009 | B2 |
| 7571865 | Nicodem et al. | Aug 2009 | B2 |
| 7574168 | Twitchell et al. | Aug 2009 | B2 |
| 7574300 | Twitchell et al. | Aug 2009 | B2 |
| 7579945 | Richter et al. | Aug 2009 | B1 |
| 7583198 | Kates | Sep 2009 | B2 |
| 7583769 | Smith et al. | Sep 2009 | B2 |
| 7595727 | Grijalva et al. | Sep 2009 | B2 |
| 7600137 | Trappeniers et al. | Oct 2009 | B2 |
| 7623028 | Kates | Nov 2009 | B2 |
| 7626508 | Kosuge et al. | Dec 2009 | B2 |
| 7703694 | Mueller et al. | Apr 2010 | B2 |
| D614976 | Skafdrup et al. | May 2010 | S |
| 7735118 | Brok et al. | Jun 2010 | B2 |
| 7782200 | Fleischmann | Aug 2010 | B1 |
| 7817031 | Kates | Oct 2010 | B2 |
| 7837958 | Crapser et al. | Nov 2010 | B2 |
| 7904209 | Podgorny et al. | Mar 2011 | B2 |
| 7907941 | Twitchell | Mar 2011 | B2 |
| 7924735 | Sun et al. | Apr 2011 | B2 |
| 7940716 | Twitchell | May 2011 | B2 |
| 7975292 | Corella | Jul 2011 | B2 |
| 7986238 | Cho | Jul 2011 | B2 |
| 7994928 | Richmond | Aug 2011 | B2 |
| 8000315 | Doi et al. | Aug 2011 | B2 |
| 8016205 | Drew | Sep 2011 | B2 |
| 8037022 | Rahman et al. | Oct 2011 | B2 |
| 8098166 | Lang | Jan 2012 | B2 |
| 8111651 | Twitchell | Feb 2012 | B2 |
| 8125978 | Lim et al. | Feb 2012 | B2 |
| 8165072 | Mooney et al. | Apr 2012 | B2 |
| 8175109 | Nogueira-Nine et al. | May 2012 | B2 |
| 8188764 | Weiss et al. | May 2012 | B2 |
| 8228183 | Glenn et al. | Jul 2012 | B2 |
| 8233905 | Vaswani et al. | Jul 2012 | B2 |
| 8234694 | Youn et al. | Jul 2012 | B2 |
| 8255090 | Frader-Thompson et al. | Aug 2012 | B2 |
| 8275404 | Berger et al. | Sep 2012 | B2 |
| 8391435 | Farley et al. | Mar 2013 | B2 |
| 8462662 | Robins et al. | Jun 2013 | B2 |
| 8514758 | De Kimpe et al. | Aug 2013 | B2 |
| 8531268 | Ghabra et al. | Sep 2013 | B2 |
| 8589174 | Nelson et al. | Nov 2013 | B2 |
| 8605660 | Twitchell | Dec 2013 | B2 |
| 8619652 | Singh et al. | Dec 2013 | B2 |
| 8954082 | Twitchell | Feb 2015 | B2 |
| 9072049 | Farley et al. | Jun 2015 | B2 |
| 9183733 | Kates | Nov 2015 | B2 |
| 9286787 | Kates | Mar 2016 | B2 |
| 9286788 | Kates | Mar 2016 | B2 |
| 9295099 | Twitchell et al. | Mar 2016 | B2 |
| 9318015 | Kates | Apr 2016 | B2 |
| 9357490 | Kates | May 2016 | B2 |
| 9386553 | Berger et al. | Jul 2016 | B2 |
| 9412260 | Kates | Aug 2016 | B2 |
| 9474023 | Kates | Oct 2016 | B1 |
| 9532310 | Farley et al. | Dec 2016 | B2 |
| 9699736 | Farley et al. | Jul 2017 | B2 |
| 9986484 | Twitchell | May 2018 | B2 |
| 20010000019 | Bowers et al. | Mar 2001 | A1 |
| 20010050550 | Yoshida et al. | Dec 2001 | A1 |
| 20020005707 | Kerai et al. | Jan 2002 | A1 |
| 20020011570 | Castleman | Jan 2002 | A1 |
| 20020011923 | Cunningham et al. | Jan 2002 | A1 |
| 20020012323 | Petite et al. | Jan 2002 | A1 |
| 20020030592 | Hakanen et al. | Mar 2002 | A1 |
| 20020030596 | Finn et al. | Mar 2002 | A1 |
| 20020033759 | Morello | Mar 2002 | A1 |
| 20020039896 | Brown | Apr 2002 | A1 |
| 20020050632 | Tuttle et al. | May 2002 | A1 |
| 20020050932 | Rhoades et al. | May 2002 | A1 |
| 20020073646 | Von Gutfeld et al. | Jun 2002 | A1 |
| 20020075145 | Hardman et al. | Jun 2002 | A1 |
| 20020084414 | Baker et al. | Jul 2002 | A1 |
| 20020089434 | Ghazarian | Jul 2002 | A1 |
| 20020098861 | Doney et al. | Jul 2002 | A1 |
| 20020099567 | Joao | Jul 2002 | A1 |
| 20020102979 | Curley et al. | Aug 2002 | A1 |
| 20020119770 | Twitchell | Aug 2002 | A1 |
| 20020124169 | Agrawal et al. | Sep 2002 | A1 |
| 20020126005 | Hardman et al. | Sep 2002 | A1 |
| 20020130771 | Osborne et al. | Sep 2002 | A1 |
| 20020130778 | Nicholson | Sep 2002 | A1 |
| 20020146985 | Naden | Oct 2002 | A1 |
| 20020158775 | Wallace | Oct 2002 | A1 |
| 20020186141 | Jen et al. | Dec 2002 | A1 |
| 20030008692 | Phelan | Jan 2003 | A1 |
| 20030011428 | Yamakawa et al. | Jan 2003 | A1 |
| 20030011474 | Ng | Jan 2003 | A1 |
| 20030011482 | Harms et al. | Jan 2003 | A1 |
| 20030025612 | Holmes et al. | Feb 2003 | A1 |
| 20030037125 | Luman et al. | Feb 2003 | A1 |
| 20030043763 | Grayson | Mar 2003 | A1 |
| 20030058093 | Dohi et al. | Mar 2003 | A1 |
| 20030083064 | Cooper | May 2003 | A1 |
| 20030114898 | Von Ark et al. | Jun 2003 | A1 |
| 20030117966 | Chen | Jun 2003 | A1 |
| 20030122677 | Kail | Jul 2003 | A1 |
| 20030140135 | Okuyama et al. | Jul 2003 | A1 |
| 20030141973 | Yeh et al. | Jul 2003 | A1 |
| 20030144020 | Challa et al. | Jul 2003 | A1 |
| 20030146833 | Johnston et al. | Aug 2003 | A1 |
| 20030151513 | Herrmann et al. | Aug 2003 | A1 |
| 20030162504 | Sabongi et al. | Aug 2003 | A1 |
| 20030167391 | Al-Ali | Sep 2003 | A1 |
| 20030168443 | Dozier | Sep 2003 | A1 |
| 20030179073 | Ghazarian | Sep 2003 | A1 |
| 20030182077 | Emord | Sep 2003 | A1 |
| 20030189491 | Ng | Oct 2003 | A1 |
| 20030189948 | Sashihara | Oct 2003 | A1 |
| 20030199247 | Striemer | Oct 2003 | A1 |
| 20030202477 | Zhen et al. | Oct 2003 | A1 |
| 20030209601 | Chung | Nov 2003 | A1 |
| 20030214400 | Mizutani et al. | Nov 2003 | A1 |
| 20030220075 | Baker et al. | Nov 2003 | A1 |
| 20030228846 | Berliner et al. | Dec 2003 | A1 |
| 20030231001 | Bruning | Dec 2003 | A1 |
| 20030236077 | Sivard | Dec 2003 | A1 |
| 20040007264 | Bootka | Jan 2004 | A1 |
| 20040017291 | Hardman et al. | Jan 2004 | A1 |
| 20040019783 | Hawkes | Jan 2004 | A1 |
| 20040021572 | Schoen et al. | Feb 2004 | A1 |
| 20040023629 | Klank | Feb 2004 | A1 |
| 20040025018 | Haas et al. | Feb 2004 | A1 |
| 20040041706 | Stratmoen et al. | Mar 2004 | A1 |
| 20040041731 | Hisano | Mar 2004 | A1 |
| 20040050429 | Aylward | Mar 2004 | A1 |
| 20040062224 | Brownrigg et al. | Apr 2004 | A1 |
| 20040066271 | Leck | Apr 2004 | A1 |
| 20040082296 | Twitchell | Apr 2004 | A1 |
| 20040090329 | Hitt | May 2004 | A1 |
| 20040090924 | Giaimo et al. | May 2004 | A1 |
| 20040100379 | Boman et al. | May 2004 | A1 |
| 20040100394 | Hitt | May 2004 | A1 |
| 20040100415 | Veitch et al. | May 2004 | A1 |
| 20040102864 | Stack et al. | May 2004 | A1 |
| 20040113772 | Hong Chou | Jun 2004 | A1 |
| 20040119588 | Marks | Jun 2004 | A1 |
| 20040121793 | Weigele et al. | Jun 2004 | A1 |
| 20040135691 | Duron et al. | Jul 2004 | A1 |
| 20040137959 | Salzhauer et al. | Jul 2004 | A1 |
| 20040142716 | Orlik et al. | Jul 2004 | A1 |
| 20040143750 | Kulack et al. | Jul 2004 | A1 |
| 20040147267 | Hill | Jul 2004 | A1 |
| 20040150516 | Faetanini | Aug 2004 | A1 |
| 20040164238 | Xu et al. | Aug 2004 | A1 |
| 20040164855 | Okubo | Aug 2004 | A1 |
| 20040174259 | Peel | Sep 2004 | A1 |
| 20040176028 | Dibernardo | Sep 2004 | A1 |
| 20040181693 | Milliot et al. | Sep 2004 | A1 |
| 20040183673 | Nageli | Sep 2004 | A1 |
| 20040193876 | Donley et al. | Sep 2004 | A1 |
| 20040198467 | Orlik et al. | Oct 2004 | A1 |
| 20040215532 | Boman et al. | Oct 2004 | A1 |
| 20040217858 | Ingley et al. | Nov 2004 | A1 |
| 20040222884 | Costa et al. | Nov 2004 | A1 |
| 20040224631 | Davis et al. | Nov 2004 | A1 |
| 20040232924 | Hilleary et al. | Nov 2004 | A1 |
| 20040233041 | Bohman et al. | Nov 2004 | A1 |
| 20040233054 | Neff et al. | Nov 2004 | A1 |
| 20040233855 | Gutierrez et al. | Nov 2004 | A1 |
| 20040233874 | Baker | Nov 2004 | A1 |
| 20040236645 | Tien | Nov 2004 | A1 |
| 20040246463 | Milinusic | Dec 2004 | A1 |
| 20040246903 | Huang et al. | Dec 2004 | A1 |
| 20040263340 | Pearson et al. | Dec 2004 | A1 |
| 20050012601 | Matsubara et al. | Jan 2005 | A1 |
| 20050030175 | Wolfe | Feb 2005 | A1 |
| 20050035877 | Kim | Feb 2005 | A1 |
| 20050043068 | Shohara et al. | Feb 2005 | A1 |
| 20050043907 | Eckel et al. | Feb 2005 | A1 |
| 20050046563 | Whitney | Mar 2005 | A1 |
| 20050053063 | Madhavan | Mar 2005 | A1 |
| 20050062605 | Sutphin | Mar 2005 | A1 |
| 20050071358 | Hind | Mar 2005 | A1 |
| 20050073406 | Easley et al. | Apr 2005 | A1 |
| 20050078672 | Caliskan et al. | Apr 2005 | A1 |
| 20050087235 | Skorpik | Apr 2005 | A1 |
| 20050088299 | Bandy | Apr 2005 | A1 |
| 20050090211 | Lilja et al. | Apr 2005 | A1 |
| 20050093702 | Twitchell | May 2005 | A1 |
| 20050093703 | Twitchell | May 2005 | A1 |
| 20050099292 | Sajkowsky | May 2005 | A1 |
| 20050105841 | Luo et al. | May 2005 | A1 |
| 20050111428 | Orlik et al. | May 2005 | A1 |
| 20050116667 | Mueller et al. | Jun 2005 | A1 |
| 20050125083 | Kiko | Jun 2005 | A1 |
| 20050128067 | Zakrewski | Jun 2005 | A1 |
| 20050128080 | Hall et al. | Jun 2005 | A1 |
| 20050129034 | Takeyoshi | Jun 2005 | A1 |
| 20050131652 | Corwin et al. | Jun 2005 | A1 |
| 20050145018 | Sabata et al. | Jul 2005 | A1 |
| 20050146445 | Sieboda et al. | Jul 2005 | A1 |
| 20050152318 | Elbatt et al. | Jul 2005 | A1 |
| 20050154527 | Ulrich | Jul 2005 | A1 |
| 20050157659 | Huitema | Jul 2005 | A1 |
| 20050174236 | Brookner | Aug 2005 | A1 |
| 20050187867 | Sokolic et al. | Aug 2005 | A1 |
| 20050190759 | Lee | Sep 2005 | A1 |
| 20050194456 | Tessier et al. | Sep 2005 | A1 |
| 20050199716 | Shafer et al. | Sep 2005 | A1 |
| 20050200475 | Chen | Sep 2005 | A1 |
| 20050215280 | Twitchell | Sep 2005 | A1 |
| 20050226201 | McMillin | Oct 2005 | A1 |
| 20050228991 | Schmit | Oct 2005 | A1 |
| 20050246408 | Chung | Nov 2005 | A1 |
| 20050258974 | Mahowald | Nov 2005 | A1 |
| 20050261037 | Raghunath et al. | Nov 2005 | A1 |
| 20050262923 | Kates | Dec 2005 | A1 |
| 20050270151 | Winick | Dec 2005 | A1 |
| 20050270160 | Chan et al. | Dec 2005 | A1 |
| 20050275527 | Kates | Dec 2005 | A1 |
| 20050275528 | Kates | Dec 2005 | A1 |
| 20050275529 | Kates | Dec 2005 | A1 |
| 20050275530 | Kates | Dec 2005 | A1 |
| 20050275547 | Kates | Dec 2005 | A1 |
| 20060007008 | Kates | Jan 2006 | A1 |
| 20060007863 | Naghian | Jan 2006 | A1 |
| 20060032379 | Kates | Feb 2006 | A1 |
| 20060041680 | Proctor et al. | Feb 2006 | A1 |
| 20060059977 | Kates | Mar 2006 | A1 |
| 20060063484 | Proctor et al. | Mar 2006 | A1 |
| 20060068832 | Islam | Mar 2006 | A1 |
| 20060098592 | Proctor et al. | May 2006 | A1 |
| 20060109106 | Braun | May 2006 | A1 |
| 20060114102 | Chang et al. | Jun 2006 | A1 |
| 20060132485 | Milinusic | Jun 2006 | A1 |
| 20060135145 | Redi | Jun 2006 | A1 |
| 20060146717 | Conner | Jul 2006 | A1 |
| 20060147003 | Archacki et al. | Jul 2006 | A1 |
| 20060158326 | Easley et al. | Jul 2006 | A1 |
| 20060163422 | Krikorian et al. | Jul 2006 | A1 |
| 20060164232 | Waterhouse et al. | Jul 2006 | A1 |
| 20060164239 | Loda | Jul 2006 | A1 |
| 20060164257 | Giubbini | Jul 2006 | A1 |
| 20060187026 | Kochis | Aug 2006 | A1 |
| 20060202817 | Mackenzie et al. | Sep 2006 | A1 |
| 20060206273 | Reichel et al. | Sep 2006 | A1 |
| 20060208099 | Chapman et al. | Sep 2006 | A1 |
| 20060239197 | Lieuallen et al. | Oct 2006 | A1 |
| 20060245424 | Ramanathan et al. | Nov 2006 | A1 |
| 20060255934 | Easley et al. | Nov 2006 | A1 |
| 20060256756 | Wakabayashi | Nov 2006 | A1 |
| 20060267756 | Kates | Nov 2006 | A1 |
| 20060268727 | Rangarajan | Nov 2006 | A1 |
| 20060270382 | Lappetelainen et al. | Nov 2006 | A1 |
| 20060273896 | Kates | Dec 2006 | A1 |
| 20060276161 | Twitchell et al. | Dec 2006 | A1 |
| 20060282546 | Reynolds et al. | Dec 2006 | A1 |
| 20060286988 | Blume et al. | Dec 2006 | A1 |
| 20060287008 | Twitchell et al. | Dec 2006 | A1 |
| 20070001854 | Chung et al. | Jan 2007 | A1 |
| 20070002792 | Twitchell et al. | Jan 2007 | A1 |
| 20070002793 | Twitchell, Jr. | Jan 2007 | A1 |
| 20070004331 | Twitchell et al. | Jan 2007 | A1 |
| 20070008408 | Zehavi | Jan 2007 | A1 |
| 20070032951 | Tanenhaus et al. | Feb 2007 | A1 |
| 20070038787 | Harris et al. | Feb 2007 | A1 |
| 20070040673 | Bohine | Feb 2007 | A1 |
| 20070041333 | Twitchell et al. | Feb 2007 | A1 |
| 20070041345 | Yarvis | Feb 2007 | A1 |
| 20070043478 | Ehlers et al. | Feb 2007 | A1 |
| 20070043807 | Twitchell et al. | Feb 2007 | A1 |
| 20070044524 | Coutermarsh et al. | Mar 2007 | A1 |
| 20070063833 | Kates | Mar 2007 | A1 |
| 20070069885 | Twitchell et al. | Mar 2007 | A1 |
| 20070078999 | Corson et al. | Apr 2007 | A1 |
| 20070090946 | Kates | Apr 2007 | A1 |
| 20070099628 | Twitchell et al. | May 2007 | A1 |
| 20070099629 | Twitchell et al. | May 2007 | A1 |
| 20070113882 | Meyers | May 2007 | A1 |
| 20070114295 | Jenkens | May 2007 | A1 |
| 20070115114 | Meyers | May 2007 | A1 |
| 20070115115 | Meyers | May 2007 | A1 |
| 20070115827 | Boehnke et al. | May 2007 | A1 |
| 20070115859 | Meyers | May 2007 | A1 |
| 20070115902 | Shamoon et al. | May 2007 | A1 |
| 20070118332 | Meyers | May 2007 | A1 |
| 20070121557 | Sylvain | May 2007 | A1 |
| 20070133980 | Meyers | Jun 2007 | A1 |
| 20070135179 | Hardman et al. | Jun 2007 | A1 |
| 20070139183 | Kates | Jun 2007 | A1 |
| 20070139197 | Hopman | Jun 2007 | A1 |
| 20070147255 | Oyman | Jun 2007 | A1 |
| 20070152815 | Meyers | Jul 2007 | A1 |
| 20070155327 | Twitchell et al. | Jul 2007 | A1 |
| 20070159999 | Twitchell et al. | Jul 2007 | A1 |
| 20070195702 | Yuen et al. | Aug 2007 | A1 |
| 20070200765 | Meyers | Aug 2007 | A1 |
| 20070211076 | Kates | Sep 2007 | A1 |
| 20070229237 | Kates | Oct 2007 | A1 |
| 20070234784 | Kates | Oct 2007 | A1 |
| 20070266575 | Nash | Nov 2007 | A1 |
| 20070274232 | Axelsson | Nov 2007 | A1 |
| 20070291690 | Twitchell et al. | Dec 2007 | A1 |
| 20070291724 | Twitchell et al. | Dec 2007 | A1 |
| 20080015742 | Kulyk et al. | Jan 2008 | A1 |
| 20080027586 | Hern et al. | Jan 2008 | A1 |
| 20080059622 | Hite et al. | Mar 2008 | A1 |
| 20080066658 | Muirhead | Mar 2008 | A1 |
| 20080094209 | Braun | Apr 2008 | A1 |
| 20080099568 | Nicodem et al. | May 2008 | A1 |
| 20080111692 | Twitchell et al. | May 2008 | A1 |
| 20080112377 | Twitchell et al. | May 2008 | A1 |
| 20080112378 | Twitchell et al. | May 2008 | A1 |
| 20080117040 | Peel | May 2008 | A1 |
| 20080129458 | Twitchell | Jun 2008 | A1 |
| 20080141754 | Kates | Jun 2008 | A1 |
| 20080142592 | Twitchell et al. | Jun 2008 | A1 |
| 20080143484 | Twitchell et al. | Jun 2008 | A1 |
| 20080144554 | Twitchell et al. | Jun 2008 | A1 |
| 20080151850 | Twitchell et al. | Jun 2008 | A1 |
| 20080165749 | Twitchell et al. | Jul 2008 | A1 |
| 20080180252 | Vogt | Jul 2008 | A1 |
| 20080212544 | Twitchell et al. | Sep 2008 | A1 |
| 20080221737 | Josephson et al. | Sep 2008 | A1 |
| 20080228904 | Crespo-Dubi et al. | Sep 2008 | A1 |
| 20080234878 | Joao | Sep 2008 | A1 |
| 20080264888 | Zakula et al. | Oct 2008 | A1 |
| 20080278310 | Kates | Nov 2008 | A1 |
| 20080278315 | Kates | Nov 2008 | A1 |
| 20080278316 | Kates | Nov 2008 | A1 |
| 20080278342 | Kates | Nov 2008 | A1 |
| 20080284590 | Kates | Nov 2008 | A1 |
| 20080291844 | Krause | Nov 2008 | A1 |
| 20080302172 | Kates | Dec 2008 | A1 |
| 20080303654 | Kates | Dec 2008 | A1 |
| 20080303897 | Twitchell et al. | Dec 2008 | A1 |
| 20080304443 | Twitchell | Dec 2008 | A1 |
| 20080315596 | Terry et al. | Dec 2008 | A1 |
| 20090016308 | Twitchell | Jan 2009 | A1 |
| 20090057427 | Geadelmann et al. | Mar 2009 | A1 |
| 20090092082 | Twitchell et al. | Apr 2009 | A1 |
| 20090103462 | Twitchell et al. | Apr 2009 | A1 |
| 20090104902 | Twitchell et al. | Apr 2009 | A1 |
| 20090122737 | Twitchell et al. | May 2009 | A1 |
| 20090129306 | Twitchell et al. | May 2009 | A1 |
| 20090135000 | Twitchell et al. | May 2009 | A1 |
| 20090143918 | Amundson et al. | Jun 2009 | A1 |
| 20090146805 | Joao | Jun 2009 | A1 |
| 20090153336 | Kates | Jun 2009 | A1 |
| 20090161642 | Twitchell et al. | Jun 2009 | A1 |
| 20090181623 | Twitchell et al. | Jul 2009 | A1 |
| 20090194601 | Flohr | Aug 2009 | A1 |
| 20090290512 | Twitchell | Nov 2009 | A1 |
| 20090295564 | Twitchell | Dec 2009 | A1 |
| 20090322510 | Berger et al. | Dec 2009 | A1 |
| 20100013635 | Berger et al. | Jan 2010 | A1 |
| 20100058450 | Fein et al. | Mar 2010 | A1 |
| 20100061352 | Fasolo et al. | Mar 2010 | A1 |
| 20100067420 | Twitchell | Mar 2010 | A1 |
| 20100097969 | De Kimpe et al. | Apr 2010 | A1 |
| 20100141449 | Twitchell | Jun 2010 | A1 |
| 20100145865 | Berger et al. | Jun 2010 | A1 |
| 20100150122 | Berger et al. | Jun 2010 | A1 |
| 20100156608 | Bae et al. | Jun 2010 | A1 |
| 20100163633 | Barrett et al. | Jul 2010 | A1 |
| 20100166113 | Farley et al. | Jul 2010 | A1 |
| 20100168924 | Tessier et al. | Jul 2010 | A1 |
| 20100199086 | Kuang et al. | Aug 2010 | A1 |
| 20100214060 | Twitchell | Aug 2010 | A1 |
| 20100214074 | Twitchell | Aug 2010 | A1 |
| 20100214969 | Lamm et al. | Aug 2010 | A1 |
| 20100238036 | Holcombe | Sep 2010 | A1 |
| 20110001812 | Kang et al. | Jan 2011 | A1 |
| 20110025501 | Kates | Feb 2011 | A1 |
| 20110078675 | Van Camp et al. | Mar 2011 | A1 |
| 20110119747 | Lambiase | May 2011 | A1 |
| 20110138044 | Bailey et al. | Jun 2011 | A1 |
| 20110151837 | Wlnbush | Jun 2011 | A1 |
| 20110176465 | Panta et al. | Jul 2011 | A1 |
| 20110282937 | Deshpande et al. | Nov 2011 | A1 |
| 20110289320 | Twitchell et al. | Nov 2011 | A1 |
| 20120077434 | Royston et al. | Mar 2012 | A1 |
| 20120163422 | Lee et al. | Jun 2012 | A1 |
| 20120190390 | Reunamaki et al. | Jul 2012 | A1 |
| 20120250619 | Twitchell | Oct 2012 | A1 |
| 20130016636 | Berger et al. | Jan 2013 | A1 |
| 20130070657 | Farley et al. | Mar 2013 | A1 |
| 20130223420 | Twitchell et al. | Aug 2013 | A1 |
| 20140203943 | Kates | Jul 2014 | A1 |
| 20140285336 | Kates | Aug 2014 | A1 |
| 20140308963 | Twitchell et al. | Oct 2014 | A1 |
| 20140333423 | Kates | Nov 2014 | A1 |
| 20140333434 | Kates | Nov 2014 | A1 |
| 20150061868 | Kates | Mar 2015 | A1 |
| 20150061892 | Kates | Mar 2015 | A1 |
| 20150070192 | Kates | Mar 2015 | A1 |
| 20150103747 | Twitchell | Apr 2015 | A1 |
| 20150172887 | Petite | Jun 2015 | A1 |
| 20160029315 | Kates | Jan 2016 | A1 |
| 20160044597 | Farley et al. | Feb 2016 | A1 |
| 20160219523 | Twitchell et al. | Jul 2016 | A1 |
| 20160247382 | Kates | Aug 2016 | A1 |
| 20160267761 | Kates | Sep 2016 | A1 |
| 20160286490 | Kates | Sep 2016 | A1 |
| 20160300183 | Berger et al. | Oct 2016 | A1 |
| 20170041876 | Farley et al. | Feb 2017 | A1 |
| 20170048798 | Twitchell et al. | Feb 2017 | A9 |
| 20170245215 | Twitchell | Aug 2017 | A1 |
| 20180293538 | Berger et al. | Oct 2018 | A1 |
| Number | Date | Country |
|---|---|---|
| 2388660 | Jul 2000 | CN |
| 3415786 | Nov 1984 | DE |
| 0070449 | Jan 1983 | EP |
| 0093463 | Nov 1983 | EP |
| 0346152 | Dec 1989 | EP |
| 0346152 | Oct 1990 | EP |
| 0467036 | Jan 1992 | EP |
| 0601820 | Jun 1994 | EP |
| 0748083 | Dec 1996 | EP |
| 0748085 | Dec 1996 | EP |
| 0580298 | Jan 1997 | EP |
| 0829995 | Mar 1998 | EP |
| 0930492 | Jul 1999 | EP |
| 0441999 | Aug 1999 | EP |
| 0944014 | Sep 1999 | EP |
| 1692668 | Aug 2006 | EP |
| 1317733 | Apr 2010 | EP |
| 1692599 | Jul 2013 | EP |
| 231458 | Jan 1926 | GB |
| 2278471 | Nov 1994 | GB |
| 2308947 | Jul 1997 | GB |
| 9298780 | Nov 1997 | JP |
| 10258189 | Sep 1998 | JP |
| 20040012311 | Feb 2004 | KR |
| 100509070 | Aug 2005 | KR |
| 20050102419 | Oct 2005 | KR |
| 100587735 | Jun 2006 | KR |
| 20070005515 | Jan 2007 | KR |
| 20080001235 | Jan 2008 | KR |
| 9810393 | Mar 1998 | WO |
| 0021047 | Apr 2000 | WO |
| 0055825 | Sep 2000 | WO |
| 0068907 | Nov 2000 | WO |
| 0069186 | Nov 2000 | WO |
| 03009631 | Jan 2003 | WO |
| 2003098175 | Nov 2003 | WO |
| 2004010398 | Jan 2004 | WO |
| 2004073326 | Aug 2004 | WO |
| 2004100763 | Nov 2004 | WO |
| 2005010837 | Feb 2005 | WO |
| 2006056174 | Jun 2006 | WO |
| 2008054938 | May 2008 | WO |
| 2009140669 | Nov 2009 | WO |
| 2009151877 | Dec 2009 | WO |
| Entry |
|---|
| US 9,445,367 B2, 09/2016, Farley et al. (withdrawn) |
| “Advisory Action”, U.S. Appl. No. 13/555,897, dated Nov. 6, 2014, 3 pages. |
| “Advisory Action”, U.S. Appl. No. 14/168,876, dated Jun. 10, 2015, 3 pages. |
| “Advisory Action”, U.S. Appl. No. 14/536,108, dated Sep. 3, 2015, 4 pages. |
| “Advisory Action”, U.S. Appl. No. 12/353,197, dated Jul. 16, 2012, 5 pages. |
| “Application Note Published by Texas Instruments for CC1100/CC2500 Products”, Accessed on Dec. 19, 2008, 17 pages. |
| “Best Way to Contra/Indoor Molds, Dust Mites, and other Microorganisms: Measuring and Controlling Indoor Humidity [Brochure]”, Indoor Health Products, Inc. (2001-2002). Layton, Utah: Indoor Health Products, Inc. Retrieved from the Internet: <URL: http://www. relativehumidity-sensor.com> on Jun. 18, 2004, 3 pages. |
| “Final Office Action”, U.S. Appl. No. 10/856,395, dated Oct. 30, 2006, 10 pages. |
| “Final Office Action”, U.S. Appl. No. 14/168,876, dated Mar. 18, 2015, 10 pages. |
| “Final Office Action”, U.S. Appl. No. 14/534,848, dated Jan. 26, 2017, 10 pages. |
| “Final Office Action”, U.S. Appl. No. 15/590,880, dated Feb. 8, 2018, 11 pages. |
| “Final Office Action”, U.S. Appl. No. 14/339,234, dated Aug. 20, 2015, 12 pages. |
| “Final Office Action”, U.S. Appl. No. 15/161,880, dated Dec. 20, 2016, 12 pages. |
| “Final Office Action”, U.S. Appl. No. 14/548,137, dated Sep. 1, 2015, 13 pages. |
| “Final Office Action”, U.S. Appl. No. 14/534,848, dated Nov. 23, 2015, 13 pages. |
| “Final Office Action”, U.S. Appl. No. 15/052,172, dated Feb. 9, 2017, 13 pages. |
| “Final Office Action”, U.S. Appl. No. 15/161,880, dated Mar. 20, 2017, 13 pages. |
| “Final Office Action”, U.S. Appl. No. 11/562,352, dated Aug. 21, 2008, 14 pages. |
| “Final Office Action”, U.S. Appl. No. 13/555,897, dated Aug. 29, 2014, 14 pages. |
| “Final Office Action”, U.S. Appl. No. 15/090,973, dated Nov. 10, 2016, 14 pages. |
| “Final Office Action”, U.S. Appl. No. 12/353,197, dated Mar. 23, 2012, 15 pages. |
| “Final Office Action”, U.S. Appl. No. 14/536,108, dated Jun. 13, 2016, 16 pages. |
| “Final Office Action”, U.S. Appl. No. 13/367,341, dated Feb. 26, 2013, 17 pages. |
| “Final Office Action”, U.S. Appl. No. 14/298,371, dated Mar. 6, 2015, 17 pages. |
| “Final Office Action”, U.S. Appl. No. 14/536,108, dated May 26, 2015, 18 pages. |
| “Final Office Action”, U.S. Appl. No. 14/338,592, dated May 29, 2015, 22 pages. |
| “Final Office Action”, U.S. Appl. No. 14/573,625, dated Dec. 14, 2016, 29 pages. |
| “Final Office Action”, U.S. Appl. No. 11/314,807, dated Jul. 16, 2007, 5 pages. |
| “Final Office Action”, U.S. Appl. No. 11/314,807, dated Apr. 1, 2008, 5 pages. |
| “Final Office Action”, U.S. Appl. No. 12/036,915, dated Jul. 8, 2009, 5 pages. |
| “Final Office Action”, U.S. Appl. No. 10/856,395, dated Apr. 13, 2006, 8 pages. |
| “First Action Interview Office Action”, U.S. Appl. No. 14/338,592, dated Mar. 24, 2015, 4 pages. |
| “First Action Interview Office Action”, U.S. Appl. No. 14/339,234, dated Mar. 24, 2015, 8 pages. |
| “First Action Interview Pre-Interview Communication”, U.S. Appl. No. 15/194,148, dated Jul. 17, 2017, 4 pages. |
| “First Alert—User's Manual Smoke and Fire Alarm: Battery Powered Photoelectric Smoke Alarm with Silence and Escape Light: Model SA720 [Brochure]”, Mexico: First Alert, Jan. 1, 2007, 6 pages. |
| “G-Cap 2 Relative Humidity Sensor [Brochure]”, GE General Eastern Instruments—GlobalSpec.com—Retrieved from the Internet: <URL: http://www.globalspec.com/FeaturedProducts/Detaii?ExhibitiD=1454> on Jun. 18, 2004, 2 pages. |
| “Impedance Moisture Sensor Technology [Brochure].”, Michell Instruments L TO. Retrieved from the Internet: <URL: http://www.sensorland.com/HowPage029.html> on Jun. 18, 2004, 2 pages. |
| “International Preliminary Report on Patentability”, Application No. PCT/US2006/026158, dated Jan. 17, 2008, 9 pages. |
| “International Search Report and Written Opinion”, Application No. PCT/US2009/044277, dated Jan. 27, 2010, 13 pages. |
| “International Search Report and Written Opinion”, Application No. PCT/US2009/044276, dated Jan. 11, 2010, 7 pages. |
| “Mechanical Data Sheet: PT(S-PQFP-G48) Plastic Quad Flatpack, [Brochure].”, Texas Instruments, Inc. (1996). Dallas, Texas: Texas Instruments, Inc., Jan. 1, 1996, 2 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 12/647,672, dated Aug. 14, 2012, 10 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/216,225, dated Mar. 4, 2008, 10 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/428,536, dated Dec. 24, 2009, 10 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 15/090,973, dated Jun. 15, 2016, 10 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 15/161,880, dated Jul. 12, 2016, 10 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 12/353,197, dated Oct. 6, 2011, 11 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 13/555,897, dated Dec. 17, 2013, 11 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 15/590,880, dated Aug. 11, 2017, 12 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/338,592, dated Mar. 2, 2015, 12 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/534,848, dated Aug. 11, 2016, 12 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 12/271,850, dated May 11, 2011, 13 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 15/052,172, dated Jul. 19, 2016, 13 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 10/948,628, dated Sep. 8, 2006, 14 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/761,760, dated Jan. 16, 2008, 15 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/536,108, dated Dec. 3, 2015, 17 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/536,108, dated May 4, 2017, 17 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/534,848, dated Jun. 1, 2015, 19 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 13/367,341, dated Jul. 24, 2012, 20 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 12/905,248, dated Aug. 30, 2013, 20 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/573,625, dated May 5, 2016, 38 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 15/194,148, dated Dec. 7, 2017, 4 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 10/856,231, dated Apr. 5, 2006, 4 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/145,880, dated Apr. 27, 2006, 4 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/145,880, dated Mar. 1, 2007, 4 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/573,625, dated Sep. 21, 2017, 5 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/314,807, dated Jan. 18, 2007, 5 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/562,313, dated Sep. 5, 2007, 5 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/562,352, dated Jan. 14, 2008, 5 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/748,388, dated Dec. 17, 2008, 5 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 10/856,395, dated Oct. 3, 2005, 6 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/216,225, dated Jul. 10, 2008, 6 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 12/036,915, dated Oct. 8, 2008, 6 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/875,488, dated Dec. 18, 2015, 6 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 10/856,717, dated Dec. 14, 2005, 7 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 10/856,717, dated May 31, 2006, 7 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/494,988, dated Mar. 5, 2009, 7 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 12/182,079, dated Feb. 26, 2010, 7 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 10/856,390, dated Dec. 15, 2005, 8 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 10/856,231, dated Dec. 21, 2005, 8 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/231,321, dated Jul. 24, 2006, 8 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 12/468,047, dated Dec. 13, 2011, 8 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 10/856,387, dated Dec. 14, 2005, 9 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 11/233,931, dated Jul. 10, 2006, 9 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/298,371, dated Sep. 9, 2014, 9 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/168,876, dated Sep. 15, 2014, 9 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/100,357, dated Sep. 15, 2014, 10 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/748,388, dated May 19, 2009, 12 pages. |
| “Notice of Allowance”, U.S. Appl. No. 12/647,672, dated Nov. 1, 2012, 12 pages. |
| “Notice of Allowance”, U.S. Appl. No. 10/948,628, dated May 3, 2007, 2 pages. |
| “Notice of Allowance”, U.S. Appl. No. 10/856,231, dated Jun. 28, 2006, 4 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/231,321, dated Mar. 21, 2007, 4 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/145,880, dated Sep. 21, 2007, 4 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/314,807, dated Dec. 24, 2008, 4 pages. |
| “Notice of Allowance”, U.S. Appl. No. 13/555,897, dated Jun. 8, 2015, 5 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/298,371, dated Jul. 2, 2015, 5 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/548,137, dated Dec. 10, 2015, 5 pages. |
| “Notice of Allowance”, U.S. Appl. No. 13/555,897, dated Dec. 17, 2015, 5 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/168,876, dated Feb. 12, 2016, 5 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/875,488, dated Apr. 8, 2016, 5 pages. |
| “Notice of Allowance”, U.S. Appl. No. 15/090,973, dated Mar. 16, 2017, 5 pages. |
| “Notice of Allowance”, U.S. Appl. No. 10/856,387, dated Jun. 23, 2006, 6 pages. |
| “Notice of Allowance”, U.S. Appl. No. 10/856,717, dated Mar. 13, 2007, 6 pages. |
| “Notice of Allowance”, U.S. Appl. No. 10/948,628, dated Apr. 9, 2007, 6 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/145,880, dated Jul. 5, 2007, 6 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/562,313, dated May 23, 2008, 6 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/761,760, dated Jul. 1, 2008, 6 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/494,988, dated Jul. 17, 2009, 6 pages. |
| “Notice of Allowance”, U.S. Appl. No. 12/182,079, dated Jun. 23, 2010, 6 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/428,536, dated Feb. 8, 2011, 6 pages. |
| “Notice of Allowance”, U.S. Appl. No. 10/856,170, dated Dec. 13, 2005, 7 pages. |
| “Notice of Allowance”, U.S. Appl. No. 10/856,390, dated Jun. 27, 2006, 7 pages. |
| “Notice of Allowance”, U.S. Appl. No. 13/620,171, dated Feb. 18, 2014, 7 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/573,625, dated Mar. 28, 2017, 7 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/233,931, dated Aug. 10, 2006, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/216,225, dated Mar. 10, 2009, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 12/271,850, dated Oct. 6, 2011, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 13/619,681, dated Mar. 3, 2015, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/754,115, dated Dec. 24, 2015, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/754,115, dated May 4, 2016, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 15/179,350, dated Aug. 15, 2016, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/754,115, dated Sep. 20, 2016, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 15/248,576, dated Mar. 15, 2017, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 11/428,536, dated Jul. 23, 2010, 9 pages. |
| “Notice of Allowance”, U.S. Appl. No. 12/468,047, dated May 31, 2012, 9 pages. |
| “Notice of Allowance”, U.S. Appl. No. 13/367,341, dated Aug. 5, 2013, 9 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/339,234, dated Oct. 27, 2015, 9 pages. |
| “Preinterview First Office Action”, U.S. Appl. No. 14/338,592, dated Oct. 31, 2014, 4 pages. |
| “Preinterview First Office Action”, U.S. Appl. No. 14/339,234, dated Nov. 19, 2014, 5 pages. |
| “Relative Humidity Information [Brochure]”, Indoor Health Products, Inc. (2002) Layton, Utah: Indoor Health Products, Inc. Retrieved from the Internet: <URL: http://www. relativehumidity-sensor.com/relative-humidity.html> on Jun. 18, 2004, 6 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. 11/562,313, dated Feb. 22, 2008, 5 pages. |
| “Restriction Requirement”, U.S. Appl. No. 12/468,047, dated Oct. 5, 2011, 5 pages. |
| “Restriction Requirement”, U.S. Appl. No. 10/948,628, dated Dec. 30, 2005, 6 pages. |
| “Restriction Requirement”, U.S. Appl. No. 11/761,760, dated Oct. 11, 2007, 6 pages. |
| “Restriction Requirement”, U.S. Appl. No. 10/948,628, dated Apr. 20, 2006, 7 pages. |
| “Restriction Requirement”, U.S. Appl. No. 12/193,641, dated Apr. 3, 2009, 7 pages. |
| “Supplemental Notice of Allowance”, U.S. Appl. No. 11/145,880, dated Dec. 10, 2007, 2 pages. |
| “TeraHop Networks—Tradeshow Handouts”, MERIT-2030-2040 Gateway Controllers; MERIT-300 Incedent Node; MERIT-TL TeraLink System Software, Jan. 1, 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. |
| “TRF6901 Single-Chip RF Transceiver Product Catalog [Brochure].”, Texas Instruments, Inc. (2001-2003). Dallas, Texas: Texas Instruments, Inc., 27 pages. |
| “Waterbug: Electronic water detection at its best! [Brochure].”, Winland Electronics, Inc. (2011). Mankato, Minnesota: Winland Electronics Inc. Retrieved from the Internet: <URL:www.winland.com>, Jan. 1, 2011, 1 page. |
| “Ways to Prevent Mold Problems [Brochure].”, Toxic Black Mold Information Center. (2002). Layton, Utah: Toxic Black Mold Information Center. Retrieved from the Internet: <URL: http://www.toxic-black-mold-info.com/prevent.html> on Jun. 18, 2004, 12 pages. |
| “Website Page Detailing Features of Texas Instruments' Chipcon Products”, Accessed on Dec. 19, 2008, 1 page. |
| “Written Opinion”, Application No. PCT/US06/00868, dated Apr. 2, 2007, 3 pages. |
| “Written Opinion”, Application No. PCT/US2006/026158, dated Nov. 21, 2006, 7 pages. |
| Bourke, Tony “Server Load Balancing”, Sebastopol, California: O'Reilly Associates, Jan. 1, 2001, 182 pages. |
| Easley, Linda et al., “Global Container Security System”, U.S. Appl. No. 60/499,338, filed Sep. 3, 2003, 27 pages. |
| Garcia-Luna-Aceves, J J. “Source-Tree Routing in Wireless Networks”, Proceedings of Seventh International Conference on Network Protocols, 10 pages. |
| Gira, “Gira Dua/NdS smoke alarm: Double safety by measuring heat and scattered light. [Brochure]”, Radevormwald, Germany: Gira. Retrieved from the Internet: <URL: http://www.gira.de/gebaeudetechniklprodukte/sicherheit/rauchmelder/rauchwarnmelderdualvds.html> on Apr. 18, 2013,, 7 pages. |
| Gira, “Gira Dua/VdS smoke alarm: Double safety by measuring heat and scattered light [Brochure]”, Radevormwald, Germany: Gira. Retrieved from the Internet: <URL: http://www.gira.de/gebaeudetechniklprodukte/sicherheit/rauchmelder/rauchwarnmelderdualvds.html> on Apr. 18, 2013,, 14 pages. |
| Gira, “Installation and user manual: Smoke alarm device Dua/VdS [Brochure]”, Radevormwald, Germany: Gira. Retrieved from the Internet: <URL: http://download.gira.de/data2/2330121 O.pdf> on Apr. 18, 2013., 20 pages. |
| Gu, Daniel L. et al., “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, pp. 879-884. |
| Gu, Daniel L. “Hierarchical Routing for Multi-Layer Ad-Hoc Wireless Networks with UAVs”, 21st Century Military Communications Conference Proceedings, 5 pages. |
| Haartsen, Jaap “Bluetooth—The Universal Radio Interface for Ad Hoc, Wireless Connectivity”, Ericsson Review No. 3, 8 pages. |
| Haartsen, Jaap “Bluetooth: Vision, Goals, and Architecture”, Mobile Computing & Communications Review, vol. 1, No. 2, 8 pages. |
| Hubaux, Jean-Pierre et al., “Toward Self-Organized Mobile Ad Hoc Networks: The Terminodes Project”, IEEE Communications Magazine ( vol. 39, Issue: 1, Jan. 2001 ), 7 pages. |
| Iwata, Atsushi et al., “Scalable Routing Strategies for Ad hoc Wireless Networks”, IEEE Journal on Selected Areas in Communications, 26 pages. |
| Keshavarzian, “Energy-Efficient Link Assessment in Wireless Sensor Networks”, Conference on the IEEE computer and Communications Societies, vol. 3, 14 pages. |
| Kidde, “Battery Operated Smoke Alarm with Hush: Model i9060 [Brochure].”, Mebane, North Carolina: Kidde, Jan. 1, 2009, 2 pages. |
| Lee, Sung-Ju “On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks”, Retrieved at: https://tools.ietf.org/html/draft-ietf-manet-odmrp-02, 29 pages. |
| Melodia, Tommaso et al., “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, pp. 520-532. |
| Mingliang, Jiang et al., “Cluster Based Routing Protocol (CBRP)”, Internet-Draft, National University of Singapore, 27 pages. |
| Morgan, Gary “Miniature Tags Provide Visibility & Cohesion for an LIA Battalion Level ‘Proof of Principle’”, Pacific NW National Laboratory, 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, Guangyu et al., “A Wireless Hierarchical Routing Protocol with Group Mobility”, Wireless Communications and Networking Conference, Jan. 21, 1999, 18 pages. |
| Pei, Guangyu et al., “Mobility Management in Hierarchical Multi-Hop Mobile Wireless Networks”, Eight International Conference on Computer Communications and Networks Proceedings., 6 pages. |
| Perkins, C E. “Mobile Ad Hoc Networking Terminology”, draft-ietf-manet-term-01.txt—Internet Draft, Nov. 17, 1998, 10 pages. |
| Perkins, Charles E. “Ad Hoc Networks”, Table of Contens, Chapters 1, 4, and 11, 112 pages. |
| Ramanathan, Ram et al., “Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support”, Mobile Networks and Applications, 36 pages. |
| Sharp, Kevin “Physical Reality: A Second Look, Supply Chain Systems”, http://www.idsystems.com/reader/1999_03/phys0399_pt2/index.htm, 5 pages. |
| Sommer, Ben “Group 4, Passive RF Tags”, 4 pages. |
| Stojmenovic, Ivan et al., “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 ), 6 pages. |
| Valdevit, Evio “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, Jan. 1, 1999, 13 pages. |
| White, et al., “A Conceptual Model for Simulation Load Balancing”,, Proc. 1998 Spring Simulation Interoperability Workshop, Jan. 1, 1998, 7 pages. |
| Woo, Alec 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. |
| “Non-Final Office Action”, U.S. Appl. No. 15/590,880, dated Aug. 28, 2018, 10 pages. |
| “Final Office Action”, U.S. Appl. No. 15/590,880, dated Apr. 4, 2019, 10 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 15/914,786, dated Apr. 19, 2019, 14 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20180234905 A1 | Aug 2018 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60696159 | Jul 2005 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14573625 | Dec 2014 | US |
| Child | 15953362 | US | |
| Parent | 14100357 | Dec 2013 | US |
| Child | 14573625 | US | |
| Parent | 13367341 | Feb 2012 | US |
| Child | 14100357 | US | |
| Parent | 12271850 | Nov 2008 | US |
| Child | 13367341 | US | |
| Parent | 11428536 | Jul 2006 | US |
| Child | 12271850 | US |
