Enhanced cluster-based stable path for load balancing and reducing overhead using artificial bee colony in MANETs
by Ramadass Sundar; Ayyaswamy Kathirvel
International Journal of Vehicle Information and Communication Systems (IJVICS), Vol. 5, No. 1, 2020

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.

Online publication date: Thu, 07-May-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Vehicle Information and Communication Systems (IJVICS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com