Accelerating a dual algorithm for the simultaneous routing and power control problem
Hodgskiss, Joe, Dekorsy, Armin and Fliege, Jörg (2007) Accelerating a dual algorithm for the simultaneous routing and power control problem. In, The 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC07). 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC07) , Institute of Electrical and Electronics Engineers, 1-5. (Submitted). (doi:10.1109/PIMRC.2007.4394404).
Full text not available from this repository.
Efficiently transmitting data in wireless networks requires an integrated routing and radio resource allocation strategy. An initial observation that suggest dual decomposition to be a worthwhile approach is that the network flow variables for routing and the communication variables for resource allocation are only coupled through link capacities. With dual decomposition we split routing and resource allocation up in two separate subproblems and coordinate the solutions by solving a master dual problem. In this paper, we suggest to solve the master dual problem iteratively by using Aitken's method for an update of the dual variables. In contrast to former proposed subgradient methods, we accelerate the iteration process for achieving an optimum solution. This results in significant less complexity, but still facilitating distributed implementation. Beside describing the application of Aitken's method to simultaneous routing and resource allocation we also give necessary conditions for optimality, and show results for data transmission in a wireless mesh network being optimized in a proportional fair manner.
|Item Type:||Book Section|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Operational Research
|Date Deposited:||28 Jul 2008|
|Last Modified:||06 Aug 2015 02:43|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)