This invention relates to adaptive networks and more particularly to sensing modules including proximity sensors and transceivers for communicating among adjacent modules in a self-adaptive network array that communicates intrusion information to local or central computers.
Certain installations require secure boundaries to preserve integrity or security of the installation against unauthorized intrusions. A store house of strategic materials or a temporary security area around a crime scene, or the like, is commonly marked by fencing or rope or tape borders, or the like, to inhibit further intrusion by unauthorized personnel. However, such factors are not deterrents to individuals who are determined to enter the security area.
Alternatively, more permanent installations commonly include closed-circuit video surveillance of a secured area, with concomitant monitors for security personnel in attendance to observe video images for any changed circumstances. Appropriate alarms and corrective measures may be initiated upon observation of a video image of changed circumstances that prompt human analysis and manual responses. These tactics are commonly expensive for video camera and monitor installations and for continuing labor expenses associated with continuous shifts of attendant personnel.
In accordance with one embodiment of the present invention, a plurality of individual transceiver modules may be deployed around the perimeter of an installation to be secured in order to sense and transmit information about activity within a vicinity of a transceiver module. Each module is capable of communicating its own sensory data to one or more adjacent modules, and can relay data signals received from one or more adjacent modules to other adjacent modules in the formation of a distributed self-adaptive network that may communicate with a central computer. Such interactions of adjacent modules obviate need for an electromagnetic survey of an area to be secured, and promotes convenient re-structuring of perimeter sensors as desired without complications of re-assembling hard-wired sensors and monitors. In addition, interactions of adjacent modules establish verification of an intrusion event that is distinguishable from false detection events.
Referring now to
Each sensor monitor 9, 11 includes a proximity sensor 13 that may be, for example, a passive infrared sensor that responds to the presence or proximity of a warm object such as an individual, vehicle, or the like. Alternatively, the proximity sensor 13 may be an active infrared or radio or ultrasonic sensor that emits a signal and senses any echo attributable to presence of a reflective object within a sensing field of view. Of course, other sensors such as vibration detectors or light detectors may be used to respond to the presence of an intruding object.
In addition, each proximity sensor 9 includes a transceiver 15 that responds to radio transmissions from other similar modules, and also transmits radio signals to other modules for reception and relay or re-transmission thereby of such received signals. In this way, an array of modules 9, 11 form an interactive, distributed network that operates self-adaptively on operative modules 9. Thus, if one module 9, 11 is added, removed or is rendered inoperative, then adjacent operative modules 9, 11 are capable of interacting to reconfigure a different distributed array.
Each sensor module 9, 11 also includes a processor 17 that controls operation of the transceiver 15 and proximity sensor 13 to produce data signals for transmission via the transceiver 15 to one or more adjacent modules 9, 11. In addition, the processor 17 may control random recurrences of monitoring events to amass information about any changes in circumstances associated with proximate objects, for conversion to data signals to be transmitted via transceiver 15. Each processor 17 may include alarm utilization circuitry for initiating alarms, commencing video surveillance, or the like, upon sensing a change in proximity circumstances. Alternatively, the distributed network of modules 9, 11 may also communicate with a central computer 19 via a transceiver 21 acting as a gateway between the computer 19 and the distributed array of modules 9, 11 for communicating signals between the computer 19 and the network of interactive modules 9, 11. Computer 19 may operate on a database 23 of address or identification codes for each module 9, 11 in order to communicate through the network of modules 9, 11, that each have different addresses or identification codes, to a particular module having a selected address. In this way, each module 9, 11 may transmit and receive data signals specifically designating the module by its unique identification code or address. And, each module 9, 11 is powered by self-contained batteries 25 and/or photovoltaic cells 27.
The modules 9, 11 may be disposed within conventional traffic-marking cones for convenient mobile placement or may be mounted on fence posts, or may be mounted on spikes driven into the ground within and about an area to be secured, or may be otherwise suitably mounted in, on and about areas or passageways that are to be secured against unauthorized intrusions.
The plurality of modules 9, 11 may interact to distinguish between a false intrusion detection event and a true event for which alarm and other responses should be initiated. Certain proximity sensors such as passive infrared sensors or ultrasonic sensors may respond to a breeze of different temperature, or to objects blowing by in a strong wind and thereby create a false intrusion detection.
In accordance with an embodiment of the present invention, such false intrusion detections are recognized to be predominantly random events attributable to stimulation of one sensor and likely not an adjacent sensor. Thus, correlation of sensor events among multiple adjacent sensors permits discrimination against false intrusion detections. Additional information is extracted throughout the network of multiple sensors, for example, responsive to an entry location and to movement along a path of travel. The additional information including, for example, time and duration and location of one or more sensor stimulations may be transmitted back to the central computer 19 through the network of module's 9, 11 for computerized correlation analysis of the additional information to verify a true intrusion event. Alternatively, modules 9, 11 disposed within or about a small area may communicate the additional information between modules to correlate the sensor stimulations and locally perform computerized correlation analysis within one or more of the processors 17 to verify a true intrusion event.
Additionally, the sensor information derived from a plurality of adjacent or neighboring modules 9, 11 may be analyzed by the central computer 19, or by local processors 17, to triangulate the location and path of movement of an intruder for producing location coordinates to which an installed video surveillance camera may be aligned. Thus, one or more stand-alone, battery-operated video surveillance cameras 12 with different addresses in the network may be selectively activated in an adjacent region only upon true intrusion events in the region for maximum unattended battery operation of the cameras 12. Such cameras 12 of diminutive size and low power consumption (such as commonly incorporated into contemporary cell phones) may operate for brief intervals during a true intrusion event to relay image data through the network of modules 9, 11 for storage in the database 23 along with such additional information as time of intrusion, duration and coordinates along a path of movement through the secured area, and the like.
Referring now to the
However, such a module (9-1 to 9-5) can also overhear a NM's transmissions that include the NM's neighborhood list (NL) as a pre-set maximum number, say 16, of modules from which the NM can receive. For greater numbers of modules, the NM excludes from the NL those modules with poor or lower-quality reception. Thus, if a receiving module does not detect its broadcast address or ID in a potential parent's NL, then that NM will not be selected as a parent. A base station (e.g., 9-5 connected to central computer 19, 21, 23) may be set to accommodate a larger number of modules in its NL to handle more children or subordinate modules for greater prospects of assembling an efficient adaptive network through some selection of modules and relay operations therebetween.
Transmitted messages from a module (9-1 to 9-5) contain several factors, including:
a) cost, as a number to be minimized which indicates to NM's the amount of energy required to transmit to a base station. The cost is a summation of all costs of all ‘hops’ to the base station (a base station 9-5 has zero cost to forward messages, so its messages are distinctive from messages of possible parent modules); and
b) the number of ‘hops’ to send a message to the base station; and
c) a packet sequence number (e.g., 16-bit integer) that is incremented every time a message is transmitted from the base station 9-5 or other module 9-1 to 9-4; and
d) a neighborhood list (NL) of all other modules in the vicinity from which the base station or other module can receive, including:
Therefore, a module (9-1 to 9-5) may calculate a probability factor (PF) of success in transmitting to a possible parent, as:
PF=(% of module's packets received by NM)×(% of possible parent's packets received by module).
Each module (9-1 to 9-4) may thus calculate its own cost (OC) of sending a message to the base station (9-5), as:
OC=cost of NM/PF.
A module selects lowest OC to sent a message.
As illustrated in
Thus, as illustrated in
Referring now to
In addition, to transmitting its own generated data signals, a module 9 receives and relays or re-transmits 41 data signals received from adjacent modules in the array of modules 9, 11. Such data signals generated and transmitted or received and re-transmitted by a module among modules are received 43 by the central computer 19 which may analyze 47 the data signals relative to a database 45 of information, for example, regarding conditions about each selected module 9, 11 to trigger alarm conditions 49, or adjust 51 the database, or transmit 53 data or command signals to all or selected, addressed modules 9, 11, 12. Computer analysis of data signals from adjacent addressed modules 9, 11 may profile the characteristics of changed circumstances in the vicinity of the addressed modules, and may identify an intruding object from database information on profiles and characteristics of various objects such as individuals, vehicles, and the like. The processor 7 of each module may include an output utilization circuit for controlling initialization of alarm conditions, or video surveillance of the vicinity, or the like. In addition, alarm utilization 49 determined from analyses of received data signals by the central computer 19 may facilitate triangulating to coordinates of the intrusion locations and along paths of movement for controlling camera 12 surveillance, and may also actuate overall alarm responses concerning the entire secured area.
Therefore, the deployable sensor modules and the self-adaptive networks formed thereby greatly facilitate establishing perimeter surveillance within and around a secure area without time-consuming and expensive requirements of hard-wiring of modules to a central computer. In addition, data signals generated by, or received from other adjacent modules and re-transmitted among adjacent modules promotes self-adaptive formation of distributed sensing networks that can self configure around blocked or inoperative modules to preserve integrity of a secure perimeter established by interactive sensing modules.
This application is a continuation-in-part of application Ser. no. 11/096,098, entitled “Adaptive Sensing Network”, filed on Mar. 30, 2005 by A. Broad et al., now U.S. Pat. No. 7,369,047, which application is incorporated herein in the entirety by this reference thereto.
Number | Name | Date | Kind |
---|---|---|---|
4002886 | Sundelin | Jan 1977 | A |
4418333 | Schwarzbach et al. | Nov 1983 | A |
4766295 | Davis et al. | Aug 1988 | A |
5352957 | Werner | Oct 1994 | A |
5365154 | Schneider et al. | Nov 1994 | A |
5640151 | Reis et al. | Jun 1997 | A |
5697061 | Krueger et al. | Dec 1997 | A |
5841365 | Rimkus | Nov 1998 | A |
5995015 | DeTemple et al. | Nov 1999 | A |
6032109 | Ritmiller, III | Feb 2000 | A |
6078269 | Markwell et al. | Jun 2000 | A |
6208247 | Agre et al. | Mar 2001 | B1 |
6243654 | Johnson et al. | Jun 2001 | B1 |
6381467 | Hill et al. | Apr 2002 | B1 |
6392562 | Boston et al. | May 2002 | B1 |
6587739 | Abrams et al. | Jul 2003 | B1 |
6690289 | Odinak et al. | Feb 2004 | B1 |
6745027 | Twitchell, Jr. | Jun 2004 | B2 |
6749116 | Massaro | Jun 2004 | B2 |
6750769 | Smith | Jun 2004 | B1 |
6822568 | Gehlot et al. | Nov 2004 | B2 |
6844821 | Swartzel et al. | Jan 2005 | B2 |
6859831 | Gelvin et al. | Feb 2005 | B1 |
6961709 | Goodwin, III | Nov 2005 | B2 |
7035240 | Balakrishnan et al. | Apr 2006 | B1 |
7090125 | Goel et al. | Aug 2006 | B2 |
7103511 | Petite | Sep 2006 | B2 |
7152040 | Hawthorne et al. | Dec 2006 | B1 |
7176808 | Broad et al. | Feb 2007 | B1 |
7231180 | Benson et al. | Jun 2007 | B2 |
7360095 | Girouard et al. | Apr 2008 | B2 |
7369047 | Broad et al. | May 2008 | B2 |
7397368 | Otto et al. | Jul 2008 | B2 |
7424527 | Petite | Sep 2008 | B2 |
7429936 | Paradiso et al. | Sep 2008 | B2 |
7440735 | Karschnia et al. | Oct 2008 | B2 |
20030025599 | Monroe | Feb 2003 | A1 |
20030043028 | Torikai et al. | Mar 2003 | A1 |
20030063585 | Younis et al. | Apr 2003 | A1 |
20040010492 | Zhao et al. | Jan 2004 | A1 |
20040098218 | Ito et al. | May 2004 | A1 |
20040122833 | Forth et al. | Jun 2004 | A1 |
20050218218 | Koster | Oct 2005 | A1 |
20050237153 | Chen | Oct 2005 | A1 |
20060130142 | Mester et al. | Jun 2006 | A1 |
20060176239 | Sweeney | Aug 2006 | A1 |
20060187040 | Sweeney | Aug 2006 | A1 |
20060271667 | Clow et al. | Nov 2006 | A1 |
Number | Date | Country | |
---|---|---|---|
20060229086 A1 | Oct 2006 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11096098 | Mar 2005 | US |
Child | 11095640 | US |