Method and system for data in a collection and route discovery communication network

• US 20030202479A1
• Filed: 04/30/2002
• Published: 10/30/2003
• Est. Priority Date: 04/30/2002
• Status: Active Grant

• Current Assignee: ARRIS Enterprises LLC (CommScope Holding Company, Inc.)
• Original Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Inventors: Huang, Jian, OʼDea, Robert J.
• Granted Patent: US 7,116,643 B2
• Time in Patent Office: Days
• US Class Current: 370/252
• CPC Class Codes: H04L 43/00 Arrangements for monitoring or testing data switching networks
• CPC Class Codes: H04L 43/06 Generation of reports
• CPC Class Codes: H04L 43/16 Threshold monitoring
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/566 Routing instructions carried by the data packet, e.g. active networks
• CPC Class Codes: H04W 40/04 based on wireless node resources
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A communication system provides for data collection and route discovery for a network of distributed nodes. A base code having a data collection function occasionally sends agent packets to selected nodes of the network (620), and these nodes in turn route the agent packets to other nodes. A route suitability level is maintained for each node that reflects the suitability of that node for routing packets to the base node (510). At least some data packets contain reporting criteria for particular nodes (620). When a condition exists at a node that meets the reporting criteria, a selected packet is updated with reporting data, and routed toward the based node via a neighbor node based on the route suitability level of the neighbor node (550, 552, 555). The node also routes selected received packets that are destined for the base node to one or more neighbor nodes based on their route suitability level (540 542 545). The route suitability level at a particular node preferably increases when an agent packet uses that node en route toward the base node, and decreases over time through non-use or by other factors.

Claims

1. A method in a communication network having a data collector node and a plurality of sensor nodes that are distributed, the method comprising the steps of:

at the collector node, occasionally sending agent packets configured in a roaming state to at least some of the plurality of sensor nodes;

occasionally updating a route suitability level at each node of the plurality of sensor nodes reflecting suitability of each node for routing agent packets toward the collector node;

receiving an agent packet at a particular sensor node of the plurality of sensor nodes;

taking action, at the particular sensor node, in response to receipt of the agent packet, including the steps of;

(a) accessing contents of the agent packet;

(b) when the agent packet contents indicate a state that the agent packet is destined for the collector node;

(b1) forwarding the agent packet to a neighbor node selected from the plurality of sensor nodes based on a route suitability level associated with the neighbor node;

(b2) updating the route suitability level of the particular sensor node reflecting usage of the particular sensor node as a route toward the collector node; and

(c) when the agent packet contents indicate that the agent packet should continue in roaming state, forwarding the agent packet to a neighbor node selected at random.

2. The method of claim 1, wherein the step of taking action further comprises the step of,

(d) when a local condition exists that meets a reporting criteria:

(d1) updating the agent packet with reporting data;

(d2) causing the agent packet to indicate a state that the agent packet is destined for the collector node;

(d3) forwarding the agent packet to a neighbor node selected based on a route suitability level associated with the neighbor node.

3. The method of claim 2, wherein the step (d) further comprises the step of determining that the local condition exists that meets the reporting criteria based at least in part on using the contents of the agent packet.

4. The method of claim 1, wherein the step of updating the route suitability level comprises the steps of increasing the route suitability level.

5. The method of claim 1, wherein the step of occasionally updating a route suitability level comprises the steps of applying an evaporation algorithm to reduce the route suitability level over time.

6. The method of claim 1, wherein the step of occasionally updating a route suitability level comprises the step of applying a diffusion algorithm to decrease the route suitability level based on the route suitability level of at least one neighbor node.

7. The method of claim 1, wherein step (b1) further comprises the steps of:

determining route suitability level for a plurality of neighbor nodes;

selecting a set of neighbor nodes having a high route suitability level when compared to that of others of the plurality of neighbor nodes; and

forwarding the agent packet to multiple neighbor nodes from the set of neighbor nodes selected.

8. The method of claim 1, wherein step (a) comprises the steps of:

unpacking the agent packet to obtain software instructions; and

locally executing the software instructions.

9. The method of claim 8, wherein step (a) further comprises the steps of:

unpacking the agent packet to obtain data; and

locally executing the software instructions.

10. A method in a communication network having a plurality of distributed communication nodes and a base node, wherein the base node occasionally sends agent packets configured in a roaming state to at least some of the plurality of communication nodes, and accepts data in agent packets returned to the base node, the method comprising the steps of, at a particular node selected from the plurality of communication nodes:

maintaining a route suitability level reflecting suitability of the particular node for routing packets toward the base node;

receiving an agent packet;

taking action in response to receipt of the agent packet, including the steps of;

(a) accessing contents of the agent packet;

(b) when the agent packet contents indicate a state that the agent packet is destined for the base node,

(b1) forwarding the agent packet to a neighbor node selected from the plurality of communication nodes based on a route suitability level associated with the neighbor node,

(b2) increasing the route suitability level of the particular node reflecting usage of the particular node as a route toward the base node; and

(c) when the agent packet contents indicate that the agent packet should continue in roaming state, forwarding the agent packet to a neighbor node selected at random from the plurality of communication nodes.

11. The method of claim 10, wherein the step of maintaining comprises the step of applying an algorithm to reduce the route suitability level over time.

