Energy-efficient wireless communication

In this chapter we present an energy-efficient highly adaptive network interface architecture and a novel data link layer protocol for wireless networks that provides Quality of Service (QoS) support for diverse traffic types. Due to the dynamic nature of wireless networks, adaptations in bandwidth scheduling and error control are necessary to achieve energy efficiency and an acceptable quality of service. In our approach we apply adaptability through all layers of the protocol stack, and provide feedback to the applications. In this way the applications can adapt the data streams, and the network protocols can adapt the communication parameters

Adaptive multimedia streaming control algorithm in wireless LANs and 4G networks

E-learning has become an important service offered over the Internet. Lately many users are accessing learning content via wireless networks and using mobile devices. Most content is rich media-based and often puts significant pressure on the existing wireless networks in order to support high quality of delivery. In this context, offering a solution for improving user quality of experience when multimedia content is delivered over wireless networks is already a challenging task. Additionally, to support this for mobile e-learning over wireless LANs becomes even more difficult. If we want to increase the end-used perceived quality, we have to take into account the users’ individual set of characteristics. The fact that users have subjective opinions on the quality of a multimedia application can be used to increase their QoE by setting a minimum quality threshold below which the connection is considered to be undesired. Like this, the use of precious radio resources can be optimized in order to simultaneously satisfy an increased number of users. In this thesis a new user-oriented adaptive algorithm based on QOAS was designed and developed in order to address the user satisfaction problem. Simulations have been carried out with different adaptation schemes to compare the performances and benefits of the DQOAS mechanism. The simulation results are showing that using a dynamic stream granularity with a minimum threshold for the transmission rate, improves the overall quality of the multimedia delivery process, increasing the total number of satisfied users and the link utilization The good results obtained by the algorithm in IEEE 802.11 wireless environment, motivated the research about the utility of the newly proposed algorithm in another wireless environment, LTE. The study shows that DQOAS algorithm can obtain good results in terms of application perceived quality, when the considered application generates multiple streams. These results can be improved by using a new QoS parameters mapping scheme able to modify the streams’ priority and thus allowing the algorithms decisions to not be overridden by the systems’ scheduler

A Review on Provisioning Quality of Service of Wireless Telemedicine for E-Health Services

In general, on-line medical consultation reduces time required for medical consultation induces improvement in the quality and efficiency of healthcare services. All major types of current e-health applications such as ECG, X-ray, video, diagnosis images and other common applications have been included in the scope of the study. In addition, the provision of Quality of Service (QoS) for the application of specific healthcare services in e-health, the scheme of priority for e-health services and the support of QoS in wireless networks and techniques or methods for IEEE 802.11 to guarantee the provision of QoS has also been assessed. In e-health, medical services in remote locations such as rural healthcare centers, ambulances, ships as well as home healthcare services can be supported through the applications of e-health services such as medical databases, electronic health records and the routing of text, audio, video and images. Given this, an adaptive resource allocation for a wireless network with multiple service types and multiple priorities have been proposed. For the provision of an acceptable QoS level to users of e-health services, prioritization is an important criterion in a multi-traffic network. The requirement for QoS provisioning in wireless broadband medical networks have paved the pathway for bandwidth requirements and the real-time or live transmission of medical applications. From the study, good performance of the proposed scheme has been validated by the results obtained. The proposed wireless network is capable of handling medical applications for both normal and life-threatening conditions as characterized by the level of emergencies. In addition, the bandwidth allocation and admission control algorithm for IEEE 802.16- based design specifically for wireless telemedicine/e-health services have also been presented in the study. It has been concluded that under busy traffic conditions, the proposed architecture can used as a feasible and reliable infrastructure network for telemedicine

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 design for support of delay bound quality of service guarantees over fading channels.

Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, Durban, 2011.Quality-of-service (QoS) guarantees have become critically important for the transmission of real-time multimedia traffic in next generation mobile wireless networks. The aim of this dissertation is to investigate the cross-layer design for support of delay bound QoS guarantees over fading channels. Providing diverse QoS guarantees presents a challenge due to the time-varying fading nature of wireless channels. Existing physical layer modelling is inadequate in supporting real time QoS metrics such as delay, hence adaptive techniques need to be extended to the upper-protocol layers. The first objective of this dissertation is to introduce a cross-layer design framework which investigates the impact of the physical layer on the data link delay bound QoS performance. At the physical layer, adaptive modulation and coding (AMC) is utilized for transmission over block fading channels. At the data link layer, the effective capacity approach is used to model the delay bound QoS performance subject to physical layer variations. The effects of varying physical layer parameters, such as average signal-to-noise ratio (SNR), the fading parameter for the kagami- model, and target packet-error rate (PER), on the analytical delay bound performance are investigated and then validated by the simulation of a queuing system. Due to the cross-layer design framework, the system’s throughput has a significant impact on bounded delay at the data link layer. The switching levels of the conventional AMC scheme used in the first objective were fixed, subject to a target PER. However, fixed switching levels results in the system’s throughput limiting the delay bound performance. The second objective of this dissertation is to optimize the switching levels of the AMC scheme employed at the physical layer, by maximizing the average throughput, while maintaining the target PER constraint. The analytical and simulated results show that by optimizing the switching levels, a superior delay bound performance is achieved, when compared to the deterministic switching levels of the conventional AMC scheme used in the first objective

