We propose the "bounds selection-dynamic reset algorithm" (sB-DRA) protocol for wireless ad hoc LANs. The sB-DRA consists of the selection/adjustment of the contention window (CW) interval (selection Bounds algorithm-sB from our previous work (Romaszko and Blondia, 2006)) and the resetting of the contention window value dynamically after a dropped packet or successful transmission (enhanced dynamic resetting algorithm - DRA). The sB algorithm allows to adjust the lower and upper bounds of the CW interval taking into account the number of 1-hop active neighbours and the number of transmission attempts during the recovery mechanism. The DRA considers the number of 1-hop neighbours and their change (fast/slow increase/decrease) during recovery process. The enhanced DRA algorithm can be tuned dynamically depending on the channel conditions. The sB-DRA protocol achieves better throughput and significantly reduces the number of collisions and packet loss compared to the IEEE 802.11 DCF standard (1999). We have also shown that the sB algorithm outperforms the basic (without resetting the Backoff ranges mechanism) "deterministic contention window algorithm" (DCWA) (Ksentini et al., 2005) in mobile ad hoc networks.
['Sylwia Romaszko', 'Chris Blondia']
Bounds Selection - Dynamic Reset Protocol for Wireless Ad Hoc LANs