Cross-layer design and optimization of medium access control protocols for wlans

This thesis provides a contribution to the field of Medium Access Control (MAC) layer protocol design for wireless networks by proposing and evaluating mechanisms that enhance different aspects of the network performance. These enhancements are achieved through the exchange of information between different layers of the traditional protocol stack, a concept known as Cross-Layer (CL) design. The main thesis contributions are divided into two parts. The first part of the thesis introduces a novel MAC layer protocol named Distributed Queuing Collision Avoidance (DQCA). DQCA behaves as a reservation scheme that ensures collision-free data transmissions at the majority of the time and switches automatically to an Aloha-like random access mechanism when the traffic load is low. DQCA can be enriched by more advanced scheduling algorithms based on a CL dialogue between the MAC and other protocol layers, to provide higher throughput and Quality of Service (QoS) guarantees. The second part of the thesis explores a different challenge in MAC layer design, related to the ability of multiple antenna systems to offer point-to-multipoint communications. Some modifications to the recently approved IEEE 802.11n standard are proposed in order to handle simultaneous multiuser downlink transmissions. A number of multiuser MAC schemes that handle channel access and scheduling issues and provide mechanisms for feedback acquisition have been presented and evaluated. The obtained performance enhancements have been demonstrated with the help of both theoretical analysis and simulation obtained results

Providing QoS in a Cognitive Radio Network

Abstract-We consider the problem of wireless channel allocation (whenever the channels are free) to multiple cognitive radio users in a Cognitive Radio Network (CRN) so as to satisfy their Quality of Service (QoS) requirements efficiently. The CRN base station may not know the channel states of all the users. The multiple channels are available at random times. In this setup Opportunistic Splitting can be an attractive solution. A disadvantage of this algorithm is that it requires the metrics of all users to be an independent, identically distributed sequence. However we use a recently generalized version of this algorithm in which the optimal parameters are learnt on-line through stochastic approximation and metrics can be Markov. We provide scheduling algorithms which maximize weightedsum system throughput or are throughput or delay optimal. We also consider the scenario when some traffic streams are delay sensitive

Cross-layer design for network performance optimization in wireless networks

In this dissertation, I use mathematical optimization approach to solve the complex network problems. Paper l and paper 2 first show that ignoring the bandwidth constraint can lead to infeasible routing solutions. A sufficient condition on link bandwidth is proposed that makes a routing solution feasible, and then a mathematical optimization model based on this sufficient condition is provided. Simulation results show that joint optimization models can provide more feasible routing solutions and provide significant improvement on throughput and lifetime. In paper 3 and paper 4, an interference model is proposed and a transmission scheduling scheme is presented to minimize the end-to-end delay. This scheduling scheme is designed based on integer linear programming and involves interference modeling. Using this schedule, there are no conflicting transmissions at any time. Through simulation, it shows that the proposed link scheduling scheme can significantly reduce end-to-end latency. Since to compute the maximum throughput is an NP-hard problem, efficient heuristics are presented in Paper 5 that use sufficient conditions instead of the computationally-expensive-to-get optimal condition to capture the mutual conflict relation in a collision domain. Both one-way transmission and two-way transmission are considered. Simulation results show that the proposed algorithms improve network throughput and reduce energy consumption, with significant improvement over previous work on both aspects. Paper 6 studies the complicated tradeoff relation among multiple factors that affect the sensor network lifetime and proposes an adaptive multi-hop clustering algorithm. It realizes the best tradeoff among multiple factors and outperforms others that do not. It is adaptive in the sense the clustering topology changes over time in order to have the maximum lifetime --Abstract, page iv

Energy Efficient and Cooperative Solutions for Next-Generation Wireless Networks

