Abstract

Enhanced Clustering Ant Colony Routing Modified (ECACR-M) algorithm is proposed in this paper which is the modified version of ECACR algorithm. Performance enhancement is the major issue in wireless networks, as source and destination are fixed so parameters like throughput, average delay and network latency can only be improved. Swarm intelligence inspired Ant Colony Optimisation (ACO) algorithms are popular to find optimum path. Standard Ant Colony Routing (SACR) algorithm introduced as first algorithm which was further improved and redefined as Improved Ant Colony Routing (IPACR) algorithm, but they take longer path. Improved Clustering Ant Colony Routing (ICACR) algorithm is developed on clustering technique and is better than IPACR algorithm by parameters like throughput and average delay, but not successful for case where sink node and source node are closest. The paper proposes modified algorithm ECACR-M that is motivated by ACO and clustering technique to find optimum route.

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