抽象的

Minimizing Idle Time and Collision Time Using Token DCF With Append Process and Change Contention Window Size for Wireless Network

Shailja Uikey, Namrata Sahayam

IEEE 802.11 DCF is the MAC protocol currently used in wireless LANs. However, due to idle and collision times, 802.11 DCF performs poorly when it comes to channel utilization, system throughput, and channel access time. To overcome these sources of inefficiency in 802.11 DCF, we propose a distributed and dynamically adaptive MAC protocol for wireless networks, called Token-DCF with Append process and change contention window size. Main focus of our approach is on reducing idle and collision times by introducing an algorithm of token passing using Append process and change contention window size. In Append process strong data searched by DCF process and its queue length if greater than the threshold level, will focus on the minimum queue length in header list and add it with the new neighboring node by increasing system throughput and channel access time. We simulate in ns-2 to measure and compare performance of MAC protocols.