Method and apparatus for providing directed communications through a networked array of nodes

• US 7,158,511 B2
• Filed: 09/27/2001
• Issued: 01/02/2007
• Est. Priority Date: 09/27/2000
• Status: Expired due to Fees

• Current Assignee: HRL Laboratories LLC (The Boeing Co.)
• Original Assignee: HRL Laboratories LLC (The Boeing Co.)
• Inventors: Payton, David W.
• Primary Examiner(s): Harper; Kevin C.
• Application Number:
  US09/966,166
• Publication Number:
  US 20020036989A1
• Time in Patent Office: 1,923 Days
• Field of Search: 370/310, 370/315, 370/338, 370/351, 370/389, 370/392, 370/400
• US Class Current: 370/389
• CPC Class Codes: H04L 12/1854 with non-centralised forwarding system, e.g. chaincast
• CPC Class Codes: H04L 12/189 in combination with wireless systems selective distribution or broadcast in wireless communication networks H04W4/06
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/16 Multipoint routing
• CPC Class Codes: H04L 45/20 Hop count for routing purposes, e.g. TTL
• CPC Class Codes: H04L 45/24 Multipath
• CPC Class Codes: H04L 45/243 using M+N parallel active paths
• CPC Class Codes: H04L 51/222 using geographical location information, e.g. messages transmitted or received in proximity of a certain spot or area
• CPC Class Codes: H04W 40/00 Communication routing or communication path finding
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A method and apparatus are presented for messaging within a plurality of nodes 100, wherein each node 100 includes a processor 208, a memory 210 connected with the processor 208, and a directional communication interface 204 connected with the processor 208. The nodes 100 are operative for receiving a message including an address code with a relative target address of an intended recipient node 106; for processing the address code to determine if the current node 100 is the intended recipient node 106; for modifying the message based on the direction from which the message was received and is to be transmitted; and for re-transmitting the message including a modified address code. The nodes 100 each repeat these actions to propagate a message along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node 100 identities or locations.

Claims

1. A method for messaging within a plurality of nodes, wherein each of the nodes includes a processor, a memory connected with the processor, and a directional communication interface, the method comprising:

a. receiving a message including an address code and corresponding data at a current node among the plurality of nodes, the address code including a relative target address of the node to which the corresponding message is intended to be sent;

b. processing the received address code to determine if the address code indicates that the current node is the intended recipient of the message;

c. modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. re-transmitting the message including the modified address code, in each direction in which it is to be re-transmitted; and

e. repeating steps a to d at every node until the message reaches the node to which the message is intended to be sent, whereby a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities;

further including a step of initializing a cumulative hop count in the message when it is initially transmitted, a step of incrementing or decrementing the hop-count each time the message is re-transmitted, and a step of halting the re-transmission of the message when the hop-count reaches a predetermined level, whereby messages propagate through the plurality of nodes for a pre-specified number of hops and then are no-longer re-transmitted regardless whether they reach the node to which they were intended to be sent.

2. A method for messaging within a plurality of nodes, wherein each of the nodes includes a processor, a memory connected with the processor, and a directional communication interface, the method comprising:

a. receiving a message including an address code and corresponding data at a current node among the plurality of nodes, the address code including a relative target address of the node to which the corresponding message is intended to be sent;

b. processing the received address code to determine if the address code indicates that the current node is the intended recipient of the message;

c. modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. re-transmitting the message including the modified address code, in each direction in which it is to be re-transmitted; and

e. repeating steps a to d at every node until the message reaches the node to which the message is intended to be sent, whereby a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities;

further including a step of providing a unique identifier the message when it is initially transmitted, a step of checking and recording the unique identifier of the message at each node to determine whether the unique identifier of the message matches one previously stored, and a step of halting the re-transmission of the message if the unique identifier of the message matches one previously stored, whereby messages propagate through the plurality of nodes only once.

3. A method for messaging within a plurality of nodes, wherein each of the nodes includes a processor, a memory connected with the processor, and a directional communication interface, the method comprising:

