Intelligent medium access control for the future wireless networks

Abstract

<div lang="en" class="abs"><p class="abs_header">Abstract</p><p>Medium access control (MAC) in wireless ad hoc networks has received considerable attention for almost a couple of decades; however, there are still open problems which deserve thorough study in order to facilitate migration to the next generation broadband wireless communication systems. In ad hoc networks, a detected frame collision can be due to the so-called unreachability problem, where the destination station is situated either in the transmission or interference range of an emitting station and is unable to receive connection establishment frames from any of its neighboring stations. Unreachability might also be due to the inability of a radio station to respond to any connection establishment request, though when the unreachable station receives the connection establishment requests, however, it is prohibited from responding to the requests due to being situated in the interference range of the emitting neighbor. </p><p>To investigate the impact of this problem, we have to be equipped with a proper analytical framework; therefore, as the first part of this thesis, a scalable framework called Parallel Space – Time Markov chain (PSTMC) is proposed, through which a finite load non-saturated ad hoc network can be easily modeled. At the first step, a single-hop ad hoc network is considered and the accuracy of the model is evaluated using extensive numerical results. Subsequently, the proposed framework is further extended to model multi-hop ad hoc networks. Several discussions are also given on how the framework can be deployed for an arbitrary network topology. One of the main key features of the PSTMC model is its remarkable scalability in modeling complex network configurations. In fact, it is shown that multi-hop ad hoc networks have bounded complexity in being modeled by the PSTMC framework due to its spectacular specifications. These features lead us to a powerful tool by which an arbitrary network topology can be studied. In addition, the proposed models clearly facilitate demonstrating the impact of the unreachability problem on the performance of multi-hop networks. The introduced framework shows how the unreachability problem degrades the achieved throughput and channel capacity by the contending radio stations depending on the deployed network topology. </p><p>In the remainder of the thesis the unreachability problem in mobile ad hoc networks is tackled and a new MAC protocol to enhance the performance of the network is proposed. This MAC scheme is equipped with smart decision-making algorithms as well as adaptive management mechanisms to reduce the impact of the unreachability problem in single channel scenarios. Subsequently, the problem of concurrent radio resource management and contention resolution in multi-channel cognitive ad hoc networks is considered. In particular, a multi-channel technique for traffic distribution among a set of data channels without centralized control, which is enabled by a probabilistic channel selection algorithm as well as a multi-channel binary exponential backoff mechanism, is proposed. It is shown through simulations that the suggested scheme outperforms the existing MAC protocols in multi-channel environments as well as cognitive networks coexisting with primary users. A mathematical model is also introduced to study the performance of the multi-channel MAC protocol in a single-hop non-saturated wireless network. </p></div>