Distributed cross-layer coordination of congestion control and resource allocation in S-TDMA wireless networks

We consider the problem of joint congestion control and resource allocation in spatial-TDMA wireless networks. The design problem is posed as a utility maximization problem subject to link rate constraints which involve both transmission scheduling and power allocation. Starting from the performance...

Full description

Saved in:
Bibliographic Details
Published inWireless networks Vol. 14; no. 6; pp. 949 - 965
Main Authors Soldati, Pablo, Johansson, Björn, Johansson, Mikael
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.12.2008
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1022-0038
1572-8196
1572-8196
DOI10.1007/s11276-007-0046-5

Cover

More Information
Summary:We consider the problem of joint congestion control and resource allocation in spatial-TDMA wireless networks. The design problem is posed as a utility maximization problem subject to link rate constraints which involve both transmission scheduling and power allocation. Starting from the performance limitations of a centralized optimization based on global network information, we proceed systematically in our development of two distributed and transparent protocols that rely on local information only. In the process, we introduce a novel decomposition method for convex optimization, establish its convergence for the utility maximization problem, and demonstrate how it suggests a distributed solution based on TCP/AQM and incremental updates of the transmission schedule. We develop a two-step procedure for finding the schedule updates and suggest two schemes for distributed link scheduling and power control under realistic interference models. Although the final protocols are suboptimal, we isolate and quantify the performance losses incurred by each simplification and demonstrate strong performance in examples.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1022-0038
1572-8196
1572-8196
DOI:10.1007/s11276-007-0046-5