Distributed network utility maximization in wireless networks with a bounded number of paths | Zendy

André Schumacher | Zendy; Harri Haanpää | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Distributed network utility maximization in wireless networks with a bounded number of paths

Author(s) -

André Schumacher,

Harri Haanpää

Publication year - 2008

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/1454630.1454645

Subject(s) - bounded function , computer science , wireless network , utility maximization , node (physics) , dual (grammatical number) , wireless , computer network , distributed computing , maximization , upper and lower bounds , path (computing) , multi commodity flow problem , mathematical optimization , decomposition , distributed algorithm , flow network , mathematics , telecommunications , engineering , art , mathematical analysis , ecology , literature , mathematical economics , structural engineering , biology

We consider the fair multicommodity flow problem in multihop wireless networks. We optimize the flow between a number of source-destination pairs to achieve a fair allocation of network resources while satisfying node capacity constraints. To account for the limitations of wireless devices, we use a path-based formulation and allow only a bounded number of paths between each source-destination pair. We develop a dual decomposition based distributed algorithm for solving the problem, show the optimality of a stationary solution, and compare the performance of the algorithm with a centralized branch-and-bound method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research