Energy efficiency is increasingly important for next-generation wireless systems due to the limited battery resources of mobile clients. While fourth generation cellular standards emphasize low client battery consumption, existing techniques do not explicitly focus on reducing power that is consumed when a client is actively communicating with the network. Based on high data rate demands of modern multimedia applications, active mode power consumption is expected to become a critical consideration for the development and deployment of future wireless technologies. Another reason for focusing more attention on energy efficient studies is given by the relatively slow progress in battery technology and the growing quality of service requirements of multimedia applications. The disproportion between demanded and available battery capacity is becoming especially significant for small-scale mobile client devices, where wireless power consumption dominates within the total device power budget. To compensate for this growing gap, aggressive improvements in all aspects of wireless system design are necessary. Recent work in this area indicates that joint link adaptation and resource allocation techniques optimizing energy efficient metrics can provide a considerable gain in client power consumption. Consequently, it is crucial to adapt state-of-the-art energy efficient approaches for practical use, as well as to illustrate the pros and cons associated with applying power-bandwidth optimization to improve client energy efficiency and develop insights for future research in this area. This constitutes the first objective of the present research. Together with energy efficiency, next-generation cellular technologies are emphasizing stronger support for heterogeneous multimedia applications. Since the integration of diverse services within a single radio platform is expected to result in higher operator profits and, at the same time, reduce network management expenses, intensive research efforts have been invested into design principles of such networks. However, as wireless resources are limited and shared by clients, service integration may become challenging. A key element in such systems is the packet scheduler, which typically helps ensure that the individual quality of service requirements of wireless clients are satisfied. In contrastingly different distributed wireless environments, random multiple access protocols are beginning to provide mechanisms for statistical quality of service assurance. However, there is currently a lack of comprehensive analytical frameworks which allow reliable control of the quality of service parameters for both cellular and local area networks. Providing such frameworks is therefore the second objective of this thesis. Additionally, the study addresses the simultaneous operation of a cellular and a local area network in spectrally intense metropolitan deployments and solves some related problems. Further improving the performance of battery-driven mobile clients, cooperative communications are sought as a promising and practical concept. In particular, they are capable of mitigating the negative effects of fading in a wireless channel and are thus expected to enhance next-generation cellular networks in terms of client spectral and energy efficiencies. At the cell edges or in areas missing any supportive relaying infrastructure, client-based cooperative techniques are becoming even more important. As such, a mobile client with poor channel quality may take advantage of neighboring clients which would relay data on its behalf. The key idea behind the concept of client relay is to provide flexible and distributed control over cooperative communications by the wireless clients themselves. By contrast to fully centralized control, this is expected to minimize overhead protocol signaling and hence ensure simpler implementation. Compared to infrastructure relay, client relay will also be cheaper to deploy. Developing the novel concept of client relay, proposing simple and feasible cooperation protocols, and analyzing the basic trade-offs behind client relay functionality become the third objective of this research. Envisioning the evolution of cellular technologies beyond their fourth generation, it appears important to study a wireless network capable of supporting machine-to-machine applications. Recent standardization documents cover a plethora of machine-to-machine use cases, as they also outline the respective technical requirements and features according to the application or network environment. As follows from this activity, a smart grid is one of the primary machine-to-machine use cases that involves meters autonomously reporting usage and alarm information to the grid infrastructure to help reduce operational cost, as well as regulate a customer's utility usage. The preliminary analysis of the reference smart grid scenario indicates weak system architecture components. For instance, the large population of machine-to-machine devices may connect nearly simultaneously to the wireless infrastructure and, consequently, suffer from excessive network entry delays. Another concern is the performance of cell-edge machine-to-machine devices with weak wireless links. Therefore, mitigating the above architecture vulnerabilities and improving the performance of future smart grid deployments is the fourth objective of this thesis. Summarizing, this thesis is generally aimed at the improvement of energy efficient properties of mobile devices in next-generation wireless networks. The related research also embraces a novel cooperation technique where clients may assist each other to increase per-client and network-wide performance. Applying the proposed solutions, the operation time of mobile clients without recharging may be increased dramatically. Our approach incorporates both analytical and simulation components to evaluate complex interactions between the studied objectives. It brings important conclusions about energy efficient and cooperative client behaviors, which is crucial for further development of wireless communications technologies

Optimal Data Scheduling of Clients Serviced using Beamforming Antennas in Mobile Scenarios

The use of beamforming antennas has received significant attention over the last decade. I consider beamforming applied to dynamic operations such as networked UAV hubs which interconnect with users on the ground. The key problem involves understanding how to optimally manage the users' data requirements while considering mobility and a dynamic radio environment serviced by one or more hubs with beamforming antenna capability. In this work I break the problem down into scheduling, tracking and ultimately execution. I develop a regularized linear programming based scheduling algorithm along with developing a very efficient scheduling with uncertainty receding horizon based relaxation and implement them along with a capacity tracking estimation algorithm. Finally I show the results of successfully implementing this system in hardware using Fidelity Comtech's Phocus Array FCI-3100X. This implementation shows that the problem overview presented in this work provides a solid basis and defines the key components needed for a reliable electronic beamforming antenna system able to successfully service dispersed users in a mobile environment. It also shows the tools developed, refined, and integrated with respect to tracking, scheduling, and practical modifications

Topics in access, storage, and sensor networks

In the first part of this dissertation, Data Over Cable Service Interface Specification (DOCSIS) and IEEE 802.3ah Ethernet Passive Optical Network (ETON), two access networking standards, are studied. We study the impact of two parameters of the DOCSIS protocol and derive the probability of message collision in the 802.3ah device discovery scheme. We survey existing bandwidth allocation schemes for EPONs, derive the average grant size in one such scheme, and study the performance of the shortest-job-first heuristic. In the second part of this dissertation, we study networks of mobile sensors. We make progress towards an architecture for disconnected collections of mobile sensors. We propose a new design abstraction called tours which facilitates the combination of mobility and communication into a single design primitive and enables the system of sensors to reorganize into desirable topologies alter failures. We also initiate a study of computation in mobile sensor networks. We study the relationship between two distributed computational models of mobile sensor networks: population protocols and self-similar functions. We define the notion of a self-similar predicate and show when it is computable by a population protocol. Transition graphs of population protocols lead its to the consideration of graph powers. We consider the direct product of graphs and its new variant which we call the lexicographic direct product (or the clique product). We show that invariants concerning transposable walks in direct graph powers and transposable independent sets in graph families generated by the lexicographic direct product are uncomputable. The last part of this dissertation makes contributions to the area of storage systems. We propose a sequential access detect ion and prefetching scheme and a dynamic cache sizing scheme for large storage systems. We evaluate the cache sizing scheme theoretically and through simulations. We compute the expected hit ratio of our and competing schemes and bound the expected size of our dynamic cache sufficient to obtain an optimal hit ratio. We also develop a stand-alone simulator for studying our proposed scheme and integrate it with an empirically validated disk simulator