Risk-Averse Access Point Selection in Wireless Communication Networks

被引:13
作者
Ma, Wann-Jiun [1 ]
Oh, Chanwook [1 ]
Liu, Yang [1 ]
Dentcheva, Darinka [2 ]
Zavlanos, Michael M. [1 ]
机构
[1] Duke Univ, Dept Mech Engn & Mat Sci, Durham, NC 27706 USA
[2] Stevens Inst Technol, Dept Math Sci, Hoboken, NJ 07030 USA
来源
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS | 2019年 / 6卷 / 01期
关键词
Distributed optimization; optimal wireless networking; risk-averse optimization; STOCHASTIC-DOMINANCE; CONNECTIVITY CONTROL; CONGESTION CONTROL; OPTIMIZATION; FAIRNESS; SYSTEMS;
D O I
10.1109/TCNS.2018.2792309
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers the problem of selecting the optimal set of access points and routing decisions in wireless communication networks. We consider networks that are subject to uncertainty in the wireless channel, for example, due to multipath fading effects, and formulate the problem as a risk-averse network flow problem with binary variables corresponding to the status of the sinks, namely, selected or not. Risk measures capture low-probability but high-cost events and, when used for stochastic optimization, they produce solutions that are more reliable compared to mean-value formulations and less conservative than worst-case approaches. By relaxing the integer constraints, we reformulate the problem as a linear optimization problem, which we solve in a distributed way using the accelerated distributed augmented Lagrangian method that was recently developed by the authors to solve optimization problems with convex separable objectives and linear coupling constraints. We present numerical simulations and experimental results using low-power wireless radios that demonstrate the ability of the proposed method to effectively deal with large variations in the quality of the wireless channel.
引用
收藏
页码:24 / 36
页数:13
相关论文
共 49 条
  • [1] [Anonymous], 2006, P 9 ANN INT C MOB CO
  • [2] Coherent measures of risk
    Artzner, P
    Delbaen, F
    Eber, JM
    Heath, D
    [J]. MATHEMATICAL FINANCE, 1999, 9 (03) : 203 - 228
  • [3] Distributed Scheduling of Network Connectivity Using Mobile Access Point Robots
    Chatzipanagiotis, Nikolaos
    Zavlanos, Michael M.
    [J]. IEEE TRANSACTIONS ON ROBOTICS, 2016, 32 (06) : 1333 - 1346
  • [4] An augmented Lagrangian method for distributed optimization
    Chatzipanagiotis, Nikolaos
    Dentcheva, Darinka
    Zavlanos, Michael M.
    [J]. MATHEMATICAL PROGRAMMING, 2015, 152 (1-2) : 405 - 434
  • [5] Layering as optimization decomposition: A mathematical theory of network architectures
    Chiang, Mung
    Low, Steven H.
    Calderbank, A. Robert
    Doyle, John C.
    [J]. PROCEEDINGS OF THE IEEE, 2007, 95 (01) : 255 - 312
  • [6] Cox D. R., 1966, STAT ANAL SERIES EVE
  • [7] Concavity and efficient points of discrete distributions in probabilistic programming
    Dentcheva, D
    Prékopa, A
    Ruszczynski, A
    [J]. MATHEMATICAL PROGRAMMING, 2000, 89 (01) : 55 - 77
  • [8] Optimization with stochastic dominance constraints
    Dentcheva, D
    Ruszczynski, A
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2003, 14 (02) : 548 - 566
  • [9] Dentcheva D., 1993, SIAM J OPTIMIZ, V25, P564
  • [10] Mean-risk tests of stochastic dominance
    Dentcheva, Darinka
    Stock, Gregory J.
    Rekeda, Ludmyla
    [J]. STATISTICS & RISK MODELING, 2011, 28 (02) : 97 - 118