By Topic

QoS Traffic Engineering for Self-Adaptive Resource Allocation in MAI-Affected Wireless Networks

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)
Enzo Baccarelli ; Dept. of Inf. Eng., Electron. & Telecommun., Sapienza Univ. of Rome, Rome, Italy ; Nicola Cordeschi ; Valentina Polli

Traffic Engineering application to the cross-layer design of Multiple Access Interference (MAI)-affected powerlimited wireless networks, when Quality of Service constraints are also present, leads to deal with nonconvex resource allocation problems. Although several manageable-complexity solutions have been proposed, they are based on specific capacity functions and, generally, fail to provide reliable results in low-SINR (Signal to Interference plus Noise Ratio) scenarios. We develop a two-level decomposition that is able to find the optimal solution of a wide nonconvex cross-layer problem, which combines user utility, flow control, QoS multipath routing,Medium Access Control (MAC) design and power control, by means of a suitable relaxed convex version of its comprising flow control and power-allocation sub-problems. Sufficient conditions for the equivalence of the primary (nonconvex) problem and its related (convex) version are provided. Moreover, we develop a distributed, iterative, asynchronous algorithm for computing the solution of the overall nonconvex resource allocation problem, that is able to (quickly) self-adapt to possible network time evolutions (as, for example, node failure events) and, most importantly, that may be implemented on top of connectionless networking platforms. Actual performance of the overall proposed solution and its robustness against node-failure events are numerically tested and compared with the corresponding ones of Destination Sequenced Distance Vector-based single-path routing algorithms.

Published in:

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Date of Conference:

5-9 Dec. 2011