IEICE TRANSACTIONS on Communications
Virtual-FIFO Back-Off Algorithm for Collision Resolution in Wireless Networks
Summary :
This investigation proposes a virtual-FIFO (VFIFO) back-off algorithm for wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) algorithms. The proposed scheme exploits the CU's capability for collision detection to estimate the number of simultaneously competing users. Additionally, packets generated in a given cycle are split into groups according to their times of arrivals and are guaranteed to be serviced one after another within the next cycle. Although the proposed algorithm is not strictly first come fist served, the FIFO principle is virtually accomplished. Simulation results demonstrate that the standard deviation of delay can be improved by more than two orders and the throughput can be maintained at 0.42 when the number of users approaches infinity. The capture effect even further improves system performance.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.10 pp.4056-4063
- Publication Date
- 2005/10/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.10.4056
- Type of Manuscript
- PAPER
- Category
- Wireless Communication Technologies
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Chih-Peng LI, "Virtual-FIFO Back-Off Algorithm for Collision Resolution in Wireless Networks" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 10, pp. 4056-4063, October 2005, doi: 10.1093/ietcom/e88-b.10.4056.
Abstract: This investigation proposes a virtual-FIFO (VFIFO) back-off algorithm for wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) algorithms. The proposed scheme exploits the CU's capability for collision detection to estimate the number of simultaneously competing users. Additionally, packets generated in a given cycle are split into groups according to their times of arrivals and are guaranteed to be serviced one after another within the next cycle. Although the proposed algorithm is not strictly first come fist served, the FIFO principle is virtually accomplished. Simulation results demonstrate that the standard deviation of delay can be improved by more than two orders and the throughput can be maintained at 0.42 when the number of users approaches infinity. The capture effect even further improves system performance.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.10.4056/_p
Copy
@ARTICLE{e88-b_10_4056,
author={Chih-Peng LI, },
journal={IEICE TRANSACTIONS on Communications},
title={Virtual-FIFO Back-Off Algorithm for Collision Resolution in Wireless Networks},
year={2005},
volume={E88-B},
number={10},
pages={4056-4063},
abstract={This investigation proposes a virtual-FIFO (VFIFO) back-off algorithm for wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) algorithms. The proposed scheme exploits the CU's capability for collision detection to estimate the number of simultaneously competing users. Additionally, packets generated in a given cycle are split into groups according to their times of arrivals and are guaranteed to be serviced one after another within the next cycle. Although the proposed algorithm is not strictly first come fist served, the FIFO principle is virtually accomplished. Simulation results demonstrate that the standard deviation of delay can be improved by more than two orders and the throughput can be maintained at 0.42 when the number of users approaches infinity. The capture effect even further improves system performance.},
keywords={},
doi={10.1093/ietcom/e88-b.10.4056},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Virtual-FIFO Back-Off Algorithm for Collision Resolution in Wireless Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 4056
EP - 4063
AU - Chih-Peng LI
PY - 2005
DO - 10.1093/ietcom/e88-b.10.4056
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2005
AB - This investigation proposes a virtual-FIFO (VFIFO) back-off algorithm for wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) algorithms. The proposed scheme exploits the CU's capability for collision detection to estimate the number of simultaneously competing users. Additionally, packets generated in a given cycle are split into groups according to their times of arrivals and are guaranteed to be serviced one after another within the next cycle. Although the proposed algorithm is not strictly first come fist served, the FIFO principle is virtually accomplished. Simulation results demonstrate that the standard deviation of delay can be improved by more than two orders and the throughput can be maintained at 0.42 when the number of users approaches infinity. The capture effect even further improves system performance.
ER -
English
