The week's pick
Random Articles
Reseach Article
An Optimized Ant Colony Algorithm to Reduce the Impact of Flooding using Clustering in Ad Hoc Network
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 84 - Number 6 |
| Year of Publication: 2013 |
| Authors: Rajdeep Singh Chauhan, Jasbir Singh Saini, Harwinder Singh Sohal |
10.5120/14581-2810
|
Rajdeep Singh Chauhan, Jasbir Singh Saini, Harwinder Singh Sohal . An Optimized Ant Colony Algorithm to Reduce the Impact of Flooding using Clustering in Ad Hoc Network. International Journal of Computer Applications. 84, 6 ( December 2013), 30-34. DOI=10.5120/14581-2810
Abstract
Flooding is a phenomenon used in adhoc networks to get the information about the other nodes in the network. Whenever the topology in adhoc network changes the node has to perform the flooding technique to get the shortest path for neighborhood nodes. By using this technique, the information seeking packets from the source nodes are sent to all the other nodes in neighbor to get the information regarding the different routing paths and the routing distances for the other nodes. Ant algorithm is one of the best approaches to get the shortest path of the neighborhood nodes. The shortest path is get by using flooding technique in ant algorithm but there is a problem, when the changes in the network are frequent & dynamic, for each & every change, the node has to perform flooding to get the shortest path which give rise to the problem of congestion & decreases the throughput. Both of the problems results in the increase of end to end delay. This motivates the need of clustering technique to handle such problems. The present work describes that the whole network nodes are divided into clusters. So rather then using the flooding technique for all the neighbor nodes, the flooding is used only among the clusters which reduces the network congestion and results in the increase of throughput & decrease in the end to end delay.
References
- D. Kim, J. Garcia and K. Obraczka, "Routing Mechanisms for Mobile Ad Hoc Networks based on the Energy Drain Rate", IEEE Transactions on Mobile Computing. Vol 2, no 2, 2003, pp. 161-173.
- Wenjing Guo, Wei Zhang, Gang Lu "A Comprehensive Routing Protocol in Wireless Sensor Network Based on Ant Colony Algorithm" 2010 Second International Conference on Networks Security, Wireless Communications and trusted Computing, 2010 Second International Conference on Network Security , Wireless Communications and Trusted Computing, PP 41-44. an uting, PP41-44
- Yanhua Li, Zhi-Li Zhang, and Daniel Boley "From Shortest-path to All-path: The Routing Continuum Theory and its applications" IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. X, NO. X, JANUARY 201X, PP 1-11.
- Hussein O. , Saadawi T. "Ant Routing Algorithm for Mobile Ad-hoc Networks (ARAMA)*".
- Gabber E. , Smith M. A. (2004) "Trail Blazer: A Routing Algorithm Inspired By Ants", IEEE International Conference on Network Protocols (ICNP'04).
- Chen G. , Guo T. , Wang W. , Zhao T. (2006), "An Improved Ant-Based Routing Protocol In Wireless Sensor Networks"1-4244-0429-0-/06(IEEE 2006).
- LI B. , LI D. , LI H. (2009), "ASAR: Ant-Based Spectrum Aware Routing For Congnitive Radio Networks" 978-1-4244-5668-0/9(IEEE 2009).
- Bandyopadhyay M. , Baumik P (2010) "Zone Based Ant Colony Routing In Mobile Ad-hoc Network" Copyright Clearance Centre (CCC) 978-1-4244-5489-1/10(IEEE 2010).
- Maghayreh E. A. , Al-Haija S. A. , Alkhateeb F. , Alijawarneh A. (2010) "Bees_Ant Based Routing Algorithm"978-0-7695-3973-7/10(IEEE 2010)
Index Terms
Keywords