TY - GEN
T1 - On the throughput limit of multi-hop wireless networks with reconfigurable antennas
AU - Pan, Yanjun
AU - Li, Ming
AU - Fan, Neng
AU - Hou, Yantian
N1 - Funding Information:
This work was supported in part by ONR YIP award N00014-16-1-2650, and NSF grants CNS-1564477, CNS-1619728.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/6/26
Y1 - 2018/6/26
N2 - Reconfigurable antenna (RA) has emerged as a disruptive antenna technology with the potential of significantly improving the capacity of wireless links, by agilely reconfiguring its antenna states. Through jointly optimizing antenna state selection, routing and scheduling, it offers another dimension of opportunity to enhance end-to-end (E2E) throughput in multi-hop wireless networks (MWNs). However, the throughput limit of MWNs with RAs has not been well understood, due to challenges in theoretical modeling and computational intractability caused by a large number of states. In this work, we endeavor to systematically study this problem. We first propose a general antenna state-link conflict graph model to capture the intricate state-link association and corresponding interference relationship in the network. Based on this model, we formulate a max-flow based optimization framework to derive the throughput bound of a given MWN. As this problem is NP-hard, we explore column generation to solve it more efficiently, and propose a heuristic algorithm which can also accelerate the optimal solution. Simulation results show that our proposed algorithms can efficiently approach or compute the optimal throughput, and validate the advantage of antenna reconfigurability in MWNs.
AB - Reconfigurable antenna (RA) has emerged as a disruptive antenna technology with the potential of significantly improving the capacity of wireless links, by agilely reconfiguring its antenna states. Through jointly optimizing antenna state selection, routing and scheduling, it offers another dimension of opportunity to enhance end-to-end (E2E) throughput in multi-hop wireless networks (MWNs). However, the throughput limit of MWNs with RAs has not been well understood, due to challenges in theoretical modeling and computational intractability caused by a large number of states. In this work, we endeavor to systematically study this problem. We first propose a general antenna state-link conflict graph model to capture the intricate state-link association and corresponding interference relationship in the network. Based on this model, we formulate a max-flow based optimization framework to derive the throughput bound of a given MWN. As this problem is NP-hard, we explore column generation to solve it more efficiently, and propose a heuristic algorithm which can also accelerate the optimal solution. Simulation results show that our proposed algorithms can efficiently approach or compute the optimal throughput, and validate the advantage of antenna reconfigurability in MWNs.
UR - http://www.scopus.com/inward/record.url?scp=85050226536&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050226536&partnerID=8YFLogxK
U2 - 10.1109/SAHCN.2018.8397127
DO - 10.1109/SAHCN.2018.8397127
M3 - Conference contribution
AN - SCOPUS:85050226536
T3 - 2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2018
SP - 1
EP - 9
BT - 2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2018
Y2 - 11 June 2018 through 13 June 2018
ER -