Receiver state estimation in a duty cycled radio

Information

  • Patent Grant
  • 9532310
  • Patent Number
    9,532,310
  • Date Filed
    Monday, June 29, 2015
    9 years ago
  • Date Issued
    Tuesday, December 27, 2016
    8 years ago
Abstract
A method for receiver state estimation includes communicating, from a first communications device to a second communications device, a first plurality of wake-up frames: receiving, at the first communications device from the second communications device, an indication of a received wake-up frame of the communicated first plurality of wake-up frames; determining, by the first communications device, a time at which the second communications device is in a ready state based on the received indication; subsequently communicating, from the first communications device to the second communications device, a second plurality of wake-up frames. The first plurality is greater than the second plurality, the reduction in number from the first plurality to the second plurality being based on the determined time at which the second communications device is in a ready state.
Description
INCORPORATION BY REFERENCE

Additionally, the present application hereby incorporates herein by reference each of the following identified U.S. patent applications—as well as any publications thereof and any patents issuing therefrom; the following identified U.S. patent application publications; and the following identified U.S. patents: U.S. patent application Ser. No. 12/607,040; U.S. patent application Ser. No. 12/609,009; U.S. patent application Ser. No. 12/609,008; U.S. patent application Ser. No. 12/608,837; U.S. patent application Ser. No. 12/468,047; U.S. patent application Ser. No. 12/367,544 (U.S. Patent Application Publication No. 2009/0135000 A1); U.S. patent application Ser. No. 12/367,543 (U.S. Patent Application Publication No. 2009/0161642 A1); U.S. patent application Ser. No. 12/367,542 (U.S. Patent Application Publication No. 2009/0181623 A1); U.S. patent application Ser. No. 12/353,197 (U.S. Patent Application Publication No. 2009/0129306 A1); U.S. patent application Ser. No. 12/352,992 (U.S. Patent Application Publication No. 2009/0122737 A1); U.S. patent application Ser. No. 12/343,865 (U.S. Patent Application Publication No. 2009/0104902 A1); U.S. patent application Ser. No. 12/343,822 (U.S. Patent Application Publication No. 2009/0103462 A1); U.S. patent application Ser. No. 12/271,850 (U.S. Patent Application Publication No. 2009/0092082 A1); U.S. patent application Ser. No. 12/140,253 (U.S. Patent Application Publication No. 2008/0303897 A1); U.S. patent application Ser. No. 11/930,797 (U.S. Patent Application Publication No. 2008/0151850 A1); U.S. patent application Ser. No. 11/930,793 (U.S. Patent Application Publication No. 2008/0112378 A1); U.S. patent application Ser. No. 11/930,788 (U.S. Patent Application Publication No. 2008/0165749 A1); U.S. patent application Ser. No. 11/930,785 (U.S. Patent Application Publication No. 2008/0143484 A1); U.S. patent application Ser. No. 11/930,782 (U.S. Patent Application Publication No. 2008/0212544 A1); U.S. patent application Ser. No. 11/930,779 (U.S. Patent Application Publication No. 2008/0129458 A1); U.S. patent application Ser. No. 11/930,777 (U.S. Patent Application Publication No. 2008/0111692 A1); U.S. patent application Ser. No. 11/930,770 (U.S. Patent Application Publication No. 2008/0144554 A1); U.S. patent application No. 11/930,761 (U.S. Patent Application Publication No. 2008/0112377 A1); U.S. patent application Ser. No. 11/930,753 (U.S. Patent Application Publication No. 2008/0142592 A1) now U.S. Pat. No. 7,535,339; U.S. patent application Ser. No. 11/930,749 (U.S. Patent Application Publication No. 2008/0130536 A1) now U.S. Pat. No. 7,538,658; U.S. patent application Ser. No. 11/930,740 (U.S. Patent Application Publication No. 2008/0150723 A1) now U.S. Pat. No. 7,538,657; U.S. patent application Ser. No. 11/930,736 (U.S. Patent Application Publication No. 2008/0143483 A1) now U.S. Pat. No. 7,538,656; U.S. patent application Ser. No. 11/847,309 (U.S. Patent Application Publication No. 2007/0291724 A1); U.S. patent application Ser. No. 11/847,295 (U.S. Patent Application Publication No. 2007/0291690 A1); U.S. patent application Ser. No. 11/832,998 (U.S. Patent Application Publication No. 2007/0273503 A1) now U.S. Pat. No. 7,378,959; U.S. patent application Ser. No. 11/832,991 (U.S. Patent Application Publication No. 2007/0268134 A1) now U.S. Pat. No. 7,378,958; U.S. patent application Ser. No. 11/832,979 (U.S. Patent Application Publication No. 2007/0268126 A1) now U.S. Pat. No. 7,378,957; U.S. patent application Ser. No. 11/610,427 (U.S. Patent Application Publication No. 2007/0159999 A1); U.S. patent application Ser. No. 11/618,931 (U.S. Patent Application Publication No. 2007/0155327 A1); U.S. patent application Ser. No. 11/555,173 (U.S. Patent Application Publication No. 2007/0099629 A1); U.S. patent application Ser. No. 11/555,164 (U.S. Patent Application Publication No. 2007/0099628 A1); U.S. patent application Ser. No. 11/465,466 (U.S. Patent Application Publication No. 2007/0043807 A1); U.S. patent application Ser. No. 11/465,796 (U.S. Patent Application Publication No. 2007/0041333 A1); U.S. patent application Ser. No. 11/460,976 (U.S. Patent Application Publication No. 2008/0315596 A1); U.S. patent application Ser. No. 11/428,536 (U.S. Patent Application Publication No. 2007/0002793 A1); U.S. patent application Ser. No. 11/428,535 (U.S. Patent Application Publication No. 2007/0002792 A1); U.S. patent application Ser. No. 11/425,047 (U.S. Patent Application Publication No. 2007/0069885 A1) now U.S. Pat. No. 7,554,442; U.S. patent application Ser. No. 11/425,040 (U.S. Patent Application Publication No. 2006/0287008 A1) now U.S. Pat. No. 7,539,520; U.S. patent application Ser. No. 11/424,850 (U.S. Patent Application Publication No. 2007/0004331 A1); U.S. patent application Ser. No. 11/424,849 (U.S. Patent Application Publication No. 2007/0004330 A1) now U.S. Pat. No. 7,574,168; U.S. patent application Ser. No. 11/424,847 (U.S. Patent Application Publication No. 2007/0001898 A1) now U.S. Pat. No. 7,583,769; U.S. patent application Ser. No. 11/424,845 (U.S. Patent Application Publication No. 2006/0287822 A1) now U.S. Pat. No. 7,574,300; U.S. patent application Ser. No. 11/423,127 (U.S. Patent Application Publication No. 2006/0289204 A1) now U.S. Pat. No. 7,563,991; U.S. patent application Ser. No. 11/422,306 (U.S. Patent Application Publication No. 2006/0282217 A1) now U.S. Pat. No. 7,542,849; U.S. patent application Ser. No. 11/422,304 (U.S. Patent Application Publication No. 2006/0276963 A1) now U.S. Pat. No. 7,526,381; U.S. patent application Ser. No. 11/422,321 (U.S. Patent Application Publication No. 2006/0276161 A1); U.S. patent application Ser. No. 11/422,329 (U.S. Patent Application Publication No. 2006/0274698 A1) now U.S. Pat. No. 7,529,547; U.S. patent application Ser. No. 11/306,765 (U.S. Patent Application Publication No. 2008/0136624A1) now U.S. Pat. No. 7,394,361; U.S. application Ser. No. 11/306,764 (U.S. Patent Application Publication No. 2006/0237490 A1) now U.S. Pat. No. 7,391,321; U.S. patent application Ser. No. 11/193,300 (U.S. Patent Application Publication No. 2007/0024066 A1) now U.S. Pat. No. 7,438,334; U.S. patent application Ser. No. 11/161,550 (U.S. Patent Application Publication No. 2007/0002808 A1) now U.S. Pat. No. 7,430,437; U.S. patent application Ser. No. 11/161,545 (U.S. Patent Application Publication No. 2006/0018274 A1) now U.S. Pat. No. 7,221,668; U.S. patent application Ser. No. 11/161,542 (U.S. Patent Application Publication No. 2006/0023679 A1) now U.S. Pat. No. 7,522,568; U.S. patent application Ser. No. 11/161,540 (U.S. Patent Application Publication No. 2007/0004431 A1) now U.S. Pat. No. 7,200,132; U.S. patent application Ser. No. 11/161,539 (U.S. Patent Application Publication No. 2006/0023678 A1) now U.S. Pat. No. 7,209,468; U.S. patent application Ser. No. 10/987,964 (U.S. Patent Application Publication No. 2005/0093703 A1) now U.S. Pat. No. 7,155,264; U.S. patent application Ser. No. 10/987,884 (U.S. Patent Application Publication No. 2005/0093702 A1) now U.S. Pat. No. 7,133,704; U.S. patent application Ser. No. 10/604,032 (U.S. Patent Application Publication No. 2004/0082296 A1) now U.S. Pat. No. 6,934,540; U.S. patent application Ser. No. 10/514,336 (U.S. Patent Application Publication No. 2005/0215280A1) now U.S. Pat. No. 7,209,771; and U.S. patent application Ser. No. 00/681,282 (U.S. Patent Application Publication No. 2002/0119770 A1) now U.S. Pat. No. 6,745,027.


