Applied optimization methods for wireless networks /
General Material Designation
[Book]
First Statement of Responsibility
Y. Thomas Hou, Virginia Polytechnic and State University, Yi Shi, Intelligent Automation Inc., Hanif D. Sherali, Virginia Polytechnic and State University
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
xvi, 330 pages :
Other Physical Details
illustrations ;
Dimensions
26 cm
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references (pages 316-326) and index
CONTENTS NOTE
Text of Note
Contents note continued: 10.7.Chapter summary -- 10.8.Problems -- 11.Metaheuristic methods -- 11.1.Review of key results in metaheuristic methods -- 11.2.Case study: Routing for multiple description video over wireless ad hoc networks -- 11.3.Problem description -- 11.4.A metaheuristic approach -- 11.5.Numerical examples -- 11.6.Chapter summary -- 11.7.Problems -- pt. IV Other Topics -- 12.Asymptotic capacity analysis -- 12.1.Review of asymptotic analysis -- 12.2.Capacity scaling laws of wireless ad hoc networks -- 12.3.Case 1: Asymptotic capacity under the protocol model -- 12.4.Case 2: Asymptotic capacity under the physical model -- 12.5.Case 3: Asymptotic capacity lower bound under the generalized physical model -- 12.6.Chapter summary -- 12.7.Problems
Text of Note
Contents note continued: 4.1.Problem complexity vs. solution complexity -- 4.2.Case study: Optimal cooperative relay node assignment -- 4.3.Cooperative communications: a primer -- 4.4.The relay node assignment problem -- 4.5.An optimization-based formulation -- 4.6.An exact algorithm -- 4.7.Proof of optimality -- 4.8.Numerical examples -- 4.9.Chapter summary -- 4.10.Problems -- pt. II Methods for Near-optimal and Approximation Solutions -- 5.Branch-and-bound framework and application -- 5.1.Review of branch-and-bound framework -- 5.2.Case study: Power control problem for multi-hop cognitive radio networks -- 5.3.Mathematical modeling -- 5.4.Problem formulation -- 5.5.A solution procedure -- 5.6.Numerical examples -- 5.7.Chapter summary -- 5.8.Problems -- 6.Reformulation-Linearization Technique and applications -- 6.1.An introduction of Reformulation-Linearization Technique (RLT) --
Text of Note
Contents note continued: 6.2.Case study: Capacity maximization for multi-hop cognitive radio networks under the physical model -- 6.3.Mathematical models -- 6.4.Reformulation -- 6.5.A solution procedure -- 6.6.Numerical results -- 6.7.Chapter summary -- 6.8.Problems -- 7.Linear approximation -- 7.1.Review of linear approximation for nonlinear terms -- 7.2.Case study: Renewable sensor networks with wireless energy transfer -- 7.3.Wireless energy transfer: a primer -- 7.4.Problem description -- 7.5.Renewable cycle construction -- 7.6.Optimal traveling path -- 7.7.Problem formulation and solution -- 7.8.Construction of initial transient cycle -- 7.9.Numerical examples -- 7.10.Chapter summary -- 7.11.Problems -- 8.Approximation algorithm and its applications - Part 1 -- 8.1.Review of approximation algorithms -- 8.2.Case study: The base station placement problem -- 8.3.Network model and problem description -- 8.4.Optimal flow routing for a given base station location --
Text of Note
Contents note continued: 8.5.Search space for base station location -- 8.6.Subarea division and fictitious cost points -- 8.7.Summary of algorithm and example -- 8.8.Correctness proof and complexity analysis -- 8.9.Numerical examples -- 8.10.Chapter summary -- 8.11.Problems -- 9.Approximation algorithm and its applications - Part 2 -- 9.1.Introduction -- 9.2.Case study: The mobile base station problem -- 9.3.Problem and its formulation -- 9.4.From time domain to space domain -- 9.5.A (1-E)-optimal algorithm -- 9.6.Numerical examples -- 9.7.Chapter summary -- 9.8.Problems -- pt. III Methods for Efficient Heuristic Solutions -- 10.An efficient technique for mixed-integer optimization -- 10.1.Sequential fixing: an introduction -- 10.2.Case study: Spectrum sharing for cognitive radio networks -- 10.3.Mathematical modeling and problem formulation -- 10.4.Deriving a lower bound -- 10.5.A near-optimal algorithm based on sequential fixing -- 10.6.Numerical examples --
Text of Note
Machine generated contents note: 1.Introduction -- 1.1.Book overview -- 1.2.Book outline -- 1.3.How to use this book -- pt. I Methods for Optimal Solutions -- 2.Linear programming and applications -- 2.1.Review of key results in linear programming -- 2.2.Case study: Lexicographic max-min rate allocation and node lifetime problems -- 2.3.System modeling and problem formulation -- 2.4.A serial LP algorithm based on parametric analysis -- 2.5.SLP-PA for the LMM node lifetime problem -- 2.6.A mirror result -- 2.7.Numerical results -- 2.8.Chapter summary -- 2.9.Problems -- 3.Convex programming and applications -- 3.1.Review of key results in convex optimization -- 3.2.Case study: Cross-layer optimization for multi-hop MIMO networks -- 3.3.Network model -- 3.4.Dual problem decomposition -- 3.5.Solving the Lagrangian dual problem -- 3.6.Constructing a primal optimal solution -- 3.7.Numerical results -- 3.8.Chapter summary -- 3.9.Problems -- 4.Design of polynomial-time exact algorithm --