Dynamic Sliding Contention Window Adjustment in Saturated Wireless Networks

Author

Mala, C. ; Nithya, B.

Author_Institution

Dept. of Comput. Sci. & Eng., Nat. Inst. of Technol., Tiruchirappalli, India

fYear

2014

fDate

10-12 Sept. 2014

Firstpage

186

Lastpage

193

Abstract

Most of the existing back off algorithms adjust the Contention Window (CW) only after the occurrences of collision in wireless networks. To prevent/ reduce further collisions, this paper proposes a sliding CW approach, to be done, after each successful transmission. Based on the current channel status measured by channel utilization and contention ratio, sliding factors are determined to adjust both lower and upper bounds of CW. The NS2 simulation results show that the proposed algorithm significantly outperforms the conventional Binary Exponential Back off (BEB) and Double Increment Double Decrement (DIDD) algorithms in terms of throughput, delay and packet loss.

Keywords

radio networks; telecommunication channels; NS2 simulation; binary exponential backoff algorithm; channel utilization; delay; double increment double decrement algorithm; dynamic sliding contention window adjustment; packet loss; saturated wireless networks; sliding CW approach; sliding factors; Delays; Heuristic algorithms; Packet loss; Throughput; Topology; Upper bound; Backoff Algorithm; Channel Utilization; Contention Ratio; Contention Window; NS2; Wireless Networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Network-Based Information Systems (NBiS), 2014 17th International Conference on

Conference_Location

Salerno

Print_ISBN

978-1-4799-4226-8

Type

conf

DOI

10.1109/NBiS.2014.14

Filename

7023952