Volume 1, Issue 3 (9-2009)                   2009, 1(3): 1-13 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Esmailpour A, Nasser N. A Backup Routing Scheme for Mobile Ad-Hoc Networks . International Journal of Information and Communication Technology Research 2009; 1 (3) :1-13
URL: http://ijict.itrc.ac.ir/article-1-281-en.html
1- Department of Computing and Information Science University of Guelph Guelph, Canada NlG 2Wl
Abstract:   (2310 Views)

In recent years, performance of the Mobile Ad-Hoc Network (MANET) has become an important research area in the wireless networks community. MANET consists of clusters of Mobile Nodes (MNs) on the access network that could be connected to other clusters through a fixed backbone of routers. The access link contention can severely constrain the end-to-end throughput of the path between a pair of source and destination MNs connected through the backbone. In this paper, we propose an integrated routing system for MANET that includes the backbone paths and the ad-hoc paths formed as a result of direct communication among MNs without going through the backbone. In our proposed routing system, an alternative ad-hoc path can be used only when the primary backbone path is severely constrained due to access links contention. We also propose a scheme for making the MN aware of link quality measures, and incorporate throughput metric in the core of AODV. We implemented the proposed routing system in the OPNET simulator, and evaluated the performance of our scheme under a variety of conditions. Simulation results show that the alternative ad-hoc path is effective in delivering higher throughput when the backbone path is severely constrained.

Full-Text [PDF 2058 kb]   (842 Downloads)    
Type of Study: Research | Subject: Communication Technology

Add your comments about this article : Your username or Email:
CAPTCHA

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.