Design of novel high density, fault tolerant protocol for cluster based routing in Ad-Hoc networks

Abstract

Clustering in ad-hoc networks is a widely used approach to ease implementation of various problems such as routing and resource management. Ad-hoc wireless networks perform the difficult task of multi-hop communication in environment without a dedicated infrastructure, with mobile nodes and changing network topology. In this article, after determining the cluster members and cluster head, distance and energy for each node are carried out per cluster head and cluster; data gathered from cluster members are relayed to the main server. The results showed that the proposed algorithm is scalable, has less number of dropped packets, uses high energy during the path discovery, and handles fault tolerance problem during the packets transmission. A new algorithm for clustering which merges network nodes to form higher level clusters by increasing their levels, their energy and their density is proposed. Its operations are provided in simulation environment of network simulation tool 2 (ns-2).