Managing dynamic groups of mobile systems

Since road networks are the backbone of transportation and personal mobility, congestions are a severe problem. Improving the utilization of existing roads by scheduling shared resources, e.g. crossroads, more efficiently is a promising approach to alleviate the problem. We have developed an architecture allowing mobile systems to schedule shared resource in real-time based on wireless communication. In this paper, we present two membership protocols, which are at the core of this architecture. The protocols allow mobile systems to join and leave a group with predictable delay. A synchronous system model with omission failures describes the dynamic properties of the medium. The protocols exploit application knowledge to allocate bandwidth to joining stations dynamically yet predictably. Nevertheless, they can be converted to a general solution if predictable join delays are not a requirement.

[1]  Rogério de Lemos,et al.  A robust group membership algorithm for distributed real-time systems , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[2]  Edgar Nett,et al.  Reliable Real-Time Communication in Cooperative Mobile Applications , 2003, IEEE Trans. Computers.

[3]  Edgar Nett,et al.  Reliable real-time cooperation of mobile autonomous systems , 2001, Proceedings 20th IEEE Symposium on Reliable Distributed Systems.

[4]  Flaviu Cristian,et al.  Synchronous and asynchronous , 1996, CACM.

[5]  Matti A. Hiltunen,et al.  Properties of membership services , 1995, Proceedings ISADS 95. Second International Symposium on Autonomous Decentralized Systems.

[6]  Flaviu Cristian,et al.  Synchronous and Asynchronous Group Communication. , 1996 .

[7]  Anees Shaikh,et al.  RTCAST: lightweight multicast for real-time process groups , 1996, Proceedings Real-Time Technology and Applications.