12. The method of claim 10, wherein the step of maintaining comprises the step of applying a diffusion algorithm to decrease the route suitability level based on the route suitability level of at least one neighbor node.

13. The method of claim 10, wherein the step of taking action further comprises the step of,

(d) when a local condition exists that meets a reporting criteria,

(d1) updating the agent packet with reporting data;

(d2) causing the agent packet to indicate a state that the agent packet is destined for the base node;

(d3) forwarding the agent packet to a neighbor node selected from the plurality of communication nodes based on a route suitability level associated with the neighbor node.

14. The method of claim 13, wherein the step (d) further comprises the step of determining that the local condition exists that meets the reporting criteria based at least in part on using the contents of the agent packet.

15. The method of claim 10, wherein step (b1) further comprises the steps of:

determining route suitability level for a plurality of neighbor nodes;

selecting a set of neighbor nodes having a high route suitability level when compared to that of others of the plurality of neighbor nodes; and

forwarding the agent packet to multiple neighbor nodes from the set of neighbor nodes selected.

16. The method of claim 16, wherein step (a) comprises the steps of:

unpacking the agent packet to obtain software instructions; and

locally executing the software instructions.

17. Apparatus for operating within a communication network, comprising a communication node having:

a transmitter;

a receiver operable to receive an agent packet,

a memory for storing;

a local route suitability level, the route suitability level reflecting suitability for operating as a router for routing the agent packet toward a particular destination;

operating instructions for accessing and routing agent packets, including instructions for routing the agent packet to a neighbor node selected based on a route suitability level associated with the neighbor node, and for increasing the local route suitability level upon performing a routing operation; and

information including route suitability level for neighbor nodes

a processor coupled to the memory, the receiver, and the transmitter, and responsive to receipt of an agent packet by the receiver to execute the operating instructions.

18. The apparatus of claim 17, wherein the memory of the communication node further comprises operating instructions for routing an agent packet to a randomly selected neighbor node based at least in part on the agent packet having a roaming state.

19. The apparatus of claim 18, wherein the memory further comprises an algorithm for reducing the route suitability level over time.

20. The apparatus of claim 19, wherein the memory further comprises an algorithm for applying a diffusion algorithm to decrease the local route suitability level based on the route suitability level of at least one neighbor node.

21. The apparatus of claim 18, wherein the communication node further comprises a sensor for measuring a local condition, and the memory further comprises operating instructions for updating an agent packet with reporting data when the local condition meets a reporting criterion.

22. The apparatus of claim 21, further comprising a base node having a transmission mode for transmitting agent packets configured with a roaming state to a plurality of communication nodes, and to receive agent packets containing reporting data.

23. A sensor network, comprising:

a base node having a transmission mode for transmitting agent packets configured with a roaming state to a plurality of communication nodes, and to receive agent packets containing reporting data, the agent packets having self-extracting software and data that specify reporting criteria for environmental conditions;

a plurality of distributed sensor nodes having communication links there between, each sensor node comprising;

a sensor for measuring at least one environmental parameter;

a transmitter;

a receiver operable to receive an agent packet,

a memory for storing;

a local route suitability level, the route suitability level reflecting suitability for operating as a router for routing the agent packet toward a particular destination;

operating instructions for maintaining the local route suitability level, including instructions for;

increasing the local route suitability level upon performing a routing operation;

decreasing the local route suitability level according to an algorithm incorporating a local evaporation rate and a local diffusion rate;

operating instructions for routing agent packets, including instructions for;

routing the agent packet to a neighbor node selected based on a route suitability level associated with a neighbor node when the agent packet contains data destined for the base node;

routing the agent packet to a neighbor node selected when the agent packet is in a roaming state and the route suitability level associated with a neighbor node is above a certain threshold;

routing the agent packet to a neighbor node selected at random when the agent packet is in a roaming state and the route suitability levels associated with neighbor nodes are below a certain threshold;

operating instructions for extracting software and data contained in an agent packet, and for determining whether a local condition exist that meet a reporting criteria defined at least in part by the software and data;

a processor coupled to the sensor, the memory, the receiver, and the transmitter, and responsive to receipt of an agent packet by the receiver to execute the operating instructions.

24. A method in a communication network having a plurality of nodes including a base node having a data collection function, the method comprising the steps of, at a particular node selected from the plurality of nodes:

maintaining a route suitability level that reflects suitability of the particular node for routing agent packets toward the base node;

receiving an agent packet;

updating the agent packet with reporting data when the agent packet contains reporting criteria, and a local condition exists that meets the reporting criteria; and

forwarding the agent packet toward the base node via a neighbor node selected from the plurality of nodes based on a route suitability level associated with the neighbor node, when the agent packet has data destined for the base node.

25. The method of claim 24, wherein the step of maintaining a route suitability level comprises the steps of applying an evaporation algorithm to reduce the route suitability level over time.

26. The method of claim 25, wherein the step of maintaining a route suitability level comprises the step of applying a diffusion algorithm to decrease the route suitability level based on the route suitability level of at least one neighbor node.

27. The method of claim 26, wherein the step of maintaining a route suitability level comprises the step of applying a diffusion algorithm to decrease the route suitability level based on the route suitability level of at least one neighbor node.

28. The method of claim 24, further comprising the step of forwarding the agent packet to a neighbor node selected at random from the plurality of nodes, when the agent packet has no data destined for the base node.