Skip Navigation


The Computer Journal Advance Access first published online on February 8, 2008
This version published online on February 11, 2008
The Computer Journal, doi:10.1093/comjnl/bxn007
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
bxn007v2    most recent
bxn007v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wu, Z.-Y.
Right arrow Articles by Song, H.-T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2008. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Ant-based Energy-aware Disjoint Multipath Routing Algorithm for MANETs

Zheng-Yu Wu1,* and Han-Tao Song2

1 Department of Computer Science and Technology, College of Information Science and Technology, Beijing Forestry University, Beijing 100083, PR China
2 School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, PR China

* Corresponding author: bitwzy1{at}gmail.com

Received 21 February 2007; revised 9 January 2008

Ant-based routing protocols for mobile ad hoc networks (MANETs) have been widely explored, but most of them are essentially single-path routing methods that tend to impose a heavy burden on the hosts along the shortest path from source to destination. In this paper, we combine swarm intelligence and node-disjoint multipath routing to alleviate these problems. A novel approach called ant-based energy-aware disjoint multipath routing algorithm (AEADMRA) is proposed. AEADMRA is based on swarm intelligence and especially on the ant colony-based meta heuristic. AEADMRA can discover multiple energy-aware node-disjoint routing paths with a low routing overhead. Simulation results indicate that the performance of AEADMRA outperforms other pertinent algorithms.

Key Words: routing • ant-based algorithm • MANETs

The Original version was incorrect.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.