Authors: Yao Hua Ho; Meng Chang Chen; Han-Chieh Chao
Addresses: Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei 116, Taiwan ' Institute of Information Science, Academia Sinica, Taipei 115, Taiwan ' Institute of Computer Science and Information Engineering, National Ilan University, I-Lan 260, Taiwan
Abstract: In a mobile ad hoc network (MANET), communication connections need to adapt to frequent and unpredictable topology changes. Early solutions focused reconnecting a broken link quickly with a low overhead; however, this strategy cannot cope with a high mobility environment. For high mobility environments, greedy techniques rely on any mobile hosts along the general direction of the destination node to forward data packets. However, the greedy approach suffers from packet loss because the packet forwarding policy does not consider traffic congestion along the route or the direction. In this paper, we propose a congestion avoidance routing (CAR) technique for two greedy protocols, connectionless approach (CLA) and contention-based forwarding (CBF), to address the packet loss problem by rerouting packets dynamically to avoid traffic congestion. To demonstrate the improvement, we present extensive simulation results to show the proposed techniques can prevent the occurrence of contention areas and significantly outperform existing techniques.
Keywords: communication connections; congestion avoidance routing; MANETs; mobile ad hoc networks; routing protocols; connectionless approach; CLA; contention-based forwarding; CBF; packet loss; dynamic rerouting; packet rerouting; network traffic congestion; simulation.
International Journal of Ad Hoc and Ubiquitous Computing, 2014 Vol.16 No.1, pp.26 - 41
Available online: 09 Jun 2014 *Full-text access for editors Access for subscribers Purchase this article Comment on this article