Implementation and comparison of clustering techniques in wireless routing protocols

Abstract

Traditional clustering methods (hierarchal routing methods) are preferred over table driven and ad hoc routing protocols because of least overhead. The overhead in clustering approach is less because special nodes (cluster heads) are used to handle different group of users. This makes the routing table size small for each of the node but with the limitation of non optimum path possibility between two different nodes. This non optimum path gives rise to more bandwidth consumption as compared to other novel methods like AODV, DSR and DSDV. The existing table driven (DSDV etc.) and Ad Hoc (DSR and AODV etc.) routing protocols can be the obvious choice networks but both these algorithm suffers from large buffer requirement and large route discovery overhead. The design proposed in this paper use clustering technique along with DSDV or AODV to reduce routing overhead and improve packet delivery ratio for bigger networks.