Dynamically reconfigurable communications network and method

• US 5,974,236 A
• Filed: 08/17/1995
• Issued: 10/26/1999
• Est. Priority Date: 03/25/1992
• Status: Expired due to Term

• Current Assignee: AES Corporation
• Original Assignee: AES Corporation
• Inventors: Sherman, Michael J.
• Primary Examiner(s): Rinehart, Mark H.
• Application Number:
  US08/516,035
• Time in Patent Office: 1,531 Days
• Field of Search: 395/200.1, 395/200.12, 395/200.15, 395/200.16, 395/200.02, 395/200.5, 395/200.51, 395/200.52, 395/200.58, 395/200.72, 395/200.73 , 395/200.75, 395/200.79, 370/255, 370/257, 370/389, 370/408, 370/254, 370/341, 370/913, 370/409, 340/825.02, 340/825.52, 340/826, 340/825.54, 340/825.44, 455/17, 455/18, 455/53.1, 455/56.1, 455/54.1
• US Class Current: 709/221
• CPC Class Codes: H04W 40/125 using a measured number of retransmissions as a link metric
• CPC Class Codes: H04W 40/248 Connectivity information update
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A wireless, dynamically and autonomously reconfigurable link layered communication network and method. The network self-optimizes communication paths within the network. A plurality of communication nodes form the network with each node having a transceiver for receiving and transmitting messages. Prioritized routing lists to all other nodes are stored at each node and updated. Each communication node can be an origination node and a destination node as well as serving as message repeater nodes.

Claims

1. A method for dynamically reconfiguring with or without operator intervention, transmission paths in a link layered wireless communication network containing N communication nodes, between said communication nodes so as to optimize such paths between any two communication nodes, said method comprising the steps of:

(A) Assigning to each communication node a permanent identification, j, and N-1 variable link layer levels, x_j,i, where i is the identification of any other communication node and x_j,i is the minimum number of transmissions required to transmit a message from communication node j to communication node i;

(B) Providing each communication node, j, with means for determining its own link layer levels, x_j,i, and creating its own prioritized routing lists, R_j,i, to any other communication node, i, with both being updated during a received message or an acknowledgment reception by said communication node j from data attached to such received message or acknowledgment, and;

(C) At any time, routing communications between communication node j, having a link layer level x_j,i, and communication node i, having a link layer level x_i,i =0, through x_j,i -1 communication nodes, having descending link layer levels x_k,i, when the message is addressed from the communication node j to the communication node i.

3. The method of claim 1 wherein the means provided for determining a communication node'"'"'s link layer levels x_j,i and creating its routing lists R_j,i includes:

(A) a data controller at each communication node for formatting messages for transmission, that includes in each transmitted message the communication node'"'"'s permanent identification, j, and its link layer levels x_j,i at the time of the transmission;

(B) Transceiver means at j, for monitoring a loop for transmitted messages and acknowledgements and for transmitting messages and acknowledgements;

(C) said data controller having embedded in it software algorithms for determining the link layer level hierarchies between itself and all other communication nodes in the network and updating message routing priority lists, R_j,i for itself to each other communication node i in the network by;

(i) monitoring the loop for any messages and acknowledgements;

(ii) determining a destination'"'"'s permanent identification i, of the message or acknowledgement received as well as the link layer level x_k,i of the transmitting communication node;

(iii) adding to its current routing list R_j,i any such transmitting communication node having a link layer level x_k,i lower than its own link layer level, x_j,i ;

(iv) sorting the routing list R_j,i by link layer level so that the top of the routing list includes the lowest link layer level of such other communication nodes;

(v) resetting its own link layer level, x_j,i , to be the lowest link layer level on the routing list R_j,i plus one; and

,

(vi) in the event that its own routing list, R_j,i is empty, increment its own link layer level, x_j,i, by one, then transmit a message destined to communication node i and repeat steps (i) to (v); and

,

(vii) in the event that an acknowlegement of message receipt is past due from a communication node at the top of its routing list, R_j,i, delete said communication node form said routing list, and then repeat steps (i) to (v) or step (vi).

4. The method of claim 3 wherein the software algorithm for selecting all routing lists R_j,i from the originating communication node having the unique identification j to any destination communication node having a unique identification i and determining the originating communication node'"'"'s link layer levels x_j,i includes maintaining at all communication nodes all master lists M_u, where u are the unique identifications of any then active communication nodes in the network, including i and j, and where M_u is the set of all communication nodes i for which x_u,i =1 said method further comprising the steps of:

(A) Selecting all unique identifications, n, that are common to any two master lists M_u and M_v, where u and v are any unique identifications including j and i;

