Abstract: The Address Resolution Protocol (ARP) is used by
computers to map logical addresses (IP) to physical addresses
(MAC). However ARP is an all trusting protocol and is stateless
which makes it vulnerable to many ARP cache poisoning attacks
such as Man-in-the-Middle (MITM) and Denial of service (DoS)
attacks. These flaws result in security breaches thus weakening the
appeal of the computer for exchange of sensitive data. In this paper
we describe ARP, outline several possible ARP cache poisoning
attacks and give the detailed of some attack scenarios in network
having both wired and wireless hosts. We have analyzed each of
proposed solutions, identify their strengths and limitations. Finally
get that no solution offers a feasible solution. Hence, this paper
presents an efficient and secure version of ARP that is able to cope
up with all these types of attacks and is also a feasible solution. It is a
stateful protocol, by storing the information of the Request frame in
the ARP cache, to reduce the chances of various types of attacks in
ARP. It is more efficient and secure by broadcasting ARP Reply
frame in the network and storing related entries in the ARP cache
each time when communication take place.
Abstract: Mobile ad-hoc networks (MANETs) are a form of
wireless networks which do not require a base station for providing
network connectivity. Mobile ad-hoc networks have many
characteristics which distinguish them from other wireless networks
which make routing in such networks a challenging task. Cluster
based routing is one of the routing schemes for MANETs in which
various clusters of mobile nodes are formed with each cluster having
its own clusterhead which is responsible for routing among clusters.
In this paper we have proposed and implemented a distributed
weighted clustering algorithm for MANETs. This approach is based
on combined weight metric that takes into account several system
parameters like the node degree, transmission range, energy and
mobility of the nodes. We have evaluated the performance of
proposed scheme through simulation in various network situations.
Simulation results show that proposed scheme outperforms the
original distributed weighted clustering algorithm (DWCA).