12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > An effective ant-colony based routing algorithm...
View graph of relations

« Back

An effective ant-colony based routing algorithm for mobile ad-hoc network

Research output: Contribution in Book/Report/ProceedingsPaper

Published

  • Yingzhuang Liu
  • Hong Zhang
  • Qiang Ni
  • Zongyi Zhou
  • Guangxi Zhu
Publication date05/2008
Host publicationCircuits and Systems for Communications, 2008. ICCSC 2008. 4th IEEE International Conference on
PublisherIEEE
Pages100-103
Number of pages4
ISBN (Electronic)978-1-4244-1708-7
ISBN (Print)978-1-4244-1707-0
Original languageEnglish

Conference

Conference2008 4th IEEE International Conference on Circuits and Systems for Communications (ICCSC 2008)
CountryUnited Kingdom
CityShanghai, China
Period26/05/0828/05/08

Conference

Conference2008 4th IEEE International Conference on Circuits and Systems for Communications (ICCSC 2008)
CountryUnited Kingdom
CityShanghai, China
Period26/05/0828/05/08

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.