Resource allocation in wireless networks. Theory and algorithms

DOI10.1007/11818762zbMath1144.68009OpenAlexW2476733765MaRDI QIDQ948833

Slawomir Stanczak, Holger Boche, Marcin Wiczanowski

Publication date: 14 October 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11818762

zbMATH Keywords

algorithmscommunicationcomputational complexityconvex optimizationeigenvaluesstochastic approximationQoSdistributed algorithmsconvex analysiscommunication complexitygradient projection algorithmPerron-Frobenius theorywireless networkingnetwork modelsalgorithmicsdistributed networkslink schedulingubiquitous computingcomputational discrete mathematicspower control algorithm

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Distributed systems (68M14)

Related Items (7)

Selective bi-coordinate variations for resource allocation type problems ⋮ Application of the conditional gradient method to resource allocation in wireless networks ⋮ Distributed discrete‐time optimization algorithms with applications to resource allocation in epidemics control ⋮ Selective bi-coordinate method for limit non-smooth resource allocation type problems ⋮ Learning and selfconfirming equilibria in network games ⋮ On vector formulations of auction-type problems with applications ⋮ A Lagrangean-based heuristics for the target covering problem in wireless sensor network

This page was built for publication: Resource allocation in wireless networks. Theory and algorithms