By Topic

On a new queue backoff fair algorithm for 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
$31 $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)
Chuanxia Wu ; Inst. of Mobile Commun., Southwest Jiaotong Univ., Chengdu, China ; Junhuan Feng ; Pingzhi Fan

The medium access control (MAC) protocol through which mobile nodes can share a common broadcast channel is essential in ad hoc networks. Due to the existence of hidden terminals and multihop feature of ad hoc networks, contention among nodes is not homogeneous. Some nodes are at a disadvantage in access to the shared channel and suffer severe throughput degradation when load to channel is high. This is known as the "fairness problem". A new simple yet effective queue backoff fair algorithm is proposed. To quantify the degree of the fairness effect of the algorithm, an improved fairness index (IFI) is also defined. Based on IFI, the goal of achieving channel access fairness relative to effective aggregate throughput becomes equivalent to minimizing the improved fairness index. Analysis and simulation results show that, by choosing appropriate parameters, the new algorithm achieve lower improved fairness index and consequently improve the fairness relative to effective aggregate throughput, compared with the IEEE 802.11 binary exponential backoff (BEB) algorithm and other algorithms.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Date of Conference:

27-29 Aug. 2003