Abstract: A mobile communication system which consists of a plurality of MANETs and nodes, which comprises a transceiver at each node. Each transceiver is a combination of a hopping transmitter operating according to a predetermined hopping sequence and rate and a wideband reference receiver, that can simultaneously receive at once, the whole operating band assigned to the system. Each transceiver further includes a circuitry for reallocating simultaneously receiving channels, dynamically spread over a wideband frequency range and circuitry for determining transmission hopping patterns to use the least possible number of frequencies according to the active population status of nodes that belong to the plurality of MANETs.

Abstract: A potentially interfering node updatable database associated with the MAC, in each node, contains a limited number of unique identification numbers (UNIDs) referring to nodes likely to interfere with the transmission of the node. Typically these UNIDs are one or two hop neighbors. In addition to the actual nodes, the database also contains unique ID numbers of dummy nodes. Practically, the node database does not distinguish between real or dummy nodes. Selecting a certain node to transmit at a certain TS is brought about by a “which node is to transmit in the next TS” (WINIT) function. This function takes into account all the UNIDs available in the UNID databases of the different nodes. When the WINIT selects a specific UNID to be active in the upcoming TS, the relevant MAC element in the respective node, invokes the transmission.

Abstract: A mobile communication system which consists of a plurality of MANETs and nodes, which comprises a transceiver at each node. Each transceiver is a combination of a hopping transmitter operating according to a predetermined hopping sequence and rate and a wideband reference receiver, that can simultaneously receive at once, the whole operating band assigned to the system. Each transceiver further includes a circuitry for reallocating simultaneously receiving channels, dynamically spread over a wideband frequency range and circuitry for determining transmission hopping patterns to use the least possible number of frequencies according to the active population status of nodes that belong to the plurality of MANETs.

Abstract: A method for servicing a multiplicity of different queues in a node of a network, in which packets are sent over a time slotted communications channel, while keeping the quality of service (QoS) for each different queue. Incoming packets are classified first to different QoS. Then at least some of the incoming packets are fragmented into fragments. Further, the fragments are assigned to the respective queues. The incoming fragments of packets are populated in time slots, in an order determined by a queue order list (QOL). Each fragment of a packet populated with another fragment of a same packet in a same time slot, has no overhead except for one fragment of that same fragmented packet in the time slot, the overhead of which is retained.

Abstract: A potentially interfering node updatable database associated with the MAC, in each node, contains a limited number of unique identification numbers (UNIDs) referring to nodes likely to interfere with the transmission of the node. Typically these UNIDs are one or two hop neighbours. In addition to the actual nodes, the database also contains unique ID numbers of dummy nodes. Practically, the node database does not distinguish between real or dummy nodes. Selecting a certain node to transmit at a certain TS is brought about by a “which node is to transmit in the next TS” (WINIT) function. This function takes into account all the UNIDs available in the UNID databases of the different nodes. When the WINIT selects a specific UNID to be active in the upcoming TS, the relevant MAC element in the respective node, invokes the transmission.

Abstract: The method of the invention is implemented in ad hoc communications network employing at least two-hop routing and wherein each node in the network employs an omnidirectional send/receive capability. Each node keeps a near neighbour database (NND) updated by receiving of messages. Each Othernode in the network, the message of which was received by Mynode in a time period T, is a candidate for becoming a relay for transmitting Mynode's messages. The probability of an Othernode to become a relay for Mynode is higher for a larger amount of candidates Othernode has in its NND. The probability for the Othernode to become a relay is higher the larger its distance from Mynode.