It is well known that one of the critical sources of TCP poor performance in multihop ad hoc networks lies in the TCP window mechanism that controls the amount of traffic sent into the network. In this paper, we propose a novel cross layer solution called “TCP Contention Control” that dynamically adjusts the amount of outstanding data in the network based on the level of contention experienced ...

The paper proposes a Waiting-time Dependent Increasing rate Adapted Backoff (WDIA) algorithm to improve the contention efficiency in the IEEE 802.16e (OFDMA). A contention model is first proposed to analyze the frame-based behavior of contention resolution in 802.16e network. We introduce the concept of reduced overlapping between back-off windows of contending stations and we adopt adaptable i...

Space switches suffer from external blocking because of output port contention. We review contention resolution methods used to avoid external blocking, and choose a solution based on ring reservation, resulting in an elegant and efficient mechanism requiring only nearest-neighbor communications. In addition to external blocking, space switches suffer from head-of-line (HOL) blocking, and we pr...

In mobile ad hoc networks, researchers defines various solutions for MAC aware routing to improve the network performance. In case of contention at MAC layer, the solution which is provided for routing is not feasible so there is need to explore behavior of MAC protocol and compatibility with routing protocols. In this survey paper, we will discuss some contention based solutions those were dev...

In this paper, the concepts of the MAC (Medium Access Control) protocol and traffic scheduling in the radio interface, as are currently worked out in the ACTS Project Magic WAND (Wireless ATM Network Demonstrator) are presented. Since the MAC protocol is based both on reservation and contention techniques, it has been named Mobile Access Scheme based on Contention And Reservation for ATM, or MA...

We propose obstruction-free step complexity, a new complexity measure for nonblocking algorithms. We believe that this measure provides a more pragmatic quantification of nonblocking algorithms than previous measures, providing better guidance for designers of practical nonblocking algorithms. In our opinion, the main shortcoming of existing complexity measures for nonblocking algorithms is tha...

This paper describes the new application of the classical occupancy problem to the establishments of ad hoc wireless local area networks. A contention-based algorithm called uniform for network setups is introduced in this paper. The major evaluation criterion for this algorithm is the contention time needed to complete the initial establishment of a network. This paper obtains the exact recurs...

User diversity arises when wireless users experience diverse channel conditions. This paper proposes three opportunistic random access algorithms that favor users with the best channel conditions in channel access. These algorithms operate on the contention mechanism of CSMA/CA and compute the contention window based on channel conditions. In one algorithm, the contention windows of all users s...