TY - JOUR
T1 - Pathbook
T2 - Cross-layer optimization for full-duplex wireless networks
AU - Fang, Xi
AU - Yang, Dejun
AU - Xue, Guoliang
N1 - Funding Information:
This research was supported in part by ARO Grant W911NF-09-1-0467 and NSF Grants 0905603 and 1115129 . The information reported here does not reflect the position or the policy of the federal government. A preliminary version of this paper appeared in IEEE MASS 2011 [18] .
PY - 2013/6/19
Y1 - 2013/6/19
N2 - Recently, Choi et al. designed the first practical full-duplex wireless system, which challenges the basic assumption in wireless communications that a radio cannot transmit and receive on the same frequency at the same time. In this paper, we study cross-layer optimization for full-duplex wireless networks, comprehensively considering various resource and social constraints. We focus on (1) the problem of allocating resources to maximize the total profit of multiple users subject to node constraints and (2) the problem of allocating resources to minimize the network power consumption subject to user rate demands and node constraints. We formulate these problems as convex programming systems. By combining Lagrangian decomposition and subgradient methods, we design distributed iterative algorithms to solve these problems, which compute the optimized user information flow (i.e. user behavior) for the network layer and the optimized node broadcast rate (i.e. node behavior) for the MAC layer. Our algorithms allow each user and each node to adjust its own behavior individually in each iteration. We analyze the convergence rate, the amount of feasibility violation, and the gap between the optimal solution and our solution in each iteration. We also use the dual space information to analyze node load constraint violation.
AB - Recently, Choi et al. designed the first practical full-duplex wireless system, which challenges the basic assumption in wireless communications that a radio cannot transmit and receive on the same frequency at the same time. In this paper, we study cross-layer optimization for full-duplex wireless networks, comprehensively considering various resource and social constraints. We focus on (1) the problem of allocating resources to maximize the total profit of multiple users subject to node constraints and (2) the problem of allocating resources to minimize the network power consumption subject to user rate demands and node constraints. We formulate these problems as convex programming systems. By combining Lagrangian decomposition and subgradient methods, we design distributed iterative algorithms to solve these problems, which compute the optimized user information flow (i.e. user behavior) for the network layer and the optimized node broadcast rate (i.e. node behavior) for the MAC layer. Our algorithms allow each user and each node to adjust its own behavior individually in each iteration. We analyze the convergence rate, the amount of feasibility violation, and the gap between the optimal solution and our solution in each iteration. We also use the dual space information to analyze node load constraint violation.
KW - Cross-layer optimization
KW - Full-duplex broadcast MAC
KW - Full-duplex wireless networks
KW - Multipath routing
KW - Network power
KW - Network utilization
UR - http://www.scopus.com/inward/record.url?scp=84878343868&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84878343868&partnerID=8YFLogxK
U2 - 10.1016/j.comnet.2013.03.003
DO - 10.1016/j.comnet.2013.03.003
M3 - Article
AN - SCOPUS:84878343868
SN - 1389-1286
VL - 57
SP - 1895
EP - 1912
JO - Computer Networks
JF - Computer Networks
IS - 9
ER -