TY - GEN
T1 - Optimized O-ACK
T2 - 12th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2015
AU - Ahsan, Shegufta Bakht
AU - Vaidya, Nitin
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/11/25
Y1 - 2015/11/25
N2 - In wireless LANs, MAC protocols perform one of the most important tasks: efficiently sharing the limited bandwidth among the contending stations. In IEEE 802.11, Distributed Coordination Function (DCF) is used as a default MAC protocol. Despite its wide acceptance, it has two major downsides: i) Channel idle time and ii) Collision overheads. Besides, the use of the explicit ack frames incurs extra overhead due to the preamble, packet headers etc. This paper presents an optimized version of the Overheard-ACK (O-ACK) protocol (presented in [2]) which incorporates piggybacking, packet overhearing and token based scheduling to significantly reduce the overheads. The previous version of O-ACK creates chains of transmissions, where consecutive transmissions are separated by SIFS interval, which increases the throughput. But on the downside, as two adjacent transmissions are separated by only SIFS idle time, a newly arrived station cannot start transmission. Our current version of O-ACK ensures higher throughput and fairness in multiple AP scenario by continuously adapting the chain creation process based on the surrounding environment. Our NS-2 based simulation results confirm that this protocol significantly outperforms the DCF protocol.
AB - In wireless LANs, MAC protocols perform one of the most important tasks: efficiently sharing the limited bandwidth among the contending stations. In IEEE 802.11, Distributed Coordination Function (DCF) is used as a default MAC protocol. Despite its wide acceptance, it has two major downsides: i) Channel idle time and ii) Collision overheads. Besides, the use of the explicit ack frames incurs extra overhead due to the preamble, packet headers etc. This paper presents an optimized version of the Overheard-ACK (O-ACK) protocol (presented in [2]) which incorporates piggybacking, packet overhearing and token based scheduling to significantly reduce the overheads. The previous version of O-ACK creates chains of transmissions, where consecutive transmissions are separated by SIFS interval, which increases the throughput. But on the downside, as two adjacent transmissions are separated by only SIFS idle time, a newly arrived station cannot start transmission. Our current version of O-ACK ensures higher throughput and fairness in multiple AP scenario by continuously adapting the chain creation process based on the surrounding environment. Our NS-2 based simulation results confirm that this protocol significantly outperforms the DCF protocol.
KW - Fairness
KW - Multiple Access Point
KW - Packet Overhearing
KW - Token Passing
UR - http://www.scopus.com/inward/record.url?scp=84960900220&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84960900220&partnerID=8YFLogxK
U2 - 10.1109/SAHCN.2015.7338307
DO - 10.1109/SAHCN.2015.7338307
M3 - Conference contribution
AN - SCOPUS:84960900220
T3 - 2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2015
SP - 163
EP - 165
BT - 2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2015
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 22 June 2015 through 25 June 2015
ER -