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

Liu, Yingzhuang and Zhang, Hong and Ni, Qiang and Zhou, Zongyi and Zhu, Guangxi (2008) An effective ant-colony based routing algorithm for mobile ad-hoc network. In: Circuits and Systems for Communications, 2008. ICCSC 2008. 4th IEEE International Conference on. IEEE, GBR, pp. 100-103. ISBN 978-1-4244-1707-0

Full text not available from this repository.

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.

Item Type:
Contribution in Book/Report/Proceedings
ID Code:
66144
Deposited By:
Deposited On:
20 Aug 2013 10:27
Refereed?:
Yes
Published?:
Published
Last Modified:
01 Jan 2020 05:44