A Congestion Control Algorithm for Ad Hoc Networks: A Dual Decomposition Approach

Author

Xu, Weiqiang ; Wu, Tiejun

Author_Institution

Inst. of Intelligent Syst. & Decision Making, Zhejiang Univ., Zhejiang University

Volume

1

fYear

0

fDate

0-0 0

Firstpage

4522

Lastpage

4525

Abstract

We consider the problem of finding the optimal end-to-end session rate for wireless ad hoc networks, formulate this problem as a nonlinear optimization to maximize the sum of the sources´ utilities with constraints that arise from contention for channel access, apply dual decomposition approach to solve this nonlinear optimization problem, and propose the algorithm to obtain the optimal solutions. Numerical example proves the proposed algorithm can fairly close to the globally optimal solution

Keywords

ad hoc networks; nonlinear programming; telecommunication channels; telecommunication congestion control; congestion control; dual decomposition; nonlinear optimization; optimal end-to-end session rate; wireless ad hoc network; Ad hoc networks; Algorithm design and analysis; Constraint optimization; Decision making; Intelligent networks; Intelligent systems; Interference constraints; Mobile ad hoc networks; Relays; Wireless communication; Wireless ad hoc networks; congestion control; dual decomposition;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on

Conference_Location

Dalian

Print_ISBN

1-4244-0332-4

Type

conf

DOI

10.1109/WCICA.2006.1713235

Filename

1713235