Abstract: An ad-hoc network comprising multiple nodes in, each node including a transmitter, a receiver, a tactical database, storing a partition of the geographical area into multiple cells, each cell is associated with coordinates in a geographical coordinate system, storing tactical data the nodes, a geographical cell processor for identifying the geographical position of the node in associating the node with one of the geographical cells, a situation awareness and collision avoidance messages processor for transmitting/receiving situation awareness messages, the situation awareness messages include the node identification representation, the node geographical position and the node protocol information the node, together with additional of the nodes being defined as cell members of the geographical cell, the cell-member is determined a cell-representative for the geographical cell, the cell-representative, transmits cell-representative messages, to nodes that are within a determined distance from the cell-representa

Abstract: An efficient distributed technique for setting up, taking down, and updating connections in a communications network, which is robust in the presence of failures. More specifically with this invention a path for a connection is computed and reservation requests are simultaneously sent through separate channels to each of a set of nodes of the path for the connection to reserve and determine if resources are available for the connection. Upon acknowledgement that the links for the connection are available and have been reserved, a setup message is sequentially transmitted between the adjacent nodes along the path until the setup messages reaches the destination node. The switches in each node then configure themselves in response to the setup message so as to establish the connection.

Abstract: A method of discarding unwanted data packets from a communication network of the type having a multitude of nodes connected together to form a circular network. Each node has an address, and each data packet includes a plurality of address subfields to identify addresses of one or more of said nodes. The method comprises the steps of dividing the network into a plurality of segments such that each of the network segments is adjacent at least another of the network segments, assigning each of the network segments one of a plurality of subspace values such that adjacent network segments have different subspace values, and assigning to each address subfield one of the plurality of subspace values.