Robust resource allocation in future wireless networks
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 objectiv...
Saved in:
| Main Authors | , , |
|---|---|
| Format | Electronic eBook |
| Language | English |
| Published |
Cham, Switzerland :
Springer,
2017.
|
| Subjects | |
| Online Access | Plný text |
Cover
Loading…
MARC
| LEADER | 00000cam a2200000Ii 4500 | ||
|---|---|---|---|
| 001 | 99864 | ||
| 003 | CZ-ZlUTB | ||
| 005 | 20201229193758.0 | ||
| 006 | m o d | ||
| 007 | cr cnu|||unuuu | ||
| 008 | 170308s2017 sz ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e rda |e pn |c N$T |d EBLCP |d GW5XE |d IDEBK |d N$T |d YDX |d UAB |d NJR |d OCLCF |d IOG |d COO |d AZU |d UPM |d ESU |d JBG |d IAD |d ICW |d ICN |d OTZ |d VT2 |d OCLCQ |d U3W |d CAUOI |d KSU |d EZ9 |d AU@ |d OCLCQ |d WYU |d OCLCQ |d UKMGB |d UKAHL |d OCLCQ |d ERF |d UKBTH |d LEATE |d OCLCQ | ||
| 020 | |a 9783319503899 |q (electronic bk.) | ||
| 020 | |z 9783319503875 |q (print) | ||
| 024 | 7 | |a 10.1007/978-3-319-50389-9 |2 doi | |
| 035 | |a (OCoLC)974802335 |z (OCoLC)975013403 |z (OCoLC)975084497 |z (OCoLC)975438416 |z (OCoLC)984848292 |z (OCoLC)999478821 |z (OCoLC)1005824789 |z (OCoLC)1012076531 |z (OCoLC)1048161218 |z (OCoLC)1058377266 |z (OCoLC)1066448666 |z (OCoLC)1086542918 |z (OCoLC)1112587042 |z (OCoLC)1112846736 |z (OCoLC)1113425404 |z (OCoLC)1116160745 |z (OCoLC)1122813128 |z (OCoLC)1127173783 |z (OCoLC)1136213010 | ||
| 100 | 1 | |a Parsaeefard, Saeedeh, |e author. | |
| 245 | 1 | 0 | |a Robust resource allocation in future wireless networks / |c Saeedeh Parsaeefard, Ahmad Reza Sharafat, Nader Mokari. |
| 264 | 1 | |a Cham, Switzerland : |b Springer, |c 2017. | |
| 300 | |a 1 online resource | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a počítač |b c |2 rdamedia | ||
| 338 | |a online zdroj |b cr |2 rdacarrier | ||
| 505 | 0 | |a Preface; Contents; Notations and Symbols; Abbreviations; 1 Introduction; 1.1 Motivation; 1.2 Formulating Resource Allocation Problems; 1.3 Mathematical Background; 1.3.1 Stochastic Robust Optimization; 1.3.2 Worst-Case Robust Optimization; 1.3.2.1 General Norm; 1.3.2.2 Polyhedron Model; 1.3.3 Hybrid Approach: Bounded Uncertainty and Probabilistic Constraints; 1.3.3.1 Chance-Constrained Approach; 1.3.3.2 D-Norm Approach; 1.4 Generic System Model; 1.4.1 System Model for Wireless Networks with Homogeneous Users; 1.4.2 System Model for Wireless Networks with Heterogeneous Users. | |
| 505 | 8 | |a 1.4.2.1 Underlay Cognitive Radio Network1.4.2.2 Wireless Networks with Heterogeneous Users in Unlicensed Bands; 1.4.3 Physical Layer Security in Wireless Channels; 1.5 Cost of Robustness; 1.6 Organization of This Book; References; 2 Robust Cooperative Resource Allocation; 2.1 Introduction; 2.2 Single-Channel Cellular Cognitive Radio Networks; 2.2.1 Robust Problem; 2.2.1.1 Iterative Algorithm for Solving Nominal and Robust Problems; 2.2.1.2 Reduced Throughput in Robust Solution; 2.2.1.3 Distributed Robust Solutions and Extra Message Passing; 2.2.1.4 Infrequent Message Passing. | |
| 505 | 8 | |a 2.3 Multi-channel Cognitive Radio Networks2.3.1 Robust Problems; 2.3.1.1 Social Utility of Robust Solutions Versus Uncertainty Levels; 2.3.2 Trade-Off Algorithms; 2.3.2.1 Trade-Off in D-Norm Approach; 2.3.2.2 Trade-off in Chance-Constrained Approach; 2.4 Overview of Other Works on Robust Cooperative Resource Allocation; 2.5 Concluding Remarks; Appendices; Appendix 1: Proof of Proposition 2.2; Appendix 2: Convexity of (9); Appendix 3: Proof of Proposition 2.3; Appendix 4: Proof of Lemma 2.1; Appendix 5: Proof of Proposition 2.4; Appendix 6: Proof of Lemma 2.2; Appendix 7: Proof of Lemma 2.3. | |
| 505 | 8 | |a Appendix 8: Proof of Proposition 2.5References; 3 Robust Noncooperative Resource Allocation; 3.1 Introduction; 3.2 Overview of Nominal Noncooperative Strategic Games; 3.2.1 Existence and Uniqueness of NE; 3.2.1.1 Existence of NE; 3.2.1.2 Uniqueness of NE; 3.2.1.3 Existence and Uniqueness of NE in Nominal Noncooperative Power Control Games with Homogeneous Users; 3.2.2 Social Utility (Sum Rate) at NE; 3.2.3 Distributed Algorithms; 3.3 Worst-Case Robust Power Control in Noncooperative Games; 3.3.1 Robust Power Control for Noncooperative Homogeneous Users; 3.3.1.1 Existence and Uniqueness of RNE. | |
| 505 | 8 | |a 3.3.1.2 Social Utility (Sum Rate)3.3.1.3 Distributed Algorithms; 3.3.1.4 Overview of Other Works on Robust Noncooperative Games with Homogeneous Users; 3.3.2 Robust Power Control in Noncooperative CRNs; 3.3.2.1 Existence and Uniqueness of RNE; 3.3.2.2 Social Utility (Sum Rate); 3.3.2.3 Distributed Algorithms; 3.3.2.4 Overview of Other Works on Robust Noncooperative CRNs; 3.3.3 Robust Power Control for Noncooperative Heterogeneous Users; 3.3.3.1 Robust Stackelberg Games; 3.3.3.2 Single-Leader/Single-Follower Robust Stackelberg Games; 3.3.3.3 Multi-user Stackelberg Games. | |
| 504 | |a Includes bibliographical references and index. | ||
| 506 | |a Plný text je dostupný pouze z IP adres počítačů Univerzity Tomáše Bati ve Zlíně nebo vzdáleným přístupem pro zaměstnance a studenty | ||
| 520 | |a 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. | ||
| 590 | |a SpringerLink |b Springer Complete eBooks | ||
| 650 | 0 | |a Radio resource management (Wireless communications) | |
| 650 | 0 | |a Wireless communication systems |x Management. | |
| 655 | 7 | |a elektronické knihy |7 fd186907 |2 czenas | |
| 655 | 9 | |a electronic books |2 eczenas | |
| 700 | 1 | |a Sharafat, Ahmad Reza, |e author. | |
| 700 | 1 | |a Mokari, Nader, |e author. | |
| 776 | 0 | 8 | |i Print version: |a Parsaeefard, Saeedeh. |t Robust resource allocation in future wireless networks. |d Cham, Switzerland : Springer, 2017 |z 3319503871 |z 9783319503875 |w (OCoLC)962125862 |
| 856 | 4 | 0 | |u https://proxy.k.utb.cz/login?url=https://link.springer.com/10.1007/978-3-319-50389-9 |y Plný text |
| 992 | |c NTK-SpringerENG | ||
| 999 | |c 99864 |d 99864 | ||