(B) Creating from all communication nodes pairs {u,w} where w is any communication node in any master list M_u, all the possible linked pairs L_u,v =;

(C) Creating all chains C_j,i of linked pairs L_u,v having as their first pair the unique identification j and a unique identification included in M_j, and having as their last pair a unique identification included M_i and the unique identification i, and when there are more than a first and a last pair in the chain, having each other pair within the chain C_j,i for linked pairs with the pair preceding it and with the pair following it;

(D) From all chains C_j,i so formed, selecting a chain C'"'"'_j,i having the smallest number of pairs; and

,

(E) Creating a routing list R_j,i by selecting the second unique identification in each pair in the chain C'"'"'_j,i in the order they occupy in the said chain; and

,

(F) Setting x_j,i to be the number of pairs in the chain C'"'"'_j,i.

5. The method of claim 3 wherein the software algorithm for selecting all prioritized routing lists R_j,i from an originating communication node having the unique identification j to any destination communication node having a unique identification i and determining the originating communication node'"'"'s link layer levels x_j,i includes maintaining at all communication nodes a list of all then current routing lists R_m,n where m and n are the unique identifications of any then active communication node in the network, including i, said method further comprising the steps of:

(A) Selecting all communication nodes k for which x_j,k =1;

(B) For each communication node j, selecting form all the routing lists R_m,n the routing list R_k,i containing the lowest number of communication nodes;

(C) Setting the routing lists R_j,i to be R_j,i =(k,R_k,i); and

,

(D) Setting the link layer levels to be x_j,i =x_k,i +1.

6. The method of claim 4 wherein the software algorithm for selecting all prioritized routing lists R_j,i from an originating communication node having the unique identification j to any destination communication node having unique identifications i and determining the originating communication node'"'"'s link layer levels x_j,i includes the step of maintaining at all communication nodes a list of all then current routing lists R_k,i where k are the unique identifications of all the communication nodes in M_j ;

and, setting the routing lists R_j,i to be equal to (k,R_k,i) and the link layers levels x_j,i to be equal to x_k,i +1.

19. A method of consolidating into an existing wireless communication network an adjacent wireless communication network both operating at the same transmission frequency comprising the steps of:

A. Assuring that all unique identifications of communication nodes in said adjacent wireless communication network differ from all unique identifications in said wireless existing communication network; and

,

B. Receiving at least one message at one communication node j in said adjacent wireless communication network originating from at least one communication node i in said existing wireless communication network; and

,

C. Receiving at least one message at one communication node i in said existing wireless communication originating from at least one communication node j in said adjacent wireless communication network; and

,

D. From data included in the said received message at the said communication node j in the said adjacent wireless communication network deriving all link layer levels x_j,m and all routing list R_j,m where m is any unique identification of communication nodes in the said existing wireless communication network by setting all link layer levels x_j,m to be x_j,m =x_i,m +1, and by selecting all routing lists R_j,m to be R_j,m =(i,R_i,m); and

,

E. Sending a message from said communication node j in said adjacent wireless communication network to all communication nodes n in said adjacent wireless communication network; and

F. From data included in said messages from communication node j in said adjacent wireless communication network to each communication node n in said adjacent wireless communication network set all link layer levels x_n,i to be x_n,i =x_n,j +x_j,m and select all routing lists R_n,m to be R_n,m =(R_nj,R_j,m); and

G. From data included in the said received message at the said communication node i in said existing wireless communication network deriving all link layer levels x_i,n and all routing lists R_i,n where n is any unique identification of a communication node in the said adjacent wireless communication network by setting all link layer levels x_i,n to be x_i,n =x_j,n +1, and by selecting all routing lists R_i,n to be R_i,n =(j,R_j,n); and

,

H. Sending a message from said communication node i in said existing wireless communication network to all communication nodes m in said existing wireless communication network; and

,

