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

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 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(|N/sub a/|), where N/sub a/ is the size of the server-group.