Pathbook: Cross-layer optimization for full-duplex wireless networks

• Published in: Computer networks (Amsterdam, Netherlands : 1999) Vol. 57; no. 9; pp. 1895 - 1912
• Main Authors: Fang, Xi, Yang, Dejun, Xue, Guoliang
• Format: Journal Article
• Language: English
• Published: Kidlington Elsevier B.V 19.06.2013; Elsevier; Elsevier Sequoia S.A
• Subjects: Access methods and protocols, osi model; Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Cross-layer optimization; Exact sciences and technology; Full-duplex broadcast MAC; Full-duplex wireless networks; Lagrange multiplier; Mathematical programming; Mobile communications networks; Multipath routing; Network power; Network utilization; Optimization algorithms; Radio frequency; Radiocommunications; Resource allocation; Software; Studies; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Theoretical computing; Wireless networks; Full-duplex broadcast MAC; Multipath routing; Full-duplex wireless networks; Cross-layer optimization; Network utilization; Network power; Subgradient optimization; Decomposition method; Transmission protocol; Iterative method; Physical layer; Convex programming; Duplex; Data flow processing; Convergence speed; Electrical network; Optimal solution; Distributed algorithm; Wireless network; Feasibility; Lagrangian method; User behavior; Radio communication
• ISSN: 1389-1286; 1872-7069
• DOI: 10.1016/j.comnet.2013.03.003

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.