An Adaptive Backoff Algorithm for Mobile Ad-Hoc Networks

An Adaptive Backoff Algorithm for Mobile Ad-Hoc Networks

Yaser Khamayseh, Muneer Bani Yassein, Iman I. Badran, Wail Mardini
Copyright: © 2011 |Volume: 3 |Issue: 3 |Pages: 19
ISSN: 1937-9412|EISSN: 1937-9404|EISBN13: 9781613508459|DOI: 10.4018/jmcmc.2011070101
Cite Article Cite Article

MLA

Khamayseh, Yaser, et al. "An Adaptive Backoff Algorithm for Mobile Ad-Hoc Networks." IJMCMC vol.3, no.3 2011: pp.1-19. http://doi.org/10.4018/jmcmc.2011070101

APA

Khamayseh, Y., Yassein, M. B., Badran, I. I., & Mardini, W. (2011). An Adaptive Backoff Algorithm for Mobile Ad-Hoc Networks. International Journal of Mobile Computing and Multimedia Communications (IJMCMC), 3(3), 1-19. http://doi.org/10.4018/jmcmc.2011070101

Chicago

Khamayseh, Yaser, et al. "An Adaptive Backoff Algorithm for Mobile Ad-Hoc Networks," International Journal of Mobile Computing and Multimedia Communications (IJMCMC) 3, no.3: 1-19. http://doi.org/10.4018/jmcmc.2011070101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Collision is a common problem in Mobile Ad Hoc Networks (MANETs). There are several backoff algorithms that have been proposed to avoid this problem. This paper proposes a new backoff algorithm called the Square Root Backoff (SRB). Moreover, it identifies that no algorithm can perform the best in all cases. Therefore, an adaptive strategy is proposed to choose the best backoff mechanism from a set of mechanisms based on network density and mobility parameters. The proposed adaptive algorithm is implemented in two phases, the offline phase and the online phase. Such design aims at reducing the time complexity of the algorithm by performing some of the computations prior to the actual deployment and of the network. Results from simulations demonstrate that the SRB algorithm achieved better performance than BEB and LB. Moreover, the adaptive backoff algorithm obtains the best throughput and end-to-end delay performance over the other backoff algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.