A Cluster-based Approach for Routing in Ad-Hoc Networks
MLICS '95 Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper we propose Clustering technique provides a solution to support QoS in ad hoc networks. For the effective functioning of cluster based routing algorithms, the clusters must be long-lived and stable. The proposed scheme considers the spatial and temporal stability of the nodes. The node elected as the clusterhead is such that it has maximum associativity as well as satisfies a minimum connectivity requirement. Effective work has been done for Cluster Reorganization. Cluster Head Re-election is periodically done so that the cluster head is centered in a cluster. Cluster management will be effective, since the cluster heads are elected based on various parameters like processing capabilities, speed of the node, number of neighbor nodes and associativity with the neighbor nodes. Though overhead is incurred initially due to cluster setup, cluster maintenance will be easier in the long run. Ultimately routing efficiency will increase due to long-lived clusters and reduced control packets.