a. receiving a message including an address code and corresponding data at a current node among the plurality of nodes, the address code including a relative target address of the node to which the corresponding message is intended to be sent;

b. processing the received address code to determine if the address code indicates that the current node is the intended recipient of the message;

c. modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. re-transmitting the message including the modified address code, in each direction in which it is to be re-transmitted; and

e. repeating steps a to d at every node until the message reaches the node to which the message is intended to be sent, whereby a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities;

further including the optional step of modifying the data of the message at a node prior to re-transmission, whereby the message may accumulate information as it propagates to the intended recipient; and

wherein a portion of the nodes include at least one sensor for generating sensor information, and wherein in the step of modifying the data, sensor information may be used to modify the data of the message prior to re-transmission.

4. A method for messaging within a plurality of nodes as set forth in claim 3, wherein when the message reaches the node to which the message is intended to be sent, a step of designating a new node to which the message is intended to be sent and wherein the message is propagated to the new node by repeating steps a–

e, whereby a message may be sequentially transmitted to multiple intended recipients.

5. A method for messaging within a plurality of nodes as set forth in claim 4, wherein each time the message reaches a node to which the message is intended to be sent, a step of modifying the address code of the message to indicate a new node to which the message is intended to be sent is performed, and an optional step modifying the data of the message may be performed.

6. A method for messaging within a plurality of nodes, wherein each of the nodes includes a processor, a memory connected with the processor, and a directional communication interface, the method comprising:

a. receiving a message including an address code and corresponding data at a current node among the plurality of nodes, the address code including a relative target address of the node to which the corresponding message is intended to be sent;

b. processing the received address code to determine if the address code indicates that the current node is the intended recipient of the message;

c. modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. re-transmitting the message including the modified address code, in each direction in which it is to be re-transmitted; and

e. repeating steps a to d at every node until the message reaches the node to which the message is intended to be sent, whereby a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities;

wherein the re-transmitting of the message across the plurality of nodes occurs in a two-dimensional plane;

wherein each of the nodes transmits and receives in four possible directions; and

wherein the four possible directions are at 90 degree angles to each other and wherein a message is received from a direction represented by (X, Y), and wherein the address code is modified in the modifying step such that when it is;

a. transmitted 90 degrees to the left of the direction in which it is received, the modified address code is (Y, −

(X+1));

b. transmitted along the same direction in which it is received, the modified address code is (X, Y−

1); and

c. transmitted 90 degrees to the right of the direction in which it is received, the modified address code is (−

Y, X−

1).

7. A method for messaging within a plurality of nodes as set forth in claim 6, further including a step of time-stamping the message when it is initially transmitted, and a step of comparing the time-stamp to a current time at each node prior to re-transmission, a step of halting the re-transmitting of the message after a predetermined amount of time has elapsed since the step of time-stamping the message occurred, whereby messages propagate through the plurality of nodes for a pre-specified amount of time and then are no-longer re-transmitted regardless whether they reach the node to which they were intended to be sent.

8. A method for messaging within a plurality of nodes as set forth in claim 7, wherein the multiple nodes among the plurality nodes near the node to which the message is intended to be sent may also be indicated as intended recipients of the message, whereby the selected nodes cover an area within the plurality of nodes.

9. A method for messaging within a plurality of nodes as set forth in claim 6, further including a step of initializing a cumulative hop count in the message when it is initially transmitted, a step of incrementing or decrementing the hop-count each time the message is re-transmitted, and a step of halting the re-transmission of the message when the hop-count reaches a predetermined level, whereby messages propagate through the plurality of nodes for a pre-specified number of hops and then are no-longer re-transmitted regardless whether they reach the node to which they were intended to be sent.

10. A method for messaging within a plurality of nodes as set forth in claim 6, further including a step of providing a unique identifier in the message when it is initially transmitted, a step of checking and recording the unique identifier of the message at each node to determine whether the unique identifier of the message matches one previously stored, and a step of halting the re-transmission of the message if the unique identifier of the message matches one previously stored, whereby the messages propagate through the plurality of nodes only once.

