Multiuser Resource Allocation and Scheduling Techniques for Future Wireless Networks PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Multiuser Resource Allocation and Scheduling Techniques for Future Wireless Networks PDF full book. Access full book title Multiuser Resource Allocation and Scheduling Techniques for Future Wireless Networks by Marios Nicolaou. Download full books in PDF and EPUB format.
Author: Marios Nicolaou
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Get Book Here
Book Description
Author: Marios Nicolaou
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Get Book Here
Book Description
Author: Saeedeh Parsaeefard
Publisher: Springer
ISBN: 3319503898
Category : Technology & Engineering
Languages : en
Pages : 255
Get Book Here
Book Description
This book presents state-of-the-art research on robust resource allocation in current and future wireless networks. The authors describe the nominal resource allocation problems in wireless networks and explain why introducing robustness in such networks is desirable. Then, depending on the objectives of the problem, namely maximizing the social utility or the per-user utility, cooperative or competitive approaches are explained and their corresponding robust problems are considered in detail. For each approach, the costs and benefits of robust schemes are discussed and the algorithms for reducing their costs and improving their benefits are presented. Considering the fact that such problems are inherently non-convex and intractable, a taxonomy of different relaxation techniques is presented, and applications of such techniques are shown via several examples throughout the book. Finally, the authors argue that resource allocation continues to be an important issue in future wireless networks, and propose specific problems for future research.
Author: Shiwei Huang
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Get Book Here
Book Description
Future wireless communication networks are expected to be more energy-efficient and to provide higher throughput, in order to satisfy the demands for the increasing number of mobile users. Resource allocation and transmission scheduling play more and more important roles in improving the performance of wireless networks, in terms of energy saving, throughput, delay, etc. In this thesis, we consider three networks with different characteristics and objectives, i.e., wireless relay networks for distant transmissions, dense multi-user coexisting networks, and device-to-device (D2D) assisted mobile edge computing systems for compute-intensive mobile applications. We aim to investigate the key resource allocation and/or transmission scheduling issues in these networks. In particular, i) a transmit power allocation scheme with reduced overheads for amplify-and-forward relay networks is proposed to reduce energy consumption, based on the two-stage stochastic programming method, ii) an analysis framework for buffer-aided decode-and-forward relay networks under time-correlated fading channels is developed and an improved link scheduling/selection policy is presented, through the analyses to two quasi-birth-death Markov chains, iii) an interference-avoidance scheduling scheme for dense multi-user coexisting networks with heterogeneous priorities and demands is presented to increase the number of admitted users, on the basis of the column generation method, and iv) a joint optimization of admission control, link scheduling, and resource management for D2D-assisted mobile edge computing is carried out, according to the branch-and-price method. Simulations are performed to verify the effectiveness of the proposed schemes where the performance of networks is shown to be improved significantly.
Author: Ian C. Wong
Publisher: Springer Science & Business Media
ISBN: 0387749454
Category : Technology & Engineering
Languages : en
Pages : 126
Get Book Here
Book Description
This book proposes a unified algorithmic framework based on dual optimization techniques that have complexities that are linear in the number of subcarriers and users, and that achieve negligible optimality gaps in standards-based numerical simulations. Adaptive algorithms based on stochastic approximation techniques are also proposed, which are shown to achieve similar performance with even much lower complexity. All the algorithms proposed are clearly presented in concise block diagrams allowing the reader to implement these algorithms in the software of their choice. This book is an accessible reference for researchers and industry practitioners alike.
Author: Sławomir Stańczak
Publisher: Springer Science & Business Media
ISBN: 3540462481
Category : Computers
Languages : en
Pages : 200
Get Book Here
Book Description
The wireless industry is in the midst of a fundamental shift from providing voice-only services to offering customers an array of multimedia services, including a wide variety of audio, video and data communications capabilities. Future wireless networks will be integrated into every aspect of daily life, and therefore could affect our life in a magnitude similar to that of the Internet and cellular phones. This monograph demonstrates that these emerging applications and directions require fundamental understanding on how to design and control wireless networks that lies far beyond what the currently existing theory can provide. It is shown that mathematics is the key technology to cope with central technical problems in the design of wireless networks since the complexity of the problem simply precludes the use of engineering common sense alone to identify good solutions. The main objective of this book is to provide tools for better understanding the fundamental tradeoffs and interdependencies in wireless networks, with the goal of designing resource allocation strategies that exploit these interdependencies to achieve significant performance gains. The book consists of three largely independent parts: theory, applications and appendices. The latter contain foundational apects to make the book more understandable to readers who are not familiar with some basic concepts and results from linear algebra and convex analysis.
Author: Ioannis M. Avgouleas
Publisher: Linköping University Electronic Press
ISBN: 9175190044
Category :
Languages : en
Pages : 62
Get Book Here
Book Description
The Internet of Things (IoT) should be able to react with minimal human intervention and contribute to the Artificial Intelligence (AI) era requiring real-time and scalable operation under heterogeneous network infrastructures. This thesis investigates how cooperation and allocation of resources can contribute to the evolution of future wireless networks supporting the IoT. First, we examine how to allocate resources to IoT services which run on devices equipped with multiple network interfaces. The resources are heterogeneous and not interchangeable, and their allocation to a service can be split among different interfaces. We formulate an optimization model for this allocation problem, prove its complexity, and derive two heuristic algorithms to approximate the solution in large instances of the problem. The concept of virtualization is promising towards addressing the heterogeneity of IoT resources by providing an abstraction layer between software and hardware. Network function virtualization (NFV) decouples traditional network operations such a routing from proprietary hardware platforms and implements them as software entities known as virtualized network functions (VNFs). In the second paper, we study how VNF demands can be allocated to Virtual Machines (VMs) by considering the completion-time tolerance of the VNFs. We prove that the problem is NP-complete and devise a subgradient optimization algorithm to provide near-optimal solutions. Our numerical results demonstrate the effectiveness of our algorithm compared to two benchmark algorithms. Furthermore, we explore the potential of using intermediate nodes, the so-called relays, in IoT networks. In the third paper, we study a multi-user random-access network with a relay node assisting users in transmitting their packets to a destination node. We provide analytical expressions for the performance of the relay's queue and the system throughput. We optimize the relay’s operation parameters to maximize the network-wide throughput while maintaining the relay's queue stability. A stable queue at relay guarantees finite delay for the packets. Furthermore, we study the effect of the wireless links' signal-to-interference-plusnoise ratio (SINR) threshold and the self-interference (SI) cancellation on the per-user and network-wide throughput. Additionally, caching at the network edge has recently emerged as an encouraging solution to offload cellular traffic and improve several performance metrics of the network such as throughput, delay and energy efficiency. In the fourth paper, we study a wireless network that serves two types of traffic: cacheable and non-cacheable traffic. In the considered system, a wireless user with cache storage requests cacheable content from a data center connected with a wireless base station. The user can be assisted by a pair of wireless helpers that exchange non-cacheable content as well. We devise the system throughput and the delay experienced by the user and provide numerical results that demonstrate how they are affected by the non-cacheable packet arrivals, the availability of caching helpers, the parameters of the caches, and the request rate of the user. Finally, in the last paper, we consider a time-slotted wireless system that serves both cacheable and non-cacheable traffic with the assistance of a relay node. The latter has storage capabilities to serve both types of traffic. We investigate how allocating the storage capacity to cacheable and non-cacheable traffic affects the system throughput. Our numerical results provide useful insights into the system throughput e.g., that it is not necessarily beneficial to increase the storage capacity for the non-cacheable traffic to realize better throughput at the non-cacheable destination node.
Author: Anh H. Nguyen
Publisher:
ISBN: 9781303814372
Category :
Languages : en
Pages : 148
Get Book Here
Book Description
In wireless communications, it is of utmost importance to exploit multi-user diversity and at the same time provide satisfactory quality of service for all users. However, these two goals often conflict with each other. On one hand, multiuser diversity is maximized by selecting the user with the best channel condition. On the other, ensuring fairness among users demands the allocation of network resources to those who do not necessarily have the best channel conditions. Whenever a user with a poorer channel condition is selected, there is a certain loss in the overall system throughput. The major objective of this thesis is to find scheduling algorithms that guarantee fairness with minimal performance tradeoff. First, we consider multi-user diversity in a multi-user MIMO system. When zero-forcing beam-forming transmission technique is used, the system needs to find a subset of users such that the transmission to these users results in the highest throughput. As the number of users grows, the complexity of the user subset selection increases exponentially. To address this issue, simple user-subset-selection algorithms have been developed that can perform well and are very close to the optimal ones found through an exhaustive search. Maximizing system throughput is a key factor in ensuring high network performance, but guaranteeing service provision to all users is no less important. To support fairness among users, cumulative distribution function (CDF) scheduling is utilized because of the its capability to precisely control allocation for each user. The CDF scheduling algorithm requires knowledge of the channel distribution among all users. However, the channel distribution or even an approximation of it is hard to obtain in real systems. In this dissertation, two classes of practical, CDF-based scheduling algorithms are developed. They are the non-parametric CDF scheduling (NPCS), used when the channel model is unknown, and the parametric CDF scheduling (PCS), used when the channel model is known. These algorithms are shown to frequently outperform the well-known Proportional Fair (PF) scheduling method, and may be viable alternatives to it. The performance of the developed scheduling technique is then carefully analyzed and verified through simulations under various channel models. In order to apply them in real systems, these algorithms are first proposed for continuous rate transmission. Modified versions are then developed for finite rate transmission and limited feedback resources. Lastly, we analyze throughput of heterogeneous relay OFDMA systems using CDF scheduling with partial feedback. The scheduling problem is even more challenging with the incorporation of relays because of the different coherent time on their two hops. The CDF scheduling algorithm is modified to satisfy short-term fairness among users. In addition, performance of different feedback schemes in a wideband multi-user system are compared. Among the considered schemes, thresholding feedback is numerically shown to have the lowest feedback requirement, given a certain probability of feedback availability.
Author: Ian C. Wong
Publisher: Springer
ISBN: 9780387521176
Category : Technology & Engineering
Languages : en
Pages : 0
Get Book Here
Book Description
This book proposes a unified algorithmic framework based on dual optimization techniques that have complexities that are linear in the number of subcarriers and users, and that achieve negligible optimality gaps in standards-based numerical simulations. Adaptive algorithms based on stochastic approximation techniques are also proposed, which are shown to achieve similar performance with even much lower complexity. All the algorithms proposed are clearly presented in concise block diagrams allowing the reader to implement these algorithms in the software of their choice. This book is an accessible reference for researchers and industry practitioners alike.
Author: Amila Tharaperiya Gamage
Publisher: Springer
ISBN: 3319642685
Category : Technology & Engineering
Languages : en
Pages : 116
Get Book Here
Book Description
This book provides an in-depth discussion on how to efficiently manage resources of heterogeneous wireless networks and how to design resource allocation algorithms to suit real world conditions. Efficiently managing resources of the networks is more crucial now, than ever before, to meet users’ rapidly increasing demand for higher data rates, better quality-of-service (QoS) and seamless coverage. Some of the techniques that can be incorporated within heterogeneous wireless networks to achieve this objective are interworking of the networks, user multi-homing and device-to-device (D2D) communication. Designing resource allocation algorithms to suit real world conditions is also important, as the algorithms should be deployable and perform well in real networks. For example, two of the conditions considered in this book are resource allocation intervals of different networks are different and small cell base stations have limited computational capacity. To address the first condition, resource allocation algorithms for interworking systems are designed to allocate resources of different networks at different time-scales. To address the second condition, resource allocation algorithms are designed to be able to run at cloud computing servers. More of such conditions, algorithms designed to suit these conditions, modeling techniques for various networks and performance analysis of the algorithms are discussed in the book. This book concludes with a discussion on the future research directions on the related fields of study. Advanced-level students focused on communication and networking will use this book as a study guide. Researchers and experts in the fields of networking, converged networks, small-cell networks, resource management, and interference management, as well as consultants working in network planning and optimization and managers, executives and network architects working in the networking industry will also find this book useful as a reference.
Author: Shuo Shi
Publisher: Springer Nature
ISBN: 303104245X
Category : Computers
Languages : en
Pages : 740
Get Book Here
Book Description
This book constitutes the proceedings of the 4th International Conference on 6G for Future Wireless Networks, 6GN 2021, held in Huizhou, China, in October 2021. The 63 full papers were selected from 136 submissions and present the state of the art and practical applications of 6G technologies. The papers are arranged thematically in tracks as follows: Advanced Communication and Networking Technologies for 5G/6G Networks; Advanced Signal Processing Technologies for 5G/6G Networks; and Educational Changes in The Age of 5G/6G.
