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

Authors:
Pablo Soldati;Björn Johansson;Mikael Johansson
Affiliations:
Automatic Control Lab, School of Electrical Engineering, Royal Institute of Technology, Stockholm, Sweden;Automatic Control Lab, School of Electrical Engineering, Royal Institute of Technology, Stockholm, Sweden;Automatic Control Lab, School of Electrical Engineering, Royal Institute of Technology, Stockholm, Sweden
Venue:
Wireless Networks
Year:
2008

Citing 10
Cited 1

Distributed Assignment Algorithms for Multihop Packet Radio Networks

IEEE Transactions on Computers
Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Channel access algorithms with active link protection for wireless communication networks with power control

IEEE/ACM Transactions on Networking (TON)
Assignment methods for spatial reuse TDMA

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
CDMA-based MAC protocol for wireless ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A duality model of TCP and queue management algorithms

IEEE/ACM Transactions on Networking (TON)
Convex Optimization

Convex Optimization
Rate Performance Objectives of Multihop Wireless Networks

IEEE Transactions on Mobile Computing
Capacity regions for wireless ad hoc networks

IEEE Transactions on Wireless Communications
Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control

IEEE Journal on Selected Areas in Communications

Distributed algorithms for resource allocation of physical and transport layers in wireless cognitive ad hoc networks

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.