Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2012.030939
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 3 Issue 9, 2012.
Abstract: MANET is a self-directed system consisting of mobile nodes, which can be either routers and/or hosts. Nodes in MANET are connected by wireless links without base stations. The Backoff algorithm considered as a main element of Media Access Control (MAC) protocol, which is used to avoid collision in MANET’s. The Fibonacci Backoff algorithm and the Pessimistic Fibonacci Backoff are proposed to improve network performance depending on contention window size. This research introduces a new hybrid Backoff algorithm called Pessimistic Fibonacci Backoff (PFB) Algorithm which merges the two previous algorithms in order to find the most proper contention window sizes that reduce collisions as much as possible. This research takes into consideration and evaluates each of the following main measurements: Packet delivery ratio, normalized routing load and end-to-end delay. Based on the extracted simulation results, PFB algorithm outperforms Pessimistic Linear-Exponential Backoff (PLEB) by up to 76%,40.41%, 31.88% in terms of Packet delivery ratio, end-to-end delay and normalized routing load respectively, especially in the sparse environments. All of the simulation results are obtained by the well-known NS-2 Simulator, version 2.34, without any distance or location measurements devices.
Muneer Bani Yassein, Mohammed Ahmed Alomari and Constandinos X. Mavromoustakis, “Optimized Pessimistic Fibonacci Back-off Algorithm (PFB)” International Journal of Advanced Computer Science and Applications(IJACSA), 3(9), 2012. http://dx.doi.org/10.14569/IJACSA.2012.030939