Abstract: This paper reports a distributed mutual exclusion
algorithm for mobile Ad-hoc networks. The network is clustered
hierarchically. The proposed algorithm considers the clustered
network as a logical tree and develops a token passing scheme
to get the mutual exclusion. The performance analysis and
simulation results show that its message requirement is optimal,
and thus the algorithm is energy efficient.
Abstract: Ad hoc networks are characterized by multi-hop
wireless connectivity and frequently changing network topology.
Forming security association among a group of nodes in ad-hoc
networks is more challenging than in conventional networks due to the
lack of central authority, i.e. fixed infrastructure. With that view in
mind, group key management plays an important building block of
any secure group communication. The main contribution of this paper
is a low complexity key management scheme that is suitable for fully
self-organized ad-hoc networks. The protocol is also password
authenticated, making it resilient against active attacks. Unlike other
existing key agreement protocols, ours make no assumption about the
structure of the underlying wireless network, making it suitable for
“truly ad-hoc" networks. Finally, we will analyze our protocol to show
the computation and communication burden on individual nodes for
key establishment.
Abstract: Mobile devices, which are progressively surrounded
in our everyday life, have created a new paradigm where they
interconnect, interact and collaborate with each other. This network
can be used for flexible and secure coordinated sharing. On the other
hand Grid computing provides dependable, consistent, pervasive, and
inexpensive access to high-end computational capabilities. In this
paper, efforts are made to map the concepts of Grid on Ad-Hoc
networks because both exhibit similar kind of characteristics like
Scalability, Dynamism and Heterogeneity. In this context we
propose “Mobile Ad-Hoc Services Grid – MASGRID".
Abstract: This paper describes a UDP over IP based, server-oriented redundant host configuration protocol (RHCP) that can be used by collaborating embedded systems in an ad-hoc network to acquire a dynamic IP address. The service is provided by a single network device at a time and will be dynamically reassigned to one of the other network clients if the primary provider fails. The protocol also allows all participating clients to monitor the dynamic makeup of the network over time. So far the algorithm has been implemented and tested on an 8-bit embedded system architecture with a 10Mbit Ethernet interface.