Each of the foregoing patent application publications and patents is hereby incorporated herein by reference for purposes of disclosure of class-based network (CBN) technology, wake-up (WUV) technology, and class-based networks that utilize such technologies (such as those of TeraHop Networks, Inc. of Alpharetta, Ga.), and systems employing such technologies including, inter alia: (1) implementations in the first responder context; (2) implementations in container tracking and monitoring context: and (3) implementations in equipment tracking and monitoring, especially rental construction equipment. It is intended that the CBN and WU technologies, and related features, improvements, and enhancements, as disclosed in these incorporated references may be utilized in combination with various embodiments and implementations of the present invention.


Further still, “Ad Hoc Wireless Networks”, by C. Siva Ram Murthy and B. S. Manoj, is hereby incorporated herein by reference.


COPYRIGHT STATEMENT

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.


BACKGROUND OF THE INVENTION

The present invention generally relates to systems and methods for reducing power consumption and congestion in wireless networks.


At least some methods and systems described herein could be considered a refinement of ‘Receiver with constant battery saving duty cycle’ (U.S. Pat. No. 5,355,518) to reduce power consumption and bandwidth usage. Other US patents that describe similar techniques include: U.S. Pat. No. 4,964,121 for a ‘Battery saver for a TDM system’; U.S. Pat. No. 5,355,518 for a ‘Receiver with constant battery saving duty cycle’; and U.S. Pat. No. 4,802,240 for a ‘Synchronous receiving method for selective calling signal’.


A need exists for improvement in power consumption and congestion associated with wireless networks. This, and other needs, are addressed by one or more aspects of the present invention.


SUMMARY OF THE INVENTION

The present invention includes many aspects and features. Moreover, while many aspects and features relate to, and are described in, the context of systems and methods for reducing power consumption and congestion in wireless networks, the present invention is not limited to use only in such systems and methods, as will become apparent from the following summaries and detailed descriptions of aspects, features, and one or more embodiments of the present invention.


Accordingly, one aspect of the present invention relates to a method for receiver state estimation. The method includes communicating, from a first communications device to a second communications device, a first plurality of wake-up frames; receiving, at the first communications device from the second communications device, an indication of a received wake-up frame of the communicated first plurality of wake-up frames: determining, by the first communications device, a time at which the second communications device is in a ready state based on the received indication; subsequently communicating, from the first communications device to the second communications device, a second plurality of wake-up frames. The first plurality is greater than the second plurality, the reduction in number from the first plurality to the second plurality being based on the determined time at which the second communications device is in a ready state.


In a feature of this aspect of the invention, the first communications device and the second communications device each comprise a remote sensor node (RSN).


