By Topic

A round-2 randomized leader election algorithm and latency for MDVM system

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
$31 $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)
Bagchi, S. ; Sch. of Inf. Technol., Bengal Eng. & Sci. Univ., Shibpur, India ; Das, P.

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 to overcome the resource limitations of clients. This paper proposes a round-2 randomized algorithm to elect a leader and co-leader of the server-group without assuming any particular network topology. The algorithm is implemented and the network-paging latency values of wireless network are measured experimentally. Results indicate that in most cases the algorithm successfully terminates in first round. The network-paging latency values indicate that MDVM system is realizable using 3G/4G wireless communication systems. In addition, the overall message complexity of the algorithm is O(|Na|), where Na is the size of the server-group.

Published in:

Next Generation Web Services Practices, 2005. NWeSP 2005. International Conference on

Date of Conference:

22-26 Aug. 2005