Email this article 
Open Access
Subscription or Fee Access
On-Demand Clustering Routing Protocol in Ant-Based Algorithm Using WCDS for MANET
Abstract
Swarm intelligence is one of the popular approaches that have increased the development of new approaches that can increase the network efficiency. Swarm intelligence imitates the collective behaviour of some biological species to solve the network routing problems. Ant Colony Optimization (ACO) comes under the swarm intelligence approach. This paper aims at increasing the network efficiency by decreasing the overhead required to send the routing packets. Ant Colony Optimization is designed to find a better routing path by continually issuing routing packets (ants) to leave the pheromone information on the path from the source to the destination, so that ACO could maintain the routing path according to the pheromone trail. Weakly Connected Dominating Sets (WCDS) construction scheme is implemented as an auxiliary structure in ACO to cluster network nodes and achieve an efficient packet transmission. The Forward Ant is broadcasted only by the cluster heads thus reducing the overhead required to transmit ant packets. The Backward Ant uses the pseudo-random-proportional-selection strategy to select a best path from source to destination to increase the network efficiency. The performance of this protocol is compared with AODV and it is analyzed in terms of throughput and packet delivery ratio.
Keywords
References
Alzoubi KM, Wan PJ and Frieder O. (2003), ‘Maximal independent set, weakly connected dominating set, and induced spanners in wireless ad hoc networks’, International Journal of Foundations Computer Science, Vol. 7, No. 4, pp. 287–303.
Bo Han and WeijiaJia. (2007), ‘Clustering wireless ad hoc networks with weakly connected dominating set’, Parallel Distributed Computing, Vol. 67, No. 2, pp. 727–737.
Chakchouk N, Hamdaoui B and Frikha M. (2009), ‘WCDS-induced routing for data-aggregation in wireless sensor networks’, Communications and networking, Vol.3, No. 1, pp. 1–6.
Charles E. Perkins and Elizabeth M. Royer. (1999), ‘Ad-hoc On-Demand Distance Vector Routing’, WMCSA Second IEEE workshop, Vol. 2, No. 2, pp. 90–100.
Chinara S, Rath SK. (2009), ‘A survey on one-hop clustering algorithms in mobile ad hoc networks’, J Netw Syst Manage, Vol.17, pp.183–207.
Jianping Wang, EseosaOsagie, ParimalaThulasiraman and Ruppa K. Thulasiram. (2002), ‘HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad hoc network’, Ad Hoc Networks, Vol. 7, No. 3, pp. 690–705.
Kuen Han Li and JenqShiouLeu. (2015), ‘Weakly connected dominating set-assisted ant-based routing protocol for wireless ad-hoc networks’, Computers and Electrical Engineering, Vol. 3, No. 1, pp. 34–50.
Ramasubramanian V, Haas ZJ, Sirer EG. (2003), ‘SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks’, In: Proceedings of the 4th ACM international symposium on mobile ad hoc networking & computing (MobiHoc ‘03), pp. 303–314.
Shuang B, Li Z and Chen J. (2006), ‘An ant-based on-demand energy route protocol for IEEE 802.15.4 mesh network’, International Journal of Wireless Networks, Vol. 16, No. 2, pp. 225–36.
Shubhajeet Chatterjee and Swagatam Das. (2014), ‘Ant colony optimization based enhanced dynamic source routing algorithm for mobile Ad-hoc network’, Information Sciences, Vol. 7, No. 6, pp. 67–90.
Sucec J and Marsic I. (2004), ‘Hierarchical routing overhead in mobile ad hoc networks’, Mobile Computing, Vol. 3, No. 8, pp. 46–56.
Tiago Camilo, Carlos Carreto, Jorge Sa Silva and Fernando Boavida. (2006), ‘An Energy-Efficient Ant-Based Routing Algorithm for Wireless Sensor Networks’, Proceedings of ant colony optimization and swarm intelligence, Vol. 4150, No. 3, pp. 49–59.
Tolba FD, Magoni D, Lorenz P. (2007), ‘A stable clustering algorithm for highly mobile ad hoc networks’, Systems and networks communications, ICSNC, In: Second international conference, Vol. 7, pp.11.
Weiss E, Hiertz GR, Bangnan X. (2005), ‘Performance analysis of temporally ordered routing algorithm based on IEEE 802.11a’, In: Vehicular technology conference, Vol. 4, pp. 2565–2569.
Yuanzhu Peter Chen and Arthur L. Liestman. (2002), ‘Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks’, Proceedings of the 3rd ACM international conference on mobile ad hoc networking &computing,Vol.5, No. 4, pp. 165–72.
Yu JY, Chong PHJ. (2005), ‘A survey of clustering schemes for mobile ad hoc networks’, Communications Surveys & Tutorials, IEEE, Vol. 7, pp. 32–48.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.