基于改进蚁群算法的Ad hoc路由协议的研究

冯勇; 廖瑞华; 饶妮妮; 王炜华

doi:10.3724/SP.J.1146.2007.00486

基于改进蚁群算法的Ad hoc路由协议的研究

doi: 10.3724/SP.J.1146.2007.00486

冯勇^{① 廖瑞华,},
廖瑞华,
饶妮妮,
王炜华

计量
- 文章访问数: 3234
- HTML全文浏览量: 102
- PDF下载量: 1019
- 被引次数: 0
出版历程
- 收稿日期: 2007-04-02
- 修回日期: 2007-09-28
- 刊出日期: 2008-10-19

The Routing Protocol Based on Improved Ant Colony Algorithm for Ad hoc Networks

摘要

摘要: 现有Ad hoc网络路由协议技术研究中，路由稳定性和可靠性问题尚未得到很好解决，不能很好地适应Ad hoc网络。针对已有Ad hoc路由技术中存在的开销大以及网络稳定性较低的问题，该文引入蚁群算法，并对其进行改进。研究基于改进蚂蚁算法的Ad hoc 路由协议，并与比较成熟的AODV(Ad hoc On-Demand Distance Vector)进行对比。仿真实验结果表明，通过发挥网络中结点群体功能，新协议减小了端对端传输延时，改善了数据包传输成功率与协议开销，有效地提高了网络的稳定性和通信效率。
- Ad hoc网络 /
- 路由协议 /
- 蚁群算法 /
- AODV
Abstract: Many of the existing proposed routing protocols could not give well stability and reliability and not fit in the needs for Ad hoc network. Because of the problems of great overhead and the lower stability in Ad hoc routing technology, an improved ant colony algorithm is proposed to study an ant-based Ad hoc routing protocol. Compared with the AODV (Ad hoc On-Demand Distance Vector)routing protocol which is a very mature strategy in Ad hoc study, simulation results show that by bringing the node colony function into play，the improved ant colony routing protocol can reduce the end-to-end delay and the routing overhead and increase the packet delivery rate. The network performances such as the stability and the efficiency are improved effectively.
- A /
- d /

HTML全文

参考文献(1)

Ramanathan R and Redi J. A brief overview of mobile Ad hoc networks: Challenges and direction[J]. IEEE Communications Magazine, 2002, 40(5): 20-23.[2]Karn P. MACA-A new channel access method for packet radio [A].ARRL/CRRL Amateur Radio 9th Computer Networking Conference[C]. Ontario, Canada, 1990: 134-142.[3]Bettstetter C. On the minimum node degree and connectivity of a wireless multihop network [C]. Proc.MobiHoc, Lausanne, Switzerland, 2002: 80-91.[4]Royer E M and Toh Chai-Keong. A review of current routing protocols for Ad hoc mobile wireless networks [J].IEEE Personal Communications.1999, 6(2):46-55[5]Perkins C and Bhagwat P. Highly dynamic destination- sequenced distance-vector routing (DSDV) for mobile computers[J].Computer Communication Review.1994, 24(4):234-244[6]Clausen T and Jacquet P. Optimized link state routing protocol (OLSR). RFC3626, October, 2003.[7]Perkins C, Royer E M, and Das S R. Ad hoc on-demand distance vector (aodv) routing. IETF Internet draft, draft- ietf-manet-aodv-07.txt, November, 2000.[8]Johnson D and Maltz D. Dynamic Source Routing in Ad hoc Wireless Networks. Mobile Computing[M]. Edited by Tomas Imielinski and Hank Korth, Kluwer Academic Publishers, 1996: 153-181.[9]Dorigo M, Maniezzo V, and Colorni A. The ant system: optimization by a colony of cooperating agents[J].IEEE Trans. on Systems Man and Cybernetics.1996, 26(1):29-41[10]Dorigo M and Caro G D. Ant algorithms for discrete optimization[J].Artificial Life.1999, 5(3):137-172[11]Cgmara D and Loureiro A A F. A GPS/ant - like routing algorithm for Ad hoc networks. IEEE Wireless Communications and Networking Conference (WCNCOO), Chicago, IL, USA, September, 2000: 1232-1236.[12]Marwaha S, Tham C K, and Srinivasan D. Mobile agents based routing protocol for mobile Ad hoc networks. In Proceedings of IEEE GLOBECOM, Taipei, 2002: 163-167.[13]Gutjahr W J. ACO Algorithms with guaranteed convergence to the optimal solution. Technical report, University of Vienna, ISDS 2001-02.[14]Heissenbilttel M and Braun T. Ants-based routing in large scale mobile Ad-hoc networks. Kommunikation in verteilten Systemen(KiVS03), Leipzig, Germany, March, 2003: 181- 190.[15]Gilnes M.[J].Sorges U, and Bouazizi I. ARA-the ant-colony based routing algorithm for MANETs. International Conference on Parallel Processing Workshops (ICPPW02), Vancouver, British Columbia, Canada, IEEE Computer Society Press.2002,:-[16]Dorigo M, Bonabeau E, and Theraulaz G. Ant algorithms and stigmergy [J].Future Generation Computer Systems.2000, 16:851-871

施引文献

资源附件(0)

访问统计