International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 5, No. 10, 8 Aug. 2013
Cover page and Table of Contents: PDF (size: 178KB)
Intelligent Routing using Ant Algorithms for Wireless Ad Hoc Networks
Full Text (PDF, 178KB), PP.51-57
Views: 0 Downloads: 0
Author(s)
S. Menaka
1,*
M.K. Jayanthi
2
Index Terms
MANETs, Ant Colony Optimization, Swarm Intelligence, Routing
Abstract
Wireless network is one of the niche areas and has been a growing interest owing to their ability to control the physical environment even from remote locations. Intelligent routing, bandwidth allocation and power control techniques are the known critical factors for this network communication. It is customary to find a feasible path between the communication end point which is a challenging task in this type of network. The present study proposes an Ant Mobility Model (AMM), an on-demand, multi-path routing algorithm that exercises power control and coordinate the nodes to communicate with one another in wireless network. The main goal of this protocol is to reduce the overhead, congestion, and stagnation, while increasing the throughput of the network. It can be realized from the simulation results that AMM proves to be a promising solution for the mobility pattern in wireless networks like MANETs.
Cite This Paper
S. Menaka, M.K. Jayanthi, "Intelligent Routing using Ant Algorithms for Wireless Ad Hoc Networks", International Journal of Computer Network and Information Security(IJCNIS), vol.5, no.10, pp.51-57, 2013. DOI:10.5815/ijcnis.2013.10.08
Reference
[1]Elizabeth Royer and C-K Toh ”A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks”, IEEE Personal Communications Magazine, April 1999, pp. 46-55.
[2]Charles E. Perkins and Elizabeth Royer” Ad-hoc On-Demand Distance Vector Routing. ”, Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90-100.
[3]E. Bonabeau, M. Dorigo, and G. Theraulaz, Swarm intelligence: from natural to artificial systems, Oxford University Press, 1999.
[4]M. Dorigo, V. Maniezzo, and A. Colorni, “The ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics, part B, vol. 26, no. 1, pp. 29-41, 1996.
[5]R. Schoonderwoerd, O. Holland, J. Bruten and L. Rothkrantz. “Ant based Load Balancing in Telecommunication Networks,” Adaptive Behavior, vol. 5, pp. 169-207, 1996.
[6]G. Di Caro and M. Dorigo, “AntNet: distributed stigmergetic control for communications networks,” Journal of Artificial Intelligence Research, vol. 9, pp. 317-365, 1998.
[7]G.D. Caro and M. Dorigo, “AntNet: A mobile Agents Approach to Adaptive Routing”, University Libre de Bruxelles, Belgium, Technical report IRIDIA/97-12, 1997.
[8]T. Stutzle and H. H. Hoos, “The MAX-MIN ant system and local search for the traveling salesman problem”, Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC‘97), pp 309-314, 1997.
[9]Bullnheimer B., R.F. Hart1 and C. Strauss, “Applying the Ant System to the Vehicle Routing problem”, The 2nd Meta-heuristic International Conference, Sophia-Antipolice, France (1997).
[10]K. Fujita, A. Saito, T. Matsui, and H. Matsuo.“An adaptive ant-based routing algorithm used routing history in dynamic networks”. In 4th Asia-Pacific Conf.On Simulated Evolution and Learning, 2002.
[11]D. Cgmara and A.A.F. Loureiro, “A GPS/Ant-Like Routing Algorithm for Ad Hoc Networks”, IEEE Wireless Communications and Networking conference (WCNC’OO), September 2000.
[12]S. Marwaha, CK. Tham and D. Srinivasan, “Mobile Agents based Routing Protocol for Mobile Ad Hoc Networks”, in Proceedings of IEEE GLOBECOM 2002,17-2 1 Nov 2002.
[13]MesutGunes, Udo surges, and ImedBouazizi.“ARA- The Ant Colony Based Routing Algorithm for MANETs”, In the International Conference of Parallel Processing Workshops (ICPPW’02), Vancouver, B.C., Canada, pp. 79-85, August 2002.
[14]M Gunes and 0. Spaniol,” Routing Algorithms for Mobile Multi-Hop Ad-Hoc Networks”, Next Generation Network Technologies International Workshop, October 2002.
[15]J. S. Baras and H. Mehta.A probabilistic emergent routing algorithm for mobile ad hoc networks. In WiOpt03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2003.
[16]M. Dorigo and G. Di Caro, “The Ant Colony Optimization Meta-Heuristic, New Ideas in Optimization”, McGraw-Hill, editor David Come and Marco Dorigo and Fred Glover, pp 1 --32, 1999.
[17]O. Hussien, T. Saadawi. “Ant routing algorithm for mobile ad-hoc networks (ARAMA)”, proc. Of the 2003 IEEE International Conference of performance, Computing, and Communications Conference, pp. 281- 290, April 2003.
[18]Peter S. Heck and Sumit Gosh.Arizona State University. “A study of Synthetic creativity: Behavior Modeling and Simulation of Ant Colony”. IEEE Intelligent Systems.Vol. 15, Issue 6 2000.
[19]UCB/LBNL/VINT Network Simulator NS, http://www.isi.edu/nsnam/ns/.
[20]K. Fall and K. Varadhan.The ns Manual, Nov 2000.