I. From data included in said messages from communication node i in said existing wireless communication network to each communication node m in said existing wireless communication network setting all link layer levels x_m,n to be x_m,n =x_m,i +x_i,n and selecting all routing lists R_m,n to be R_m,n =(R_m,i,R_i,n ; and

,

J. At each communication node in the consolidated wireless communication network, repeating steps (i) to (v) or step (vi) or step (vii) of claim 3 to optimize the routing lists R_m,n and R_n,m.

20. A method of consolidating into an existing wireless communication network an adjacent wireless communication network both operating at the same transmission frequency comprising the steps of:

A. Assuring that all unique identifications of communication nodes in said adjacent wireless communication network differ from all unique identifications in said wireless existing communication network; and

,

B. Receiving at least one message at one communication node j in said adjacent wireless communication network originating from at least one communication node i in said existing wireless communication network; and

,

C. Receiving at least one message at one communication node i in said existing wireless communication network originating from at least one communication node j in said adjacent wireless communication network; and

,

D. From data included in the said received message at the said communication node j in the said adjacent wireless communication network deriving all link layer levels x_j,m and all routing lists R_j,m where m is any unique identification of communication nodes in the said existing wireless communication network by setting all link layer levels x_j,m to be x_j,m =x_i,m +1, and by selecting all routing lists R_j,m to be R_j,m =(i,R_i,m); and

,

E. Sending a message from said communication node j in said adjacent wireless communication network to all communication nodes n in said adjacent wireless communication network; and

F. From data included in said messages from communication node j in said adjacent wireless communication network to each communication node n in said adjacent wireless communication network set all link layer levels x_n,i to be x_n,i =x_n,j +x_j,m and select all routing lists R_n,m to be R_n,m =(R_n,j,R_j,m); and

G. From data included in the said received message at the said communication node i in said existing wireless communication network deriving all link layer levels x_i,n and all routing list R_i,n where n is any unique identification of a communication node in the said adjacent wireless communication network by setting all link layer levels x_i,n to be x_i,n =x_j,n +1, and by selecting all routing lists R_i,n to be R_i,n =(j,R_j,n); and

,

H. Sending a message from said communication node i in said existing wireless communication network to all communication nodes m in said existing wireless communication network; and

,

I. From data included in said messages from communication node i in said existing wireless communication network to all communication node m in said existing wireless communication network setting all link layer levels x_m,n to be x_m,n =x_m,i +x_i,n and selecting all routing lists R_m,n to be R_m,n =(R_m,i,R_i,n); and

,

J. At each communication node in the consolidated wireless communication network optimizing the routing lists R_m,n and R_n,m. by the method of claim 4.

21. A method of consolidating into an existing wireless communication network an adjacent wireless communication network both operating at the same transmission frequency comprising the steps of:

A. Assuring that all unique identifications of communication nodes in said adjacent wireless communication network differ from all unique identifications in said wireless existing communication network; and

,

B. Receiving at least one message at one communication node j in said adjacent wireless communication network originating from at least one communication node i in said existing wireless communication network; and

,

C. Receiving at least one message at one communication node i in said existing wireless communication network originating from at least one communication node j in said adjacent wireless communication network; and

,

D. From data included in the said received message at the said communication node j in the said adjacent wireless communication network deriving all link layer levels x_j,m and all routing lists R_j,m where m is any unique identification of communication nodes in the said existing wireless communication network by setting all link layer levels x_j,m to be x_j,m =x_i,m +1, and by selecting all routing lists R_j,m to be R_j,m =(i,R_i,m); and

,

E. Sending a message from said communication node j in said adjacent wireless communication network to all communication nodes n in said adjacent wireless communication network; and

F. From data included in said messages from communication node j in said adjacent wireless communication network to each communication node n in said adjacent wireless communication network set all link layer levels x_n,i to be x_n,i =x_n,j +x_j,m and select all routing lists R_n,m to be R_n,m =(R_n,j,R_j,m); and

G. From data included in the said received message at the said communication node i in said existing wireless communication network deriving all link layer levels x_i,n and all routing list R_i,n where n is any unique identification of a communication node in the said adjacent wireless communication network by setting all link layer levels x_i,n to be x_i,n =x_j,n +1, and by selecting all routing lists R_i,n to be R_i,n =(j,R_j,n); and

,

H. Sending a message from said communication node i in said existing wireless communication network to all communication nodes m in said existing wireless communication network; and

,

I. From data included in said messages from communication node i in said existing wireless communication network to all communication node m in said existing wireless communication network setting all link layer levels x_m,n to be x_m,n =x_m,i +x_i,n and selecting all routing lists R_m,n to be R_m,n =(R_m,i,R_i,n); and

,

J. At each communication node in the consolidated wireless communication network optimizing the routing lists R_m,n and R_n,m. by the method of claim 5.

22. A method of consolidating into an existing wireless communication network an adjacent wireless communication network both operating at the same transmission frequency comprising the steps of:

A. Assuring that all unique identifications of communication nodes in said adjacent wireless communication network differ from all unique identifications in said wireless existing communication network; and

,

B. Receiving at least one message at one communication node j in said adjacent wireless communication network originating from at least one communication node i in said existing wireless communication network; and

,

C. Receiving at least one message at one communication node i in said existing wireless communication network originating from at least one communication node j in said adjacent wireless communication network; and

,

D. From data included in the said received message at the said communication node j in the said adjacent wireless communication network deriving all link layer levels x_j,m and all routing lists R_j,m where m is any unique identification of communication nodes in the said existing wireless communication network by setting all link layer levels x_j,m to be x_j,m =x_i,m +1, and by selecting all routing lists R_j,m to be R_j,m =(i,R_i,m); and

,

E. Sending a message from said communication node j in said adjacent wireless communication network to all communication nodes n in said adjacent wireless communication network; and

F. From data included in said messages from communication node j in said adjacent wireless communication network to each communication node n in said adjacent wireless communication network set all link layer levels x_n,i to be x_n,i =x_n,j +x_j,m and select all routing lists R_n,m to be R_n,m =(R_n,j,R_j,m); and

G. From data included in the said received message at the said communication node i in said existing wireless communication network deriving all link layer levels x_i,n and all routing list R_i,n where n is any unique identification of a communication node in the said adjacent wireless communication network by setting all link layer levels x_i,n to be x_i,n =x_j,n +1, and by selecting all routing lists R_i,n to be R_i,n =(j,R_j,n); and

,

H. Sending a message from said communication node i in said existing wireless communication network to all communication nodes m in said existing wireless communication network; and

,

I. From data included in said messages from communication node i in said existing wireless communication network to all communication node m in said existing wireless communication network setting all link layer levels x_m,n to be x_m,n =x_m,i +x_i,n and selecting all routing lists R_m,n to be R_m,n =(R_m,i,R_i,n); and

,

J. At each communication node in the consolidated wireless communication network optimizing the routing lists R_m,n and R_n,m. by the method of claim 6.

31. The method of claim 4 further comprising the step of selecting between different routing lists R_j,i to transmit a message from an originating node j to a destination node i, for which x_j,i are equal, a preferred routing list R'"'"'_j,i by selecting the routing list for which the signal received by the originating node from the first node on the routing list is strongest.

32. The method of claims 5 or 6 further comprising the step of selecting between different routing lists R_j,i to transmit a message from an originating node j to a destination node i, for which x_j,i are equal, a preferred routing list R'"'"'_j,i selecting the routing list (k,R_k,i) for which the signal received by the originating node from the node k is strongest.

45. The method of claim 1 further comprising steps for improving critical message reception at the destination node i, from an origination node j under an adverse environment said steps comprising:

(A) Transmitting a critical message from the originating node j to a destination node i through at least two routing lists R_j,i and R'"'"'_j,i where the link layer levels x_j,i and x'"'"'_j,i associated with the routing R_j,i and R'"'"'_j,i respectively, obey the relationship x'"'"'_j,i =x_j,i +1, including in the said critical message a hierarchy segment with a unique message identification m_j,i which is independent of the routing selected for said critical message; and

,

(B) At the destination node i, discarding any message for which a prior message having said unique message identification m_j,i has been received.

51. A method for creating and using a structured message for use in at least some of the communications in a dynamically self reconfiguring network, having at least an originating communication node having a unique identification j, and at least a destination communication node having a unique identification i, said method comprising the steps of:

generating a structured message having a first message segment containing a message content, and generating a second message segment containing network hierarchial information, including at least unique identifications of an originating communication node and a destination communication node of said structured message with the originating node having a link layer level x_j,i, where x_j,i is the minimum number of transmissions required to transmit the message between said nodes, and a routing R_j,i used in transmitting said message, said second message segment also containing at least then effective routing lists R_k,i where k are all the unique identifications of communication nodes within a master list M_j of the originating communication node having a unique identification j, and i is the unique identification of any other communication node except the originating communication node and the communication nodes in M_j, and sending the structured message from an originating communication node j to any destination node i at predetermined time intervals t_j,i, if the time from the last communication between the communication nodes j and I exceeds such predetermined time interval t_j,i whereby optimal communication paths are maintained in the network and determining a new communication node'"'"'s link layer levels X_j,i and its routing lists R_j,i according to the method of claim 1.

52. A method for creating and using a structured message for use in at least some of the communications in a dynamically self reconfiguring network, having at least an originating communication node having a unique identification j, and at least a destination communication node having a unique identification i, said method comprising the steps of:

generating a structured message having a first message segment containing a message content, and generating a second message segment containing network hierarchial information, including at least unique identifications of an originating communication node and a destination communication node of said structured message with the originating node having a link layer level x_j,i, where x_j,i is the minimum number of transmissions required to transmit the message between said nodes, and a routing R_j,i used in transmitting said message, said second message segment also containing at least then effective routing lists R_k,i where k are all the unique identifications of communication nodes within a master list M_j of the originating communication node having a unique identification j, and i is the unique identification of any other communication node except the originating communication node and the communication nodes in M_j, and sending the structured message from an originating communication node j to any destination node i at predetermined time intervals t_j,i, if the time from the last communication between the communication nodes j and I exceeds such predetermined time interval t_j,i whereby optimal communication paths are maintained in the network and determining a new communication node'"'"'s link layer levels X_j,i and its routing lists R_j,i according to the method of claim 3.

53. A method for creating and using a structured message for use in at least some of the communications in a dynamically self reconfiguring network, having at least an originating communication node having a unique identification j, and at least a destination communication node having a unique identification i, said method comprising the steps of:

generating a structured message having a first message segment containing a message content, and generating a second message segment containing network hierarchial information, including at least unique identifications of an originating communication node and a destination communication node of said structured message with the originating node having a link layer level x_j,i, where x_j,i is the minimum number of transmissions required to transmit the message between said nodes, and a routing R_j,i used in transmitting said message, said second message segment also containing at least then effective routing lists R_k,i where k are all the unique identifications of communication nodes within a master list M_j of the originating communication node having a unique identification j, and i is the unique identification of any other communication node except the originating communication node and the communication nodes in M_j, and sending the structured message from an originating communication node j to any destination node i at predetermined time intervals t_j,i, if the time from the last communication between the communication nodes j and I exceeds such predetermined time interval t_j,i whereby optimal communication paths are maintained in the network and determining a new communication node'"'"'s link layer levels X_j,i and its routing lists R_j,i according to the method of claim 4.

54. A method for creating and using a structured message for use in at least some of the communications in a dynamically self reconfiguring network, having at least an originating communication node having a unique identification j, and at least a destination communication node having a unique identification i, said method comprising the steps of:

generating a structured message having a first message segment containing a message content, and generating a second message segment containing network hierarchial information, including at least unique identifications of an originating communication node and a destination communication node of said structured message with the originating node having a link layer level x_j,i, where x_j,i is the minimum number of transmissions required to transmit the message between said nodes, and a routing R_j,i used in transmitting said message, said second message segment also containing at least then effective routing lists R_k,i where k are all the unique identifications of communication nodes within a master list M_j of the originating communication node having a unique identification j, and i is the unique identification of any other communication node except the originating communication node and the communication nodes in M_j, and sending the structured message from an originating communication node j to any destination node i at predetermined time intervals t_j,i, if the time from the last communication between the communication nodes j and I exceeds such predetermined time interval t_j,i whereby optimal communication paths are maintained in the network and determining a new communication node'"'"'s link layer levels X_j,i and its routing lists R_j,i according to the method of claim 5.

55. A method for creating and using a structured message for use in at least some of the communications in a dynamically self reconfiguring network, having at least an originating communication node having a unique identification j, and at least a destination communication node having a unique identification i, said method comprising the steps of:

generating a structured message having a first message segment containing a message content, and generating a second message segment containing network hierarchial information, including at least unique identifications of an originating communication node and a destination communication node of said structured message with the originating node having a link layer level x_j,i, where x_j,i is the minimum number of transmissions required to transmit the message between said nodes, and a routing R_j,i used in transmitting said message, said second message segment also containing at least then effective routing lists R_k,i where k are all the unique identifications of communication nodes within a master list M_j of the originating communication node having a unique identification j, and i is the unique identification of any other communication node except the originating communication node and the communication nodes in M_j, and sending the structured message from an originating communication node j to any destination node i at predetermined time intervals t_j,i, if the time from the last communication between the communication nodes j and I exceeds such predetermined time interval t_j,i whereby optimal communication paths are maintained in the network and determining a new communication node'"'"'s link layer levels X_j,i and its routing lists R_j,i according to the method of claim 6.

56. The network of claim 52 in which local equipments at the remote communication nodes comprises a plurality of security detectors and annunciators and wherein the network is a security network.

57. The network of claim 54 in which local equipments at the remote communication nodes comprises a plurality of security detectors and annunciators and wherein the network is a security network.

58. The network of claim 52 in which local equipments at the remote communication nodes comprises a plurality of sensors and actuators and wherein the network is an energy management system.

59. The network of claim 54 in which local equipments at the remote communication nodes comprises a plurality of sensors and actuators and wherein the network is an energy management system.

2. A method of conveying within a wireless network information about the network'"'"'s communication hierarchy utilizing for at least part of the communications a structured message having at least a network hierarchy information segment containing a unique identification of an originating communication node j, a destination communication node i and the then current link layer levels x_j,i, and a message content segment said method comprising the steps of:

(A) Including in the structured message'"'"'s network hierarchy information segment at least all then current lists M_u, where u is any communication node in the network and where each list M_u includes all communication nodes n, for which the link level x_u,u =1; and

/or,

(B) Including in the structured message'"'"'s network hierarchy information segment at least a list of all then effective routing lists R_j,i from the originating communication node j, to any other communication node i; and

/or

(C) Including in the said structured message'"'"'s hierarchy information segment at least a list of all then effective routing lists R_n,m from any communication node n to any other communication node m.

7. A dynamically self reconfiguring wireless communication network comprising a plurality of communication nodes each having a permanent unique identification and variable link layer levels x_j,i, said x_j,i being the minimum number of transmissions required to retransmit a message from any communication node having a unique identification j to any other communication node having a unique identification i, with each communication node having data transmission and reception means, and each communication node having data control and processing means for determining its own link layer levels x_j,i and routing lists R_j,i from messages it receives.

24. The wireless communication network of claim 7 in which only a subset of communication nodes having unique identifications, d, can act as destination nodes to all other communication nodes.

25. The wireless communication network of claim 24, where the subset of communication nodes having unique identifications, d, consists at any given time of a single communication node, the network'"'"'s central communication node.

26. A method of shifting the central communication node functions in a wireless communication network of claim 25 from a then central communication node having a unique identification, d, to any one of other potential central communication nodes having unique identifications, e, comprising the steps of:

A. Maintaining at all communication nodes, j, routing lists R_j,d and R_j,e to all possible central communication nodes having unique identifications, d for the then central communication node, and e for the potential central communication nodes; and

B. Transmitting a message from said central communication node having the unique identification, d, to all communication nodes in the network; and

,

C. In said message providing a directive removing from the then current routing lists at each communication node, j, the routing lists R_j,d and establish as the only routing lists at each communication j, the routing lists R_j,e where e is the unique identification of the new central communication node.

27. The wireless self reconfiguring communication network of claim 24 wherein the functions of the central communication node can be shifted to any one communication node of a predetermined subset of the communication nodes in the network.

29. The wireless communication network of claim 7 in which at least a subset of the communication node can have repeater function R deactivated at least some of the time.

30. The wireless communication network of claim 29 wherein said subset comprises mobile communication nodes that can be immobilized, said mobile communication nodes having their R function "Off" when mobile and "On" when immobilized.

33. The wireless self reconfiguring communication network of claim 7 in which a preferred routing list is determined by selecting the shortest list with the strongest reception.

34. A method of consolidating a plurality of wireless communication sub networks as in claim 25, each operating at transmission frequencies that are not necessarily the same, into a single wireless communication network in which all communication nodes can communicate with each other comprising the steps of:

A. Providing the central communication node in each of said sub networks with a frequency agile transceiver capable of operating at least at the said sub network frequency and at another frequency; and

B. Establishing routing lists between all the central communication nodes of the sub networks and creating from said central communication nodes a principal network of claim 7, in which messages are transmitted at the said another frequency, the principal network'"'"'s frequency; and

,

C. Routing all messages within the sub network as if the sub network were a network of claim 7 at said sub network operating frequency; and

D. Routing all messages whose originating node and destination nodes are in different sub networks, first to the central communication node of the originating node'"'"'s sub network at the said sub network frequency, then transmitting said message at the principal network frequency to the central communication node of the sub network to which the destination node belongs, and then transmitting said message to the destination node at the destination node'"'"'s sub network frequency; and

E. Maintaining at all central communication nodes a list of all communication nodes in the network including with each its unique identification and the designation of its sub network.

35. A wireless self reconfiguring communication network of a plurality of geographically incongruent sub networks of claim 7, each operating at frequencies that are not necessarily the same, each sub network of claim 7, having at least one communication node having a frequency agile transceiver capable of operating at its sub network frequency and at another frequency, the principal network frequency.

36. The network of claim 35 wherein some of the sub networks that operate at different frequencies from each other are geographically congruent.

39. The wireless communication network of claim 7 in which at least one directive can be implemented simultaneously within the network.

46. The network of claim 25 in which the central communication node is associated with an energy management system capable of providing directives to remote communication nodes'"'"' to activate or deactivate local equipment in response to inputs transmitted from said local equipment to the central communication node.

47. The network of claim 25 in which the central communication node is associated with a process control system capable of providing directive to remote communication nodes'"'"' to activate or deactivate local equipment in response to inputs transmitted from said local equipment to the central communication node.

48. The network of claim 46 wherein each communication node contains a transceiver operating at infrared frequencies.

49. The network of claim 47 wherein the communication node contains a transceiver operating at infrared frequencies.

8. A method for creating a structured message for use in at least some of the communications in a dynamically self reconfiguring network, having at least an originating communication node having a unique identification j, and at least a destination communication node having a unique identification i, said method comprising the steps of:

generating a structured message having a first message segment containing a message content, and generating a second message segment containing network hierarchial information, including at least unique identifications of an originating communication node a destination communication node of said structured message with the originating node having a link layer level x_j,i, where x_j,i is the minimum number of transmissions required to transmit the message between said nodes, and a routing R_j,i used in transmitting said message.

9. The method of claim 8 wherein the second message segment containing hierarchial information also contains at least all master list M_u, said master lists each containing all unique identifications n of communication nodes having unique identification n for which x_u,n =1, and u is the unique identification of any communication node.

10. The method of claim 8 wherein the second message segment containing hierarchial information also contains at least all then effective routing lists R_m,n between any two communication nodes having unique identifications m and n.

11. The method of claim 8 wherein the second message segment containing hierarchial information also contains at least then effective routing lists R_k,i where k are all the unique identifications of communication nodes within a master list M_j of the originating communication node having a unique identification j, and i is the unique identification of any other communication node except the originating communication node and the communication nodes in M_j.

12. The method of claim 9 further comprising the steps of sending a structured message form an originating communication node j to any destination node i at predetermined time intervals t_j,i, if the time from the last communication between the communication nodes j and i exceeds such predetermined time interval t_j,i whereby optimal communication paths are maintained in the network.

13. The method of claim 10 further comprising the steps of sending a structured message from an originating communication node j to any destination node i at predetermined time intervals t_j,i, if the time from the last communication between the communication nodes j and i exceeds such predetermined time interval t_j,i whereby optimal communication paths are maintained in the network.

14. The method of claim 11 further comprising the steps of sending a structured message from an originating communication node j to any destination node i at predetermined time intervals t_j,i, if the time from the last communication between the communication nodes j and i exceeds such predetermined time interval t_j,i whereby optimal communication paths are maintained in the network.

15. A dynamically self reconfiguring wireless communication network comprising a plurality of communication nodes each having a permanent unique identification and variable link layer levels x_j,i, said x_j,i being the minimum number of transmissions required to retransmit a message from any communication node having a unique identification j to any other communication node having a unique identification i, each communication node having data transmission and reception means, and each communication node having data control and processing means for determining its own link layer levels x_j,i and routing lists R_j,i from messages it receives and in which optimal communication paths are maintained by transmitting at predetermined time intervals t_j,i messages structured according to claim 9 between any originating node j and any destination node i.

16. A dynamically self reconfiguring wireless communication network comprising a plurality of communication nodes each having a permanent unique identification and variable link layer levels x_j,i, said x_j,i being the minimum number of transmissions required to retransmit a message from any communication node having a unique identification j to any other communication node having a unique identification i, each communication node having data transmission and reception means, and each communication node having data control and processing means for determining its own link layer levels x_j,i and routing lists R_j,i from messages it receives and in which optimal communication paths are maintained by transmitting at predetermined time intervals t_j,i messages structured according to claim 10 between any originating node j and any destination node i.

17. A dynamically self reconfiguring wireless communication network comprising a plurality of communication nodes each having a permanent unique identification and variable link layer levels x_j,i, said x_j,i being the minimum number of transmissions required to retransmit a message from any communication node having a unique identification j to any other communication node having a unique identification i, each communication node having data transmission and reception means, and each communication node having data control and processing means for determining its own link layer levels x_j,i and routing lists R_j,i from messages it receives and in which optimal communication paths are maintained by transmitting at predetermined time intervals t_j,i messages structured according to claim 11 between any originating node j and any destination node i.

40. The wireless communication network of claim 11 wherein said at least one directive is a change in an encryption algorithm.

41. The wireless communication network of claim 40 wherein a network wide encryption algorithm can be changed at predetermined time intervals.

42. A wireless communication network of claim 40 where the time intervals between changes in encryption algorithms is a variable that depends at least partially on communication patterns experienced by the network in a most recent predetermined time interval.

43. A wireless communication network of claim 40 where the encryption algorithm is at least partially determined from communication patterns experienced by the network in a most recent predetermined time interval.

18. A method for incorporating a new communication node in the wireless communication network comprising the steps of:

A. Assigning to the new communication node a permanent unique identification j, different from any unique identifications of communication nodes within said network and variable link layer levels, x_j,i, where i is the unique identification of any other communication node in said network, and x_j,i is the minimum number of transmissions required to transmit a message from the new communication node j to any other communication node i in the network, and;

B. Providing said new communication node, j, with means for determining its own link layer levels, x_j,i and creating its own prioritized routing lists, R_j,i, to any other communication node, i, in said network with both being updated during a message or acknowledgment reception by said communication node j from data attached to such received message or acknowledgment, and;

C. At any time, routing communications between the communication node j, having a link layer level x_j,i, and a communication node i, having a link layer level x_i,i =0, through x_j,i -1 transceivers in said network, having descending link layer levels x_k,i, when the message is addressed from the new communication node j to the communication node i in the network.

23. A method for converting a self reconfiguring wireless communication network to a network having only a subset of communication nodes having unique identifications, d, as possible destination nodes for all other communication nodes in the network, while said subset of communication nodes having unique identifications, d, maintains the ability to use as destinations nodes all communications nodes in the network, comprising the steps of:

A. Transmitting a message from at least one of said communication nodes having unique identifications, d, to all communication nodes having unique identifications, s, which are not in said subset; and

B. In said message providing a list of all said comminication nodes having unique identifications, s; and

,

C. In said message providing a directive removing from the then current routing lists at each communication node, j, which does not have one of the unique identifications, d, all rounting lists R_j,s.

28. A method of switching on and off the repeating function of at least one communication node having a unique identification, m, in a self reconfiguring wireless network, comprising the steps of:

A. Assigning to said communication node having a unique identification m, a repeater function, R, with the values "On" and "Off"; and

,

B. Setting the value of R to "On" when said communication node acts as a repeater and to "Off" when said communication node'"'"'s repeater function is deactivated; and

C. In all messages transmitted by said communication node m, including the status of the function R in the message'"'"'s network hierarchy segment; and

,

D. Transmitting a message from the communication node m to all communication nodes in the network whenever a change in the status of the function R occurs; and

E. At any communication node j in the network selecting only routing lists R_j,i having as their elements communication nodes that do not have an R function or with their R function having a value "On", except that the destinations nodes, i, can be any communication node in the network.

37. A method of providing in a wireless communication network at least one network wide directive that is implemented simultaneously throughout the network comprising the steps of:

A. Providing each communication node in the network with means for determining a network wide synchronous time; and

B. at a given time t₀, transmitting a message to all communication nodes in the network which includes said at least one directive with a command to implement said at least one directive at a future time t₁, so that the time interval t₁ -t₀ is larger than the time interval required for the message to be received by all communication nodes in the network.

38. The method of claim 37 wherein the means for determining a network wide synchronous time is a global positioning system receiving its time signal from dedicated satellites.

44. A method for authenticating the origin of a message in a wireless communication network comprising the steps of:

A. Assigning to each message a unique identification, m_j,i where j is the unique identification of the originating node and i the unique identification of the destination node, and m_j,i includes j and i and a sequential identifier; and

,

B. Including in the hierarchy segment of said message the unique identification m_ij of said message; and

,

C. Incrementing the sequential identifier with each transmission from said originating node j to said destination node i; and

,

D. Comparing at the destination node i the message'"'"'s sequential identifier to the sequential identifier of the most recent message from originating node j; and

,

E. Declaring as non authentic any messages that have no message unique identification, or have incorrect identification or in which the sequential identifier is out of sequence.

50. A data controller for storing a structured message comprising:

a memory apparatus

a structured message for use in at least some of the communications in a dynamically self reconfiguring network, having at least an originating communication node having a unique identification j, and at least a destination communication node having a unique identification I, such structured message comprising at least two segments, a first message segment being a message content segment and a second message segment containing network hierarchial information, including at least the unique identifications of the originating communication node and the destination communication node of said structured message, with the originating node'"'"'s link layer level being x_j,i, where x_j,i is the minimum number of transmissions required to transmit the structured message between said nodes, and the routing R_j,i used in transmitting said structured message, said structured message being stored in said memory apparatus for subsequent transmission.

60. The data controller of claim 50 wherein the structured message hierarchial information segment also contains at least all master list M_u, said master lists each containing all unique identifications n of communication nodes having unique identification n for which x_u,n =1, and u is the unique identification of any communication node.

61. The data controller of claim 50 wherein the structured message hierarchial information segment also contains at least all the then effective routing lists R_m,n between any two communication nodes having unique identifications m and n.

62. The data controller of claim 50 wherein the structured message hierarchial information segment also contains at least the then effective routing lists R_k,i where k are all the unique identifications of communication nodes within the master list M_j of the originating communication node having a unique identification j, and i is the unique identification of any other communication node except the originating communication and the communication nodes in M_j.