DISTRIBUTED FLUID NETWORK SYSTEM AND METHOD

• US 20110216696A1
• Filed: 03/08/2010
• Published: 09/08/2011
• Est. Priority Date: 03/08/2010
• Status: Abandoned Application

• Current Assignee: Rainbow Technologies Incorporated
• Original Assignee: Rainbow Technologies Incorporated
• Inventors: Lippolis, Giorgio, Russo, Claudio
• Application Number:
  US12/719,611
• Publication Number:
  US 20110216696A1
• Time in Patent Office: Days
• US Class Current: 370/328
• 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 system and method for transmitting message data within a multi-hop mesh network is disclosed. Message data is provided that includes an identifier of the source node, an identifier of the destination node, a transmission route and a message for the destination node. At least one processor tracks one or more of an incoming queue, an outgoing queue and an idle queue. The message data is transmitted from the source node to a destination node or, if the destination node is not directly connected, to an intermediate node, the receiving node determines whether it is the destination node and/or whether there is at least a first predetermined condition that precludes the message delivery. If no such condition is determined and the node is not the destination node, it continues forwarding the message to a subsequent and possibly the destination node, otherwise it attempts a re-routing and if it does not determine a second predetermined condition that precludes calculating a different route, drops the message and updates the knowledge base.

Claims

1. A method for transmitting message data within a multi-hop mesh network from a source node to a destination node, the method comprising:

a) providing the message data, wherein the message data includes an identifier of the source node, an identifier of the destination node, a transmission route that represents at least a respective identifier any of a plurality of intermediate nodes between the source node and the destination node, and a message for the destination node, wherein either at least one of the intermediate nodes is connected to at least one of the source node and the destination node via a bridged socket, or the source node and the destination node are directly connected;

b) tracking, by at least one processor, an incoming queue and an outgoing queue, for at least one message from the source node to the destination node;

c) transmitting over a communication network, from the source node to one or more of the intermediate nodes, the message data;

d) receiving, by one or more intermediate nodes, the message data;

e) determining, by one or more of the intermediate nodes from the message data, a next node of the plurality of intermediate nodes, and whether there is at least a first predetermined condition associated with the transmission route;

f) forwarding, by one of the intermediate nodes, the message data to another of the intermediate nodes, unless one or more predetermined conditions occur; and

g) repeating steps f), d) and e) until there are no intermediate nodes;

h) forwarding, by one of the intermediate nodes, to the destination node, the message data and

i) receiving, by the destination node, the message data.

2. The method of claim 1, wherein at least one of the predetermined conditions is a topologic change in the communication network or network congestion.

3. The method of claim 1, wherein at least one of the predetermined conditions is based on a knowledge base.

4. The method of claim 3, wherein the knowledge base is updated by information transmitted by at least one of the source node, the destination node and one or more of the intermediate nodes.

5. The method of claim 4, wherein the information transmitted by at least one of the at least one of the source node, the destination node and one or more of the intermediate nodes represents one or more of a newly discovered node and an unresponsive node.

6. The method of claim 4, wherein the information transmitted by at least one of the source node, the destination node and one of or more of the intermediate nodes represents only network changes respectively discovered by one or more of the source node, the destination node and one or more intermediate nodes.

7. The method of claim 1, wherein the tracking is performed by a mesh controller.

8. The method of claim 7, wherein the mesh controller includes at least one instruction that is executed by at least one of the source node, the destination node and one or more of the intermediate nodes.

9. The method of claim 1, further comprising:

modifying, by one or more of the intermediary nodes, the transmission route if the one or more of the intermediate nodes determines the at least first predetermined condition, wherein the modified transmission route includes an identifier of another of the intermediate and excludes the identifier of the next of the intermediate nodes;

modifying the message data, by one or more of the intermediary nodes, with the modified transmission route; and

transmitting, by the one or more of the intermediary nodes, the modified message data to a subsequent intermediate node.