11. A method for messaging within a plurality of nodes as set forth in claim 6, wherein multiple nodes among the plurality of nodes may be indicated as intended recipients of the message, whereby a message may be targeted at selected nodes among the plurality of nodes.

12. A method for messaging within a plurality of nodes as set forth in claim 6, wherein in the step of re-transmitting the message, the message is re-transmitted only in a subset of directions determined from the address code in the message and the direction from which the message was received.

13. A method for messaging within a plurality of nodes as set forth in claim 6, wherein the in the step of re-transmitting the message, the message is re-transmitted only in directions which result in re-transmission toward the node to which the message is intended to be sent, whereby the propagation of the message always occurs toward the intended recipient.

14. A method for messaging within a plurality of nodes as set forth in claim 6, further including the optional step of modifying the data of the message at a node prior to re-transmission, whereby the message may accumulate information as it propagates to the intended recipient.

15. A method for messaging within a plurality of nodes as set forth in claim 14, wherein a portion of the nodes include at least one sensor for generating sensor information, and wherein in the step of modifying the data, sensor information may be used to modify the data of the message prior to re-transmission.

16. A method for messaging within a plurality of nodes as set forth in claim 15, wherein when the message reaches the node to which the message is intended to be sent, a step of designating a new node to which the message is intended to be sent and wherein the message is propagated to the new node by repeating steps a–

e, whereby a message may be sequentially transmitted to multiple intended recipients.

17. A method for messaging within a plurality of nodes as set forth in claim 6, wherein the data of the message is a command.

18. A method for messaging within a plurality of nodes as set forth in claim 6, where at least a portion of the nodes is mobile.

19. A system for directed communication within a data network, the network comprising a plurality of nodes, each comprising a processor, a memory connected with the processor, and a directional communication interface connected with the processor, the processor and memory include:

a. means for receiving a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

b. means for determining if the address code indicates that the node receiving the message is the intended recipient of the message;

c. means for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmined;

d. means re-transmitting the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities; and

wherein the processor and memory of each node further include a means for initializing a cumulative hop count in the message when it is initially transmitted, a means for incrementing or decrementing the hop-count each time the message is re-transmitted, and a means for halting the re-transmission of the message when the hop-count reaches a predetermined level, whereby messages propagate through the plurality of nodes for a pre-specified number of hops and then are no-longer re-transmitted regardless whether they reach the node to which they were intended to be sent.

20. A system for directed communication within a data network, the network comprising a plurality of nodes, each comprising a processor, a memory connected with the processor, and a directional communication interface connected with the processor, the processor and memory include:

a. means for receiving a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

b. means for determining if the address code indicates that the node receiving the message is the intended recipient of the message;

c. means for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. means re-transmitting the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities; and

wherein the processor and memory of each node further include a means for providing a unique identifier for the message when it is initially transmitted, a means for checking and recording the unique identifier of the message at each node to determine whether the unique identifier of the message matches one previously stored, and a means for halting the re-transmission of the message if the unique identifier of the message matches one previously stored, whereby the messages propagate through the plurality of nodes only once.

21. A system for directed communication within a data network, the network comprising a plurality of nodes, each comprising a processor, a memory connected with the processor, and a directional communication interface connected with the processor, the processor and memory include:

a. means for receiving a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

b. means for determining if the address code indicates that the node receiving the message is the intended recipient of the message;

c. means for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. means re-transmitting the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities; and

wherein the processor and memory of each node further include a means for modifying the data of the message at a node prior to re-transmission, whereby the message may accumulate information as it propagates to the intended recipient.

22. A system for directed communication within a data network as set forth in claim 21, wherein a portion of the nodes include at least one sensor for generating sensor information, and wherein the means for modifying the data uses the sensor information to modify the data of the message prior to re-transmission.

23. A system for directed communication within a data network as set forth in claim 22, wherein when the message reaches the node to which the message is intended to be sent, a new node may be designated as the node to which the message is intended to be sent, and wherein the message is propagated to the new node, whereby a message may be sequentially transmitted to multiple intended recipients.

