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: 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.