Algorithm for Ordering of Message in Mobile Computing Environment

Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination process (es), need be sent with each message. By eliminating other kinds of control information from the messages, the communication overheads can be significantly reduced. This paper presents an algorithm that uses this knowledge to efficiently enforce causal ordering of messages. The proposed algorithm does not require any prior knowledge of the network communication pattern .The algorithm can be employed in a variety o f distributed computing environments. Its energy efficiency and low bandwidth requirement make it especially suitable for mobile computing systems.