By Topic

Joint routing and power control in Rayleigh-faded wireless networks with ARQ protocols

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Meng Zheng ; Key Lab of Industrial Informatics, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang, 110016 China ; Slawomir Stanczak ; Haibin Yu

In this paper we formulate a goodput-oriented utility optimization problem for routing and power control in Rayleigh faded wireless networks with Automatic Retransmission reQuest (ARQ) protocols. This work proposes two heuristic approaches to estimate the goodput capacity in such wireless networks. The resulting approximated capacities are non-convex functions of power variables. As a result, the utility optimization problem is nonconvex, and for this we address the problem by solving a sequence of convex approximation problems. If the initial convex approximation is feasible, the sequence is shown to converge to a Karush-Kuhn-Tucker(KKT) point of the original utility optimization problem. The convex approximation problems are solved recursively by means of primal-dual methods that are shown to be amenable to distributed implementation by adjoint network. The seamless interaction between the successive convex approximation and the primal-dual algorithm constitutes the proposed successive primal-dual convex approximation (SPDCA) algorithm.

Published in:

Wireless Communication Systems (ISWCS), 2011 8th International Symposium on

Date of Conference:

6-9 Nov. 2011