System for evolutionary service migration

• US 20040156333A1
• Filed: 02/03/2004
• Published: 08/12/2004
• Est. Priority Date: 02/07/2003
• Status: Active Grant

• Current Assignee: Lockheed Martin Corporation (Martin Marietta Corporation)
• Original Assignee: General Electric Company, Lockheed Martin Corporation (Martin Marietta Corporation)
• Inventors: Bush, Stephen F.
• Granted Patent: US 7,366,185 B2
• Time in Patent Office: Days
• US Class Current: 370/328
• CPC Class Codes: H04W 36/00835 Determination of neighbour cell lists
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A system in accordance with the present invention operates a wireless ad hoc network. The system includes a plurality of nodes and a plurality of protocols for governing transmission of data between the plurality of nodes. A first node of the plurality of nodes executes an evolutionary service migration algorithm for transferring a service from the first node to one of the remaining of the plurality of nodes.

Claims

1. A system for operating a wireless ad hoc network, said system comprising:

a plurality of nodes; and

a plurality of protocols for governing transmission of data between said plurality of nodes, a first node of said plurality of nodes executing an evolutionary service migration algorithm for transferring a service from said first node to a one of the remaining of said plurality of nodes.

2. The system as set forth in claim 1 wherein said first node generates a Quality of Service metric for determining to which of said remaining plurality of nodes to transfer the service.

3. The system as set forth in claim 2 wherein the service includes code that adapts to the operation of the node to which the service is transferred.

4. The system as set forth in claim 3 wherein the evolutionary service migration algorithm produces a metric representing the degree of dynamism of the network as the degree of dynamism relates to the Quality of Service metric.

5. The system as set forth in claim 4 further including a service migration wrapper for dynamically maintaining the service at an optimal location within the network.

6. The system as set firth in claim 5 wherein a specified set of force vectors are assigned to each of said plurality of nodes by said plurality of protocols.

7. The system as set forth in claim 6 wherein the evolutionary service migration algorithm autonomously adapts to unanticipated changes to the topology of the network.

8. The system as set forth in claim 7 wherein the Quality of Service metric characterizes the performance of the network to transmit information from said first node to the remaining of said plurality of nodes.

9. The system as set forth in claim 8 the evolutionary service migration algorithm autonomously assigns an arbitrary value to a node that cannot be reached by the service.

10. The system as set forth in claim 9 further including a mechanism for evolutionary polling of some of said plurality of nodes.

11. A computer program product for transferring a service across a wireless ad hoc network, said product comprising:

a first instruction for operating a plurality of nodes with a plurality of protocols;

a second instruction for governing transmission of data between the plurality of nodes;

a third instruction for executing an evolutionary service migration algorithm for transferring the service from a first node to a one of the remaining of the plurality of nodes; and

a fourth instruction for generating a Quality of Service metric that determines to which of the remaining plurality of nodes to transfer the service from the first node.

12. The computer program product as set forth in claim 11 further including a fifth instruction for adapting a code the operation of the node to which the service is transferred.

13. The computer program product as set forth in claim 11 further including a fifth instruction for creating a metric representing the degree of dynamism of the network as the degree of dynamism relates to the Quality of Service metric.

14. The computer program product as set forth in claim 11 further including a fifth instruction for dynamically maintaining the service at an optimal location within the network.

15. The computer program product as set forth in claim 11 further including a fifth instruction for assigning a specified set of force vectors to each of the plurality of nodes by the plurality of protocols.

16. A method for transferring a service across a wireless ad hoc network, said method comprising the steps of:

operating a plurality of nodes with a plurality of protocols;

governing transmission of data between the plurality of nodes;

executing an evolutionary service migration algorithm for transferring the service from a first node to a one of the remaining of the plurality of nodes; and

generating a Quality of Service metric for determining to which of the remaining plurality of nodes to transfer the service from the first node.

17. The method as set forth in claim 16 further including the step of autonomously adapting the evolutionary service migration algorithm to unanticipated changes to the topology of the network.

18. The method as set forth in claim 16 further including the step of characterizing the performance of the network to transmit information from the first node to the remaining of the plurality of nodes with the Quality of Service metric.

19. The method as set forth in claim 16 further including the step of autonomously assigning an arbitrary value to a node that cannot be reached by the service.

20. The method as set forth in claim 16 further including the step of polling of some of the plurality of nodes.