ENHANCING VARYING OVERHEAD AD HOC ON DEMAND DISTANCE VECTOR WITH ARTIFICIAL ANTS

Authors

  • V. Balaji Prince Shri Venkateshwara Padmavathy Engineering College, Department of Electronics and Communication Engineering, Ponmar, Chennai, Tamilnadu, India
  • N. Umapathy GKM College of Engineering and Technology, Department of Electronics and Communication Engineering, Chennai, Tamilnadu
  • V. Duraisamy Sri Chandrasekharendra Saraswathi Viswa Mahavidyalaya Department of Electronics and Instrumentation Engineering, Enathur, Kancheepuram, Tamilnadu, India
  • K. Umapathy Principal, Maharaja Institute of Technology, Coimbatore, Tamilnadu, India
  • P. Venkatesan Principal, Maharaja Institute of Technology, Coimbatore, Tamilnadu, India
  • S. Saravanakumar Sri Chandrasekharendra Saraswathi Viswa Mahavidyalaya Department of Electronics and Instrumentation Engineering, Enathur, Kancheepuram, Tamilnadu, India

DOI:

https://doi.org/10.11113/jt.v77.6784

Keywords:

Mobile Adhoc Network (MANET), Adhoc On demand Distance Vector (AODV), Link quality, Metrics

Abstract

A cluster of mobile hosts installed with a wireless transceiver form a Mobile Adhoc Network (MANET), without base stations. Wireless ad hoc networks routing protocols usually focus on finding paths with minimum hop count. In a MANET, a route may suddenly be broken when a host roams away. Even if a route is connected, it may worsen due to host mobility or a better route being formed new in the system. Current protocols stick to a fixed route between a source - destination pair when discovered and it continues till it expires or is broken. A routing algorithm chooses better paths by considering wireless links quality. However, in large networks link quality from source to destination provides multiple options in space domain and finding local minima is crucial for successful routing implementation. This study extends the Varying Overhead Ad hoc On demand Distance Vector (VO-AODV) by introducing an optimization parameter using Ant Colony Optimization (ACO).

References

D. B. Johnson and D. A. Maltz. 1996. Dynamic Source Routing In Ad-Hoc Wireless Networks. In T. Imielinski and H. Korth, editors. Mobile Computing. Kluwer Academic Publishers,

V. D. Park and M. S. Corson. 1997. A Highly Adaptive Distributed Routing Algorithm For Mobile Wireless Networks. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM’97 Vol. 3. April 1997. 1405-1413.

C. E. Perkins and P. Bhagwat. 1994. Highly Dynamic Destination-Sequenced Distance Vector Routing (DSDV) for Mobile Computers. ACM SIGCOMM Computer Communication Review. 24(4): 43-57

D. De Couto, D. Aguayo, J. Bicket, and R. Morris. 2003. High-Throughput Path Metric for Multi-Hop Wireless Routing. MOBICOM. 14-19.

R. Dube, C. Rais, K. Wang, and S. Tripathi. 1997. Signal Stability Based Adaptive Routing For Ad–Hoc Mobile Networks. IEEE Personal Communications. 4(1): 36-45.

Z. J. Haas and M. R. Pearlman. 1997. The Zone Routing Protocol for Ad–Hoc Networks. Internet Draft RFC. [Online]. From: http://www.ietf.org/html.charters/manet-charter.html.

S. Y. Ni, Y. C. Tseng, and J. P. Sheu. August 1999. The Broadcast Storm Problem in a Mobile Ad Hoc Network. Proceedings ACM International Conference on Mobile Computing and Networking MobiCom’99. Seattle, Washington. August 1999.

A. Adya, P. Bahl, J. Padhye, A. Wolman and L. Zhou. 2004. A Multi-Radio Unification Protocol for IEEE802.11 Wireless Networks. IEEE First International Conference on Broadband Networks BroadNets ’04.

M. Dorigo, V. Maniezzo, and A. Colorni. 1996. Ant System: Optimization By A Colony Of Cooperating Agents. IEEE Transactions on Systems, Man and Cybernetics–Part B. 26(1). 29-41.

Downloads

Published

2015-12-16

Issue

Section

Science and Engineering

How to Cite

ENHANCING VARYING OVERHEAD AD HOC ON DEMAND DISTANCE VECTOR WITH ARTIFICIAL ANTS. (2015). Jurnal Teknologi, 77(28). https://doi.org/10.11113/jt.v77.6784