2006•Unpublished venueRequires access

Ant Routing Algorithm for Heavy Load Mobile Ad Hoc Networks

Jianli Ding, Lixin Zou, Wansheng Tang

Abstract

A mobile ad hoc network (MANET) is made up of mobile devices that communicate through wireless connections. It has recently attracted much attention in the research and the industry. Routing in mobile ad hoc networks is a challenge problem as a result of highly dynamic topology. This paper describes one ant routing method inspired by the behavior of real ants, which can effectively bear network load in ad hoc networks. Our simulations in NS-2 show that it performs very well in ad hoc environments, especially in heavy load ad hoc networks

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Mobile ad hoc network, Adaptive quality of service multi-hop routing, Computer science, Wireless ad hoc network, Computer network, Optimized Link State Routing Protocol, Ad hoc wireless distribution service, Destination-Sequenced Distance Vector routing