Adaptive network and method

• US 8,115,593 B2
• Filed: 05/11/2006
• Issued: 02/14/2012
• Est. Priority Date: 03/30/2005
• Status: Active Grant

• Current Assignee: Aceinna Transducer Systems Company Limited
• Original Assignee: Memsic Transducer Systems Co., Ltd.
• Inventors: Broad, Alan, Kapur, Rahul, Prabhu, Jaidev, Turon, Martin Albert, Xu, Ning, Yang, Xin, Miller, Matt
• Primary Examiner(s): Lee, Benjamin C
• Assistant Examiner(s): MEHRAVARI, PETER CYRUS
• Application Number:
  US11/433,194
• Publication Number:
  US 20070132846A1
• Time in Patent Office: 2,105 Days
• Field of Search: 340/7.33, 340/825.69, 340/541, 340/506, 370/237, 370/238, 370/315, 370/252, 370/338, 370/403, 370/395.21, 370351- 2, 709238-241, 348/159, 348/143
• US Class Current: 340/7.33
• CPC Class Codes: G08B 25/009 Signalling of the alarm condition to a substation whose identity is signalled to a central station, e.g. relaying alarm signals in order to extend communication range
• CPC Class Codes: G08B 25/10 using wireless transmission systems G08B25/009 takes precedence
• CPC Class Codes: G08B 29/188 Data fusion; cooperative systems, e.g. voting among different detectors
• CPC Class Codes: H04W 52/0216 using a pre-established activity schedule, e.g. traffic indication frame
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A plurality of modules interact to form an adaptive network in which each module transmits and receives data signals indicative of proximity of objects. A central computer accumulates the data produced or received and relayed by each module for analyzing proximity responses to transmit through the adaptive network control signals to a selectively-addressed module to respond to computer analyses of the data accumulated from modules forming the adaptive network. Interactions of local processors in modules that sense an intrusion determine the location and path of movements of the intruding object and control cameras in the modules to retrieve video images of the intruding object. Multiple operational frequencies in adaptive networks permit expansions by additional networks that each operate at separate radio frequencies to avoid overlapping interaction. Additional modules may be introduced into operating networks without knowing the operating frequency at the time of introduction. Remote modules operating as leaf nodes of the adaptive network actively adapt to changed network conditions upon awaking from power-conserving sleep mode. New programs are distributed to all or selected modules under control of the base station.

Claims

1. An adaptive network including a plurality of interactive modules, and comprising:

at least one of the modules operable as a leaf node in the network and operable in a sleep mode of operation of low-power expenditure and in an active mode of operation including, following transition from said sleep mode of operation, transmitting a burst of N number of messages of a first type;

a plurality of the modules each receiving at least one of the messages in the burst transmission and then counting the number of messages actually received up to the expected number N of messages, determining a received value (PR) as a function of the number of messages actually received and the number of N expected messages and transmitting a response message comprising the respective received value (PR);

the leaf node module receiving a plurality of response messages; and

the leaf node module selecting a parent module, from the plurality of modules from which response messages were received, as a function of the received values (PR) in the received response messages.

2. An adaptive network according to claim 1 in which the leaf node module transmits the N number of messages at a successive time interval TI for a burst time duration of N×

TI.

3. An adaptive network according to claim 1 in which successive ones of the N number of messages are transmitted at varied transmission strengths.

4. An adaptive network according to claim 1 in which a response message transmitted by said plurality of responding modules includes an indication of an expenditure of energy associated with transmission through the network;

and

said one leaf node module selects a parent module from the plurality of responding modules from which response messages were received as a function of the indication of the energy expended associated with a respective transmission through the network.

5. An adaptive network according to claim 4 in which said leaf node module selects the parent module according to a logical combination of weighted parameters including a highest received value (PR) and a lowest indication of energy expenditure in said response messages received from the plurality of responding modules in the network.

6. An adaptive network according to claim 4 in which said leaf node module selects according to a logical combination of weighted parameters including the respective received value (PR), the indication of energy expenditure and the strength of the response message received at said leaf node module.

7. An adaptive network according to claim 2 in which said leaf node module reverts to the sleep mode of operation after a time duration of N×

TI and receipt of response messages from a plurality of modules in the network.

8. An adaptive network according to claim 1 in which each of the modules transmitting a response message includes identification of such transmitting module;

and