24. A system for directed communication within a data network as set forth in claim 22, wherein when the message reaches the node to which the message is intended to be sent, a new node may be designated as the node to which the message is intended to be sent, and wherein the message is propagated to the new node, whereby a message may be sequentially transmitted to multiple intended recipients.

25. A system for directed communication within a data network as set forth in claim 23, wherein each time the message reaches a node to which the message is intended to be sent, the address code of the message is modified by the processor of the node to indicate a new node to which the message is intended to be sent is performed.

26. A system for directed communication within a data network as set forth in claim 23, wherein each time the message reaches a node to which the message is intended to be sent, the address code of the message is modified by the processor of the node to indicate a new node to which the message is intended to be sent is performed.

27. A system for directed communication within a data network as set forth in claim 21, wherein a portion of the nodes include at least one sensor for generating sensor information, and wherein the means for modifying the data uses the sensor information to modify the data of the message prior to re-transmission.

28. A system for directed communication within a data network, the network comprising a plurality of nodes, each comprising a processor, a memory connected with the processor, and a directional communication interface connected with the processor, the processor and memory include:

a. means for receiving a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

b. means for determining if the address code indicates that the node receiving the message is the intended recipient of the message;

c. means for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. means re-transmitting the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities;

wherein the nodes are configured to re-transmit the message in a two-dimensional plane; and

wherein the four possible directions are at 90 degree angles to each other and wherein a message is received from a direction represented by (X, Y), and

wherein the address code is modified by the means for modifying such that when it is;

a. transmitted 90 degrees to the left of the direction in which it is received, the modified address code is (Y, −

(X+1));

b. transmitted along the same direction in which it is received, the modified address code is (X, Y−

1); and

c. transmitted 90 degrees to the right of the direction in which it is received, the modified address code is (−

Y, X−

1).

29. A system for directed communication within a data network as set forth in claim 28, wherein the processor and memory of each node further include a means for time-stamping the message when it is initially transmitted, a means for comparing the time-stamp to a current time at each node prior to re-transmission, and a means for halting the re-transmitting of the message after a predetermined amount of time has elapsed since the time-stamping of the message occurred, whereby messages propagate through the plurality of nodes for a pre-specified amount of time and then are no-longer re-transmitted regardless of whether they reach the node to which they were intended to be sent.

30. A system for directed communication within a data network as set forth in claim 28, wherein the processor and memory of each node further include a means for initializing a cumulative hop count in the message when it is initially transmitted, a means for incrementing or decrementing the hop-count each time the message is re-transmitted, and a means for halting the re-transmission of the message when the hop-count reaches a predetermined level, whereby messages propagate through the plurality of nodes for a pre-specified number of hops and then are no-longer re-transmitted regardless whether they reach the node to which they were intended to be sent.

31. A system for directed communication within a data network as set forth in claim 28, wherein the processor and memory of each node further include a means for providing a unique identifier for the message when it is initially transmitted, a means for checking and recording the unique identifier of the message at each node to determine whether the unique identifier of the message matches one previously stored, and a means for halting the re-transmission of the message if the unique identifier of the message matches one previously stored, whereby the messages propagate through the plurality of nodes only once.

32. A system for directed communication within a data network as set forth in claim 28, wherein multiple nodes among the plurality of nodes may be indicated as intended recipients of the message, whereby a message may be targeted at selected nodes among the plurality of nodes.

33. A system for directed communication within a data network as set forth in claim 32, wherein the multiple nodes among the plurality nodes near the node to which the message is intended to be sent may also be indicated as intended recipients of the message, whereby the selected nodes cover an area within the plurality of nodes.

34. A system for directed communication within a data network as set forth in claim 28, wherein when the message is re-transmitted, it is re-transmitted only in directions determined from the address code in the message.

35. A system for directed communication within a data network as set forth in claim 28, the message is re-transmitted through the plurality of nodes only in directions which result in re-transmission toward the node to which the message is intended to be sent, whereby the propagation of the message always occurs toward the intended recipient.

36. A system for directed communication within a data network as set forth in claim 28, wherein the data of the messages are commands.

37. A system for directed communication within a data network as set forth in claim 28, wherein at least a portion of the nodes is mobile.

