Distributed Cross-Layer Algorithms for the Optimal Control of Multihop Wireless Networks
Name
Modiano-2010-Distributed Cross-Layer Algorithms for the Optimal Control of Multihop Wir.pdf
Size
865.2 KB
Format
Adobe PDF
Checksum (MD5)
bcbb865103c0bb447ddd0f3f04961f04
Author(s)
Eryilmaz, Atilla
Ozdaglar, Asuman E.
Shah, Devavrat
Modiano, Eytan H.
Date Issued
April 2010
Journal
Proceedings of the IEEE/ACM Transactions on Networking
Publisher
Institute of Electrical and Electronics Engineers
Citation
Eryilmaz, A. et al. “Distributed Cross-Layer Algorithms for the Optimal Control of Multihop Wireless Networks.” Networking, IEEE/ACM Transactions on 18.2 (2010): 638-651. ©2011 IEEE.
Version
Final published version
Abstract
In this paper, we provide and study a general framework that facilitates the development of distributed mechanisms to achieve full utilization of multihop wireless networks. In particular, we describe a generic randomized routing, scheduling, and flow control scheme that allows for a set of imperfections in the operation of the randomized scheduler to account for potential errors in its operation. These imperfections enable the design of a large class of low-complexity and distributed implementations for different interference models. We study the effect of such imperfections on the stability and fairness characteristics of the system and explicitly characterize the degree of fairness achieved as a function of the level of imperfections. Our results reveal the relative importance of different types of errors on the overall system performance and provide valuable insight to the design of distributed controllers with favorable fairness characteristics. In the second part of the paper, we focus on a specific interference model, namely the secondary interference model, and develop distributed algorithms with polynomial communication and computation complexity in the network size. This is an important result given that earlier centralized throughput-optimal algorithms developed for such a model relies on the solution to an NP-hard problem at every decision. This results in a polynomial complexity cross-layer algorithm that achieves throughput optimality and fair allocation of network resources among the users. We further show that our algorithmic approach enables us to efficiently approximate the capacity region of a multihop wireless network.
MIT Department
Lincoln Laboratory
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tnet.2009.2030681
