NEURAL NETWORK-BASED NODE MOBILITY AND NETWORK CONNECTIVTY PREDICTIONS FOR MOBILE AD HOC RADIO NETWORKS

• US 20070299794A1
• Filed: 06/26/2006
• Published: 12/27/2007
• Est. Priority Date: 06/26/2006
• Status: Active Grant

• Current Assignee: The Boeing Co.
• Original Assignee: The Boeing Co.
• Inventors: El-Damhougy, Hesham
• Granted Patent: US 7,555,468 B2
• Time in Patent Office: Days
• US Class Current: 706/15
• CPC Class Codes: H04W 40/18 based on predicted events
• CPC Class Codes: H04W 40/20 based on geographic position or location
• CPC Class Codes: H04W 40/246 Connectivity information discovery
• CPC Class Codes: H04W 40/32 for defining a routing cluster membership
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A self managed ad hoc communications network nodes and node mobility management. Nodes include an Artificial Neural Network (ANN) that determines connection to other network nodes. The ANN may use free space propagation link life estimation, inverse modeling for partition prediction, Stochastic Approximation, and/or coarse estimation. The node includes storage storing network tables and matrices indicating network connectivity and connection to other nodes. Also, a wireless communications unit provides for wireless communicating with other nodes.

Claims

1. A node for use in an ad hoc communications network comprising:

an Artificial Neural Network (ANN) element;

a storage unit communicatively coupled to said ANN element; and

a wireless communications unit communicatively coupled to said ANN element.

2. A node as in claim 1, wherein said ANN element determines a link life for direct connection to at least one node.

3. A node as in claim 2, wherein for each directly connected at least one said node, said ANN element determines a relative velocity and determines said link life for each said node based on the respective distance to each said node and a given propagation range.

4. A node as in claim 2, wherein said ANN element determines said link life as the time for said node to separate from another node by said given propagation range.

5. A node as in claim 1, wherein said node includes a locational unit determining a location of said node.

6. A node as in claim 5, wherein said ANN element determines said link life based on the determined said location of said node and a determined location of another directly connected said node and each of said node and said other directly connected said node are moving at known velocities.

7. A node as in claim 6, wherein said ANN element determines a propagation loss relationship responsive to locations of said node and another said node and a link life relationship responsive to said known velocities.

8. A node as in claim 7, wherein said ANN element determines a propagation loss relationship responsive to locations of said node and another said node and a link life relationship responsive to said known velocities.

9. A node as in claim 8, wherein said ANN element determines an expected loss of a direct connection, said expected loss occurring at a zero of the difference of said link life relationship and a maximum propagation range indicated by said propagation loss relationship.

10. A node as in claim 1, further comprising a stochastic approximation engine (SA Engine).

11. A node as in claim 10, wherein SA Engine provides measurement results having both a deterministic component and a random component (ε

) and the form d(x_m, y_m)+ε

_m.

12. A node as in claim 11, wherein said ANN element recursively determines said link life from a relationship having the form D_n+1=D_n−

α

_n{d(x_n,y_n)−

ρ

}, where;

ρ

is a propagation loss threshold

n=0, 1, 2, . . . ;

α

_n is a decreasing sequence of real numbers satisfying;

α

_n→

0, and

Σ

α

_n→

∞

;

d(x_n,y_n)=d(x_n(D_n),y_n(D_n)); and

D_n→

D=ρ

, the spacing between said node and said other directly connected node at said propagation loss threshold.

13. A node as in claim 11, wherein said ANN element recursively determines said link life T for x_n and y_n located at x_n(T_n), y_n(T_n) from a relationship position based time sequence having the form T_n+1=T_n−

α

_n{d(x_n, y_n)−

ρ

}, where;

ρ

is a propagation loss threshold

n=0, 1, 2, . . . ;

α

_n is a decreasing sequence of real numbers satisfying;

α

_n→

0, and

Σ

α

_n→

∞

;

d(x_n,y_n)=d(x_n(T_n),y_n(T_n)); and

T_n→

T as n→

∞

, the link life between said node (x_n) and said other directly connected node (y_n) at said propagation loss threshold.

14. A node as in claim 1, wherein said ANN element further determines a reconnect time for a disconnected one of other said nodes.

15. A node as in claim 1, wherein said node is a cluster leader.

16. A node as in claim 1, wherein said node is a Network Management System (NMS) node managing said ad hoc communications network.

17. A node as in claim 1, further comprising an input/output (I/O) unit, a node user communicating with at least one other said node through said I/O unit.

27. An ad hoc communications network as in claim 17, wherein at least one said node includes a stochastic approximation engine (SA Engine) receiving information indicating propagation losses between a pair of directly connected nodes.

