Author:
Bagchi Susmit, ,Rahaman Hafizur,Das Purnendu, ,
Abstract
The future trend in the computing paradigm is marked by mobile computing based on mobile-client/server architecture connected by wireless communication network. However, the mobile computing systems have limitations because of the resource-thin mobile clients operating on battery power. The MDVM system allows the mobile clients to utilize memory and CPU resources of Server-Groups (SG) to overcome the resource limitations of clients in order to support the high-end mobile applications such as, m-commerce and virtual organization (VO). In this paper the concept of MDVM system and the architecture of cellular network containing the SG are discussed. A round-2 randomized distributed algorithm is proposed to elect a unique leader and co-leader of the SG. The algorithm is free from any assumption about network topology, buffer space limitations and is based on dynamically elected coordinators eliminating single point of failure. The algorithm is implemented in distributed system setup and the network-paging latency values of wired and wireless networks are measured experimentally. The experimental results demonstrate that in most cases the algorithm successfully terminates in first round and the possibility of second round execution decreases significantly with the increase in the size of SG (|<I>Na</I>|). The overall message complexity of the algorithm is O(|<I>Na</I>|). The comparative study of network-paging latencies indicates that 3G/4G mobile communication systems would support the realization of MDVM system.
Publisher
Fuji Technology Press Ltd.
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition,Human-Computer Interaction
Reference28 articles.
1. G. Antonoiu and P. K. Srimani, “A Self-Stabilizing Leader Election Algorithm for Tree Graphs,” In the Journal of Parallel and Distributed Computing, 34(2), pp. 227-232, 1996.
2. S. Vasudevan, J. Kurose, and D. Towsley, “Design and Analysis of a Leader Election Algorithm for Mobile Ad-hoc Networks,” In the proc. of 12thIEEE International Conference on Network Protocols, 2004.
3. S. Dulman et al., “Wave Leader Election Protocol for Wireless Sensor Networks,” In proc. of 3rdInternational Symposium on Mobile Multimedia Systems and Applications, pp. 43-50, 2002.
4. S. Vasudevan, B. Decleene, I. Immerman, J. Kurose, and D. Towsley, “Leader Election Algorithms for Wireless Ad-hoc Networks,” DARPA Information Survivability Conference and Exposition, Vol.I, IEEE CS Press, 2003.
5. N. Malpani, J. Welch, and N. Vaidya, “Leader Election Algorithms for Mobile Ad-hoc Networks,” In proc. of 4thInternational Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Boston, 2000.