10. The method of claim 1, further comprising outputting the message data to at least one of a printer and a display.

11. A system for transmitting message data within a multi-hop mesh network from a source node to a destination node, the system comprising:

a source node that includes a source node processor and a source node memory operatively coupled to the first processor to form a source node communication device;

a destination node that includes a second processor, a second memory operatively coupled to the second processor to form a second communication device;

one or more intermediate nodes, each comprising a respective intermediate node processor and a respective intermediate node memory to form one or more intermediate node communication devices;

message data provided by the source node, wherein the message data includes an identifier of the source node, an identifier of the destination node, a transmission route that represents at least a respective identifier of any of the one or more intermediate nodes between the source node and the destination node, and a message for the destination node,

at least one bridged socket through which the source node is connected to at least a second node;

at least bridged socket through which at least one destination node is connected to at least a second node;

a mesh controller running on the source node, the destination node and any of the one or more intermediate nodes, wherein the mesh controller tracks at least one incoming queue and an outgoing queue;

a first instruction, when executed by the source node processor, causes the source node to transmit the message data to the first of the intermediate nodes over a communication network;

a second instruction, when executed by a processor of any node, causes the any node to determine from the message data the destination node, the transmission route, and whether there is at least a predetermined condition associated with the message data;

a third instruction, when executed by the processor of the any node, causes the any node to forward the message data to a subsequent one of the one or more intermediate nodes unless the any node determines the predetermined condition; and

a fourth instruction, when executed by the processor of the any node, causes the any node to determine from the message data to be the destination node, and whether there is at least the predetermined condition or a different predetermined condition associated with the message data,

wherein the destination node receives the message data if any of the one or more intermediate nodes does not determine the predetermined condition or the different predetermined condition.

12. The system of claim 11, wherein the predetermined condition or the different predetermined condition is one or more of a topologic change in the communication network, a software stack and network congestion.

13. The system of claim 11, further comprising a knowledge base, wherein the predetermined condition, the different predetermined condition is determined as a function of the knowledge base, and further wherein the knowledge base is stored on the source node, the destination node and any of the one or more intermediate nodes.

14. The system of claim 13, wherein the knowledge base is updated by information transmitted by at least one of the source node, the destination node and any of the one or more intermediate nodes.

15. The system of claim 13, wherein the knowledge base contains information that is not a perfect replica among at least one of the source node, the destination node and any of the one or more of the intermediate nodes.

16. The system of claim 14, wherein the information transmitted by at least one of the at least one of the source node, the destination node and any of the one or more intermediate nodes represents one or more of a newly discovered node and an unresponsive node.

17. The system of claim 14, wherein the information transmitted by the at least one of the source node, the destination node and one or more of the intermediate nodes represents only network changes respectively discovered by one or more of the source node, the destination node and one or more of the intermediate nodes.

18. The system of claim 11, wherein the mesh controller includes at least one instruction.

19. The system of claim 11, further comprising:

a fifth instruction, when executed by the processor, causes the intermediary node to modify the transmission route if the node itself determines the at least first predetermined condition, wherein the modified transmission route includes an identifier of a different intermediate node and excludes the identifier of the present intermediate node;

a sixth instruction, when executed by any respective intermediary processor, causes the respective intermediary node to modify the message data with the modified transmission route; and

a seventh instruction, when executed by the respective intermediary processor, causes the respective intermediary node to transmit the modified message data to the subsequent one of the one or more intermediate nodes.

20. The system of claim 11, further comprising at least one of a printer and a display, wherein the destination node causes the message data to be outputted to one or more of the at least one of a printer and display.

21. A wireless mesh network, the wireless mesh network comprising:

at least one processor;

at least one memory operatively connected to the at least one processor, wherein the at least one memory has stored;

a knowledge base including information relating to a plurality of nodes, wherein the knowledge base includes information transmitted by any of the plurality nodes and that represents only network changes respectively discovered by one or more of a source node, a destination node and one or more discovered nodes.