Time Dependent Performance Analysis of Wireless Networks

Many wireless networks are subject to frequent changes in a combination of network topology, traffic demand, and link capacity, such that nonstationary/transient conditions always exist in packet-level network behavior. Although there are extensive studies on the steady-state performance of wireless networks, little work exists on the systematic study of their packet-level time varying behavior. However, it is increasingly noted that wireless networks must not only perform well in steady state, but must also have acceptable performance under nonstationary/transient conditions. Furthermore, numerous applications in today's wireless networks are very critical to the real-time performance of delay, packet delivery ratio, etc, such as safety applications in vehicular networks and military applications in mobile ad hoc networks. Thus, there exists a need for techniques to analyze the time dependent performance of wireless networks. In this dissertation, we develop a performance modeling framework incorporating queuing and stochastic modeling techniques to efficiently evaluate packet-level time dependent performance of vehicular networks (single-hop) and mobile ad hoc networks (multi-hop). For vehicular networks, we consider the dynamic behavior of IEEE 802.11p MAC protocol due to node mobility and model the network hearability as a time varying adjacency matrix. For mobile ad hoc networks, we focus on the dynamic behavior of network layer performance due to rerouting and model the network connectivity as a time varying adjacency matrix. In both types of networks, node queues are modeled by the same fluid flow technique, which follows flow conservation principle to construct differential equations from a pointwise mapping of the steady-state queueing relationships. Numerical results confirm that fluid-flow based performance models are able to respond to the ongoing nonstationary/transient conditions of wireless networks promptly and accurately. Moreover, compared to the computation time of standard discrete event simulator, fluid-flow based model is shown to be a more scalable evaluation tool. In general, our proposed performance model can be used to explore network design alternatives or to get a quick estimate on the performance variation in response to some dynamic changes in network conditions

Design and analysis of scheduling algorithms for next generation broadband wireless access systems

Efficient utilization of network resources is a key goal for emerging Broadband Wireless Access Systems (BWAS). This is a complex goal to achieve due to the heterogeneous service nature and diverse Quality of Service (QoS) requirements of various applications that BWAS support. Packet scheduling is an important activity that affects BWAS QoS outcomes. This thesis proposes a new packet scheduling mechanism that improves QoS in mobile wireless networks which exploit IP as a transport technology for data transfer between BWAS base stations and mobile users at the radio transmission layer. In order to improve BWAS QoS the new packet algorithm makes changes at both the IP and the radio layers. The new packet scheduling algorithm exploits handoff priority scheduling principles and takes into account buffer occupancy and channel conditions. The packet scheduling mechanism also incorporates the concept of fairness. The algorithm also offers an opportunity to maximize the carriers’ revenue at various traffic situations. Performance results were obtained by computer simulation and compared to the well-known algorithms. Results show that by exploiting the new packet scheduling algorithm, the transport system is able to provide a low handoff packet drop rate, low packet forwarding rate, low packet delay, ensure fairness amongst the users of different services and generates higher revenue for the telecom carriers. Furthermore this research proposes a new and novel measure named “satisfaction factor to measure the efficacy of various scheduling schemes and finally this s research also proposes four performance measurements metric for NodeB’s of Next Generation Wireless Network