38. A node for communication within a system for directed communication within a data network, the node comprising a processor, a memory connected with the processor, and a directional communication interface connected with the processor, the processor and memory include:

a. means for receiving a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

b. means for determining if the address code indicates that the node receiving the message is the intended recipient of the message;

c. means for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. means re-transmitting the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities; and

wherein the processor and memory the node further includes a means for initializing a cumulative hop count in the message when it is initially transmitted from that node, a means for incrementing or decrementing the hop-count each time a message is re-transmitted from the node, and a means for halting the re-transmission of the message when the hop-count reaches a predetermined level at the node, whereby messages propagate through a plurality of nodes for a pre-specified number of hops and then are no-longer re-transmitted regardless whether they reach the node to which they were intended to be sent.

39. A node for communication within a system for directed communication within a data network, the node comprising a processor, a memory connected with the processor, and a directional communication interface connected with the processor, the processor and memory include:

a. means for receiving a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

b. means for determining if the address code indicates that the node receiving the message is the intended recipient of the message;

c. means for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. means re-transmitting the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities; and

wherein the processor and memory, the node further includes a means for providing a unique identifier for the message when it is initially transmitted, a means for checking and recording the unique identifier of the message at the node to determine whether the unique identifier of the message matches one previously stored, and a means for halting the re-transmission of the message if the unique identifier of the message matches one previously stored, whereby the messages propagate through a plurality of nodes only once.

40. A node for communication within a system for directed communication within a data network, the node comprising a processor, a memory connected with the processor, and a directional communication interface connected with the processor, the processor and memory include:

a. means for receiving a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

b. means for determining if the address code indicates that the node receiving the message is the intended recipient of the message;

c. means for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. means re-transmitting the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities; and

wherein the processor and memory of the node further includes a means for modifying the data of the message at a node prior to re-transmission, whereby the message may accumulate information as it propagates to the intended recipient node across a plurality of nodes.

41. A node for communication within a system for directed communication within a data network as set forth in claim 40, wherein the node includes at least one sensor for generating sensor information, and wherein the means for modifying the data uses the sensor information to modify the data of the message prior to re-transmission.

42. A node for communication within a system for directed communication within a data network, the node comprising a processor, a memory connected with the processor, and a directional communication interface connected with the processor, the processor and memory include:

a. means for receiving a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

b. means for determining if the address code indicates that the node receiving the message is the intended recipient of the message;

c. means for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. means re-transmitting the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities;

wherein the node is configured to re-transmit the message in a two-dimensional plane;

wherein the node is configured to transmit and receive in four possible direction;

wherein the four possible directions are at 90 degree angles to each other and wherein a message is received from a direction represented by (X, Y), and wherein the address code is modified by the means for modifying such that when it is;

a. transmitted 90 degrees to the left of the direction in which it is received, the modified address code is (Y, −

(X+1));

b. transmitted along the same direction in which it is received, the modified address code is (X, Y−

1); and

c. transmitted 90 degrees to the right of the direction in which it is received, the modified address code is (−

Y, X−

1).

43. A node for communication within a system for directed communication within a data network as set forth in claim 42, wherein when the message is re-transmitted, it is re-transmitted only in a subset of directions determined from the address code in the message and the direction from which the message was received.

44. A node for communication within a system for directed communication within a data network as set forth in claim 42, wherein when the message is re-transmitted boy the node, it is only re-transmitted in directions which result in re-transmission toward a node to which the message is intended to be sent, whereby the propagation of the message always occurs toward an intended recipient.

45. A node for communication within a system for directed communication within a data network as set forth in claim 42, wherein the processor and memory of the node further includes a means for modifying the data of the message at a node prior to re-transmission, whereby the message may accumulate information as it propagates to the intended recipient node across a plurality of nodes.

46. A node for communication within a system for directed communication within a data network as set forth in claim 42, wherein the data of the messages are commands.

47. A node for communication within a system for directed communication within a data network as set forth in claim 42, wherein the node is mobile.

