Skip to main content

2008 | Buch

Fundamentals of Resource Allocation in Wireless Networks

Theory and Algorithms

verfasst von: Slawomir Stanczak, Marcin Wiczanowski, Holger Boche

Verlag: Springer Berlin Heidelberg

Buchreihe : Foundations in Signal Processing, Communications and Networking

insite
SUCHEN

Über dieses Buch

The purpose of this book is to provide tools for a better understanding of the fundamental tradeo?s and interdependencies in wireless networks, with the goal of designing resource allocation strategies that exploit these int- dependencies to achieve signi?cant performance gains. Two facts prompted us to write it: First, future wireless applications will require a fundamental understanding of the design principles and control mechanisms in wireless networks. Second, the complexity of the network problems simply precludes the use of engineering common sense alone to identify good solutions, and so mathematics becomes the key avenue to cope with central technical problems in the design of wireless networks. In this book, two ?elds of mathematics play a central role: Perron-Frobenius theory for non-negative matrices and optimization theory. This book is a revised and expanded version of the research monograph “Resource Allocation in Wireless Networks” that was published as Lecture Notes in Computer Sciences (LNCS 4000) in 2006. Although the general structure has remained unchanged to a large extent, the book contains - merous additional results and more detailed discussion. For instance, there is a more extensive treatment of general nonnegative matrices and interf- ence functions that are described by an axiomatic model. Additional material on max-min fairness, proportional fairness, utility-based power control with QoS (quality of service) support and stochastic power control has been added.

Inhaltsverzeichnis

Frontmatter

Part I Mathematical Framework

1. On the Perron Root of Irreducible Matrices
This chapter deals with the Perron root of nonnegative irreducible matrices. Applications abound with nonnegative and positive matrices so that it is natural to investigate their properties. In doing so, one of the central problems is to what extent the nonnegativity (positivity) is inherited by the eigenvalues and eigenvectors. The principal tools for the analysis of spectral properties of irreducible matrices are provided by Perron–Frobenius theory. A comprehensive reference on nonnegative matrices is [4]. Some basic results are summarized in App. A.4. For more information about the Perron–Frobenius theory, the reader is also referred to [5, 6, 7].
Sławomir Stańczak, Marcin Wiczanowski, Holger Boche
2. On the Positive Solution to a Linear System with Nonnegative Coefficients
This chapter deals with a positive solution p to the following system of linear equations with nonnegative coefficients: p = u + Xp.
Sławomir Stańczak, Marcin Wiczanowski, Holger Boche

Part II Principles of Resource Allocation in Wireless Networks

3. Introduction
Wireless networking has been a vibrant research area over the last two decades. During this time, we have observed the evolution of a number of different wireless communications standards that support a wide range of services. They include delay-sensitive applications such as voice and real-time video that usually have strict requirements with respect to quality of service (QoS) parameters such as data rate, delay and/or bit error rate. In such cases, a network designer must ensure that the QoS requirements are satisfied permanently. Data applications, however, may have fundamentally different QoS requirements and traffic characteristics than video or voice applications. In fact, most data applications are delay-insensitive, and therefore may tolerate larger transmission delays.
Sławomir Stańczak, Marcin Wiczanowski, Holger Boche
4. Network Model
A wireless communications network is a collection of nodes being capable of communicating with each other over wireless communications links. Let N t := {1, . . . , N t } be the set of nodes (the subscript t in N t stands for “total”), and let (n,m) with n ≠ m represent a wireless link from node nN t to node mN t .
Sławomir Stańczak, Marcin Wiczanowski, Holger Boche
5. Resource Allocation Problem in Communications Networks
This chapter formulates the resource allocation problem for wireless networks. Before that, however, we briefly discuss the fundamental trade-off between efficiency and fairness in wired networks. This trade-off eventually led researchers to consider the problem of maximizing the sum of monotonically increasing and strictly concave utility functions of source rates. We review some existing solutions to this problem and explain the insufficiency of these solutions in case of wireless networks. Section 5.2 reformulates the problem to better capture the situation encountered in wireless networks. We will argue in favor of MAC layer fair policies that have already been used in wired networks as a basis to achieve end-to-end fairness. We precisely define the concept of joint power control and link scheduling as well as introduce the notion of the feasible rate region.
Sławomir Stańczak, Marcin Wiczanowski, Holger Boche

Part III Algorithms

6. Power Control Algorithms
This chapter presents algorithmic solutions to the power control problems as stated in the previous chapter. We primarily focus on utility-based power control algorithms with and without QoS support. First, we consider recursive gradient-based algorithms with a constant step size [160, 16]. Although much more powerful algorithms can be devised to solve the problem, such methods are of great interest in practice because of their simplicity. The significance of simple iterative algorithms that allow an efficient distributed implementation cannot be emphasized enough in the case of wireless networks where the judicious assessment of the complexity–performance trade-off is particularly important. Given the limited and costly nature of wireless resources, minimizing the control message overhead for each iteration step must be a high priority.
Sławomir Stańczak, Marcin Wiczanowski, Holger Boche

Part IV Appendices

A. Some Concepts and Results from Matrix Analysis
The appendix provides some (very) basic concepts and results from linear algebra that are vital to understanding the theory presented in this book. This is also a good opportunity to introduce the notation used throughout the book. Proofs are provided only for the most important results such as the Perron–Frobenius theorem. For other proofs and a detailed treatment of this material, the reader is referred to any linear algebra book and [7, 5, 9, 4, 189, 6, 107].
Sławomir Stańczak, Marcin Wiczanowski, Holger Boche
B. Some Concepts and Results from Convex Analysis
In this chapter, we collect definitions, notational conventions and several results from convex analysis that may be helpful in better understanding the material covered in this manuscript. Proofs are provided only for selected results concerning the notion of log-convexity and the convergence of gradient projection algorithms. For other proofs, the reader is referred to any standard analysis book (e.g., [39]) and [160, 162, 16].
Sławomir Stańczak, Marcin Wiczanowski, Holger Boche
Backmatter
Metadaten
Titel
Fundamentals of Resource Allocation in Wireless Networks
verfasst von
Slawomir Stanczak
Marcin Wiczanowski
Holger Boche
Copyright-Jahr
2008
Verlag
Springer Berlin Heidelberg
Electronic ISBN
978-3-540-79386-1
Print ISBN
978-3-540-79385-4
DOI
https://doi.org/10.1007/978-3-540-79386-1