Application of the Quorum Theory to the Mutual Exclusion Problem in a Mobile Computing

M. Redjimi, F. Dahamni, A. M'zoughi, M. Lalam, A. Henni, and M. Belkadi (Algeria)

Keywords

Mobile computing, Quorum, Mobility, Mutual exclusion, distributed System, Critical Section, Critical Resource, Twothirds, Wireless.

Abstract

In this paper, we propose the application of the theory of the Quorum to solve the problem of mutual exclusion in a mobile computing. In order to reduce the participation of the portable machines in the execution of the algorithm and to defer this one on their fixed station, we use the principle of the Two-thirds. Moreover, to reduce the number of exchanged messages in order to obtain the authorization access to a critical resource, we distribute the system sites on several subsets whose intersection is nonempty. Finally, we have some results of the execution of the proposed algorithm on the platform of simulation of networks "Network Simulator2 "[1]. of a site is proportional to the size of the quorum. As a result, it is necessary to organize the sites in a logical structure in order to reduce the size of the quorum. In what follows, we present the model of implementation, the proposed algorithm , the discussion and a simulation. 2. Model The model used is the cellular one [4][5][6][7][8] [9]. It is made of a fixed part with basic stations distributed on the cells unit, and of a mobile part represented by the unit of the mobile host. In this model, each support of a mobile station MSS (Mobile Support Station) has a table containing a specific identity of each local mobile. The fixed network, presumedly reliable, delivers messages, sequentially, to the MSSs with an arbitrary latency. The wireless network ensures a FIFO connection for the messages between the MSS and the local MHs (Mobile Hosts).

Important Links:



Go Back