48. A node for communication within a system for directed communication within a data network, the node comprising a processor, a memory connected with the processor, and a directional communication interface connected with the processor, the processor and memory include:

a. means for receiving a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

b. means for determining if the address code indicates that the node receiving the message is the intended recipient of the message;

c. means for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. means re-transmitting the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities;

wherein the processor and memory the node further includes a means for initializing a cumulative hop count in the message when it is initially transmitted from that node, a means for incrementing or decrementing the hop-count each time a message is re-transmitted from the node, and a means for halting the re-transmission of the message when the hop-count reaches a predetermined level at the node, whereby messages propagate through a plurality of nodes for a pre-specified number of hops and then are no-longer re-transmitted regardless whether they reach the node to which they were intended to be sent.

49. A node for communication within a system for directed communication within a data network, the node comprising a processor, a memory connected with the processor, and a directional communication interface connected with the processor, the processor and memory include:

a. means for receiving a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

b. means for determining if the address code indicates that the node receiving the message is the intended recipient of the message;

c. means for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted;

d. means re-transmitting the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities;

wherein the processor and memory, the node further includes a means for providing a unique identifier for the message when it is initially transmitted, a means for checking and recording the unique identifier of the message at the node to determine whether the unique identifier of the message matches one previously stored, and a means for halting the re-transmission of the message if the unique identifier of the message matches one previously stored, whereby the messages propagate through a plurality of nodes only once.

50. A computer program product for facilitating messaging within a plurality of nodes, with each node having a processor, a memory connected with the processor, and a directional communication interface, the computer program product comprising:

a. a recording medium;

b. means, recorded on the recording medium for facilitating reception of a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

c. means, recorded on the recording medium for facilitating determination whether the address code in a received message indicates that the node receiving the message is the intended recipient of the message;

d. means, recorded on the recording medium for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted; and

e. means, recorded on the recording medium for facilitating the re-transmission of the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities; and

further including means, recorded on the recording medium, for initializing a cumulative hop count in the message when it is initially transmitted from that node;

means, recorded on the recording medium, for incrementing or decrementing the hop-count each time a message is re-transmitted from the node; and

means, recorded on the recording medium, for halting the re-transmission of the message when the hop-count reaches a predetermined level at the node, whereby messages propagate through a plurality of nodes for a pre-specified number of hops and then are no-longer re-transmitted regardless whether they reach the node to which they were intended to be sent.

51. A computer program product for facilitating messaging within a plurality of nodes, with each node having a processor, a memory connected with the processor, and a directional communication interface, the computer program product comprising:

a. a recording medium;

b. means, recorded on the recording medium for facilitating reception of a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

c. means, recorded on the recording medium for facilitating determination whether the address code in a received message indicates that the node receiving the message is the intended recipient of the message;

d. means, recorded on the recording medium for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted; and

e. means, recorded on the recording medium for facilitating the re-transmission of the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities; and

further including means, recorded on the recording medium, for providing a unique identifier for the message when it is initially transmitted;

means, recorded on the recording medium, for checking and recording the unique identifier of the message at the node and determining whether the unique identifier of the message matches one previously stored; and

means, recorded on the recording medium, for halting the re-transmission of the message if the unique identifier of the message matches one previously stored, whereby the messages propagate through a plurality of nodes only once.

52. A computer program product for facilitating messaging within a plurality of nodes, with each node having a processor, a memory connected with the processor, and a directional communication interface, the computer program product comprising:

a. a recording medium;

b. means, recorded on the recording medium for facilitating reception of a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

c. means, recorded on the recording medium for facilitating determination whether the address code in a received message indicates that the node receiving the message is the intended recipient of the message;

d. means, recorded on the recording medium for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted; and

e. means, recorded on the recording medium for facilitating the re-transmission of the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities; and

further including means, recorded on the recording medium, for modifying the data of the message at a node prior to re-transmission, whereby the message may accumulate information as it propagates to the intended recipient node across a plurality of nodes.

53. A computer program product for facilitating messaging within a plurality of nodes as set forth in claim 52, wherein the means for modifying the data uses sensor information to modify the data of the message prior to re-transmission.