said leaf node module stores the identification of the selected module and reverts to the sleep mode of operation.

9. A method of operating an adaptive network of a plurality of interactive modules including at least one module operable as a leaf node in the network and operable in a sleep mode of operation of low-power expenditure and in an active mode of operation for receiving and transmitting messages, the method comprising:

transmitting from the leaf node module a burst of N number of messages of a first type following transition from the sleep mode of operation to the active mode of operation;

receiving at least one of the messages in the burst transmission at a plurality of receiving modules and each then counting messages actually received by each such receiving module up to the expected N number of messages;

determining a received value (PR) as a function of the number of messages actually received by each of the plurality of receiving modules and each such receiving module transmitting a response message comprising the respective received value (PR);

receiving by the leaf node module response messages from a plurality of responding modules; and

said leaf node module selecting a parent module from the plurality of responding module from which response messages were received as a function of the received values (PR) in the received response messages.

10. The method according to claim 9 in which the leaf node module transmits the N number of messages at a successive time interval TI for a burst time duration of N×

TI.

11. The method according to claim 10 in which successive ones of the N number of messages are transmitted at varied transmission strengths.

12. The method according to claim 9 in which a response message transmitted by said plurality of responding modules includes an indication of expenditure of energy associated with transmission through the network;

and

said one leaf node module selecting a parent module from the plurality of responding modules as a function of the indication of the energy expended associated with a respective transmission through the network.

13. The method according to claim 12 in which said leaf node module selects the parent module according to a logical combination of weighted parameters including a highest received value (PR) and a lowest indication of energy expenditure in said response messages received from the plurality of responding modules in the network.

14. The method according to claim 12 in which said leaf node module selects the parent module according to a logical combination of weighted parameters including the received value (PR) and an indication of energy expenditure and a strength of the response message received at said leaf node module.

15. The method according to claim 10 in which said leaf node module reverts to the sleep mode of operation after a time duration of N×

TI and receipt of response messages from a plurality of modules in the network.

16. The method according to claim 9 in which each of the responding modules transmitting a response message includes identification of such transmitting module;

and

said leaf node module stores the identification of the selected module and reverts to the sleep mode of operation.

17. In an adaptive network of a plurality of interactive modules, a computer-implemented method operable in a leaf node module of the plurality of modules for transmitting from the leaf node module a burst of N number of messages of a first type ;

receiving, from a plurality of other modules, signals indicating a number (PR) of the N burst messages actually received by each of said other plurality of modules, and

selecting one of the plurality of other modules as a parent node module as a function of the respective messages received numbers (PR).

18. The computer-implemented method according to claim 17 for causing the leaf node module to transmit successive ones of the N number of burst messages at a successive time interval TI for a burst time duration of N×

TI.

19. The computer-implemented method according to claim 17 wherein the leaf node module is further operable to analyze signals received from the plurality of other modules indicative of a respective expenditure of energy for communicating within the adaptive network;

and

the step of selecting the parent node module from the plurality of other modules is a function of a logical combination of the received respective numbers (PR) and a lowest expenditure of energy.

20. A computer-implemented method according to claim 17 wherein the leaf node module is operable to transmit successive ones of the N number of messages at varied transmission strengths.

21. The computer-implemented method according to claim 17 wherein the parent node module is selected as a function of a largest message received number (PR).

22. The computer-implemented method according to claim 17 for causing the leaf node module to determine a respective strength value of said signal received from each of the plurality of other modules;

and

the step of selecting the parent node module is received is a function of the strength values of the received signals.

23. The computer-implemented method according to claim 22 wherein the parent node module is selected as a function of a received signal with a greatest strength value.

24. A plurality of interactive modules for operating in a self-adaptive network, each module having a unique address and each module comprising:

means for transmitting a burst of N number of messages of a first type;

means for counting a number of burst messages actually received from another module;

means for transmitting a responsive signal including at least one of the respective unique address, a received value (PR) calculated as a function of the number of burst messages actually received and the number of N messages expected, and information regarding energy expended communicating with one or more other modules in the network;

means for analyzing strength of a responsive signal received from another module; and

means for selecting another module to communicate exclusively with as a function of one or more of the received unique addresses, the analysis of the strength of received responsive signals, an analysis of the received values (PR), and the energy expended information received from other modules within the network.

25. A module according to claim 24 in which the means for transmitting a burst alters a transmission strength of successive ones of the N number of messages.