Abstract:
Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in Ad-hoc networks. Today, Ad hoc wireless networks perform the difficult task of multi-hop communication in an environment without a dedicated infrastructure, with mobile nodes and changing network topology. After determining the cluster members and cluster head, distance and energy for each node are carried out per cluster head and cluster and data gathered from the cluster members are relayed to the main server. The result has to show that the proposed algorithm has less number of dropped packets, uses high energy during the path discovery than the widely used Ad hoc On-Demand Distance Vector (AODV) and handles the fault tolerance problem during the packets transmission.
In this project, I proposed a new algorithm for clustering in Ad-hoc networks that merges networks nodes to form higher level clusters by increasing their levels, their energy and their density. I showed the operation of the algorithm and analyzed its time and message complexities and provided results in the simulation environment of ns2. The results confirmed that the algorithm proposed is scalable and has a lower time and message complexities than the other algorithms.
Keywords: Routing Protocol, Ad hoc networking, Clustering, Cluster Density, Fault Tolerance in Ad-hoc Networks, Performance metrics, Dropped packets and Throughput.
