By Topic

Causal ordering in distributed mobile systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Alagar ; Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA ; S. Venkatesan

There is a growing trend towards using mobile computing environment for several applications, and it is important that the mobile systems are given adequate support both at the systems level and at the communication level. Causal ordering is a useful property, particularly in applications that involve human interactions. (Such applications are common in mobile computing environments.) In this paper, we present three algorithms for causal ordering in mobile systems. The first algorithm handles the resource constraints of the mobile hosts, but the system is not easily scalable with respect to the number of mobile hosts and is not graceful to host disconnections and connections. Our second algorithm eliminates the above disadvantages at the cost of inhibiting some messages. The third algorithm is a combination of the first two algorithms

Published in:

IEEE Transactions on Computers  (Volume:46 ,  Issue: 3 )