Ad Hoc Networking holds the place tightly in this present scenario and would be the network going to reign the technology driven world in the future. This is obvious by looking at the exponential growth of the protocols supportive to this network. The process of fine tuning those protocols and making them suitable to effective functionality of the network has been highly indispensable. In line with the views mentioned, this paper has been devised to enhance the existing AODV by adding the sequence number with the packets to put the situation out of loop formation. Further, the Clustering Technique specified here is to reduce the flooding Overhead, mitigates the network traffic and also for handling the bandwidth effectively. A novel distance based cluster algorithm(DBCA) for ad hoc network has been devised. This paper proposes C-IAODV (Cluster based Improved AODV)as Ad Hoc network protocol Which addresses the route updating, link failure, Communication and also eliminates the Precursor Overhead.
[1]
M. Jiang,et al.
Cluster based routing protocol (CBRP)
,
1999
.
[2]
Gary Scott Malkin,et al.
Distance-vector routing
,
1995
.
[3]
Hassan Artail,et al.
A cluster-based trust-aware routing protocol for mobile ad hoc networks
,
2010,
Wirel. Networks.
[4]
David A. Maltz,et al.
Dynamic Source Routing in Ad Hoc Wireless Networks
,
1994,
Mobidata.
[5]
C C. Chiang,et al.
Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel
,
1997
.
[6]
Charles E. Perkins,et al.
Ad-hoc on-demand distance vector routing
,
1999,
Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.