TY - JOUR
T1 - Joint routing and topology formation in multihop UWB networks
AU - Wu, Qi
AU - Xiong, Yongqiang
AU - Zhang, Qian
AU - Guo, Zihua
AU - Xia, Ng Gen
AU - Li, Zhongcheng
PY - 2006/4
Y1 - 2006/4
N2 - This paper addresses the throughput optimization problem in multihop ultra-wideband (UWB) networks by jointly considering network topology formation and routing. Given a spatial distribution of UWB devices and traffic requirement, we want to form piconets and select paths to maximize the network throughput. Although there have been several works considering the problem of selecting paths to achieve the optimal throughput in multihop wireless networks, to the best of our knowledge, none of them takes the topology formation into the consideration. In this paper, we use Boolean matrices to model role assignment in UWB networks and formulate the throughput optimization problem as a nonlinear programming (NLP) problem. Since the throughput optimization problem is NP-hard, we give an upper bound of the optimal throughput by relaxing some constraints and using pseudo-Boolean optimization to linearize the NLP. We prove that the solution of the upper bound is at most three times of the optimal throughput. Based on the topology formed by solving the upper bound, we formulate a lower bound of the optimal throughput as a linear programming problem and use column generation to solve the lower bound. Numerical results show that the lower bound is very close to the upper bound. Simulation results demonstrate the effectiveness of the scheme.
AB - This paper addresses the throughput optimization problem in multihop ultra-wideband (UWB) networks by jointly considering network topology formation and routing. Given a spatial distribution of UWB devices and traffic requirement, we want to form piconets and select paths to maximize the network throughput. Although there have been several works considering the problem of selecting paths to achieve the optimal throughput in multihop wireless networks, to the best of our knowledge, none of them takes the topology formation into the consideration. In this paper, we use Boolean matrices to model role assignment in UWB networks and formulate the throughput optimization problem as a nonlinear programming (NLP) problem. Since the throughput optimization problem is NP-hard, we give an upper bound of the optimal throughput by relaxing some constraints and using pseudo-Boolean optimization to linearize the NLP. We prove that the solution of the upper bound is at most three times of the optimal throughput. Based on the topology formed by solving the upper bound, we formulate a lower bound of the optimal throughput as a linear programming problem and use column generation to solve the lower bound. Numerical results show that the lower bound is very close to the upper bound. Simulation results demonstrate the effectiveness of the scheme.
KW - Cross-layer design
KW - Multihop networks
KW - Piconet
KW - Routing
KW - Topology formation
KW - Ultra-wideband (UWB)
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000236775900020
UR - https://openalex.org/W2148097241
UR - https://www.scopus.com/pages/publications/33947306269
U2 - 10.1109/JSAC.2005.863864
DO - 10.1109/JSAC.2005.863864
M3 - Journal Article
SN - 0733-8716
VL - 24
SP - 843
EP - 848
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 4 I
ER -