Another aspect of the present invention relates to a method for receiver state estimation. The method includes communicating, from a first communications device to a second communications device, a first plurality of wake-up frames; receiving, at the first communications device from the second communications device, an indication of a received wake-up frame of the communicated first plurality of wake-up frames; determining, by the first communications device, an offset time relative to a clock of the first communications device based on the received indication; subsequently communicating, from the first communications device to the second communications device, a second plurality of wake-up frames. The first plurality is greater than the second plurality, the reduction in number from the first plurality to the second plurality being based on the determined offset time.


In one or more embodiments, aspects and features described herein are utilized in combination with aspects and features described in one or more of the patents, publications, or applications incorporated herein by reference.


In addition to the aforementioned aspects and features of the present invention, it should be noted that the present invention further encompasses the various possible combinations and subcombinations of such aspects and features.





BRIEF DESCRIPTION OF THE DRAWINGS

One or more preferred embodiments of the present invention now will be described in detail with reference to the accompanying drawings, wherein the same elements are referred to with the same reference numerals, and wherein,



FIG. 1 illustrates a high level overview of wireless nodes including both a reduced complexity radio, and a high power complex transceiver.





DETAILED DESCRIPTION

As a preliminary matter, it will readily be understood by one having ordinary skill in the relevant art (“Ordinary Artisan”) that the present invention has broad utility and application. Furthermore, any embodiment discussed and identified as being “preferred” is considered to be part of a best mode contemplated for carrying out the present invention. Other embodiments also may be discussed for additional illustrative purposes in providing a full and enabling disclosure of the present invention. As should be understood, any embodiment may incorporate only one or a plurality of the above-disclosed aspects of the invention and may further incorporate only one or a plurality of the above-disclosed features. Moreover, many embodiments, such as adaptations, variations, modifications, and equivalent arrangements, will be implicitly disclosed by the embodiments described herein and fall within the scope of the present invention.


Accordingly, while the present invention is described herein in detail in relation to one or more embodiments, it is to be understood that this disclosure is illustrative and exemplary of the present invention, and is made merely for the purposes of providing a full and enabling disclosure of the present invention. The detailed disclosure herein of one or more embodiments is not intended, nor is to be construed, to limit the scope of patent protection afforded the present invention, which scope is to be defined by the claims and the equivalents thereof. It is not intended that the scope of patent protection afforded the present invention be defined by reading into any claim a limitation found herein that does not explicitly appear in the claim itself.


Thus, for example, any sequence(s) and/or temporal order of steps of various processes or methods that are described herein are illustrative and not restrictive. Accordingly, it should be understood that, although steps of various processes or methods may be shown and described as being in a sequence or temporal order, the steps of any such processes or methods are not limited to being carried out in any particular sequence or order, absent an indication otherwise. Indeed, the steps in such processes or methods generally may be carried out in various different sequences and orders while still falling within the scope of the present invention. Accordingly, it is intended that the scope of patent protection afforded the present invention is to be defined by the appended claims rather than the description set forth herein.


Additionally, it is important to note that each term used herein refers to that which the Ordinary Artisan would understand such term to mean based on the contextual use of such term herein. To the extent that the meaning of a term used herein—as understood by the Ordinary Artisan based on the contextual use of such term—differs in any way from any particular dictionary definition of such term, it is intended that the meaning of the term as understood by the Ordinary Artisan should prevail.


Regarding applicability of 35 U.S.C. §112, custom character6, no claim element is intended to be read in accordance with this statutory provision unless the explicit phrase “means for” or “step for” is actually used in such claim element, whereupon this statutory provision is intended to apply in the interpretation of such claim element.


Furthermore, it is important to note that, as used herein, “a” and “an” each generally denotes “at least one,” but does not exclude a plurality unless the contextual use dictates otherwise. Thus, reference to “a picnic basket having an apple” describes “a picnic basket having at least one apple” as well as “a picnic basket having apples.” In contrast, reference to “a picnic basket having a single apple” describes “a picnic basket having only one apple.”


When used herein to join a list of items, “or” denotes “at least one of the items,” but does not exclude a plurality of items of the list. Thus, reference to “a picnic basket having cheese or crackers” describes “a picnic basket having cheese without crackers”, “a picnic basket having crackers without cheese”, and “a picnic basket having both cheese and crackers.” Finally, when used herein to join a list of items, “and” denotes “all of the items of the list.” Thus, reference to “a picnic basket having cheese and crackers” describes “a picnic basket having cheese, wherein the picnic basket further has crackers,” as well as describes “a picnic basket having crackers, wherein the picnic basket further has cheese.”


Referring now to the drawings, one or more preferred embodiments of the present invention are next described. The following description of one or more preferred embodiments is merely exemplary in nature and is in no way intended to limit the invention, its implementations, or uses.



FIG. 1 illustrates a high level overview of wireless nodes including both a reduced complexity radio (RCR), and a high power complex transceiver. Preferably, each node is configured to receive a wake-up message via the RCR, that can then power up the high power complex transceiver for data transfer.


In preferred implementations, a duty-cycled receiver comprises a receiver which may be in either an idle or ready state, and will alternate periods of idleness and activity. To send a message to the receiver without any knowledge of when the receiver will be ready, other than the period, a sender must prefix multiple copies of a wake-up message for a duration equal to or greater than the period of the receiver's duty cycle. Preferably, these wake-up messages are numbered in descending order, such that when the number of the wake-up message reaches zero, the data intended for the receiver will be transmitted.


Upon reception of a message, the receiver immediately replies to acknowledge reception of the data. In a preferred implementation utilizing receiver state estimation, the receiver also indicates the number of the first wake-up message received. The transmitter then calculates, to some accuracy, the time at which the receiver is in a ready state. Given that the ready state of the receiver occurs on a known periodic basis, any future time at which the receiver will be ready can be calculated, within the limits of the available time-base.


If the time at which the receiver becomes ready can be estimated to within a time less than the period of the receiver duty-cycle, fewer wake-up transmissions must be prefixed to future data transmissions. This can save power by using fewer transmissions, and can additionally reduce congestion.


Such preferred methodologies reduce the power cost to the sender and bandwidth cost to the system when compared to a straightforward wake-up radio system. This method can be utilized separate from, or in combination with, aspects and features of wake-up transceiver (WU) technology patented by TeraHop Networks, Inc. (see U.S. Pat. No. 7,209,771, incorporated above by reference, and the patents related thereto), or other known wake-up technology and methodologies. This method also overcomes the need for maintenance in a strictly synchronized network.


