Dynamically reconfigurable communications network and method
First Claim
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, xj,i, where i is the identification of any other communication node and xj,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, xj,i, and creating its own prioritized routing lists, Rj,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 xj,i, and communication node i, having a link layer level xi,i =0, through xj,i -1 communication nodes, having descending link layer levels xk,i, when the message is addressed from the communication node j to the communication node i.
2 Assignments
0 Petitions
Accused Products
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.
-
Citations
62 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, xj,i, where i is the identification of any other communication node and xj,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, xj,i, and creating its own prioritized routing lists, Rj,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 xj,i, and communication node i, having a link layer level xi,i =0, through xj,i -1 communication nodes, having descending link layer levels xk,i, when the message is addressed from the communication node j to the communication node i. - View Dependent Claims (3, 4, 5, 6, 19, 20, 21, 22, 31, 32, 45, 51, 52, 53, 54, 55, 56, 57, 58, 59)
-
-
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 xj,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 Mu, where u is any communication node in the network and where each list Mu includes all communication nodes n, for which the link level xu,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 Rj,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 Rn,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 xj,i, said xj,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 xj,i and routing lists Rj,i from messages it receives.
-
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 xj,i, where xj,i is the minimum number of transmissions required to transmit the message between said nodes, and a routing Rj,i used in transmitting said message.
- View Dependent Claims (9, 10, 11, 12, 13, 14, 15, 16, 17, 40, 41, 42, 43)
-
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, xj,i, where i is the unique identification of any other communication node in said network, and xj,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, xj,i and creating its own prioritized routing lists, Rj,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 xj,i, and a communication node i, having a link layer level xi,i =0, through xj,i -1 transceivers in said network, having descending link layer levels xk,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 Rj,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 Rj,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 t0, 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 t1, so that the time interval t1 -t0 is larger than the time interval required for the message to be received by all communication nodes in the network. - View Dependent Claims (38)
-
-
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, mj,i where j is the unique identification of the originating node and i the unique identification of the destination node, and mj,i includes j and i and a sequential identifier; and
,B. Including in the hierarchy segment of said message the unique identification mij 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 xj,i, where xj,i is the minimum number of transmissions required to transmit the structured message between said nodes, and the routing Rj,i used in transmitting said structured message, said structured message being stored in said memory apparatus for subsequent transmission. - View Dependent Claims (60, 61, 62)
-
Specification