C. Skawratananond, N. Mittal, and V. K. Garg. A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems. Technical Report TR-PDS-1998-11, Parallel and Distributed Systems Group, University of Texas at Austin, November 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....can be delivered in any order if m1 :t k m2 :t. Causal message ordering has been an active research topic in many areas such as distributed databases, realtime systems, and fault tolerant systems. Examples include solutions for distributed systems in general [15, 25] for mobile computing systems [22, 27], and as part of total ordering multicast protocols with support for causal order delivery of messages from multiple sources [2, 7, 10, 20] However, causal message ordering is not sufficient in wireless sensor networks, since it is based on logical time. 4. THE TEMPORAL MESSAGE ORDERING SCHEME ....

C. Skawratananond, N. Mittal, and V. K. Garg. A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems. Technical Report TR-PDS-1998-11, Parallel and Distributed Systems Group, University of Texas at Austin, November 1998.

....guided by the AAA MOM (presented in section 3.1) which has led us to propose the applicativ causality in section 4. We conclude in section 5. 2 Related work Many solutions have been proposed to offer causal ordering on distributed application for mobile computing (a summary can be found in [5]) Although these solutions are well suited to mobile platforms like cellular phones (which must communicate through a Mobile qupporl qlalion) or smart cards, they are not appropriate for autonomous mobile platforms like PDAs which can communicate together in disconnected mode. C.Baquero [6] ....

C. Skawratananond, N. Mittal, and V. K. Garg. Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems. Technical Report TR-PDS-1998-011, The University of Texas at Austin, 1998. available via ftp or WWW at maple.ece.utexas.edu as technical report TR-PDS-1998-011.

....relationships (i.e. real world messages ) between these events cannot be captured by the WSN. Therefore, causal delivery mechanisms [13, 24] based on logical time are not applicable for our purposes in WSN. For the same reasons, previous work on causal order delivery in mobile computing systems [20, 28] is not applicable in settings, where we are interested in temporal relationships between real world events. The ideas for group subscriptions are related to content based messaging and systems implementing it [4, 6, 26] Basic routing and distance estimation in RETO is based on the work on ....

C. Skawratananond, N. Mittal, and V. K. Garg. A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems. Technical Report TR-PDS-

....:dlv) 3 Sufficient Conditions Theorem 1 : A mobile computation with static MHs is causally ordered if (C 1 ) all wireless channels are FIFO, C 2 ) messages in the wired network are causally ordered, and (C 3 ) each MSS sends out messages in the order they are received. The proof is provided in [15]. Condition C 2 can be formally expressed as (CO 0 ) m i :snd s m j :snd ) m j :dlv OE s m i :dlv) Sufficient conditions given in Theorem 1 were implicitly used in [3] For systems with multiple static hosts, Theorem 1 gives a lightweight protocol for causal message ordering. In the ....

....to the maximum of its original value and the value of the corresponding element in M (also piggybacked on m) This prevents any outgoing message from h d to become causally dependent on m that is sent before m is received by h d . For more detailed description of the static module, please refer to [15]. Section 5 gives the formal condition implemented by our static module. 4.2 Handoff Module In order to ensure causally ordered message delivery, some steps have to taken during handoff after an MH moves from one cell to another. This can be illustrated by the following example. Let m 1 and m 2 ....

[Article contains additional citation context not shown here]

C. Skawratananond, N. Mittal, and V. K. Garg. A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems. Technical Report TR-PDS-1998011, PDS Lab, University of Texas at Austin, USA, November 1998.

No context found.

C. Skawratananond, N. Mittal, and V. K. Garg. A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems. Technical Report TR-PDS-1998-11, Parallel and Distributed Systems Group, University of Texas at Austin, November 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC