移动Ad-Hoc网络中一种有效的蚁群路由算法

2008 4th IEEE International Conference on Circuits and Systems for Communications Pub Date : 2008-05-26 DOI:10.1109/ICCSC.2008.28

Yingzhuang Liu, Hong Zhang, Q. Ni, Zongyi Zhou, Guangxi Zhu

{"title":"移动Ad-Hoc网络中一种有效的蚁群路由算法","authors":"Yingzhuang Liu, Hong Zhang, Q. Ni, Zongyi Zhou, Guangxi Zhu","doi":"10.1109/ICCSC.2008.28","DOIUrl":null,"url":null,"abstract":"An effective Ant-Colony based routing algorithm for mobile ad-hoc network is proposed in this paper. In this routing scheme, each path is marked by path grade, which is calculated from the combination of multiple constrained QoS parameters such as the time delay, packet loss rate and bandwidth, etc. packet routing is decided by the path grade and the queue buffer length of the node. The advantage of this scheme is that it can effectively improve the packet delivery ratio and reduce the end-to-end delay. The simulation results show that our proposed algorithm can improve the packet delivery ratio by 9%-22% and the end-to-end delay can be reduced by 14%-16% as compared with the conventional QAODV and ARA routing schemes.","PeriodicalId":137660,"journal":{"name":"2008 4th IEEE International Conference on Circuits and Systems for Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"An Effective Ant-Colony Based Routing Algorithm for Mobile Ad-Hoc Network\",\"authors\":\"Yingzhuang Liu, Hong Zhang, Q. Ni, Zongyi Zhou, Guangxi Zhu\",\"doi\":\"10.1109/ICCSC.2008.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An effective Ant-Colony based routing algorithm for mobile ad-hoc network is proposed in this paper. In this routing scheme, each path is marked by path grade, which is calculated from the combination of multiple constrained QoS parameters such as the time delay, packet loss rate and bandwidth, etc. packet routing is decided by the path grade and the queue buffer length of the node. The advantage of this scheme is that it can effectively improve the packet delivery ratio and reduce the end-to-end delay. The simulation results show that our proposed algorithm can improve the packet delivery ratio by 9%-22% and the end-to-end delay can be reduced by 14%-16% as compared with the conventional QAODV and ARA routing schemes.\",\"PeriodicalId\":137660,\"journal\":{\"name\":\"2008 4th IEEE International Conference on Circuits and Systems for Communications\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 4th IEEE International Conference on Circuits and Systems for Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSC.2008.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th IEEE International Conference on Circuits and Systems for Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSC.2008.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

摘要

提出了一种有效的基于蚁群的移动自组网路由算法。在该路由方案中，每条路径都用路径等级来标识，路径等级是由时延、丢包率、带宽等多个约束性QoS参数组合计算得出的，数据包路由由节点的路径等级和队列缓冲长度决定。该方案的优点是可以有效地提高数据包的传输率，减少端到端时延。仿真结果表明，与传统的QAODV和ARA路由方案相比，本文提出的算法可将分组投递率提高9% ~ 22%，将端到端时延降低14% ~ 16%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Effective Ant-Colony Based Routing Algorithm for Mobile Ad-Hoc Network

An effective Ant-Colony based routing algorithm for mobile ad-hoc network is proposed in this paper. In this routing scheme, each path is marked by path grade, which is calculated from the combination of multiple constrained QoS parameters such as the time delay, packet loss rate and bandwidth, etc. packet routing is decided by the path grade and the queue buffer length of the node. The advantage of this scheme is that it can effectively improve the packet delivery ratio and reduce the end-to-end delay. The simulation results show that our proposed algorithm can improve the packet delivery ratio by 9%-22% and the end-to-end delay can be reduced by 14%-16% as compared with the conventional QAODV and ARA routing schemes.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 4th IEEE International Conference on Circuits and Systems for Communications

自引率

0.00%

发文量