Uplink scheduling for delay sensitive traffic in broadband wireless networks

Ankara : The Department of Electrical and Electronics Engineering and the Graduate School of Engineering and Science of Bilkent University, 2012.Thesis (Master's) -- Bilkent University, 2012.Includes bibliographical references.In wireless networks, there are two main scheduling problems: uplink (mobile station to base station) and downlink (base station to mobile station). During the downlink scheduling, scheduler at the base station (BS) has access to queue information of mobile stations (MS). On the other hand, for uplink scheduling, BS only has the partial information of the MS since distributing the detailed queue information from all MSs to BS creates significant overhead. In this thesis, we propose a novel uplink scheduling algorithm for delay sensitive traffic in broadband wireless networks. In this proposed algorithm, we extend the bandwidth request/grant mechanism defined in IEEE 802.16 standard and send two bandwidth requests instead of one: one greedy and the other conservative requests. MSs dynamically update these bandwidth requests based on their queue length and bandwidth assignment in previous frames. The scheduler at the BS tries to allocate these bandwidth requests such that the system achieves a high goodput (defined as the rate of error-free packets delivered within a maximum allowed delay threshold) and bandwidth is allocated in a fair manner, both in short term and in steady state. The proposed scheduling algorithm can utilize the network resources higher than 95% of the downlink scheduling algorithms that use the complete queue state information at the MS. Using just partial queue state information, the proposed scheduling algorithm can achieve more than 95% of the total goodput achieved by downlink scheduling algorithms utilizing whole state information. The proposed algorithm also outperforms several downlink scheduling algorithm in terms of short-term fairnessCoşkun, Cemil CanM.S

Delay analysis for wireless applications using a multiservice multiqueue processor sharing model

The ongoing development of wireless networks supporting multimedia applications requires service providers to efficiently deliver complex Quality of Service (QoS) requirements. The wide range of new applications in these networks significantly increases the difficulty of network design and dimensioning to meet QoS requirements. Medium Access Control (MAC) protocols affect QoS achieved by wireless networks. Research on analysis and performance evaluation is important for the efficient protocol design. As wireless networks feature scarce resources that are simultaneously shared by all users, processor sharing (PS) models were proposed for modelling resource sharing mechanisms in such systems. In this thesis, multi-priority MAC protocols are proposed for handling the various service traffic types. Then, an investigation of multiservice multiqueue PS models is undertaken to analyse the delay for some recently proposed wireless applications. We start with an introduction to MAC protocols for wireless networks which are specified in IEEE standards and then review scheduling algorithms which were proposed to work with the underlying MAC protocols to cooperatively achieve QoS goals. An overview of the relevant literature is given on PS models for performance analysis and evaluation of scheduling algorithms. We propose a multiservice multiqueue PS model using a scheduling scheme in multimedia wireless networks with a comprehensive description of the analytical solution. Firstly, we describe the existing multiqueue processor sharing (MPS) model, which uses a fixed service quantum at each queue, and correct a subtle incongruity in previous solutions presented in the literature. Secondly, a new scheduling framework is proposed to extend the previous MPS model to a general case. This newly proposed analytical approach is based on the idea that the service quantum arranged by a MAC scheduling controller to service data units can be priority-based. We obtain a closed-form expression for the mean delay of each service class in this model. In summary, our new approach simplifies MAC protocols for multimedia applications into an analytical model that includes more complex and realistic traffic models without compromising details of the protocol and significantly reduces the number of MAC headers, thus the overall average delay will be decreased. In response to using the studied multiservice multiqueue PS models, we apply the MPS model to two wireless applications: Push to Talk (PTT) service over GPRS/GSM networks and the Worldwide Interoperability for Microwave Access (WiMAX) networks. We investigate the uplink delay of PTT over traditional GPRS/GSM networks and the uplink delay for WiMAX Subscriber Station scheduler under a priority-based fair scheduling. MAC structures capable of supporting dynamically varying traffic are studied for the networks, especially, with the consideration of implementation issues. The model provides useful insights into the dynamic performance behaviours of GPRS/GSM and WiMAX networks with respect to various system parameters and comprehensive traffic conditions. We then evaluate the model under some different practical traffic scenarios. Through modelling of the operation of wireless access systems, under a variety of multimedia traffic, our analytical approaches provide practical analysis guidelines for wireless network dimensioning

Traffic Scheduling in Point-to-Multipoint OFDMA-based Systems

The new generation of wireless networks (e.g., WiMAX, LTE-Advanced, Cognitive Radio) support many high resource-consuming services (e.g., VoIP, video conference, multiplayer interactive gaming, multimedia streaming, digital video broadcasting, mobile commerce). The main problem of such networks is that the bandwidth is limited, besides to be subject to fading process, and shared among multiple users. Therefore, a combination of sophisticated transmission techniques (e.g., OFDMA) and proper packet scheduling algorithms is necessary, in order to provide applications with suitable quality of service. This Thesis addresses the problem of traffic scheduling in Point-to-Multipoint OFDMA-based systems. We formally prove that in such systems, even a simple scheduling problem of a Service Class at a time, is NP-complete, therefore, computationally intractable. An optimal solution is unfeasible in term of time, thus, fast and simple scheduling heuristics are needed. First, we address the Best Effort traffic scheduling issue, in a system adopting variable-length Frames, with the objective of producing a legal schedule (i.e., the one meeting all system constraints) of minimum length. Besides, we present fast and simple heuristics, which generate suboptimal solutions, and evaluate their performance in the average case, as in the worst one. Then, we investigate the scheduling of Real Time traffic, with the objective of meeting as many deadlines as possible, or equivalently, minimizing the packet drop ratio. Specifically, we propose two scheduling heuristics, which apply two different resource allocation mechanisms, and evaluate their average-case performance by means of a simulation experiment

Portfolio peak algorithms achieving superior performance for maximizing throughput in WiMAX networks

The Mobile WiMAX IEEE 802.16 standards ensure provision of last mile wireless access, variable and high data rate, point to multi-point communication, large frequency range and QoS (Quality of Service) for various types of applications. The WiMAX standards are published by the Institute of Electric and Electronic Engineers (IEEE) and specify the standards of services and transmissions. However, the way how to run these services and when the transmission should be started are not specified in the IEEE standards and it is up to computer scientists to design scheduling algorithms that can best meet the standards. Finding the best way to implement the WiMAX standards through designing efficient scheduler algorithms is a very important component in wireless systems and the scheduling period presents the most common challenging issue in terms of throughput and time delay. The aim of the research presented in this thesis was to design and develop an efficient scheduling algorithm to provide the QoS support for real-time and non-real-time services with the WiMAX Network. This was achieved by combining a portfolio of algorithms, which will control and update transmission with the required algorithm by the various portfolios for supporting QoS such as; the guarantee of a maximum throughput for real-time and non-real-time traffic. Two algorithms were designed in this process and will be discussed in this thesis: Fixed Portfolio Algorithms and Portfolio Peak Algorithm. In order to evaluate the proposed algorithms and test their efficiency for IEEE 802.16 networks, the authors simulated the algorithms in the NS2 simulator. Evaluation of the proposed Portfolio algorithms was carried out through comparing its performance with those of the conventional algorithms. On the other hand, the proposed Portfolio scheduling algorithm was evaluated by comparing its performance in terms of throughput, delay, and jitter. The simulation results suggest that the Fixed Portfolio Algorithms and the Portfolio Peak Algorithm achieve higher performance in terms of throughput than all other algorithms. Keywords: WiMAX, IEEE802.16, QoS, Scheduling Algorithms, Fixed Portfolio Algorithms, and Portfolio Peak Algorithms.The Mobile WiMAX IEEE 802.16 standards ensure provision of last mile wireless access, variable and high data rate, point to multi-point communication, large frequency range and QoS (Quality of Service) for various types of applications. The WiMAX standards are published by the Institute of Electric and Electronic Engineers (IEEE) and specify the standards of services and transmissions. However, the way how to run these services and when the transmission should be started are not specified in the IEEE standards and it is up to computer scientists to design scheduling algorithms that can best meet the standards. Finding the best way to implement the WiMAX standards through designing efficient scheduler algorithms is a very important component in wireless systems and the scheduling period presents the most common challenging issue in terms of throughput and time delay. The aim of the research presented in this thesis was to design and develop an efficient scheduling algorithm to provide the QoS support for real-time and non-real-time services with the WiMAX Network. This was achieved by combining a portfolio of algorithms, which will control and update transmission with the required algorithm by the various portfolios for supporting QoS such as; the guarantee of a maximum throughput for real-time and non-real-time traffic. Two algorithms were designed in this process and will be discussed in this thesis: Fixed Portfolio Algorithms and Portfolio Peak Algorithm. In order to evaluate the proposed algorithms and test their efficiency for IEEE 802.16 networks, the authors simulated the algorithms in the NS2 simulator. Evaluation of the proposed Portfolio algorithms was carried out through comparing its performance with those of the conventional algorithms. On the other hand, the proposed Portfolio scheduling algorithm was evaluated by comparing its performance in terms of throughput, delay, and jitter. The simulation results suggest that the Fixed Portfolio Algorithms and the Portfolio Peak Algorithm achieve higher performance in terms of throughput than all other algorithms. Keywords: WiMAX, IEEE802.16, QoS, Scheduling Algorithms, Fixed Portfolio Algorithms, and Portfolio Peak Algorithms

Cross-layer RaCM design for vertically integrated wireless networks

Includes bibliographical references (p. 70-74).Wireless local and metropolitan area network (WLAN/WMAN) technologies, more specifically IEEE 802.11 (or wireless fidelity, WiFi) and IEEE 802.16 (or wireless interoperability for microwave access, WiMAX), are well-suited to enterprise networking since wireless offers the advantages of rapid deployment in places that are difficult to wire. However, these networking standards are relatively young with respect to their traditional mature high-speed low-latency fixed-line networking counterparts. It is more challenging for the network provider to supply the necessary quality of service (QoS) to support the variety of existing multimedia services over wireless technology. Wireless communication is also unreliable in nature, making the provisioning of agreed QoS even more challenging. Considering the advantages and disadvantages, wireless networks prove well-suited to connecting rural areas to the Internet or as a networking solution for areas that are difficult to wire. The focus of this study specifically pertains to IEEE 802.16 and the part it plays in an IEEE vertically integrated wireless Internet (WIN): IEEE 802.16 is a wireless broadband backhaul technology, capable of connecting local area networks (LANs), wireless or fixed-line, to the Internet via a high-speed fixed-line link

Performances of LTE networks

Poussé par la demande croissante de services à haut débit sans fil, Long Term Evolution (LTE) a émergé comme une solution prometteuse pour les communications mobiles. Dans plusieurs pays à travers le monde, la mise en oeuvre de LTE est en train de se développer. LTE offre une architecture tout-IP qui fournit des débits élevés et permet une prise en charge efficace des applications de type multimédia. LTE est spécifié par le 3GPP ; cette technologie fournit une architecture capable de mettre en place des mécanismes pour traiter des classes de trafic hétérogènes comme la voix, la vidéo, les transferts de fichier, les courriers électroniques, etc. Ces classes de flux hétérogènes peuvent être gérées en fonction de la qualité de service requise mais aussi de la qualité des canaux et des conditions environnementales qui peuvent varier considérablement sur une courte échelle de temps. Les standards du 3GPP ne spécifient pas l’algorithmique de l’allocation des ressources du réseau d’accès, dont l’importance est grande pour garantir performance et qualité de service (QoS). Dans cette thèse, nous nous focalisons plus spécifiquement sur la QoS de LTE sur la voie descendante. Nous nous concentrons alors sur la gestion des ressources et l’ordonnancement sur l’interface radio des réseaux d’accès. Dans une première partie, nous nous sommes intéressés à des contextes de macro-cellules. Le premier mécanisme proposé pour l’allocation des ressources combine une méthode de jetons virtuels et des ordonnanceurs opportunistes. Les performances obtenues sont très bonnes mais n’assurent pas une très bonne équité. Notre seconde proposition repose sur la théorie des jeux, et plus spécifiquement sur la valeur de Shapley, pour atteindre un haut niveau d’équité entre les différentes classes de services au détriment de la qualité de service. Cela nous a poussé, dans un troisième mécanisme, à combiner les deux schémas. La deuxième partie de la thèse est consacrée aux femto-cellules (ou femtocells) qui offrent des compléments de couverture appréciables. La difficulté consiste alors à étudier et à minimiser les interférences. Notre premier mécanisme d’atténuation des interférences est fondé sur le contrôle de la puissance de transmission. Il fonctionne en utilisant la théorie des jeux non coopératifs. On effectue une négociation constante entre le débit et les interférences pour trouver un niveau optimal de puissance d’émission. Le second mécanisme est centralisé et utilise une approche de division de la bande passante afin d’obliger les femtocells à ne pas utiliser les mêmes sous-bandes évitant ainsi les interférences. Le partage de bande passante et l’allocation sont effectués en utilisant sur la théorie des jeux (valeur de Shapley) et en tenant compte du type d’application. Ce schéma réduit les interférences considérablement. Tous les mécanismes proposés ont été testés et évalués dans un environnement de simulation en utilisant l’outil LTE-Sim au développement duquel nous avons contribué. ABSTRACT : Driven by the growing demand for high-speed broadband wireless services, Long term Evolution (LTE) technology has emerged as a competitive alternative to mobile communications solution. In several countries around the world, the implementation of LTE has started. LTE offers an IP-based framework that provides high data rates for multimedia applications. Moreover, based on the 3GPP specifications, the technology provides a set of built in mechanisms to support heterogeneous classes of traffic including data, voice and video, etc. Supporting heterogeneous classes of services means that the traffic is highly diverse and has distinct QoS parameters, channel and environmental conditions may vary dramatically on a short time scale. The 3GPP specifications leave unstandardized the resource management and scheduling mechanisms which are crucial components to guarantee the QoS performance for the services. In this thesis, we evaluate the performance and QoS in LTE technology. Moreover, our research addresses the resource management and scheduling issues on the wireless interface. In fact, after surveying, classifying and comparing different scheduling mechanisms, we propose three QoS mechanisms for resource allocation in macrocell scenarios focused on real time services and two mechanisms for interference mitigation in femtocell scenarios taking into account the QoS of real time services. Our first proposed mechanism for resource allocation in macrocell scenarios combines the well known virtual token (or token buckets) method with opportunistic schedulers, our second scheme utilizes game theory, specifically the Shapley value in order to achieve a higher fairness level among classes of services and our third mechanism combines the first and the second proposed schemes. Our first mechanism for interference mitigation in femtocell scenarios is power control based and works by using non cooperative games. It performs a constant bargain between throughput and SINR to find out the optimal transmit power level. The second mechanism is centralised, it uses a bandwidth division approach in order to not use the same subbands to avoid interference. The bandwidth division and assignation is performed based on game theory (Shapley value) taking into account the application bitrate . This scheme reduces interference considerably and shows an improvement compared to other bandwidth division schemes. All proposed mechanism are performed in a LTE simulation environment. several constraints such as throughput, Packet Loss Ratio, delay, fairness index, SINR are used to evaluate the efficiency of our scheme

Performances des Réseaux LTE

Poussé par la demande croissante de services à haut débit sans fil, Long Term Evolution (LTE) a émergé comme une solution prometteuse pour les communications mobiles. Dans plusieurs pays à travers le monde, la mise en oeuvre de LTE est en train de se développer. LTE offre une architecture tout-IP qui fournit des débits élevés et permet une prise en charge efficace des applications de type multimédia. LTE est spécifié par le 3GPP ; cette technologie fournit une architecture capable de mettre en place des mécanismes pour traiter des classes de trafic hétérogènes comme la voix, la vidéo, les transferts de fichier, les courriers électroniques, etc. Ces classes de flux hétérogènes peuvent être gérées en fonction de la qualité de service requise mais aussi de la qualité des canaux et des conditions environnementales qui peuvent varier considérablement sur une courte échelle de temps. Les standards du 3GPP ne spécifient pas l algorithmique de l allocation des ressources du réseau d accès, dont l importance est grande pour garantir performance et qualité de service (QoS). Dans cette thèse, nous nous focalisons plus spécifiquement sur la QoS de LTE sur la voie descendante. Nous nous concentrons alors sur la gestion des ressources et l ordonnancement sur l interface radio des réseaux d accès. Dans une première partie, nous nous sommes intéressés à des contextes de macro-cellules. Le premier mécanisme proposé pour l allocation des ressources combine une méthode de jetons virtuels et des ordonnanceurs opportunistes. Les performances obtenues sont très bonnes mais n assurent pas une très bonne équité. Notre seconde proposition repose sur la théorie des jeux, et plus spécifiquement sur la valeur de Shapley, pour atteindre un haut niveau d équité entre les différentes classes de services au détriment de la qualité de service. Cela nous a poussé, dans un troisième mécanisme, à combiner les deux schémas. La deuxième partie de la thèse est consacrée aux femto-cellules (ou femtocells) qui offrent des compléments de couverture appréciables. La difficulté consiste alors à étudier et à minimiser les interférences. Notre premier mécanisme d atténuation des interférences est fondé sur le contrôle de la puissance de transmission. Il fonctionne en utilisant la théorie des jeux non coopératifs. On effectue une négociation constante entre le débit et les interférences pour trouver un niveau optimal de puissance d émission. Le second mécanisme est centralisé et utilise une approche de division de la bande passante afin d obliger les femtocells à ne pas utiliser les mêmes sous-bandes évitant ainsi les interférences. Le partage de bande passante et l allocation sont effectués en utilisant sur la théorie des jeux (valeur de Shapley) et en tenant compte du type d application. Ce schéma réduit les interférences considérablement. Tous les mécanismes proposés ont été testés et évalués dans un environnement de simulation en utilisant l outil LTE-Sim au développement duquel nous avons contribué.Driven by the growing demand for high-speed broadband wireless services, Long term Evolution (LTE) technology has emerged as a competitive alternative to mobile communications solution. In several countries around the world, the implementation of LTE has started. LTE offers an IP-based framework that provides high data rates for multimedia applications. Moreover, based on the 3GPP specifications, the technology provides a set of built in mechanisms to support heterogeneous classes of traffic including data, voice and video, etc. Supporting heterogeneous classes of services means that the traffic is highly diverse and has distinct QoS parameters, channel and environmental conditions may vary dramatically on a short time scale. The 3GPP specifications leave unstandardized the resource management and scheduling mechanisms which are crucial components to guarantee the QoS performance for the services. In this thesis, we evaluate the performance and QoS in LTE technology. Moreover, our research addresses the resource management and scheduling issues on the wireless interface. In fact, after surveying, classifying and comparing different scheduling mechanisms, we propose three QoS mechanisms for resource allocation in macrocell scenarios focused on real time services and two mechanisms for interference mitigation in femtocell scenarios taking into account the QoS of real time services. Our first proposed mechanism for resource allocation in macrocell scenarios combines the well known virtual token (or token buckets) method with opportunistic schedulers, our second scheme utilizes game theory, specifically the Shapley value in order to achieve a higher fairness level among classes of services and our third mechanism combines the first and the second proposed schemes. Our first mechanism for interference mitigation in femtocell scenarios is power control based and works by using non cooperative games. It performs a constant bargain between throughput and SINR to find out the optimal transmit power level. The second mechanism is centralised, it uses a bandwidth division approach in order to not use the same subbands to avoid interference. The bandwidth division and assignation is performed based on game theory (Shapley value) taking into account the application bitrate . This scheme reduces interference considerably and shows an improvement compared to other bandwidth division schemes. All proposed mechanism are performed in a LTE simulation environment. several constraints such as throughput, Packet Loss Ratio, delay, fairness index, SINR are used to evaluate the efficiency of our schemesTOULOUSE-INP (315552154) / SudocSudocFranceF

Resource Allocation in Relay-based Satellite and Wireless Communication Networks

A two-level bandwidth allocation scheme is proposed for a slotted Time-Division Multiple Access high data rate relay satellite communication link to provide efficient and fair channel utilization. The long-term allocation is implemented to provide per-flow/per-user Quality-of-Service guarantees and shape the average behavior. The time-varying short-term allocation is determined by solving an optimal timeslot scheduling problem based on the requests and other parameters. Through extensive simulations, the performance of a suitable MAC protocol with two-level bandwidth allocation is analyzed and compared with that of the existing static fixed-assignment scheme in terms of end-to-end delay and successful throughput. It is also shown that pseudo-proportional fairness is achieved for our hybrid protocol. We study rate control systems with heterogeneous time-varying propagation delays, based on analytic fluid flow models composed of first-order delay-differential equations. Both single-flow and multi-flow system models are analyzed, with special attention paid to the Mitra-Seery algorithm. The stationary solutions are investigated. For the fluctuating solutions, their dynamic behavior is analyzed in detail, analytically and numerically, in terms of amplitude, transient behavior, fairness and adaptability, etc.. Especially the effects of heterogeneous time-varying delays are investigated. It is shown that with proper parameter design the system can achieve stable behavior with close to pointwise proportional fairness among flows. Finally we investigate the resource allocation in 802.16j multi-hop relay systems with rate fairness constraints for two mutually exclusive options: transparent and non-transparent relay systems (T-RS and NT-RS). Single-Input Single-Output and Multi-Input Multi-Output antenna systems are considered in the links between the Base Station (BS) and Relay Stations (RS). 1 and 3 RSs per sector are considered. The Mobile Station (MS) association rule, which determines the access station (BS or RS) for each MS, is also studied. Two rules: Highest MCS scheme with the highest modulation and coding rate, and Highest (Mod) ESE scheme with the highest (modified) effective spectrum efficiency, are studied along with the optimal rule that maximizes system capacity with rate fairness constraints. Our simulation results show that the highest capacity is always achieved by NT-RS with 3 RSs per sector in distributed scheduling mode, and that the Highest (Mod) ESE scheme performs closely to the optimal rule in terms of system capacity

Cross-Layer RaCM Design for Vertically Integrated Wireless Networks

IEEE 802.16 wireless metropolitan area network (WMAN) technology is an improvement on its wireless local area network (WLAN) counterpart, namely IEEE 802.11, in that it provides longer range and higher bandwidth capabilities. More importantly, it specifies a connection-oriented medium access control layer (MAC) and scheduling services to support quality of service (QoS) in IEEE 802.16 networks. However, in the standard, scheduling and connection admission control (CAC) mechanisms are left unspecified, leaving this for network operators to decide. This allows implementers to create market and performance advantages, making it a rich field of research and performance analysis. Typically, researchers studying scheduling and admission control in such wireless networks consider these resource and connection management (RaCM) algorithms in isolation: They investigate (1) schedulers while fixing the admission control processes or using static connection scenarios and (2) admission controllers while fixing the scheduling processes. We hypothesize that there exists an interdependent relationship between RaCM components which is an essential aspect to cross-layer inter-RaCM algorithm design. In order to prove our hypothesis that you cannot consider the scheduler and the CAC in isolation, where it involves the performance of IEEE 802.16 networks, we require a performance model: Analytic modelling is an ideal solution but the system is far too complex. Experimental test beds are expensive, making hardware experimentation another impractical solution. The only other feasible solution is simulation. General simulation environments, such as NS2 and OMNeT++, offer IEEE 802.16 libraries and some degree of development community support. However, for several reasons, as we shall discuss, we developed our own deep simulator – a discrete-event simulation model of an IEEE vertically integrated wireless Internet scenario. In particular, we concentrate our effort on the fixed IEEE 802.16 WMAN (802.16-2004), simulating admission control and scheduling processes exactly. Both the machine model and workload model play an integral part in obtaining useful performance data: Our machine model includes particular MAC and physical layer (PHY) functions of the standard, such as framing, adaptive modulation and coding, fragmentation, and so on, as well as the admission control and scheduling algorithms. For the workload model, we developed a Markov Modulated Arrival Process (MMAP) by combining existing traffic models of different Internet applications, such as VoIP, P2P, etc. Each application is associated with one of the IEEE 802.16 traffic categories (TCs). The MMAP generates both connection– and packet level data, maintaining traffic volume ratios, as reported by previous studies of Internet application traffic volumes. Performance metrics of delay and jitter are calculated per TC connection. This allows a comparison of the quality of experience (QoE) of an individual user for the duration of a connection. At the connection level, we report the blocking probability. By simulating the RaCM with various admission control and scheduling configurations, we were able to show that there is a significant difference in performance when using different CAC and scheduler combinations. Although hardly surprising, it is still proof that one cannot simply consider either in isolation, as is done in various performance studies reported in the literature. This interdependent relationship should be considered when designing complementary admission control and scheduling algorithms

Design and Analysis of Medium Access Control Protocols for Broadband Wireless Networks

The next-generation wireless networks are expected to integrate diverse network architectures and various wireless access technologies to provide a robust solution for ubiquitous broadband wireless access, such as wireless local area networks (WLANs), Ultra-Wideband (UWB), and millimeter-wave (mmWave) based wireless personal area networks (WPANs), etc. To enhance the spectral efficiency and link reliability, smart antenna systems have been proposed as a promising candidate for future broadband access networks. To effectively exploit the increased capabilities of the emerging wireless networks, the different network characteristics and the underlying physical layer features need to be considered in the medium access control (MAC) design, which plays a critical role in providing efficient and fair resource sharing among multiple users. In this thesis, we comprehensively investigate the MAC design in both single- and multi-hop broadband wireless networks, with and without infrastructure support. We first develop mathematical models to identify the performance bottlenecks and constraints in the design and operation of existing MAC. We then use a cross-layer approach to mitigate the identified bottleneck problems. Finally, by evaluating the performance of the proposed protocols with analytical models and extensive simulations, we determine the optimal protocol parameters to maximize the network performance. In specific, a generic analytical framework is developed for capacity study of an IEEE 802.11 WLAN in support of non-persistent asymmetric traffic flows. The analysis can be applied for effective admission control to guarantee the quality of service (QoS) performance of multimedia applications. As the access point (AP) becomes the bottleneck in an infrastructure based WLAN, we explore the multiple-input multiple-output (MIMO) capability in the future IEEE 802.11n WLANs and propose a MIMO-aware multi-user (MU) MAC. By exploiting the multi-user degree of freedom in a MIMO system to allow the AP to communicate with multiple users in the downlink simultaneously, the proposed MU MAC can minimize the AP-bottleneck effect and significantly improve the network capacity. Other enhanced MAC mechanisms, e.g., frame aggregation and bidirectional transmissions, are also studied. Furthermore, different from a narrowband system where simultaneous transmissions by nearby neighbors collide with each other, wideband system can support multiple concurrent transmissions if the multi-user interference can be properly managed. Taking advantage of the salient features of UWB and mmWave communications, we propose an exclusive region (ER) based MAC protocol to exploit the spatial multiplexing gain of centralized UWB and mmWave based wireless networks. Moreover, instead of studying the asymptotic capacity bounds of arbitrary networks which may be too loose to be useful in realistic networks, we derive the expected capacity or transport capacity of UWB and mmWave based networks with random topology. The analysis reveals the main factors affecting the network (transport) capacity, and how to determine the best protocol parameters to maximize the network capacity. In addition, due to limited transmission range, multi-hop relay is necessary to extend the communication coverage of UWB networks. A simple, scalable, and distributed UWB MAC protocol is crucial for efficiently utilizing the large bandwidth of UWB channels and enabling numerous new applications cost-effectively. To address this issue, we further design a distributed asynchronous ER based MAC for multi-hop UWB networks and derive the optimal ER size towards the maximum network throughput. The proposed MAC can significantly improve both network throughput and fairness performance, while the throughput and fairness are usually treated as a tradeoff in other MAC protocols