54. A computer program product for facilitating messaging within a plurality of nodes, with each node having a processor, a memory connected with the processor, and a directional communication interface, the computer program product comprising:

a. a recording medium;

b. means, recorded on the recording medium for facilitating reception of a message via the communication interface and providing the message to the processor and memory, the message including an address code and corresponding data, the address code including a relative target address of a node to which the corresponding message is intended to be sent;

c. means, recorded on the recording medium for facilitating determination whether the address code in a received message indicates that the node receiving the message is the intended recipient of the message;

d. means, recorded on the recording medium for modifying the message based on the direction from which the message was received, the address code in the message, and the direction to which the message is to be re-transmitted; and

e. means, recorded on the recording medium for facilitating the re-transmission of the message via the directional communication interface, including the modified address code, in each direction in which it is to be re-transmitted;

whereby a message may be propagated across the plurality of nodes until the message reaches the node to which the message is intended to be sent, and a message may be propagated across a plurality of nodes along multiple paths until the message reaches a desired recipient, thereby providing path redundancy without the need for the use of unique node identities; and

wherein the computer program product is designed to facilitate message transmission and reception in four possible directions at 90 degree angles to each other and wherein a message is received from a direction represented by (X, Y), and wherein the address code is modified by the means for modifying such that when it is;

a. transmitted 90 degrees to the left of the direction in which it is received, the modified address code is (Y, −

(X+1));

b. transmitted along the same direction in which it is received, the modified address code is (X, Y−

1); and

c. transmitted 90 degrees to the right of the direction in which it is received, the modified address code is (−

Y, X−

1).

55. A computer program product for facilitating messaging within a plurality of nodes as set forth in claim 54, further including means, recorded on the recording medium, for time-stamping the message if it is initially transmitted from that node;

means, recorded on the recording medium, for comparing the time-stamp to a current time at each node prior to re-transmission; and

means, recorded on the recording medium, for halting the re-transmitting of the message if a predetermined amount of time has elapsed since the time-stamping of the message occurred, whereby messages can propagate through a plurality of nodes for a pre-specified amount of time and then are no-longer re-transmitted regardless of whether they reach the node to which they were intended to be sent.

56. A computer program product for facilitating messaging within a plurality of nodes as set forth in claim 54, further including means, recorded on the recording medium, for initializing a cumulative hop count in the message when it is initially transmitted from that node;

means, recorded on the recording medium, for incrementing or decrementing the hop-count each time a message is re-transmitted from the node; and

means, recorded on the recording medium, for halting the re-transmission of the message when the hop-count reaches a predetermined level at the node, whereby messages propagate through a plurality of nodes for a pre-specified number of hops and then are no-longer re-transmitted regardless whether they reach the node to which they were intended to be sent.

57. A computer program product for facilitating messaging within a plurality of nodes as set forth in claim 54, further including means, recorded on the recording medium, for providing a unique identifier for the message when it is initially transmitted;

means, recorded on the recording medium, for checking and recording the unique identifier of the message at the node and determining whether the unique identifier of the message matches one previously stored; and

means, recorded on the recording medium, for halting the re-transmission of the message if the unique identifier of the message matches one previously stored, whereby the messages propagate through a plurality of nodes only once.

58. A computer program product for facilitating messaging within a plurality of nodes as set forth in claim 54, wherein the means for facilitating the re-transmission of the message enables the message to be transmitted only in a subset of directions determined from the address code in the message and the direction from which the message was received.

59. A computer program product for facilitating messaging within a plurality of nodes as set forth in claim 54, further including means, recorded on the recording medium, for ensuring that when the message is re-transmitted, it is re-transmitted only in directions determined from the address code in the message.

60. A computer program product for facilitating messaging within a plurality of nodes as set forth in claim 54, further including means, recorded on the recording medium, for modifying the data of the message at a node prior to re-transmission, whereby the message may accumulate information as it propagates to the intended recipient node across a plurality of nodes.

61. A computer program product for facilitating messaging within a plurality of nodes as set forth in claim 54, wherein the data of the messages are commands.