Research on MANET Routing Algorithm Based on Ant Colony Algorithm

Article Preview

Abstract:

This paper proposed a new Ad Hoc dynamic routing algorithm, which based on ant-colony algorithm in order to reasonably extend the dynamic allocation of network traffic and network lifetime. The Algorithm choose path according transmission latency, path of the energy rate, congestion rate, dynamic rate. The Algorithm update the routing table by dynamic collection of path information after path established. The analyse shows that algorithm increases the network throughput, reduces the average end-to-end packet transmission latency, and extends the network lifetime, achieves an improving performance.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

781-787

Citation:

Online since:

October 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Perkins C E, Bhagwat P. Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers [C] Proc ACM SIGCOMM 94. New York: ACM, 1994: 234 - 244.

DOI: 10.1145/190809.190336

Google Scholar

[2] Charles Perkins, Elizabeth Royer. Ad Hoc on demand distance vector routing[R]. New Orleans: 2nd IEEE Workshop on Selected Areas in Communication, (1994).

DOI: 10.1109/mcsa.1999.749281

Google Scholar

[3] David B Johnson, David A Maltz. The dynamic source routing p protocol for mobile Ad Hoc net works (DSR) [R]. IETF I internet Draft, draft-ietf-manet-dsr-09. April (2005).

DOI: 10.17487/rfc4728

Google Scholar

[4] DORIGO M, GAMBARDELLA, MARIAL. Ant colony system:A cooperative learning approach to the traveling salesman problem [J].IEEE Trans on Evolutionary, 2002, 1(1): 53-66.

DOI: 10.1109/4235.585892

Google Scholar

[5] MANWAHA S, THAM C K, SRINIVASAN D. A novel routing protocol using mobile agents and reactive route discovery for Ad-Hoc wireless networks[C].Toward Network Superiority Proceedings of IEEE International Conference on Networks 2002(ICON 2002), 2007, 27-30:311-316.

DOI: 10.1109/icon.2002.1033329

Google Scholar

[6] Baras J S, Mehta H A. A Probabilistic emergent routing algorithm for mobile ad hoc networks. In Proceedings of WiOptOS: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. France. March 2006, pp: 120-125.

DOI: 10.1109/wiopt.2007.4480049

Google Scholar

[7] Gunes M, Sorges U, Bouazizi I. ARA-the ant-colony based routing algorithm for MANETs. In Proceedings of International Conference on Parallel Proceeding Workshops. Uucouver, BC, Canada. Aug. 2006, pp: 79-85.

DOI: 10.1109/icppw.2002.1039715

Google Scholar

[8] Caro G D, Dorigo M. AntNet: A Mobile Agents Approach to Adaptive Routing [C]. Belgium: Technical Report IRIDIA, (2005).

Google Scholar

[9] Zuo Guo-min, Yu Wan-jun, Ad hoc network routing algorithm based on ant colony Optimization algorithm [J] Application Research of Computers 2008(25)1: 59-61.

DOI: 10.1109/icmlc.2008.4620576

Google Scholar

[10] An Hui-Yao, Advanced routing algorithm and routing protocol in MANET [M] Beijing: Science Press, (2010).

Google Scholar