Turning to another example, consider an implementation involving remote sensor nodes (RSNs). Each RSN includes a wake-up receiver, and transmissions to RSNs are preambled with wake-up attention (WU_ATTIN) frames. In a preferred implementation, a receiving RSN indicates to a transmitting RSN a received WU_ATTIN frame, thus allowing a relative time offset of the receiving RSN's receiving window to be known. Subsequent transmissions to the receiving RSN can utilize fewer WU_ATTN frames, within the limits of the RSN's timebase tolerances.


For example, WU_ATTN packers might be spaced 274.7 μs apart, and might be transmitted for 105 ms. Thus, the number of WU_ATTN packets sent would be 105 ms/274.7 μs, or 382. If, however, the receiving RSN indicates that it received WU_ATTN packet number 75, then the transmitting RSN can utilize this knowledge to calculate when the receiving RSN received the packet relative to the transmitting RSN's clock. This offset time can be stored and subsequently used to reduce the number of WU_ATTN packets utilized to wake up that RSN. In subsequent transactions, ⅕, or less, WU_ATTN frames can be utilized. Notably, a frame number of a received WU_ATTN frame is preferably still sent back by the receiving RSN, thus allowing for further refinement of a time offset.


Appendix C, which is hereby incorporated herein by reference, comprises additional disclosure of one or more implementations utilizing RSNs.


Alternatively, or additionally, an embodiment in accordance with the present invention could be implemented utilizing a Chipcon CC2500 Transceiver, sold by Texas Instruments (see Appendix A, which is hereby incorporated herein by reference), by utilizing a timer feature of the CC2500. Further detail can be found in Note AN047 of Appendix B, which is hereby incorporated herein by reference.


Based on the foregoing description, it will be readily understood by those persons skilled in the art that the present invention is susceptible of broad utility and application. Many embodiments and adaptations of the present invention other than those specifically described herein, as well as many variations, modifications, and equivalent arrangements, will be apparent from or reasonably suggested by the present invention and the foregoing descriptions thereof, without departing from the substance or scope of the present invention. Accordingly, while the present invention has been described herein in detail in relation to one or more preferred embodiments, it is to be understood that this disclosure is only illustrative and exemplary of the present invention and is made merely for the purpose of providing a full and enabling disclosure of the invention. The foregoing disclosure is not intended to be construed to limit the present invention or otherwise exclude any such other embodiments, adaptations, variations, modifications or equivalent arrangements, the present invention being limited only by the claims appended hereto and the equivalents thereof.

Claims
  • 1. A method comprising: sending, from a first communications device to a second communications device, a first series of wake-up frames;receiving, from the second communications device, an identification of a received wake-up frame of the first series of wake-up frames;subsequent to sending a last wake-up frame in the first series of wake-up frames, sending a first message from the first communication device to the second communications device;sending a second series of wake-up frames, fewer in number than the first series of wake-up frames, to the second communications device, wherein the difference between the first series and the second series of wake-up frames is based upon the position of the received wake-up frame in the first series of wake-up frames; andsubsequent to sending a last wake-up frame in the second series of wake-up frames, sending a second message from the first communications device to the second communications device.
  • 2. The method of claim 1, wherein the first series of wake-up frames are numbered in descending order, and the identification of the received wake-up frame comprises the number of the received wake-up frame.
  • 3. The method of claim 1, wherein the first communications device comprises a remote sensor node.
  • 4. The method of claim 1, further comprising: based upon the identification of the received wake-up frame, calculating an offset time relative to a clock of the first communications device.
  • 5. The method of claim 1, wherein each wake-up frame of the first series of wake-up frames comprises a wake-up message.
  • 6. The method of claim 1, further comprising: calculating a time at which to begin sending the second series of wake-up frames, based upon a known duty cycle of the second communications device and a time at which the identification of the received wake-up frame is received by the first communications device.
  • 7. A communications device comprising: a receiver,a transmitter; anda processor,wherein the communications device is configured to: send, from a first communications device to a second communications device, a first series of wake-up frames;receive, from the second communications device, an identification of a received wake-up frame of the first series of wake-up frames;subsequent to sending a last wake-up frame in the first series of wake-up frames, send a first message from the first communication device to the second communications device;send a second series of wake-up frames, fewer in number than the first series of wake-up frames, to the second communications device, wherein the difference between the first series and the second series of wake-up frames is based upon the position of the received wake-up frame in the first series of wake-up frames; andsubsequent to sending a last wake-up frame in the second series of wake-up frames, send a second message from the first communications device to the second communications device.
  • 8. The device of claim 7, wherein the first series of wake-up frames are numbered in descending order, and the identification of the received wake-up frame comprises the number of the received wake-up frame.
  • 9. The device of claim 7, further comprising a sensor.
  • 10. The device of claim 7, further configured to: based upon the identification of the received wake-up frame, calculate an offset time relative to a clock of the first communications device.
  • 11. The device of claim 7, wherein each wake-up frame of the first series of wake-up frames comprises a wake-up message.
  • 12. The device of claim 7, further configured to: calculate a time at which to begin sending the second series of wake-up frames, based upon a known duty cycle of the second communications device and a time at which the identification of the received wake-up frame is received by the first communications device.
  • 13. The device of claim 7, wherein the receiver and the transmitter are part of a transceiver.
  • 14. The device of claim 7, wherein the device comprises a remote sensor node.
  • 15. A system comprising: a first communications device configured to communicate, to a second communications device, a first series of wake-up frames;a second communications device configured to, based upon receipt of at least one of the first series of wake-up frames, communicate an identification of a receive wake-up frame of the first series of wake-up frames;wherein the first communications device is further configured to: receive, from the second communications device, an identification of a received wake-up frame of the first series of wake-up frames;subsequent to sending a last wake-up frame in the first series of wake-up frames, send a first message from the first communication device to the second communications device;send a second series of wake-up frames, fewer in number than the first series of wake-up frames, to the second communications device, wherein the difference between the first series and the second series of wake-up frames is based upon the position of the received wake-up frame in the first series of wake-up frames; andsubsequent to sending a last wake-up frame in the second series of wake-up frames, send a second message from the first communications device to the second communications device.
  • 16. The system of claim 15, wherein at least one of the first communications device and the second communications device comprises a remote sensor node.
  • 17. The system of claim 15, wherein the first communications device is further configured to: calculate, based upon the identification of the received wake-up frame, an offset time relative to a clock of the first communications device.
  • 18. The system of claim 15, wherein each wake-up frame of the first series of wake-up frames comprises a wake-up message.
  • 19. The system of claim 15, the first communications device further configured to: calculate a time at which to begin sending the second series of wake-up frames, based upon a known duty cycle of the second communications device and a time at which the identification of the received wake-up frame is received by the first communications device.
CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No. 13/620,171, filed Sep. 14, 2012, now U.S. Pat. No. 9,072,049, which is a continuation of U.S. patent application Ser. No. 12/647,672, filed Dec. 28, 2009, now U.S. Pat. No. 8,391,435, which is incorporated by reference herein, and which claims the benefit of U.S. Provisional Patent Application No. 61/140,884, filed Dec. 25, 2008, which is hereby incorporated herein by reference.

US Referenced Citations (423)
Number Name Date Kind
3805265 Lester Apr 1974 A
4165024 Oswalt et al. Aug 1979 A
4613990 Halpem Sep 1986 A
4680583 Grover Jul 1987 A
4688244 Hannon et al. Aug 1987 A
4750197 Denekamp et al. Jun 1988 A
4802240 Yamaguchi et al. Jan 1989 A
4817537 Cripe et al. Apr 1989 A
4964121 Moore Oct 1990 A
5040238 Comroe et al. Aug 1991 A
5054052 Nonami Oct 1991 A
5117501 Childress et al. May 1992 A
5129096 Burns Jul 1992 A
5210540 Masumoto May 1993 A
5265025 Hirata Nov 1993 A
5295154 Meier et al. Mar 1994 A
5331637 Francis et al. Jul 1994 A
5355518 Kindinger et al. Oct 1994 A
5369784 Nelson Nov 1994 A
5424720 Kirkpatrick Jun 1995 A
5425051 Mahany Jun 1995 A
5442758 Slingwine et al. Aug 1995 A
5511232 O'Dea et al. Apr 1996 A
5540092 Handfield et al. Jul 1996 A
5565858 Guthrie Oct 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
5640151 Reis et al. Jun 1997 A
5652751 Sharony Jul 1997 A
5682379 Mahany et al. Oct 1997 A
5686902 Reis et al. Nov 1997 A
5732007 Grushin et al. Mar 1998 A
5732077 Whitehead Mar 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
5862803 Besson Jan 1999 A
5890054 Logsdon et al. Mar 1999 A
5892441 Woolley et al. Apr 1999 A
5907491 Canada et al. May 1999 A
5913180 Ryan Jun 1999 A
5917423 Duvall Jun 1999 A
5917433 Keillor et al. Jun 1999 A
5939982 Gagnon et al. Aug 1999 A
5943610 Endo Aug 1999 A
5950124 Trompower et al. Sep 1999 A
5959568 Woolley Sep 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
6046675 Hanna Apr 2000 A
6072784 Agrawal et al. Jun 2000 A
6078785 Bush Jun 2000 A
6078789 Bodenmann et al. Jun 2000 A
6091724 Chandra et al. Jul 2000 A
6097707 Hodzic et al. Aug 2000 A
6104512 Batey et al. Aug 2000 A
6108544 Dorenbosch et al. Aug 2000 A
6118988 Choi Sep 2000 A
6125306 Shimada et al. Sep 2000 A
6127928 Issacman Oct 2000 A
6127976 Boyd et al. Oct 2000 A
6134587 Okanoue Oct 2000 A
6134589 Hultgren Oct 2000 A
6154658 Caci Nov 2000 A
6192400 Hanson et al. Feb 2001 B1
6198913 Sung et al. Mar 2001 B1
6201974 Lietsalmi et al. Mar 2001 B1
6225894 Kyrtsos May 2001 B1
6239690 Burbidge May 2001 B1
6246882 Lachance Jun 2001 B1
6256303 Drakoulis et al. Jul 2001 B1
6313745 Suzuki Nov 2001 B1
6354493 Mon Mar 2002 B1
6360169 Dudaney Mar 2002 B1
6381467 Hill et al. Apr 2002 B1
6404082 Rasinski et al. Jun 2002 B1
6405102 Swartz et al. Jun 2002 B1
6409082 Davis et al. Jun 2002 B1
6418299 Ramanathan Jul 2002 B1
6424260 Maloney Jul 2002 B2
6424264 Giraldin et al. Jul 2002 B1
6427913 Maloney Aug 2002 B1
6437692 Petite et al. Aug 2002 B1
6473607 Shohara et al. Oct 2002 B1
6476708 Johnson Nov 2002 B1
6480149 Twitchell Nov 2002 B1
6481222 Denniston Nov 2002 B1
6512478 Chien Jan 2003 B1
6529142 Yeh et al. Mar 2003 B2
6542114 Eagleson et al. Apr 2003 B1
6547137 Begelfer et al. Apr 2003 B1
6559620 Zhou et al. May 2003 B2
6587755 Smith et al. Jul 2003 B1
6600418 Sainati et al. Jul 2003 B2
6611556 Koerner et al. Aug 2003 B1
6614349 Proctor et al. Sep 2003 B1
6617962 Horwitz et al. Sep 2003 B1
6628835 Brill et al. Sep 2003 B1
6665585 Kawase Dec 2003 B2
6693907 Wesley et al. Feb 2004 B1
6700533 Werb et al. Mar 2004 B1
6717507 Bayley et al. Apr 2004 B1
6720888 Eagleson et al. Apr 2004 B2
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
6753775 Auerbach et al. Jun 2004 B2
6760578 Rotzoll Jul 2004 B2
6761312 Piatek et al. Jul 2004 B2
6765484 Eagleson et al. Jul 2004 B2
6799210 Gentry et al. Sep 2004 B1
6816063 Kubler et al. Nov 2004 B2
6847892 Zhou Jan 2005 B2
6870476 Cockburn et al. Mar 2005 B2
6874037 Abram et al. Mar 2005 B1
6882274 Richardson et al. Apr 2005 B2
6900731 Kreiner May 2005 B2
6919803 Breed Jul 2005 B2
6927688 Tice Aug 2005 B2
6934540 Twitchell et al. Aug 2005 B2
6940392 Chan et al. Sep 2005 B2
6972682 Lareau et al. Dec 2005 B2
6975614 Kennedy Dec 2005 B2
6988079 Or-Bach et al. Jan 2006 B1
7012529 Sajkowsky Mar 2006 B2
7022773 Albano et al. Apr 2006 B2
7027773 McMillin Apr 2006 B1
7034683 Ghazarian Apr 2006 B2
7038585 Hall et al. May 2006 B2
7072668 Chou Jul 2006 B2
7088229 Johnson Aug 2006 B2
7098784 Easley et al. Aug 2006 B2
7103344 Menard Sep 2006 B2
7126470 Clift et al. Oct 2006 B2
7133704 Twitchell et al. Nov 2006 B2
7142121 Chan et al. Nov 2006 B2
7148800 Cunningham Dec 2006 B2
7148803 Bandy Dec 2006 B2
7155238 Katz Dec 2006 B2
7155264 Twitchell 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 Apr 2007 B2
7209771 Twitchell Apr 2007 B2
7212122 Gloekler May 2007 B2
7221668 Twitchell et al. May 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
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
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
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
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
7438334 Terry et al. Oct 2008 B2
7440781 Beach et al. Oct 2008 B2
7482920 Joao Jan 2009 B2
7489244 August et al. Feb 2009 B2
7522568 Twitchell et al. Apr 2009 B2
7526381 Twitchell et al. Apr 2009 B2
7528719 Hopman et al. May 2009 B2
7529547 Twitchell et al. 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
7563991 Clark et al. Jul 2009 B2
7574168 Twitchell et al. Aug 2009 B2
7574300 Twitchell et al. Aug 2009 B2
7583769 Smith et al. Sep 2009 B2
7595727 Grijalva et al. Sep 2009 B2
7600137 Trappeniers et al. Oct 2009 B2
7782200 Fleischmann Aug 2010 B1
7907941 Twitchell Mar 2011 B2
7924735 Sun et al. Apr 2011 B2
7940716 Twitchell May 2011 B2
7986238 Cho Jul 2011 B2
8000315 Doi et al. Aug 2011 B2
8111651 Twitchell Feb 2012 B2
8125978 Lim et al. Feb 2012 B2
8165072 Mooney Apr 2012 B2
8175109 Nogueira-Nine May 2012 B2
8188764 Weiss May 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 Sep 2013 B2
8605660 Twitchell Dec 2013 B2
8619652 Singh Dec 2013 B2
8954082 Twitchell Feb 2015 B2
9072049 Farley et al. Jun 2015 B2
9295099 Twitchell et al. Mar 2016 B2
9386553 Berger et al. Jul 2016 B2
20010000019 Bowers et al. Mar 2001 A1
20010050550 Yoshida et al. Dec 2001 A1
20020030596 Finn et al. 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
20020089434 Ghazarian Jul 2002 A1
20020098861 Doney et al. Jul 2002 A1
20020099567 Joao Jul 2002 A1
20020119770 Twitchell Aug 2002 A1
20020130778 Nicholson Sep 2002 A1
20020146985 Naden Oct 2002 A1
20030008692 Phelan Jan 2003 A1
20030011474 Ng Jan 2003 A1
20030083064 Cooper May 2003 A1
20030117966 Chen Jun 2003 A1
20030140135 Okuyama et al. Jul 2003 A1
20030141973 Yeh et al. Jul 2003 A1
20030144020 Challa et al. Jul 2003 A1
20030179073 Ghazarian Sep 2003 A1
20030182077 Emord Sep 2003 A1
20030189491 Ng Oct 2003 A1
20030202477 Zhen et al. Oct 2003 A1
20030209601 Chung Nov 2003 A1
20030236077 Sivard Dec 2003 A1
20040021572 Schoen et al. Feb 2004 A1
20040025018 Haas et al. Feb 2004 A1
20040041706 Stratmoen et al. Mar 2004 A1
20040041731 Hisano Mar 2004 A1
20040082296 Twitchell Apr 2004 A1
20040100379 Boman et al. May 2004 A1
20040100394 Hitt May 2004 A1
20040100415 Veitch et al. May 2004 A1
20040113772 Chou Jun 2004 A1
20040119588 Marks Jun 2004 A1
20040121793 Weigele et al. Jun 2004 A1
20040135691 Duron et al. Jul 2004 A1
20040142716 Orlik et al. Jul 2004 A1
20040143750 Kulack et al. Jul 2004 A1
20040147267 Hill et al. Jul 2004 A1
20040174259 Peel Sep 2004 A1
20040183673 Nageli Sep 2004 A1
20040198467 Orlik et al. Oct 2004 A1
20040215532 Boman et al. Oct 2004 A1
20040232924 Hilleary et al. Nov 2004 A1
20040233041 Bohman et al. Nov 2004 A1
20040233054 Neff et al. Nov 2004 A1
20040246463 Milinusic Dec 2004 A1
20040246903 Huang et al. Dec 2004 A1
20050043068 Shohara et al. Feb 2005 A1
20050071358 Hind et al. Mar 2005 A1
20050073406 Easley et al. Apr 2005 A1
20050078672 Caliskan et al. Apr 2005 A1
20050087235 Skorpik Apr 2005 A1
20050088299 Bandy et al. 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
20050111428 Orlik et al. May 2005 A1
20050128080 Hall et al. Jun 2005 A1
20050129034 Takeyoshi 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
20050190759 Lee et al. Sep 2005 A1
20050199716 Shafer et al. Sep 2005 A1
20050215280 Twitchell Sep 2005 A1
20050226201 McMillin Oct 2005 A1
20050261037 Raghunath et al. Nov 2005 A1
20050270160 Chan et al. Dec 2005 A1
20060007863 Naghian Jan 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 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
20060187026 Kochis Aug 2006 A1
20060202817 Mackenzie et al. Sep 2006 A1
20060239197 Lieuallen et al. Oct 2006 A1
20060255934 Easley et al. Nov 2006 A1
20060268727 Rangarajan et al. Nov 2006 A1
20060270382 Lappetelainen et al. Nov 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
20070002792 Twitchell et al. Jan 2007 A1
20070002793 Twitchell et al. Jan 2007 A1
20070004331 Twitchell et al. Jan 2007 A1
20070008408 Zehavi Jan 2007 A1
20070032951 Tanenhaus et al. Feb 2007 A1
20070041333 Twitchell et al. Feb 2007 A1
20070041345 Yarvis et al. Feb 2007 A1
20070043807 Twitchell et al. Feb 2007 A1
20070044524 Coutermarsh et al. Mar 2007 A1
20070069885 Twitchell et al. Mar 2007 A1
20070099628 Twitchell et al. May 2007 A1
20070099629 Twitchell et al. May 2007 A1
20070113882 Meyers 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
20070118332 Meyers May 2007 A1
20070121557 Sylvain May 2007 A1
20070133980 Meyers Jun 2007 A1
20070135179 Hardman et al. 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
20070274232 Axelsson et al. Nov 2007 A1
20070291690 Twitchell et al. Dec 2007 A1
20070291724 Twitchell et al. Dec 2007 A1
20080027586 Hern Jan 2008 A1
20080066658 Muirhead Mar 2008 A1
20080094209 Braun Apr 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 et al. 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
20080234878 Joao Sep 2008 A1
20080264888 Zakula et al. Oct 2008 A1
20080291844 Krause Nov 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
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
20090146805 Joao Jun 2009 A1
20090161642 Twitchell et al. Jun 2009 A1
20090181623 Twitchell et al. Jul 2009 A1
20090290512 Twitchell Nov 2009 A1
20090295564 Twitchell Dec 2009 A1
20090322510 Berger Dec 2009 A1
20100013635 Berger et al. Jan 2010 A1
20100067420 Twitchell Mar 2010 A1
20100097969 De Kimpe Apr 2010 A1
20100141449 Twitchell Jun 2010 A1
20100145865 Berger et al. Jun 2010 A1
20100150122 Berger et al. Jun 2010 A1
20100166113 Farley et al. Jul 2010 A1
20100214060 Twitchell Aug 2010 A1
20100214074 Twitchell Aug 2010 A1
20100214969 Lamm Aug 2010 A1
20110138044 Bailey Jun 2011 A1
20110176465 Panta Jul 2011 A1
20110289320 Twitchell, Jr. Nov 2011 A1
20120077434 Royston Mar 2012 A1
20120163422 Lee Jun 2012 A1
20120190390 Reunamaki 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
20140308963 Twitchell et al. Oct 2014 A1
20150103747 Twitchell Apr 2015 A1
20160219523 Twitchell et al. Jul 2016 A1
20160300183 Berger et al. Oct 2016 A1
Foreign Referenced Citations (22)
Number Date Country
0467036 Jan 1992 EP
0601820 Jun 1994 EP
0748083 Dec 1996 EP
0748085 Dec 1996 EP
0829995 Mar 1998 EP
0944014 Sep 1999 EP
1692668 Aug 2006 EP
1317733 Apr 2010 EP
1692599 Jul 2013 EP
2308947 Jul 1997 GB
20040012311 Feb 2004 KR
100509070 Aug 2005 KR
20050102419 Oct 2005 KR
100587735 Jun 2006 KR
20070005515 Jan 2007 KR
20080001235 Jan 2008 KR
WO-0068907 Nov 2000 WO
WO-0069186 Nov 2000 WO
WO-03098175 Nov 2003 WO
WO-2006056174 Jun 2006 WO
WO-2009140669 Nov 2009 WO
WO-2009151877 Dec 2009 WO
Non-Patent Literature Citations (62)
Entry
Application Note published by Texas Instruments for CC1100/CC2500 Products, accessed on or around Dec. 19, 2008.
Website Page detailing features of Texas Instruments' Chipcon Products, accessed Dec. 19, 2008.
Advisory Action, U.S. Appl. No. 12/353,197, Jul. 16, 2012, 5 pages.
Advisory Action, U.S. Appl. No. 13/555,897, Nov. 6, 2014, 3 pages.
Final Office Action, U.S. Appl. No. 12/353,197, Mar. 23, 2012, 15 pages.
Final Office Action, U.S. Appl. No. 13/367,341, Feb. 26, 2013, 17 pages.
Final Office Action, U.S. Appl. No. 13/555,897, Aug. 29, 2014, 14 pages.
International Preliminary Report on Patentability, Application No. PCT/US2006/026158, Jan. 17, 2008, 9 pages.
International Search Report and Written Opinion, Application No. PCT/US2009/044277, Jan. 27, 2010, 13 pages.
International Search Report and Written Opinion, Application No. PCT/US2009/044276, Jan. 11, 2010, 7 pages.
Non-Final Office Action, U.S. Appl. No. 11/428,536, Dec. 24, 2009, 10 pages.
Non-Final Office Action, U.S. Appl. No. 12/271,850, May 11, 2011, 13 pages.
Non-Final Office Action, U.S. Appl. No. 12/353,197, Oct. 6, 2011, 11 pages.
Non-Final Office Action, U.S. Appl. No. 12/468,047, Dec. 13, 2011, 8 pages.
Non-Final Office Action, U.S. Appl. No. 12/647,672, Aug. 14, 202, 10 pages.
Non-Final Office Action, U.S. Appl. No. 13/367,341, Jul. 24, 2012, 20 pages.
Non-Final Office Action, U.S. Appl. No. 13/555,897, Dec. 17, 2013, 11 pages.
Non-Final Office Action, U.S. Appl. No. 15/573,625, May 5, 2016, 38 pages.
Non-Final Office Action, U.S. Appl. No. 15/052,172, Jul. 19, 2016, 13 pages.
Notice of Allowance, U.S. Appl. No. 11/428,536, Feb. 8, 2011, 6 pages.
Notice of Allowance, U.S. Appl. No. 11/428,536, Jul. 23, 2010, 9 pages.
Notice of Allowance, U.S. Appl. No. 12/271,850, Oct. 6, 2011, 8 pages.
Notice of Allowance, U.S. Appl. No. 12/468,047, May 31, 2012, 9 pages.
Notice of Allowance, U.S. Appl. No. 12/647,672, Nov. 1, 2012, 12 pages.
Notice of Allowance, U.S. Appl. No. 13/367,341, Aug. 5, 2013, 9 pages.
Notice of Allowance, U.S. Appl. No. 13/555,897, Jun. 8, 2015, 5 pages.
Notice of Allowance, U.S. Appl. No. 13/555,897, Dec. 17, 2015, 5 pages.
Notice of Allowance, U.S. Appl. No. 13/619,681, Mar. 3, 2015, 8 pages.
Notice of Allowance, U.S. Appl. No. 13/620,171, Feb. 18, 2014, 7 pages.
Notice of Allowance, U.S. Appl. No. 14/100,357, Sep. 15, 2014, 10 pages.
Restriction Requirement, U.S. Appl. No. 12/468,047, Oct. 5, 2011, 5 pages.
“TeraHop Networks Dec. 2007”, 1 page.
“TeraHop Networks Feb. 2008”, 1 page.
Written Opinion, Application No. PCT/US2006/00868, Apr. 2, 2007, 3 pages.
Written Opinion, Application No. PCT/US2006/026158, Nov. 21, 2006, 7 pages.
Easley, “Global Container Security System”, U.S. Provisional Application No. 60/499,338, filed Sep. 3, 2003, 27 pages.
Garcia-Luna-Aceves, “Source-Tree Routing in Wireless Networks”, Proceedings of Seventh International Conference on Network Protocols, Oct. 1999, 10 pages.
Gu, “C-ICAMA, A Centralized Intelligent Channel Assigned Multiple Access for Multi-Layer Ad-Hoc Wireless Networks with UAVs”, Conference: Wireless Communications and Networking Confernce, 2000, Feb. 2000, pp. 879-884.
Gu, “Hierarchical Routing for Multi-Layer Ad-Hoc Wireless Networks with UAVs”, 21st Century Military Communications Conference Proceedings, Oct. 2000, 5 pages.
Haartsen, “Bluetooth—The Universal Radio Interface for Ad Hoc, Wireless Connectivity”, Ericsson Review No. 3, Jan. 1998, 8 pages.
Haartsen, “Bluetooth: Vision, Goals, and Architecture”, Mobile Computing & Communications Review, vol. 1, No. 2, Oct. 1998, 8 pages.
Hubaux, “Toward Self-Organized Mobile Ad Hoc Networks: The Terminodes Project”, IEEE Communications Magazine (vol. 39, Issue: 1, Jan. 2001), Jan. 2001, 7 pages.
Iwata, “Scalable Routing Strategies for Ad hoc Wireless Networks”, IEEE Journal on Selected Areas in Communications, Aug. 1999, 26 pages.
Keshavarzian, “Energy-Efficient Link Assessment in Wireless Sensor Networks”, Conference on the IEEE computer and Communications Societies, vol. 3, Nov. 2004, 14 pages.
Lee, “On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks”, Retrieved at: https://tools.ietf.org/html/draft-ietf-manet-odmrp-02, Jan. 2000, 29 pages.
Melodia, “On the Interdependence of Distributed Topology Control and Geographical Routing in Ad Hoc and Sensors Networks”, IEEE Journal on Selected Areas in Communications, vol. 23, No. 3, Mar. 2008, pp. 520-532.
Minglaing, “Cluster Based Routing Protocol (CBRP)”, Internet-Draft, National University of Singapore, Sep. 1999, 27 pages.
Morgan, “Miniature Tags Provide Visibility & Cohesion for an LIA Battalion Level ‘Proof of Principle’”, Pacific NW National Laboratory, Apr. 2001, 11 pages.
Nageli, “Portable Detachable Self-Contained Tracking Unit for Two-Way Satellite Communication with a Central Server”, U.S. Appl. No. 60/444,029, filed Jan. 31, 2003, 38 pages.
Pei, “A Wireless Hierarchical Routing Protocol with Group Mobility”, Wireless Communications and Networking Conference, Jan. 21, 1999, 18 pages.
Pei, “Mobility Management in Hierarchical Multi-Hop Mobile Wireless Networks”, Eight International Conference on Computer Communications and Networks Proceedings., Oct. 1999, 6 pages.
Perkins, “Ad Hoc Networks”, Table of Contents, Chapters 1, 4, and 11, Jan. 2001, 112 pages.
Perkins, “Mobile Ad Hoc Networking Terminology”, draft-ieft-manet-term-01.txt—Internet Draft, Nov. 17, 1998, 10 pages.
Ramanathan, “Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support”, Mobile Networks and Application, Jun. 1998, 36 pages.
Sharp, “Physical Reality: A Second Look, Supply Chain Systems”, http://www.idsystems.com/reader/1999—03/phys0399—pt2/index.htm, Mar. 1999, 5 pages.
Sommer, “Group 4, Passive RF Tags”, 4 pages.
Stojmenovic, “Design Guidelines for Routing Protocols in Ad Hoc and Sensor Networks with a Realistic Physical Layer”, IEEE Communications Magazine (vol. 43, Issue: 3, Mar. 2005), Mar. 2005, 6 pages.
Valdevit, “Cascading in Fibre Channel: how to build a multi-switch fabric”, Broade Communications Systems, available at http://www.brocade.com/SAN/white—papers/pdf/Cascading.pdf, 1999, 13 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 Bried Description”, 121 pages.
“TeraHop Networks—Tradeshow Handouts”, MERIT-2030-2040 Gateway Controllers; MERIT-300 Incident Node; MERIT-TL TeraLink System Software, 2006, 6 pages.
“Response to the Department of Homeland Security and Border Protection Converyance Security Device Requirements, Version 1.2”, TeraHop Networks, Inc. Dec. 10, 2007, 62 pages.
Related Publications (1)
Number Date Country
20160044597 A1 Feb 2016 US
Provisional Applications (1)
Number Date Country
61140884 Dec 2008 US
Continuations (2)
Number Date Country
Parent 13620171 Sep 2012 US
Child 14754115 US
Parent 12647672 Dec 2009 US
Child 13620171 US