By Topic

Distributed Cross-Layer Optimization of MANETs in Composite Fading

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)
John Papandriopoulos ; ARC Special Research Centre for Ultra-Broadband Information Networks (CUBIN), Department of Electrical and Electronic Engineering, University of Melbourne, VIC 3010, Australia ; Subhrakanti Dey ; Jamie S. Evans

Cross-layer design can significantly improve the performance of mobile ad-hoc networks (MANETs), as indicated by the flurry of recent results in the literature. Much of this work stems from the Kelly network utility maximization (NUM) framework, where convexity is crucial for developing algorithms that reach the global optimum. Unfortunately many problems are nonconvex in nature, so convex approximations are abundant. In this paper, we consider the joint optimization of source data-rates and link transmitter powers in a MANET, specifically dealing with the statistical variations of the wireless channel. In this paradigm we show that the commonly applied high-SIR convex approximation is unrealistic, so we seek to find solutions of the unmodified NUM problem. Our first result shows that the canonical formulation (previously thought to be nonconvex) is indeed a convex problem for logarithmic TCP-Vegas utilities; we then derive an algorithm reaching the global optimum. Our main result caters for the general case of strictly concave utilities, where we derive an algorithm that provably converges to the global solution of the underlying nonconvex NUM problem.

Published in:

2006 IEEE International Conference on Communications  (Volume:9 )

Date of Conference:

June 2006