DISTRIBUTED COMPUTING IN MOBILE

ENVIRONMENT
Apekshit Sharma, Chandrakant Sharma
ABSTRACT
o This paper considers central issues of distributed computing in a mobile environment.
Its aim is to light on the first brick of a common view for mobile systems.
o We propose a distributed algorithm for solving the h-out of-k mutual exclusion
problem for ad hoc mobile networks.
o The h-out of-k mutual exclusion problem is also known us the h-out of-k resource
allocution problem.
OBJECTIVE
o The main goal of a distributed computing system is to connect users and
resources in a transparent, open, and scalable way.
o Ideally this arrangement is drastically more fault tolerant and more powerful
than many combinations of stand-alone computer systems.
WHERE DISTRIBUTED COMPUTING IN A
MOBILE ENVIRONMENT IS USED
We pool together mobile systems and analyze them from different angles including
architecture and computability aspects.
We show that mobile systems are basically face the same problems; hence it is
useless to maintain the actual “misleading” barriers.
Moreover, in the new model, the fundamental problems of distributed computing
should find appropriate specifications.
The distributed computing environment consists of a collection of dissimilar computers
connected through the fixed-wired networks such as the Ethernet.
MOBILE SYSTEMS
In this, we show that the Mobile System appellation is not restricted to wireless mobile
systems, but includes several research areas.

CELLULAR AD-HOC PEER-TO-PEER SHARED VIRTUAL

NETWORKS NETWORKS SYSTEMS REALITY SYSTEMS
H-OUT OF-K MUTUAL EXCLUSION
PROBLEM
ASSUMPTION
o The nodes have unique node identifiers.
o Node failures do not occur.
o Communication links are bidirectional and FIFO.
o A link-level protocol ensures that each node is aware of the set of nodes with which
it can currently directly communicate by providing indications of link formations and
failures.
o Incipient link failures are detectable.
o Message delays obey the triangle inequality (i.e., messages that travel 1 hop will
be received before messages sent at the same time that travel more than 1 hop).
o Partitions of the network do not occur.
H-OUT OF K-MUTUAL EXCLUSION PROBLEM
o Set of n independent mobile nodes, communicating by message passing over a
wireless network.
o Each mobile node runs an application process and a mutual exclusion process that
communicate with each other to ensure that the node cycles between
o Non Critical Section (not interested in the CS)
o Waiting Section (waiting for access to the CS)
o Critical Section.

o A node i can access the shared resource only within the critical section.
o Every time when a node i wishes to access h shared resources,
o node i moves from its NCS to the WS, waiting for entering the CS.
H-OUT OF K-MUTUAL EXCLUSION PROBLEM
o The h-out of-k mutual exclusion problem is concerned with how to design an
algorithm satisfying the following properties:
o Mutual Exclusion:
No more than k resources can be accessed concurrently.
o Bounded Delay:
If a node enters the WS to request h resources, then it eventually enters the CS.
REVERSE LINK (RL) MUTUAL EXCLUSION
ALGORITHM
SOLUTION
OPERATION OF REVERSE LINK MUTUAL
EXCLUSION ALGORITHM ON STATIC NETWORK.
Direct wireless links

Higher height node to the lower height node.

Request queue at each node

Height

Next pointers

Token holder
OPERATION OF REVERSE LINK MUTUAL
EXCLUSION ALGORITHM ON STATIC NETWORK.
OPERATION OF REVERSE LINK MUTUAL
EXCLUSION ALGORITHM ON STATIC NETWORK.
OPERATION OF REVERSE LINK MUTUAL
EXCLUSION ALGORITHM ON STATIC NETWORK.
OPERATION OF REVERSE LINK MUTUAL
EXCLUSION ALGORITHM ON STATIC NETWORK.
OPERATION OF REVERSE LINK MUTUAL
EXCLUSION ALGORITHM ON STATIC NETWORK.
ALTERNATIVE SOLUTION
o Lamport's mutual exclusion algorithm
o Token-based distributed mutual exclusion algorithms
o Suzuki-Kasami broadcast algorithm
o Raymond's tree-based algorithm
CONCLUSION
o We propose a distributed algorithm for solving the h-out of-k mutual exclusion
problem for ad hoc mobile networks.
o The proposed algorithm is sensitive to link forming and link breaking and thus is
suitable for ad hoc mobile networks.
o This paper pointed out similarities among common mobile systems (i.e., cellular
networks, ad hoc networks, peer-to-peer systems, reality virtual systems and
cooperative robots).
THANK YOU
Ms. Riddhi Rathod (30).
Ms. Sneha Ariga ().
Ms. Vaishali ().