4.5 Article

Cross-Layer Optimization for Wireless Networks With Deterministic Channel Models

期刊

IEEE TRANSACTIONS ON INFORMATION THEORY
卷 57, 期 9, 页码 5840-5862

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2011.2162265

关键词

Cross-layer optimization; deterministic channel model; link-centric formulation; Markov approximation framework; network information flow; network utility maximization; node-centric formulation; wireless networks

资金

  1. University Grant Committee of the Hong Kong Special Administration Region, China [411008, 411209, 411010, AoE/E-02/08, E-02/08]
  2. NSF [0953117]
  3. Research Grants Council [CUHK2/06C]
  4. Direct For Computer & Info Scie & Enginr
  5. Division of Computing and Communication Foundations [0953117] Funding Source: National Science Foundation

向作者/读者索取更多资源

Cross-layer optimization is a key step in wireless network design that coordinates the resources allocated to different layers in order to achieve globally optimal network performance. Existing work on cross-layer optimization for wireless networks often adopts simplistic physical-layer models for wireless channels, such as treating interference as noise or interference avoidance. This crude modeling of physical layer often leads to inefficient utilization of resources. In this paper, we adopt a deterministic channel model proposed in [1], [2], a simple abstraction of the physical layer that effectively captures the effect of channel strength, broadcast and superposition in wireless channels. This model allows us to go beyond treating interference as noise and as a consequence are able to achieve higher throughput and utility. Within the network utility maximization (NUM) framework, we study the cross-layer optimization for wireless networks based on this deterministic channel model. First, we extend the well-studied conflict graph model to capture the flow interactions over the deterministic channels and characterize the feasible rate region. Then we study distributed algorithms for general wireless multi-hop networks with both link-centric formulation and node-centric formulation. The convergence of algorithms is proved by applying Lyapunov stability theorem and stochastic approximation method. Further, we show the convergence to the bounded neighborhood of optimal solutions with probability one under constant step sizes and constant update intervals. Our numerical evaluations validate the analytical results and show the advantage of deterministic channel model over simple physical layer models such as treating interference as noise.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据