Abstract

A routing overhead plays a vital role in mobile ad-hoc networks. The main issue focused on the previous algorithm is a stable path without considering the overhead of route discovery. The path fails in a route and again reinitiates the discovery process which may lead to additional overhead, increase delay and waste of resource utilisation. The proposed new algorithm reduces the routing overhead for cluster based initial route discovery and data transmission using artificial bee colony (CBRTABC) with ad-hoc on demand distance vector (AODV). This algorithm uses honey bees to calculate the neighbour node for route discovery and a path is established. As a result the cluster head maintains a long period of processing time and produces reliable path. Whenever the optimal path is retained then the additional route discovery overhead is reduced. This projected algorithm is computed in the NS2 simulator produced by improving the packet delivery ratio and it reduces the delay and routing overhead.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call