A New Dynamic Scheme for Efficient RTS Threshold Handling in Wireless Networks
| Autor: | Mostafa Mjidi, Kazuhide Koide, Atushi Takeda, Debasish Chakraborty, N. Nakamura, Norio Shiratori |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Mobile radio
Hidden node problem Computer science Network packet Wireless network business.industry Node (networking) ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Throughput Mobile ad hoc network Network simulation Handshaking Multiple Access with Collision Avoidance for Wireless Wireless business Carrier sense multiple access with collision avoidance Computer network |
| Zdroj: | AINA |
| DOI: | 10.1109/aina.2008.87 |
| Popis: | Wireless network is an essential and integral part of the ubiquitous environment. For efficient access control, two different transmission schemes are used: The basic carrier sensing multiple access with collision avoidance (CSMA/CA) and request-to-send/ clear-to-send (RTS/CTS) handshaking. The RTS/CTS handshaking addresses the hidden terminal problem as well as reduces the chance of collision in case of higher node density and traffic. However, in networks with low density, basic scheme would lead to higher throughput due to its less overhead. Efficient switching between these two schemes is imperative to maximize the throughput. We have first investigated to find a meaningful threshold value according to the network situation. The proposed algorithm then dynamically adjusts RTS Threshold according to the packet delivery ratio, which is an indicator of network traffic and shows a significant improvement over existing CSMA/CA and RTS/CTS schemes. Our adaptive scheme performed even better when data rates increases. We verify our proposed scheme with extensive network simulation using ns-2. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|