Causal algorithms for mobile distributed systems without unnecessary inhibition in the message delivery.

Where n = number of MHs, s = number of BSs, c is the number of bytes used to represent a integer value, b is the number of bits used to represent a byte, k is a predetermined integer parameter, ε is the length of the longest dependency sequence for a MH, li represents the number of messages sent by base station BSi and for which the delivery is not yet confirmed and LastRcv is a control information structure that stores identifiers of messages received by a MH.