By Topic

Neighbourhood backoff algorithm for optimizing bandwidth in single hop wireless ad-hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. Taifour ; LIFL/IRCiCA Lab., Lille Univ. of Sci. & Technol., France ; F. Nait-Abdesselam ; D. Simplot-Ryl

When using a random access method, such as IEEE 802.11 CSMA/CA scheme, in mobile ad hoc networks, a large bandwidth capacity is wasted due to many collisions. To improve the channel capacity, we propose a new backoff algorithm named neighbourhood backoff algorithm (NBA). A novel feature of the NBA scheme is its neighbourhood consideration, in which every node modifies its backoff interval according to the number TV of its neighbours. In order to find the optimum parameters for NBA, we have studied the backoff intervals as fund on of different number of active nodes (N) in a single transmission area. We have found that the minimum contention window is proportional to the number of neighbours. Our experiments show a better behaviour of the NBA scheme in comparison to the BEB (binary exponential backoff) scheme defined in IEEE 802.11 CSMA/CA.

Published in:

2005 International Conference on Wireless Networks, Communications and Mobile Computing  (Volume:1 )

Date of Conference:

13-16 June 2005