28. An ad hoc communications network as in claim 27, wherein received propagation loss information includes measured and calculated propagation loss information having both a deterministic component and a random component (ε

) of the form d(x_m, y_m)+ε

_m.

29. An ad hoc communications network as in claim 28, wherein said SA Engine recursively determines said link life from a relationship having the form D_n+1=D_n−

α

_n{d(x_n,y_n)−

ρ

}, where;

ρ

is a propagation loss threshold

n=0, 1, 2, . . . ;

α

_n is a decreasing sequence of real numbers satisfying;

α

_n→

0, and

Σ

α

_n→

∞

;

d(x_n,y_n)=d(x_n(D_n),y_n(D_n)); and

D_n→

D=ρ

, the spacing between a directly connected pair of nodes at said propagation loss threshold.

30. An ad hoc communications network as in claim 28, wherein said ANN element uses SA Engine in recursively determining said link life T for a first node (x_n) and second node (y_n) located at x_n(T_n), y_n(T_n) from a relationship position based time sequence having the form T_n+1=T_n−

α

_n{d(x_n, y_n)−

ρ

}, where;

ρ

is a propagation loss threshold

n=0, 1, 2, . . . ;

α

_n is a decreasing sequence of real numbers satisfying;

α

_n→

0, and

Σ

α

_n→

∞

;

d(x_n,y_n)=d(x_n(T_n),y_n(T_n)); and

T_n→

T as n→

∞

, the link life between a first said node and said second node at said propagation loss threshold.

18. An ad hoc communications network comprising:

a plurality of nodes comprising an Artificial Neural Network (ANN), each node in communication with other said nodes of said ad hoc communications network;

a plurality of network clusters, each cluster including one or more nodes of said plurality of nodes, one node in each cluster determining link life for connections for other nodes in said cluster and reconnect times for previously disconnected nodes;

a storage unit in each said node, said node storing network tables and matrices indicating network connectivity, cluster and connectivity connection between said one or more nodes; and

a wireless communications unit in each said node, said node communicating with at least one other said node wirelessly through said wireless communications unit.

19. An ad hoc communications network as in claim 18, wherein one of the plurality of said nodes is a Network Management System (NMS) node managing said ad hoc communications network and at least one other said nodes of the plurality of said nodes are cluster leaders managing communications between a respective cluster and other clusters.

20. An ad hoc communications network as in claim 18, wherein at least one said node determines a relative velocity connection to at least one said node and a link life for each one based on the respective distance from each said node relative to a given propagation range.

21. An ad hoc communications network as in claim 20, wherein said one node determines said link life as the time to separate two nodes from each other by said given propagation range.

22. An ad hoc communications network as in claim 18, wherein each said node of the plurality of said nodes include a locational unit determining a location of each said node.

23. An ad hoc communications network as in claim 22, wherein at least one said node determines said link life based on the determined said location of a first node and a determined location of second directly connected node and each of said first node and said second directly connected node are moving at known velocities.

24. An ad hoc communications network as in claim 23, wherein at least one said node determines a propagation loss relationship responsive to locations of said first node and said second directly connected node and a link life relationship responsive to said known velocities.

25. An ad hoc communications network as in claim 24, wherein at least one said node determines a propagation loss relationship responsive to locations of first node and said second directly connected node and a link life relationship responsive to said known velocities.

26. An ad hoc communications network as in claim 25, wherein at least one said node determines an expected loss of a direct connection, said expected loss occurring at a zero of the difference of said link life relationship and a maximum propagation range indicated by said propagation loss relationship.

31. An ad hoc communications network as in claim 18, wherein at least one of the plurality of said nodes further comprise an input/output (I/O) unit, a node user communicating with said other nodes through said I/O unit.

32. A mobile communications station comprising:

a wireless communications unit;

an Artificial Neural Network (ANN) element connectively coupled to said wireless communications unit; and

a storage unit connectively coupled to said ANN element.

33. A mobile communications station as in claim 32, further comprising a locational unit connectively coupled to said ANN element.

34. A mobile communications station as in claim 33, wherein said locational unit is a Global Positioning Systems (GPS) unit.

35. A mobile communications station as in claim 32, further comprising an input/output (I/O) unit connectively coupled to said ANN element.

36. A mobile communications station as in claim 32, further comprising a stochastic approximation engine (SA Engine) measuring propagation loss with another directly connected mobile communications station and training said ANN element.

37. A mobile communications station as in claim 32, wherein said storage unit having network tables and matrices indicating network connectivity and connection to said other mobile communication stations.

38. A mobile communications station as in claim 32, further comprising being coupled to an unmanned ground vehicle.

39. A mobile communications station as in claim 32, further comprising being coupled to an unmanned air vehicle.